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_15.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:05:40,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:05:40,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:05:40,661 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:05:40,661 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:05:40,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:05:40,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:05:40,665 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:05:40,667 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:05:40,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:05:40,669 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:05:40,669 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:05:40,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:05:40,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:05:40,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:05:40,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:05:40,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:05:40,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:05:40,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:05:40,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:05:40,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:05:40,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:05:40,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:05:40,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:05:40,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:05:40,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:05:40,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:05:40,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:05:40,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:05:40,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:05:40,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:05:40,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:05:40,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:05:40,700 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:05:40,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:05:40,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:05:40,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:05:40,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:05:40,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:05:40,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:05:40,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:05:40,730 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:05:40,747 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:05:40,751 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:05:40,753 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:05:40,754 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:05:40,754 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_15.bpl [2019-08-05 11:05:40,755 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-2_false-valid-deref.i_15.bpl' [2019-08-05 11:05:40,831 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:05:40,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:05:40,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:05:40,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:05:40,834 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:05:40,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "test-bitfields-2_false-valid-deref.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:40" (1/1) ... [2019-08-05 11:05:40,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "test-bitfields-2_false-valid-deref.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:40" (1/1) ... [2019-08-05 11:05:40,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:05:40,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:05:40,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:05:40,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:05:40,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "test-bitfields-2_false-valid-deref.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:40" (1/1) ... [2019-08-05 11:05:40,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "test-bitfields-2_false-valid-deref.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:40" (1/1) ... [2019-08-05 11:05:40,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "test-bitfields-2_false-valid-deref.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:40" (1/1) ... [2019-08-05 11:05:40,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "test-bitfields-2_false-valid-deref.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:40" (1/1) ... [2019-08-05 11:05:40,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "test-bitfields-2_false-valid-deref.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:40" (1/1) ... [2019-08-05 11:05:40,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "test-bitfields-2_false-valid-deref.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:40" (1/1) ... [2019-08-05 11:05:40,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "test-bitfields-2_false-valid-deref.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:40" (1/1) ... [2019-08-05 11:05:40,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:05:40,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:05:40,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:05:40,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:05:40,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "test-bitfields-2_false-valid-deref.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:40" (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:05:41,017 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:05:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:05:41,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:05:41,363 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:05:41,363 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:05:41,365 INFO L202 PluginConnector]: Adding new model test-bitfields-2_false-valid-deref.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:05:41 BoogieIcfgContainer [2019-08-05 11:05:41,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:05:41,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:05:41,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:05:41,371 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:05:41,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-2_false-valid-deref.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:40" (1/2) ... [2019-08-05 11:05:41,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39402ef8 and model type test-bitfields-2_false-valid-deref.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:05:41, skipping insertion in model container [2019-08-05 11:05:41,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-2_false-valid-deref.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:05:41" (2/2) ... [2019-08-05 11:05:41,375 INFO L109 eAbstractionObserver]: Analyzing ICFG test-bitfields-2_false-valid-deref.i_15.bpl [2019-08-05 11:05:41,389 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:05:41,399 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:05:41,419 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:05:41,447 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:05:41,448 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:05:41,448 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:05:41,448 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:05:41,448 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:05:41,448 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:05:41,449 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:05:41,449 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:05:41,449 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:05:41,476 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 11:05:41,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:05:41,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:41,489 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:05:41,491 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:41,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:41,496 INFO L82 PathProgramCache]: Analyzing trace with hash 29985, now seen corresponding path program 1 times [2019-08-05 11:05:41,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:41,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:05:41,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:41,701 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:05:41,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:05:41,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:05:41,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:05:41,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:05:41,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:05:41,721 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 11:05:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:41,782 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 11:05:41,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:05:41,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:05:41,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:41,804 INFO L225 Difference]: With dead ends: 5 [2019-08-05 11:05:41,804 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 11:05:41,809 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:05:41,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 11:05:41,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 11:05:41,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 11:05:41,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 11:05:41,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 11:05:41,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:41,850 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 11:05:41,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:05:41,851 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 11:05:41,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:05:41,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:41,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:05:41,852 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:41,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:41,852 INFO L82 PathProgramCache]: Analyzing trace with hash 927559, now seen corresponding path program 1 times [2019-08-05 11:05:41,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:41,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:05:41,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:42,006 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:05:42,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:42,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:05:42,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:05:42,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:05:42,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:05:42,009 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 11:05:42,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:42,048 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 11:05:42,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:05:42,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:05:42,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:42,049 INFO L225 Difference]: With dead ends: 6 [2019-08-05 11:05:42,049 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:05:42,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:05:42,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:05:42,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:05:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:05:42,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:05:42,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 11:05:42,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:42,054 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:05:42,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:05:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:05:42,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:05:42,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:42,055 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:05:42,055 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:42,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:42,071 INFO L82 PathProgramCache]: Analyzing trace with hash 28752353, now seen corresponding path program 2 times [2019-08-05 11:05:42,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:42,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:05:42,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:42,318 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:05:42,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:42,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:05:42,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:05:42,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:05:42,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:05:42,320 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 11:05:42,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:42,354 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:05:42,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:05:42,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 11:05:42,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:42,356 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:05:42,356 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:05:42,357 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:05:42,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:05:42,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:05:42,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:05:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:05:42,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 11:05:42,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:42,359 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:05:42,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:05:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:05:42,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:05:42,360 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:42,360 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 11:05:42,360 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:42,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:42,360 INFO L82 PathProgramCache]: Analyzing trace with hash 891320967, now seen corresponding path program 3 times [2019-08-05 11:05:42,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:42,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:05:42,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:42,560 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:05:42,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:42,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:05:42,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:05:42,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:05:42,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:05:42,562 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 11:05:42,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:42,628 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:05:42,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:05:42,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 11:05:42,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:42,629 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:05:42,629 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:05:42,630 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:05:42,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:05:42,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:05:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:05:42,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:05:42,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 11:05:42,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:42,632 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:05:42,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:05:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:05:42,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:05:42,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:42,633 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 11:05:42,633 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:42,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:42,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144225, now seen corresponding path program 4 times [2019-08-05 11:05:42,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:42,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:05:42,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:43,033 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:05:43,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:43,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:05:43,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:05:43,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:05:43,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:05:43,035 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 11:05:43,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:43,084 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:05:43,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:05:43,086 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 11:05:43,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:43,087 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:05:43,087 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:05:43,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:05:43,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:05:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:05:43,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:05:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:05:43,090 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 11:05:43,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:43,092 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:05:43,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:05:43,092 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:05:43,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:05:43,093 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:43,093 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 11:05:43,093 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:43,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:43,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894151, now seen corresponding path program 5 times [2019-08-05 11:05:43,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:43,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:05:43,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:43,315 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:05:43,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:05:43,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:05:43,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:05:43,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:05:43,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:05:43,318 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 3 states. [2019-08-05 11:05:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:43,319 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:05:43,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:05:43,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 11:05:43,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:43,320 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:05:43,320 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:05:43,320 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:05:43,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:05:43,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:05:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:05:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:05:43,321 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2019-08-05 11:05:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:43,321 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:05:43,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:05:43,322 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:05:43,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:05:43,327 INFO L202 PluginConnector]: Adding new model test-bitfields-2_false-valid-deref.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:05:43 BoogieIcfgContainer [2019-08-05 11:05:43,327 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:05:43,330 INFO L168 Benchmark]: Toolchain (without parser) took 2495.65 ms. Allocated memory was 133.2 MB in the beginning and 170.9 MB in the end (delta: 37.7 MB). Free memory was 108.9 MB in the beginning and 105.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:05:43,331 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.2 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 11:05:43,332 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.50 ms. Allocated memory is still 133.2 MB. Free memory was 108.9 MB in the beginning and 107.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:05:43,333 INFO L168 Benchmark]: Boogie Preprocessor took 49.47 ms. Allocated memory is still 133.2 MB. Free memory was 107.0 MB in the beginning and 105.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:05:43,334 INFO L168 Benchmark]: RCFGBuilder took 421.10 ms. Allocated memory is still 133.2 MB. Free memory was 105.5 MB in the beginning and 89.1 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:05:43,335 INFO L168 Benchmark]: TraceAbstraction took 1959.87 ms. Allocated memory was 133.2 MB in the beginning and 170.9 MB in the end (delta: 37.7 MB). Free memory was 88.7 MB in the beginning and 105.9 MB in the end (delta: -17.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:05:43,339 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.2 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.50 ms. Allocated memory is still 133.2 MB. Free memory was 108.9 MB in the beginning and 107.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.47 ms. Allocated memory is still 133.2 MB. Free memory was 107.0 MB in the beginning and 105.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 421.10 ms. Allocated memory is still 133.2 MB. Free memory was 105.5 MB in the beginning and 89.1 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1959.87 ms. Allocated memory was 133.2 MB in the beginning and 170.9 MB in the end (delta: 37.7 MB). Free memory was 88.7 MB in the beginning and 105.9 MB in the end (delta: -17.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 187]: 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, 1.8s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 0.3s 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.1s 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.0s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 895 SizeOfPredicates, 21 NumberOfNonLiveVariables, 702 ConjunctsInSsa, 40 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...