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/quantifier/Arrays/Arrays10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:06:20,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:06:20,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:06:20,457 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:06:20,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:06:20,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:06:20,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:06:20,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:06:20,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:06:20,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:06:20,466 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:06:20,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:06:20,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:06:20,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:06:20,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:06:20,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:06:20,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:06:20,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:06:20,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:06:20,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:06:20,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:06:20,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:06:20,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:06:20,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:06:20,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:06:20,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:06:20,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:06:20,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:06:20,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:06:20,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:06:20,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:06:20,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:06:20,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:06:20,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:06:20,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:06:20,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:06:20,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:06:20,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:06:20,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:06:20,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:06:20,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:06:20,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:06:20,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:06:20,549 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:06:20,551 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:06:20,552 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:06:20,552 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/quantifier/Arrays/Arrays10.bpl [2019-08-05 11:06:20,553 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/quantifier/Arrays/Arrays10.bpl' [2019-08-05 11:06:20,615 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:06:20,617 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:06:20,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:06:20,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:06:20,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:06:20,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Arrays10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:20" (1/1) ... [2019-08-05 11:06:20,649 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Arrays10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:20" (1/1) ... [2019-08-05 11:06:20,658 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:06:20,659 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:06:20,659 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:06:20,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:06:20,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:06:20,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:06:20,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:06:20,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Arrays10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:20" (1/1) ... [2019-08-05 11:06:20,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Arrays10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:20" (1/1) ... [2019-08-05 11:06:20,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Arrays10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:20" (1/1) ... [2019-08-05 11:06:20,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Arrays10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:20" (1/1) ... [2019-08-05 11:06:20,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Arrays10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:20" (1/1) ... [2019-08-05 11:06:20,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Arrays10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:20" (1/1) ... [2019-08-05 11:06:20,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Arrays10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:20" (1/1) ... [2019-08-05 11:06:20,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:06:20,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:06:20,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:06:20,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:06:20,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Arrays10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:20" (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:06:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:06:20,759 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:06:20,943 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:06:20,943 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:06:20,944 INFO L202 PluginConnector]: Adding new model Arrays10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:06:20 BoogieIcfgContainer [2019-08-05 11:06:20,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:06:20,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:06:20,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:06:20,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:06:20,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Arrays10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:20" (1/2) ... [2019-08-05 11:06:20,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c14f62d and model type Arrays10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:06:20, skipping insertion in model container [2019-08-05 11:06:20,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Arrays10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:06:20" (2/2) ... [2019-08-05 11:06:20,953 INFO L109 eAbstractionObserver]: Analyzing ICFG Arrays10.bpl [2019-08-05 11:06:20,962 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:06:20,970 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 11:06:20,987 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 11:06:21,013 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:06:21,014 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:06:21,014 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:06:21,014 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:06:21,015 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:06:21,015 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:06:21,015 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:06:21,015 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:06:21,015 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:06:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 11:06:21,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:06:21,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:21,036 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:06:21,039 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:21,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:21,044 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-08-05 11:06:21,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:21,135 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:06:21,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:21,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:21,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:21,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:21,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:21,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-08-05 11:06:21,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:21,432 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-08-05 11:06:21,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:21,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:21,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:32 [2019-08-05 11:06:21,512 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:06:21,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:21,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:06:21,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:06:21,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:06:21,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:06:21,538 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-08-05 11:06:21,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:21,657 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 11:06:21,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:06:21,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:06:21,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:21,669 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:06:21,670 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:06:21,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:06:21,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:06:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:06:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:06:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:06:21,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-08-05 11:06:21,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:21,704 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:06:21,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:06:21,705 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:06:21,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:06:21,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:21,706 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:06:21,706 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:21,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:21,707 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2019-08-05 11:06:21,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:21,728 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:06:21,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:21,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:21,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:21,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:21,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:21,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-08-05 11:06:21,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:21,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:21,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:21,844 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:32 [2019-08-05 11:06:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:22,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:22,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 11:06:22,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:06:22,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:06:22,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:22,048 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 4 states. [2019-08-05 11:06:22,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:22,184 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:06:22,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:06:22,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:06:22,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:22,185 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:06:22,186 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:06:22,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:06:22,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:06:22,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:06:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:06:22,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:06:22,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-08-05 11:06:22,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:22,189 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:06:22,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:06:22,190 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:06:22,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:06:22,190 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:22,191 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-08-05 11:06:22,191 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:22,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:22,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2019-08-05 11:06:22,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:22,215 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:06:22,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:22,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:22,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:22,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:22,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:22,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-08-05 11:06:22,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:22,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:22,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:22,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:32 [2019-08-05 11:06:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:22,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:22,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:06:22,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:06:22,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:06:22,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:06:22,499 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2019-08-05 11:06:22,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:22,627 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:06:22,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:06:22,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 11:06:22,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:22,635 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:06:22,635 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:06:22,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:06:22,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:06:22,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:06:22,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:06:22,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:06:22,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-05 11:06:22,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:22,641 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:06:22,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:06:22,641 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:06:22,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:06:22,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:22,642 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-08-05 11:06:22,643 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:22,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:22,643 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2019-08-05 11:06:22,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:22,690 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:06:22,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:22,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:22,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:22,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:22,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:22,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-08-05 11:06:22,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:22,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:22,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:22,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:32 [2019-08-05 11:06:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:22,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:22,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:06:22,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:06:22,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:06:22,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:06:22,964 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 6 states. [2019-08-05 11:06:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:23,153 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:06:23,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:06:23,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 11:06:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:23,154 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:06:23,155 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:06:23,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:06:23,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:06:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:06:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:06:23,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:06:23,159 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 11:06:23,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:23,159 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:06:23,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:06:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:06:23,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:06:23,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:23,160 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-08-05 11:06:23,161 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:23,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:23,161 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2019-08-05 11:06:23,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:23,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:06:23,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:23,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 14 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-08-05 11:06:23,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:23,349 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 11:06:23,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:23,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:23,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:29 [2019-08-05 11:06:23,538 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 11:06:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:23,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:23,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 11:06:23,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:06:23,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:06:23,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:06:23,727 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2019-08-05 11:06:23,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:23,794 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:06:23,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:06:23,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-08-05 11:06:23,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:23,795 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:06:23,795 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:06:23,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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 11:06:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:06:23,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:06:23,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:06:23,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:06:23,798 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-08-05 11:06:23,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:23,798 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:06:23,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:06:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:06:23,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:06:23,804 INFO L202 PluginConnector]: Adding new model Arrays10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:06:23 BoogieIcfgContainer [2019-08-05 11:06:23,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:06:23,806 INFO L168 Benchmark]: Toolchain (without parser) took 3190.01 ms. Allocated memory was 134.2 MB in the beginning and 169.9 MB in the end (delta: 35.7 MB). Free memory was 111.8 MB in the beginning and 70.1 MB in the end (delta: 41.7 MB). Peak memory consumption was 77.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:23,807 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 134.2 MB. Free memory was 113.0 MB in the beginning and 112.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:06:23,808 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.43 ms. Allocated memory is still 134.2 MB. Free memory was 111.8 MB in the beginning and 109.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:23,809 INFO L168 Benchmark]: Boogie Preprocessor took 29.74 ms. Allocated memory is still 134.2 MB. Free memory was 109.9 MB in the beginning and 108.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:23,810 INFO L168 Benchmark]: RCFGBuilder took 252.63 ms. Allocated memory is still 134.2 MB. Free memory was 108.6 MB in the beginning and 99.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:23,811 INFO L168 Benchmark]: TraceAbstraction took 2858.46 ms. Allocated memory was 134.2 MB in the beginning and 169.9 MB in the end (delta: 35.7 MB). Free memory was 99.0 MB in the beginning and 70.1 MB in the end (delta: 28.9 MB). Peak memory consumption was 64.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:23,815 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.23 ms. Allocated memory is still 134.2 MB. Free memory was 113.0 MB in the beginning and 112.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.43 ms. Allocated memory is still 134.2 MB. Free memory was 111.8 MB in the beginning and 109.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.74 ms. Allocated memory is still 134.2 MB. Free memory was 109.9 MB in the beginning and 108.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 252.63 ms. Allocated memory is still 134.2 MB. Free memory was 108.6 MB in the beginning and 99.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2858.46 ms. Allocated memory was 134.2 MB in the beginning and 169.9 MB in the end (delta: 35.7 MB). Free memory was 99.0 MB in the beginning and 70.1 MB in the end (delta: 28.9 MB). Peak memory consumption was 64.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 29]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 2 error locations. SAFE Result, 2.7s OverallTime, 5 OverallIterations, 5 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 109 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=4, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 30 ConstructedInterpolants, 20 QuantifiedInterpolants, 7010 SizeOfPredicates, 5 NumberOfNonLiveVariables, 85 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 20/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...