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/20170304-DifficultPathPrograms/sum01_bug02.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:25:46,939 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:25:46,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:25:46,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:25:46,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:25:46,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:25:46,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:25:46,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:25:46,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:25:46,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:25:46,966 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:25:46,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:25:46,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:25:46,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:25:46,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:25:46,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:25:46,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:25:46,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:25:46,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:25:46,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:25:46,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:25:46,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:25:46,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:25:46,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:25:46,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:25:46,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:25:46,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:25:46,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:25:46,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:25:46,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:25:46,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:25:46,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:25:46,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:25:46,990 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:25:46,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:25:46,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:25:46,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:25:46,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:25:46,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:25:46,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:25:46,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:25:47,021 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:25:47,039 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:25:47,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:25:47,045 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:25:47,045 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:25:47,046 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum01_bug02.i_3.bpl [2019-08-05 10:25:47,046 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum01_bug02.i_3.bpl' [2019-08-05 10:25:47,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:25:47,101 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:25:47,102 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:25:47,102 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:25:47,102 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:25:47,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum01_bug02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:47" (1/1) ... [2019-08-05 10:25:47,129 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum01_bug02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:47" (1/1) ... [2019-08-05 10:25:47,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:25:47,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:25:47,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:25:47,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:25:47,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum01_bug02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:47" (1/1) ... [2019-08-05 10:25:47,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum01_bug02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:47" (1/1) ... [2019-08-05 10:25:47,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum01_bug02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:47" (1/1) ... [2019-08-05 10:25:47,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum01_bug02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:47" (1/1) ... [2019-08-05 10:25:47,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum01_bug02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:47" (1/1) ... [2019-08-05 10:25:47,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum01_bug02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:47" (1/1) ... [2019-08-05 10:25:47,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum01_bug02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:47" (1/1) ... [2019-08-05 10:25:47,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:25:47,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:25:47,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:25:47,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:25:47,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum01_bug02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:47" (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:25:47,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:25:47,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:25:47,457 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:25:47,457 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:25:47,458 INFO L202 PluginConnector]: Adding new model sum01_bug02.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:25:47 BoogieIcfgContainer [2019-08-05 10:25:47,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:25:47,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:25:47,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:25:47,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:25:47,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum01_bug02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:47" (1/2) ... [2019-08-05 10:25:47,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f450f8e and model type sum01_bug02.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:25:47, skipping insertion in model container [2019-08-05 10:25:47,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum01_bug02.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:25:47" (2/2) ... [2019-08-05 10:25:47,471 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01_bug02.i_3.bpl [2019-08-05 10:25:47,480 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:25:47,488 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:25:47,504 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:25:47,532 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:25:47,533 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:25:47,533 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:25:47,533 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:25:47,533 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:25:47,534 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:25:47,534 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:25:47,534 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:25:47,534 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:25:47,547 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:25:47,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:25:47,559 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:47,560 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:25:47,562 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:47,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:47,568 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:25:47,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:47,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:25:47,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:47,712 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:25:47,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:25:47,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:25:47,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:25:47,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:25:47,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:25:47,737 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:25:47,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:47,779 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:25:47,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:25:47,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:25:47,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:47,792 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:25:47,793 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:25:47,795 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:25:47,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:25:47,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:25:47,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:25:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:25:47,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:25:47,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:47,843 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:25:47,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:25:47,844 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:25:47,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:25:47,844 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:47,845 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:25:47,845 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:47,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:47,846 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:25:47,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:47,874 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:25:47,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:48,161 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:25:48,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:48,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:25:48,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:25:48,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:25:48,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:25:48,167 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:25:48,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:48,251 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:25:48,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:25:48,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:25:48,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:48,253 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:25:48,253 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:25:48,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:25:48,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:25:48,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:25:48,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:25:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:25:48,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:25:48,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:48,257 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:25:48,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:25:48,257 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:25:48,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:25:48,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:48,258 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:25:48,258 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:48,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:48,258 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:25:48,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:48,295 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:25:48,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:48,475 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:25:48,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:48,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:25:48,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:25:48,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:25:48,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:25:48,477 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:25:48,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:48,530 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:25:48,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:25:48,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:25:48,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:48,531 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:25:48,531 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:25:48,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:25:48,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:25:48,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:25:48,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:25:48,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:25:48,534 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:25:48,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:48,535 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:25:48,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:25:48,535 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:25:48,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:25:48,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:48,536 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:25:48,536 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:48,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:48,537 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:25:48,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:48,570 WARN L254 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:25:48,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:48,809 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:25:48,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:48,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:25:48,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:25:48,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:25:48,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:25:48,811 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:25:49,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:49,013 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:25:49,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:25:49,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:25:49,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:49,014 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:25:49,014 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:25:49,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:25:49,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:25:49,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:25:49,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:25:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:25:49,017 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:25:49,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:49,017 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:25:49,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:25:49,018 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:25:49,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:25:49,018 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:49,018 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:25:49,019 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:49,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:49,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:25:49,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:49,064 WARN L254 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:25:49,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:49,202 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:25:49,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:49,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:25:49,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:25:49,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:25:49,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:25:49,204 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:25:49,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:49,302 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:25:49,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:25:49,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:25:49,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:49,305 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:25:49,305 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:25:49,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:25:49,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:25:49,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:25:49,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:25:49,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:25:49,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:25:49,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:49,310 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:25:49,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:25:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:25:49,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:25:49,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:49,311 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:25:49,311 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:49,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:49,311 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:25:49,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:49,343 WARN L254 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:25:49,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:49,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:49,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:25:49,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:25:49,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:25:49,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:25:49,604 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:25:49,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:49,673 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:25:49,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:25:49,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:25:49,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:49,675 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:25:49,675 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:25:49,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:25:49,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:25:49,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:25:49,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:25:49,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:25:49,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:25:49,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:49,678 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:25:49,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:25:49,678 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:25:49,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:25:49,679 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:49,679 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:25:49,679 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:49,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:49,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:25:49,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:49,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:25:49,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:50,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:25:50,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:25:50,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:25:50,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:25:50,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:25:50,103 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-08-05 10:25:50,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:50,191 INFO L93 Difference]: Finished difference Result 7 states and 6 transitions. [2019-08-05 10:25:50,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:25:50,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-08-05 10:25:50,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:50,192 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:25:50,193 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:25:50,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:25:50,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:25:50,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:25:50,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:25:50,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:25:50,194 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-08-05 10:25:50,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:50,195 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:25:50,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:25:50,195 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:25:50,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:25:50,199 INFO L202 PluginConnector]: Adding new model sum01_bug02.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:25:50 BoogieIcfgContainer [2019-08-05 10:25:50,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:25:50,202 INFO L168 Benchmark]: Toolchain (without parser) took 3100.64 ms. Allocated memory was 133.7 MB in the beginning and 169.9 MB in the end (delta: 36.2 MB). Free memory was 111.1 MB in the beginning and 93.2 MB in the end (delta: 17.9 MB). Peak memory consumption was 54.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:50,203 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.7 MB. Free memory was 112.3 MB in the beginning and 112.1 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:25:50,204 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.40 ms. Allocated memory is still 133.7 MB. Free memory was 110.9 MB in the beginning and 109.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:50,205 INFO L168 Benchmark]: Boogie Preprocessor took 23.44 ms. Allocated memory is still 133.7 MB. Free memory was 109.4 MB in the beginning and 108.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:50,206 INFO L168 Benchmark]: RCFGBuilder took 291.85 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 98.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:50,207 INFO L168 Benchmark]: TraceAbstraction took 2736.43 ms. Allocated memory was 133.7 MB in the beginning and 169.9 MB in the end (delta: 36.2 MB). Free memory was 98.0 MB in the beginning and 93.2 MB in the end (delta: 4.8 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:50,212 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 was 112.3 MB in the beginning and 112.1 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 40.40 ms. Allocated memory is still 133.7 MB. Free memory was 110.9 MB in the beginning and 109.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.44 ms. Allocated memory is still 133.7 MB. Free memory was 109.4 MB in the beginning and 108.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 291.85 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 98.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2736.43 ms. Allocated memory was 133.7 MB in the beginning and 169.9 MB in the end (delta: 36.2 MB). Free memory was 98.0 MB in the beginning and 93.2 MB in the end (delta: 4.8 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: 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.6s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19 SDtfs, 0 SDslu, 21 SDs, 0 SdLazy, 144 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 1230 SizeOfPredicates, 29 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 21/56 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...