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/abstractInterpretation/eq-termtest.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:16:04,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:16:04,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:16:04,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:16:04,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:16:04,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:16:04,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:16:04,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:16:04,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:16:04,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:16:04,063 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:16:04,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:16:04,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:16:04,064 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:16:04,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:16:04,067 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:16:04,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:16:04,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:16:04,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:16:04,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:16:04,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:16:04,088 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:16:04,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:16:04,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:16:04,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:16:04,093 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:16:04,093 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:16:04,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:16:04,095 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:16:04,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:16:04,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:16:04,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:16:04,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:16:04,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:16:04,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:16:04,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:16:04,107 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:16:04,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:16:04,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:16:04,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:16:04,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:16:04,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:16:04,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:16:04,157 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:16:04,158 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:16:04,159 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:16:04,160 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/eq-termtest.bpl [2019-08-05 11:16:04,160 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/eq-termtest.bpl' [2019-08-05 11:16:04,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:16:04,192 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:16:04,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:16:04,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:16:04,193 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:16:04,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eq-termtest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:04" (1/1) ... [2019-08-05 11:16:04,220 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eq-termtest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:04" (1/1) ... [2019-08-05 11:16:04,225 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:16:04,225 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:16:04,226 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:16:04,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:16:04,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:16:04,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:16:04,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:16:04,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eq-termtest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:04" (1/1) ... [2019-08-05 11:16:04,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eq-termtest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:04" (1/1) ... [2019-08-05 11:16:04,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eq-termtest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:04" (1/1) ... [2019-08-05 11:16:04,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eq-termtest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:04" (1/1) ... [2019-08-05 11:16:04,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eq-termtest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:04" (1/1) ... [2019-08-05 11:16:04,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eq-termtest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:04" (1/1) ... [2019-08-05 11:16:04,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eq-termtest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:04" (1/1) ... [2019-08-05 11:16:04,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:16:04,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:16:04,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:16:04,250 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:16:04,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eq-termtest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:16:04,321 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:16:04,321 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:16:04,321 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:16:04,575 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:16:04,575 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 11:16:04,576 INFO L202 PluginConnector]: Adding new model eq-termtest.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:16:04 BoogieIcfgContainer [2019-08-05 11:16:04,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:16:04,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:16:04,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:16:04,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:16:04,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eq-termtest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:04" (1/2) ... [2019-08-05 11:16:04,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c983558 and model type eq-termtest.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:16:04, skipping insertion in model container [2019-08-05 11:16:04,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eq-termtest.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:16:04" (2/2) ... [2019-08-05 11:16:04,585 INFO L109 eAbstractionObserver]: Analyzing ICFG eq-termtest.bpl [2019-08-05 11:16:04,594 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:16:04,603 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:16:04,620 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:16:04,650 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:16:04,651 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:16:04,651 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:16:04,651 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:16:04,652 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:16:04,652 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:16:04,652 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:16:04,652 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:16:04,653 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:16:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2019-08-05 11:16:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 11:16:04,674 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:04,675 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 11:16:04,677 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:04,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:04,683 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2019-08-05 11:16:04,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:04,776 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:16:04,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:04,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:16:04,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:16:04,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:16:04,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:16:04,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:16:04,921 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2019-08-05 11:16:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:04,968 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 11:16:04,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:16:04,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 11:16:04,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:04,981 INFO L225 Difference]: With dead ends: 6 [2019-08-05 11:16:04,981 INFO L226 Difference]: Without dead ends: 4 [2019-08-05 11:16:04,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:16:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2019-08-05 11:16:05,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-08-05 11:16:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-08-05 11:16:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-08-05 11:16:05,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2019-08-05 11:16:05,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:05,020 INFO L475 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2019-08-05 11:16:05,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:16:05,020 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-08-05 11:16:05,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:16:05,021 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:05,021 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:16:05,021 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:05,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:05,022 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2019-08-05 11:16:05,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:05,084 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:16:05,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:05,232 INFO L392 ElimStorePlain]: Different costs {3=[v_main_a_8], 6=[v_main_v_8]} [2019-08-05 11:16:05,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:16:05,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:16:05,301 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:16:05,302 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 30 [2019-08-05 11:16:05,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:16:05,453 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2019-08-05 11:16:05,454 INFO L567 ElimStorePlain]: treesize reduction 10, result has 78.7 percent of original size [2019-08-05 11:16:05,795 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-08-05 11:16:05,796 INFO L341 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-08-05 11:16:05,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 69 [2019-08-05 11:16:05,799 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:16:06,040 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2019-08-05 11:16:06,041 INFO L567 ElimStorePlain]: treesize reduction 32, result has 52.2 percent of original size [2019-08-05 11:16:06,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:16:06,042 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2019-08-05 11:16:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:06,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:06,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 11:16:06,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:16:06,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:16:06,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:16:06,112 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2019-08-05 11:16:06,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:06,147 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 11:16:06,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:16:06,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 11:16:06,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:06,157 INFO L225 Difference]: With dead ends: 5 [2019-08-05 11:16:06,157 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 11:16:06,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:16:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 11:16:06,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 11:16:06,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 11:16:06,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 11:16:06,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 11:16:06,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:06,161 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 11:16:06,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:16:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 11:16:06,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:16:06,161 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:06,162 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-08-05 11:16:06,162 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:06,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:06,163 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2019-08-05 11:16:06,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:06,194 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:16:06,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:06,276 INFO L392 ElimStorePlain]: Different costs {3=[v_main_a_9], 6=[v_main_v_9]} [2019-08-05 11:16:06,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:16:06,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:16:06,314 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:16:06,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 30 [2019-08-05 11:16:06,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:16:06,381 INFO L567 ElimStorePlain]: treesize reduction 10, result has 78.7 percent of original size [2019-08-05 11:16:06,788 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-08-05 11:16:06,788 INFO L341 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-08-05 11:16:06,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 69 [2019-08-05 11:16:06,791 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:16:06,868 INFO L567 ElimStorePlain]: treesize reduction 32, result has 52.2 percent of original size [2019-08-05 11:16:06,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:16:06,872 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:36 [2019-08-05 11:16:06,960 INFO L392 ElimStorePlain]: Different costs {6=[v_main_a_10], 10=[v_main_v_10]} [2019-08-05 11:16:06,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:16:06,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:16:07,013 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:16:07,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 77 [2019-08-05 11:16:07,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:16:07,081 INFO L567 ElimStorePlain]: treesize reduction 42, result has 55.3 percent of original size [2019-08-05 11:16:07,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:16:07,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:16:07,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:16:07,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:16:07,112 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:16:07,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 45 [2019-08-05 11:16:07,114 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:16:07,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:16:07,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:16:07,143 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:51 [2019-08-05 11:16:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:07,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:07,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:16:07,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:16:07,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:16:07,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:16:07,173 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-08-05 11:16:07,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:07,213 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 11:16:07,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:16:07,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 11:16:07,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:07,215 INFO L225 Difference]: With dead ends: 6 [2019-08-05 11:16:07,216 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:16:07,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 11:16:07,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:16:07,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:16:07,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:16:07,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:16:07,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 11:16:07,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:07,220 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:16:07,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:16:07,221 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:16:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:16:07,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:07,221 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1] [2019-08-05 11:16:07,222 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:07,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:07,222 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2019-08-05 11:16:07,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:07,262 WARN L254 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:16:07,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:07,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:16:07,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:16:07,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:16:07,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:16:07,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-08-05 11:16:07,309 INFO L392 ElimStorePlain]: Different costs {0=[v_main_a_11], 3=[v_main_v_12]} [2019-08-05 11:16:07,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:16:07,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:16:07,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:16:07,364 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:16:07,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-08-05 11:16:07,366 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:16:07,397 INFO L567 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-08-05 11:16:07,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:16:07,399 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-08-05 11:16:07,425 INFO L392 ElimStorePlain]: Different costs {1=[v_main_a_12], 6=[v_main_v_13]} [2019-08-05 11:16:07,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:16:07,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2019-08-05 11:16:07,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:16:07,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:16:07,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:16:07,544 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:16:07,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 57 [2019-08-05 11:16:07,547 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:16:07,617 INFO L567 ElimStorePlain]: treesize reduction 20, result has 63.6 percent of original size [2019-08-05 11:16:07,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:16:07,619 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:40 [2019-08-05 11:16:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:07,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:16:07,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:16:07,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:16:07,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:16:07,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:16:07,638 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 11:16:07,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:07,685 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 11:16:07,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:16:07,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 11:16:07,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:07,685 INFO L225 Difference]: With dead ends: 5 [2019-08-05 11:16:07,686 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:16:07,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:16:07,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:16:07,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:16:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:16:07,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:16:07,687 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-08-05 11:16:07,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:07,687 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:16:07,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:16:07,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:16:07,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:16:07,692 INFO L202 PluginConnector]: Adding new model eq-termtest.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:16:07 BoogieIcfgContainer [2019-08-05 11:16:07,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:16:07,695 INFO L168 Benchmark]: Toolchain (without parser) took 3502.02 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 109.0 MB in the beginning and 169.4 MB in the end (delta: -60.4 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:07,695 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 110.2 MB in the beginning and 110.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-08-05 11:16:07,696 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.08 ms. Allocated memory is still 138.4 MB. Free memory was 109.0 MB in the beginning and 107.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:07,697 INFO L168 Benchmark]: Boogie Preprocessor took 20.67 ms. Allocated memory is still 138.4 MB. Free memory was 107.0 MB in the beginning and 105.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:07,698 INFO L168 Benchmark]: RCFGBuilder took 327.02 ms. Allocated memory is still 138.4 MB. Free memory was 105.9 MB in the beginning and 96.9 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:07,699 INFO L168 Benchmark]: TraceAbstraction took 3114.90 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 96.7 MB in the beginning and 169.4 MB in the end (delta: -72.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:16:07,702 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 138.4 MB. Free memory was 110.2 MB in the beginning and 110.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.08 ms. Allocated memory is still 138.4 MB. Free memory was 109.0 MB in the beginning and 107.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.67 ms. Allocated memory is still 138.4 MB. Free memory was 107.0 MB in the beginning and 105.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 327.02 ms. Allocated memory is still 138.4 MB. Free memory was 105.9 MB in the beginning and 96.9 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3114.90 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 96.7 MB in the beginning and 169.4 MB in the end (delta: -72.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 24]: 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, 4 locations, 1 error locations. SAFE Result, 3.0s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 33 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred in iteration=3, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 715 SizeOfPredicates, 2 NumberOfNonLiveVariables, 80 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 6/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...