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/20051113-1.c_false-valid-memtrack.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:17:03,484 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:17:03,489 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:17:03,511 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:17:03,512 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:17:03,515 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:17:03,516 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:17:03,518 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:17:03,520 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:17:03,521 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:17:03,522 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:17:03,523 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:17:03,524 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:17:03,525 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:17:03,526 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:17:03,527 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:17:03,528 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:17:03,529 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:17:03,532 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:17:03,533 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:17:03,535 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:17:03,536 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:17:03,538 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:17:03,538 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:17:03,539 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:17:03,540 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:17:03,541 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:17:03,542 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:17:03,543 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:17:03,544 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:17:03,544 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:17:03,545 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:17:03,545 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:17:03,545 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:17:03,547 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:17:03,548 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:17:03,548 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-10 15:17:03,558 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:17:03,558 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:17:03,559 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:17:03,559 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:17:03,559 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:17:03,560 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:17:03,560 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:17:03,561 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:17:03,561 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:17:03,561 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:17:03,561 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:17:03,561 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:17:03,562 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:17:03,563 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:17:03,563 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:17:03,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:17:03,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:17:03,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:17:03,626 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:17:03,627 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:17:03,627 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_5.bpl [2018-10-10 15:17:03,628 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_5.bpl' [2018-10-10 15:17:03,688 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:17:03,690 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:17:03,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:17:03,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:17:03,692 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:17:03,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:03" (1/1) ... [2018-10-10 15:17:03,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:03" (1/1) ... [2018-10-10 15:17:03,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:03" (1/1) ... [2018-10-10 15:17:03,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:03" (1/1) ... [2018-10-10 15:17:03,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:03" (1/1) ... [2018-10-10 15:17:03,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:03" (1/1) ... [2018-10-10 15:17:03,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:03" (1/1) ... [2018-10-10 15:17:03,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:17:03,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:17:03,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:17:03,749 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:17:03,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:03" (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-10 15:17:03,833 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:17:03,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:17:03,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:17:04,394 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:17:04,395 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:17:04 BoogieIcfgContainer [2018-10-10 15:17:04,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:17:04,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:17:04,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:17:04,400 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:17:04,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:03" (1/2) ... [2018-10-10 15:17:04,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107a9edc and model type 20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:17:04, skipping insertion in model container [2018-10-10 15:17:04,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:17:04" (2/2) ... [2018-10-10 15:17:04,404 INFO L112 eAbstractionObserver]: Analyzing ICFG 20051113-1.c_false-valid-memtrack.i_5.bpl [2018-10-10 15:17:04,416 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:17:04,425 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:17:04,444 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:17:04,476 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:17:04,477 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:17:04,478 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:17:04,478 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:17:04,478 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:17:04,478 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:17:04,478 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:17:04,479 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:17:04,479 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:17:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-10-10 15:17:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-10 15:17:04,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:04,509 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] [2018-10-10 15:17:04,510 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:04,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:04,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1825267017, now seen corresponding path program 1 times [2018-10-10 15:17:04,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:04,754 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-10 15:17:04,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:17:04,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 15:17:04,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 15:17:04,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 15:17:04,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:17:04,780 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 4 states. [2018-10-10 15:17:04,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:04,901 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-10 15:17:04,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 15:17:04,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-10-10 15:17:04,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:04,918 INFO L225 Difference]: With dead ends: 39 [2018-10-10 15:17:04,918 INFO L226 Difference]: Without dead ends: 39 [2018-10-10 15:17:04,921 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-10 15:17:04,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-10 15:17:04,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-10-10 15:17:04,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-10 15:17:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-10 15:17:04,970 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2018-10-10 15:17:04,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:04,971 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-10 15:17:04,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 15:17:04,971 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-10 15:17:04,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-10 15:17:04,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:04,972 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] [2018-10-10 15:17:04,974 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:04,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:04,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1638493867, now seen corresponding path program 1 times [2018-10-10 15:17:04,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:05,167 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-10 15:17:05,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:05,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 15:17:05,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 15:17:05,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 15:17:05,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 15:17:05,171 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 5 states. [2018-10-10 15:17:05,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:05,365 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-10 15:17:05,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 15:17:05,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-10-10 15:17:05,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:05,371 INFO L225 Difference]: With dead ends: 42 [2018-10-10 15:17:05,371 INFO L226 Difference]: Without dead ends: 42 [2018-10-10 15:17:05,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:17:05,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-10 15:17:05,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-10-10 15:17:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-10 15:17:05,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-10 15:17:05,382 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2018-10-10 15:17:05,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:05,383 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-10 15:17:05,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 15:17:05,383 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-10 15:17:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-10 15:17:05,386 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:05,386 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] [2018-10-10 15:17:05,386 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:05,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:05,387 INFO L82 PathProgramCache]: Analyzing trace with hash 537769463, now seen corresponding path program 2 times [2018-10-10 15:17:05,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:05,583 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-10 15:17:05,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:05,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 15:17:05,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 15:17:05,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 15:17:05,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:17:05,586 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 6 states. [2018-10-10 15:17:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:05,734 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-10 15:17:05,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 15:17:05,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-10-10 15:17:05,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:05,737 INFO L225 Difference]: With dead ends: 45 [2018-10-10 15:17:05,737 INFO L226 Difference]: Without dead ends: 45 [2018-10-10 15:17:05,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:17:05,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-10 15:17:05,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-10-10 15:17:05,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-10 15:17:05,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-10 15:17:05,744 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2018-10-10 15:17:05,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:05,745 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-10 15:17:05,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 15:17:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-10 15:17:05,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-10 15:17:05,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:05,747 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] [2018-10-10 15:17:05,748 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:05,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:05,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1067300373, now seen corresponding path program 3 times [2018-10-10 15:17:05,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:06,034 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-10 15:17:06,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:06,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 15:17:06,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:17:06,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:17:06,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:17:06,037 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 7 states. [2018-10-10 15:17:06,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:06,191 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-10 15:17:06,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 15:17:06,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-10-10 15:17:06,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:06,193 INFO L225 Difference]: With dead ends: 48 [2018-10-10 15:17:06,193 INFO L226 Difference]: Without dead ends: 48 [2018-10-10 15:17:06,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:17:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-10 15:17:06,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-10-10 15:17:06,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-10 15:17:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-10 15:17:06,201 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2018-10-10 15:17:06,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:06,201 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-10 15:17:06,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:17:06,202 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-10 15:17:06,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-10 15:17:06,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:06,204 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] [2018-10-10 15:17:06,204 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:06,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:06,204 INFO L82 PathProgramCache]: Analyzing trace with hash 907761975, now seen corresponding path program 4 times [2018-10-10 15:17:06,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:06,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:06,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:17:06,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:17:06,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:17:06,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:17:06,377 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 8 states. [2018-10-10 15:17:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:06,859 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-10 15:17:06,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:17:06,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-10-10 15:17:06,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:06,862 INFO L225 Difference]: With dead ends: 51 [2018-10-10 15:17:06,863 INFO L226 Difference]: Without dead ends: 51 [2018-10-10 15:17:06,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:17:06,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-10 15:17:06,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-10-10 15:17:06,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-10 15:17:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-10 15:17:06,869 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2018-10-10 15:17:06,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:06,870 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-10 15:17:06,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:17:06,870 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-10 15:17:06,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-10 15:17:06,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:06,872 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:17:06,872 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:06,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:06,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1666823467, now seen corresponding path program 5 times [2018-10-10 15:17:06,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:07,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:07,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 15:17:07,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 15:17:07,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 15:17:07,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:17:07,106 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 9 states. [2018-10-10 15:17:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:07,372 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-10 15:17:07,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 15:17:07,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-10-10 15:17:07,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:07,377 INFO L225 Difference]: With dead ends: 54 [2018-10-10 15:17:07,377 INFO L226 Difference]: Without dead ends: 54 [2018-10-10 15:17:07,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:17:07,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-10 15:17:07,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-10-10 15:17:07,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-10 15:17:07,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-10 15:17:07,391 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2018-10-10 15:17:07,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:07,392 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-10 15:17:07,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 15:17:07,392 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-10 15:17:07,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-10 15:17:07,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:07,399 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:17:07,399 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:07,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:07,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1615754121, now seen corresponding path program 6 times [2018-10-10 15:17:07,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:07,807 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:07,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:07,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:17:07,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:17:07,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:17:07,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:17:07,809 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 10 states. [2018-10-10 15:17:08,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:08,062 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-10 15:17:08,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 15:17:08,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-10-10 15:17:08,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:08,065 INFO L225 Difference]: With dead ends: 57 [2018-10-10 15:17:08,065 INFO L226 Difference]: Without dead ends: 57 [2018-10-10 15:17:08,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:17:08,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-10 15:17:08,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-10-10 15:17:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-10 15:17:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-10 15:17:08,077 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2018-10-10 15:17:08,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:08,078 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-10 15:17:08,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:17:08,078 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-10 15:17:08,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-10 15:17:08,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:08,079 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:17:08,080 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:08,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:08,080 INFO L82 PathProgramCache]: Analyzing trace with hash -627290219, now seen corresponding path program 7 times [2018-10-10 15:17:08,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:08,291 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:08,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:08,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 15:17:08,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 15:17:08,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 15:17:08,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:17:08,293 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 11 states. [2018-10-10 15:17:08,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:08,481 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-10 15:17:08,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:17:08,482 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-10-10 15:17:08,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:08,484 INFO L225 Difference]: With dead ends: 60 [2018-10-10 15:17:08,484 INFO L226 Difference]: Without dead ends: 60 [2018-10-10 15:17:08,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:17:08,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-10 15:17:08,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-10-10 15:17:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-10 15:17:08,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-10 15:17:08,490 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2018-10-10 15:17:08,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:08,490 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-10 15:17:08,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 15:17:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-10 15:17:08,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-10 15:17:08,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:08,492 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:17:08,492 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:08,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:08,493 INFO L82 PathProgramCache]: Analyzing trace with hash 405032887, now seen corresponding path program 8 times [2018-10-10 15:17:08,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:08,661 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:08,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:08,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:17:08,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:17:08,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:17:08,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:17:08,664 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 12 states. [2018-10-10 15:17:08,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:08,899 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-10 15:17:08,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 15:17:08,899 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-10-10 15:17:08,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:08,902 INFO L225 Difference]: With dead ends: 63 [2018-10-10 15:17:08,902 INFO L226 Difference]: Without dead ends: 63 [2018-10-10 15:17:08,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:17:08,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-10 15:17:08,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-10-10 15:17:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-10 15:17:08,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-10 15:17:08,910 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2018-10-10 15:17:08,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:08,911 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-10 15:17:08,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:17:08,911 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-10 15:17:08,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-10 15:17:08,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:08,912 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:17:08,913 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:08,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:08,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1918122923, now seen corresponding path program 9 times [2018-10-10 15:17:08,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:09,277 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:09,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:09,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 15:17:09,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 15:17:09,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 15:17:09,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-10 15:17:09,279 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 13 states. [2018-10-10 15:17:09,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:09,534 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-10 15:17:09,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:17:09,535 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-10-10 15:17:09,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:09,536 INFO L225 Difference]: With dead ends: 66 [2018-10-10 15:17:09,537 INFO L226 Difference]: Without dead ends: 66 [2018-10-10 15:17:09,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:17:09,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-10 15:17:09,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-10-10 15:17:09,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-10 15:17:09,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-10-10 15:17:09,543 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2018-10-10 15:17:09,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:09,543 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-10-10 15:17:09,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 15:17:09,544 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-10-10 15:17:09,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-10 15:17:09,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:09,545 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:17:09,545 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:09,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:09,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1949850889, now seen corresponding path program 10 times [2018-10-10 15:17:09,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-10 15:17:09,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:17:09,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 15:17:09,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:17:09,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:17:09,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:17:09,908 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 8 states. [2018-10-10 15:17:10,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:10,038 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-10-10 15:17:10,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:17:10,039 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-10-10 15:17:10,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:10,039 INFO L225 Difference]: With dead ends: 62 [2018-10-10 15:17:10,039 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 15:17:10,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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-10 15:17:10,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 15:17:10,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 15:17:10,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 15:17:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 15:17:10,042 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2018-10-10 15:17:10,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:10,042 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 15:17:10,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:17:10,043 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 15:17:10,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 15:17:10,048 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 03:17:10 BoogieIcfgContainer [2018-10-10 15:17:10,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 15:17:10,049 INFO L168 Benchmark]: Toolchain (without parser) took 6360.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 362.2 MB). Peak memory consumption was 362.2 MB. Max. memory is 7.1 GB. [2018-10-10 15:17:10,052 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:17:10,052 INFO L168 Benchmark]: Boogie Preprocessor took 57.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:17:10,053 INFO L168 Benchmark]: RCFGBuilder took 646.55 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 15:17:10,054 INFO L168 Benchmark]: TraceAbstraction took 5652.05 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: 341.1 MB). Peak memory consumption was 341.1 MB. Max. memory is 7.1 GB. [2018-10-10 15:17:10,057 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 646.55 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5652.05 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: 341.1 MB). Peak memory consumption was 341.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 86]: 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, 38 locations, 1 error locations. SAFE Result, 5.5s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 326 SDtfs, 435 SDslu, 1187 SDs, 0 SdLazy, 459 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=10, 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, 11 MinimizatonAttempts, 20 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 528 NumberOfCodeBlocks, 528 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 517 ConstructedInterpolants, 0 QuantifiedInterpolants, 89041 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 145/550 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/20051113-1.c_false-valid-memtrack.i_5.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-10_15-17-10-069.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_5.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-10_15-17-10-069.csv Received shutdown request...