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/20181010-MemSafetyPathprograms/test-bitfields-2_false-valid-deref.i_13.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:01:37,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:01:37,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:01:37,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:01:37,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:01:37,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:01:37,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:01:37,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:01:37,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:01:37,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:01:37,249 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:01:37,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:01:37,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:01:37,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:01:37,251 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:01:37,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:01:37,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:01:37,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:01:37,256 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:01:37,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:01:37,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:01:37,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:01:37,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:01:37,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:01:37,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:01:37,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:01:37,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:01:37,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:01:37,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:01:37,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:01:37,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:01:37,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:01:37,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:01:37,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:01:37,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:01:37,289 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:01:37,290 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:01:37,290 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:01:37,290 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:01:37,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:01:37,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:01:37,344 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:01:37,360 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:01:37,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:01:37,364 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:01:37,365 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:01:37,365 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-2_false-valid-deref.i_13.bpl [2019-08-05 11:01:37,366 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-2_false-valid-deref.i_13.bpl' [2019-08-05 11:01:37,423 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:01:37,426 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:01:37,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:01:37,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:01:37,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:01:37,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "test-bitfields-2_false-valid-deref.i_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:37" (1/1) ... [2019-08-05 11:01:37,467 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "test-bitfields-2_false-valid-deref.i_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:37" (1/1) ... [2019-08-05 11:01:37,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:01:37,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:01:37,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:01:37,484 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:01:37,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "test-bitfields-2_false-valid-deref.i_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:37" (1/1) ... [2019-08-05 11:01:37,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "test-bitfields-2_false-valid-deref.i_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:37" (1/1) ... [2019-08-05 11:01:37,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "test-bitfields-2_false-valid-deref.i_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:37" (1/1) ... [2019-08-05 11:01:37,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "test-bitfields-2_false-valid-deref.i_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:37" (1/1) ... [2019-08-05 11:01:37,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "test-bitfields-2_false-valid-deref.i_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:37" (1/1) ... [2019-08-05 11:01:37,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "test-bitfields-2_false-valid-deref.i_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:37" (1/1) ... [2019-08-05 11:01:37,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "test-bitfields-2_false-valid-deref.i_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:37" (1/1) ... [2019-08-05 11:01:37,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:01:37,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:01:37,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:01:37,539 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:01:37,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "test-bitfields-2_false-valid-deref.i_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:37" (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:01:37,614 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:01:37,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:01:37,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:01:38,058 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:01:38,059 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:01:38,060 INFO L202 PluginConnector]: Adding new model test-bitfields-2_false-valid-deref.i_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:01:38 BoogieIcfgContainer [2019-08-05 11:01:38,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:01:38,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:01:38,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:01:38,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:01:38,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-2_false-valid-deref.i_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:37" (1/2) ... [2019-08-05 11:01:38,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49742301 and model type test-bitfields-2_false-valid-deref.i_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:01:38, skipping insertion in model container [2019-08-05 11:01:38,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-2_false-valid-deref.i_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:01:38" (2/2) ... [2019-08-05 11:01:38,071 INFO L109 eAbstractionObserver]: Analyzing ICFG test-bitfields-2_false-valid-deref.i_13.bpl [2019-08-05 11:01:38,083 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:01:38,093 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:01:38,113 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:01:38,161 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:01:38,162 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:01:38,163 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:01:38,163 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:01:38,163 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:01:38,163 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:01:38,164 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:01:38,164 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:01:38,164 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:01:38,184 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 11:01:38,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:01:38,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:38,195 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:01:38,198 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:38,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:38,205 INFO L82 PathProgramCache]: Analyzing trace with hash 29985, now seen corresponding path program 1 times [2019-08-05 11:01:38,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:38,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:01:38,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:38,426 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:01:38,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:01:38,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:01:38,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:01:38,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:01:38,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:01:38,453 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 11:01:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:38,502 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 11:01:38,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:01:38,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:01:38,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:38,515 INFO L225 Difference]: With dead ends: 5 [2019-08-05 11:01:38,516 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 11:01:38,518 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:01:38,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 11:01:38,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 11:01:38,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 11:01:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 11:01:38,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 11:01:38,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:38,554 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 11:01:38,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:01:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 11:01:38,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:01:38,555 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:38,555 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:01:38,556 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:38,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:38,556 INFO L82 PathProgramCache]: Analyzing trace with hash 927559, now seen corresponding path program 1 times [2019-08-05 11:01:38,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:38,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:01:38,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:38,887 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:01:38,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:38,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:01:38,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:01:38,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:01:38,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:01:38,891 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 11:01:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:38,980 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 11:01:38,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:01:38,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:01:38,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:38,982 INFO L225 Difference]: With dead ends: 6 [2019-08-05 11:01:38,982 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:01:38,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:01:38,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:01:38,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:01:38,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:01:38,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:01:38,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 11:01:38,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:38,986 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:01:38,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:01:38,987 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:01:38,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:01:38,987 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:38,988 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:01:38,988 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:38,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:38,988 INFO L82 PathProgramCache]: Analyzing trace with hash 28752353, now seen corresponding path program 2 times [2019-08-05 11:01:38,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:39,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:01:39,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:39,219 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:01:39,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:39,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:01:39,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:01:39,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:01:39,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:01:39,222 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 11:01:39,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:39,291 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:01:39,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:01:39,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 11:01:39,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:39,293 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:01:39,293 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:01:39,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:01:39,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:01:39,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:01:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:01:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:01:39,296 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 11:01:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:39,296 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:01:39,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:01:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:01:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:01:39,297 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:39,298 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 11:01:39,298 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:39,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:39,298 INFO L82 PathProgramCache]: Analyzing trace with hash 891320967, now seen corresponding path program 3 times [2019-08-05 11:01:39,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:39,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:01:39,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:39,527 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:01:39,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:39,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:01:39,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:01:39,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:01:39,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:01:39,530 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 11:01:39,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:39,605 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:01:39,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:01:39,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 11:01:39,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:39,606 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:01:39,607 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:01:39,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:01:39,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:01:39,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:01:39,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:01:39,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:01:39,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 11:01:39,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:39,610 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:01:39,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:01:39,610 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:01:39,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:01:39,611 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:39,611 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 11:01:39,611 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:39,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:39,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144225, now seen corresponding path program 4 times [2019-08-05 11:01:39,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:39,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:01:39,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:39,903 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 11:01:39,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:39,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:01:39,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:01:39,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:01:39,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:01:39,905 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 11:01:39,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:39,982 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:01:39,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:01:39,985 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 11:01:39,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:39,986 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:01:39,986 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:01:39,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:01:39,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:01:39,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:01:39,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:01:39,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:01:39,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 11:01:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:39,989 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:01:39,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:01:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:01:39,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:01:39,990 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:39,990 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 11:01:39,990 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:39,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:39,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894151, now seen corresponding path program 5 times [2019-08-05 11:01:39,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:40,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:01:40,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:40,238 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:01:40,239 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:01:40,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:40,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:40,262 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:01:40,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:21 [2019-08-05 11:01:40,320 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 11:01:40,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:01:40,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:01:40,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:01:40,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:01:40,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:01:40,322 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 3 states. [2019-08-05 11:01:40,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:40,322 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:01:40,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:01:40,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 11:01:40,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:40,323 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:01:40,323 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:01:40,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:01:40,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:01:40,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:01:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:01:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:01:40,325 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2019-08-05 11:01:40,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:40,325 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:01:40,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:01:40,325 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:01:40,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:01:40,331 INFO L202 PluginConnector]: Adding new model test-bitfields-2_false-valid-deref.i_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:01:40 BoogieIcfgContainer [2019-08-05 11:01:40,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:01:40,333 INFO L168 Benchmark]: Toolchain (without parser) took 2908.31 ms. Allocated memory was 141.6 MB in the beginning and 176.2 MB in the end (delta: 34.6 MB). Free memory was 110.5 MB in the beginning and 100.6 MB in the end (delta: 9.9 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:40,334 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 141.6 MB. Free memory was 112.4 MB in the beginning and 112.2 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:01:40,335 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.84 ms. Allocated memory is still 141.6 MB. Free memory was 110.5 MB in the beginning and 108.7 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:01:40,336 INFO L168 Benchmark]: Boogie Preprocessor took 54.42 ms. Allocated memory is still 141.6 MB. Free memory was 108.7 MB in the beginning and 107.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:40,337 INFO L168 Benchmark]: RCFGBuilder took 521.75 ms. Allocated memory is still 141.6 MB. Free memory was 107.2 MB in the beginning and 91.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:40,339 INFO L168 Benchmark]: TraceAbstraction took 2269.29 ms. Allocated memory was 141.6 MB in the beginning and 176.2 MB in the end (delta: 34.6 MB). Free memory was 90.8 MB in the beginning and 100.6 MB in the end (delta: -9.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:40,343 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 141.6 MB. Free memory was 112.4 MB in the beginning and 112.2 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 56.84 ms. Allocated memory is still 141.6 MB. Free memory was 110.5 MB in the beginning and 108.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.42 ms. Allocated memory is still 141.6 MB. Free memory was 108.7 MB in the beginning and 107.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 521.75 ms. Allocated memory is still 141.6 MB. Free memory was 107.2 MB in the beginning and 91.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2269.29 ms. Allocated memory was 141.6 MB in the beginning and 176.2 MB in the end (delta: 34.6 MB). Free memory was 90.8 MB in the beginning and 100.6 MB in the end (delta: -9.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 176]: 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.1s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17 SDtfs, 0 SDslu, 10 SDs, 0 SdLazy, 30 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 1189 SizeOfPredicates, 24 NumberOfNonLiveVariables, 654 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 15/35 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...