java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-2.1_false-valid-free.i_15.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 21:14:54,377 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 21:14:54,379 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 21:14:54,390 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 21:14:54,391 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 21:14:54,392 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 21:14:54,394 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 21:14:54,398 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 21:14:54,400 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 21:14:54,401 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 21:14:54,402 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 21:14:54,405 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 21:14:54,406 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 21:14:54,409 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 21:14:54,411 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 21:14:54,412 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 21:14:54,413 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 21:14:54,424 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 21:14:54,426 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 21:14:54,427 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 21:14:54,428 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 21:14:54,429 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 21:14:54,432 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 21:14:54,432 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 21:14:54,432 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 21:14:54,433 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 21:14:54,434 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 21:14:54,435 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 21:14:54,435 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 21:14:54,436 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 21:14:54,436 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 21:14:54,437 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 21:14:54,437 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 21:14:54,438 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 21:14:54,438 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 21:14:54,439 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 21:14:54,439 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-12 21:14:54,449 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 21:14:54,449 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 21:14:54,450 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 21:14:54,450 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 21:14:54,450 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 21:14:54,450 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 21:14:54,451 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 21:14:54,451 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 21:14:54,451 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 21:14:54,452 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 21:14:54,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 21:14:54,452 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 21:14:54,452 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 21:14:54,453 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 21:14:54,453 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 21:14:54,497 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 21:14:54,509 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 21:14:54,513 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 21:14:54,514 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 21:14:54,515 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 21:14:54,516 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-2.1_false-valid-free.i_15.bpl [2018-10-12 21:14:54,516 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-2.1_false-valid-free.i_15.bpl' [2018-10-12 21:14:54,590 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 21:14:54,594 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-12 21:14:54,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 21:14:54,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 21:14:54,595 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 21:14:54,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:14:54" (1/1) ... [2018-10-12 21:14:54,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:14:54" (1/1) ... [2018-10-12 21:14:54,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:14:54" (1/1) ... [2018-10-12 21:14:54,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:14:54" (1/1) ... [2018-10-12 21:14:54,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:14:54" (1/1) ... [2018-10-12 21:14:54,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:14:54" (1/1) ... [2018-10-12 21:14:54,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:14:54" (1/1) ... [2018-10-12 21:14:54,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 21:14:54,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 21:14:54,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 21:14:54,687 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 21:14:54,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:14:54" (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 [2018-10-12 21:14:54,747 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 21:14:54,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 21:14:54,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 21:14:55,657 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 21:14:55,658 INFO L202 PluginConnector]: Adding new model test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:14:55 BoogieIcfgContainer [2018-10-12 21:14:55,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 21:14:55,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 21:14:55,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 21:14:55,664 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 21:14:55,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:14:54" (1/2) ... [2018-10-12 21:14:55,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481ab100 and model type test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:14:55, skipping insertion in model container [2018-10-12 21:14:55,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:14:55" (2/2) ... [2018-10-12 21:14:55,667 INFO L112 eAbstractionObserver]: Analyzing ICFG test-bitfields-2.1_false-valid-free.i_15.bpl [2018-10-12 21:14:55,678 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 21:14:55,687 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 21:14:55,705 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 21:14:55,734 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 21:14:55,735 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 21:14:55,735 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 21:14:55,736 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 21:14:55,736 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 21:14:55,736 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 21:14:55,736 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 21:14:55,736 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 21:14:55,736 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 21:14:55,760 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2018-10-12 21:14:55,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-12 21:14:55,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:14:55,777 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:14:55,778 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:14:55,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:14:55,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1602610748, now seen corresponding path program 1 times [2018-10-12 21:14:55,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:14:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:14:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:14:56,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 21:14:56,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-12 21:14:56,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-12 21:14:56,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-12 21:14:56,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-12 21:14:56,308 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 4 states. [2018-10-12 21:14:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:14:56,451 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-10-12 21:14:56,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-12 21:14:56,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2018-10-12 21:14:56,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:14:56,470 INFO L225 Difference]: With dead ends: 143 [2018-10-12 21:14:56,471 INFO L226 Difference]: Without dead ends: 143 [2018-10-12 21:14:56,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-12 21:14:56,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-12 21:14:56,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-10-12 21:14:56,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-12 21:14:56,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-12 21:14:56,532 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 137 [2018-10-12 21:14:56,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:14:56,535 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-12 21:14:56,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-12 21:14:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-12 21:14:56,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-12 21:14:56,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:14:56,539 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:14:56,541 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:14:56,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:14:56,542 INFO L82 PathProgramCache]: Analyzing trace with hash 725532715, now seen corresponding path program 1 times [2018-10-12 21:14:56,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:14:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:14:56,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:14:56,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:14:56,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-12 21:14:56,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-12 21:14:56,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-12 21:14:56,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-12 21:14:56,768 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 5 states. [2018-10-12 21:14:56,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:14:56,991 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-12 21:14:56,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-12 21:14:56,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2018-10-12 21:14:56,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:14:56,996 INFO L225 Difference]: With dead ends: 146 [2018-10-12 21:14:56,997 INFO L226 Difference]: Without dead ends: 146 [2018-10-12 21:14:56,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-12 21:14:56,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-12 21:14:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-10-12 21:14:57,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-12 21:14:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-10-12 21:14:57,010 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 140 [2018-10-12 21:14:57,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:14:57,011 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-10-12 21:14:57,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-12 21:14:57,012 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-10-12 21:14:57,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-12 21:14:57,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:14:57,014 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:14:57,015 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:14:57,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:14:57,015 INFO L82 PathProgramCache]: Analyzing trace with hash -979424156, now seen corresponding path program 2 times [2018-10-12 21:14:57,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:14:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:14:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:14:57,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:14:57,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-12 21:14:57,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-12 21:14:57,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-12 21:14:57,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-12 21:14:57,216 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 6 states. [2018-10-12 21:14:57,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:14:57,336 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-12 21:14:57,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-12 21:14:57,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2018-10-12 21:14:57,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:14:57,341 INFO L225 Difference]: With dead ends: 149 [2018-10-12 21:14:57,341 INFO L226 Difference]: Without dead ends: 149 [2018-10-12 21:14:57,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-12 21:14:57,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-12 21:14:57,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2018-10-12 21:14:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-12 21:14:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-12 21:14:57,353 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 143 [2018-10-12 21:14:57,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:14:57,354 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-12 21:14:57,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-12 21:14:57,354 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-12 21:14:57,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-12 21:14:57,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:14:57,357 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:14:57,358 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:14:57,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:14:57,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1066325621, now seen corresponding path program 3 times [2018-10-12 21:14:57,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:14:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:14:57,560 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:14:57,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:14:57,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-12 21:14:57,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-12 21:14:57,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-12 21:14:57,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-12 21:14:57,562 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 7 states. [2018-10-12 21:14:58,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:14:58,308 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-10-12 21:14:58,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-12 21:14:58,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2018-10-12 21:14:58,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:14:58,311 INFO L225 Difference]: With dead ends: 150 [2018-10-12 21:14:58,311 INFO L226 Difference]: Without dead ends: 150 [2018-10-12 21:14:58,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-12 21:14:58,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-12 21:14:58,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-10-12 21:14:58,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-12 21:14:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-10-12 21:14:58,322 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 146 [2018-10-12 21:14:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:14:58,323 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-10-12 21:14:58,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-12 21:14:58,323 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-10-12 21:14:58,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-12 21:14:58,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:14:58,326 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:14:58,326 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:14:58,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:14:58,327 INFO L82 PathProgramCache]: Analyzing trace with hash -82589948, now seen corresponding path program 4 times [2018-10-12 21:14:58,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:14:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:14:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-12 21:14:58,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 21:14:58,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-12 21:14:58,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 21:14:58,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 21:14:58,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-12 21:14:58,691 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 8 states. [2018-10-12 21:14:59,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:14:59,082 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-12 21:14:59,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-12 21:14:59,083 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 149 [2018-10-12 21:14:59,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:14:59,083 INFO L225 Difference]: With dead ends: 148 [2018-10-12 21:14:59,083 INFO L226 Difference]: Without dead ends: 0 [2018-10-12 21:14:59,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-12 21:14:59,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-12 21:14:59,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-12 21:14:59,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-12 21:14:59,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-12 21:14:59,085 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 149 [2018-10-12 21:14:59,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:14:59,085 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-12 21:14:59,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 21:14:59,086 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-12 21:14:59,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-12 21:14:59,092 INFO L202 PluginConnector]: Adding new model test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 09:14:59 BoogieIcfgContainer [2018-10-12 21:14:59,092 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-12 21:14:59,093 INFO L168 Benchmark]: Toolchain (without parser) took 4502.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 317.2 MB). Peak memory consumption was 317.2 MB. Max. memory is 7.1 GB. [2018-10-12 21:14:59,095 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-12 21:14:59,096 INFO L168 Benchmark]: Boogie Preprocessor took 91.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-12 21:14:59,096 INFO L168 Benchmark]: RCFGBuilder took 971.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-12 21:14:59,097 INFO L168 Benchmark]: TraceAbstraction took 3432.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 274.9 MB). Peak memory consumption was 274.9 MB. Max. memory is 7.1 GB. [2018-10-12 21:14:59,101 INFO L336 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 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 91.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 971.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3432.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 274.9 MB). Peak memory consumption was 274.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 206]: 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, 142 locations, 1 error locations. SAFE Result, 3.3s OverallTime, 5 OverallIterations, 4 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 640 SDtfs, 571 SDslu, 1499 SDs, 0 SdLazy, 213 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred 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, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 715 NumberOfCodeBlocks, 715 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 710 ConstructedInterpolants, 0 QuantifiedInterpolants, 231654 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 22/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2.1_false-valid-free.i_15.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-12_21-14-59-114.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2.1_false-valid-free.i_15.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-12_21-14-59-114.csv Received shutdown request...