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/960521-1_1_true-valid-memsafety.i_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:17:08,508 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:17:08,510 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:17:08,522 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:17:08,522 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:17:08,523 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:17:08,524 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:17:08,526 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:17:08,528 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:17:08,529 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:17:08,530 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:17:08,530 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:17:08,531 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:17:08,532 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:17:08,533 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:17:08,534 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:17:08,535 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:17:08,537 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:17:08,539 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:17:08,541 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:17:08,542 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:17:08,543 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:17:08,546 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:17:08,546 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:17:08,546 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:17:08,547 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:17:08,548 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:17:08,549 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:17:08,550 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:17:08,551 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:17:08,551 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:17:08,552 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:17:08,552 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:17:08,552 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:17:08,553 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:17:08,554 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:17:08,555 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:08,564 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:17:08,564 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:17:08,565 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:17:08,565 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:17:08,566 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:17:08,566 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:17:08,566 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:17:08,567 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:17:08,567 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:17:08,567 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:17:08,567 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:17:08,567 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:17:08,568 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:17:08,568 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:17:08,569 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:17:08,612 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:17:08,625 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:17:08,628 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:17:08,630 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:17:08,630 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:17:08,631 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/960521-1_1_true-valid-memsafety.i_11.bpl [2018-10-10 15:17:08,631 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/960521-1_1_true-valid-memsafety.i_11.bpl' [2018-10-10 15:17:08,694 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:17:08,696 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:17:08,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:17:08,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:17:08,698 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:17:08,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:08" (1/1) ... [2018-10-10 15:17:08,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:08" (1/1) ... [2018-10-10 15:17:08,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:08" (1/1) ... [2018-10-10 15:17:08,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:08" (1/1) ... [2018-10-10 15:17:08,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:08" (1/1) ... [2018-10-10 15:17:08,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:08" (1/1) ... [2018-10-10 15:17:08,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:08" (1/1) ... [2018-10-10 15:17:08,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:17:08,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:17:08,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:17:08,772 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:17:08,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:08" (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:08,840 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:17:08,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:17:08,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:17:09,413 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:17:09,415 INFO L202 PluginConnector]: Adding new model 960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:17:09 BoogieIcfgContainer [2018-10-10 15:17:09,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:17:09,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:17:09,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:17:09,423 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:17:09,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:08" (1/2) ... [2018-10-10 15:17:09,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708a5036 and model type 960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:17:09, skipping insertion in model container [2018-10-10 15:17:09,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:17:09" (2/2) ... [2018-10-10 15:17:09,428 INFO L112 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i_11.bpl [2018-10-10 15:17:09,441 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:17:09,452 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:17:09,473 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:17:09,512 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:17:09,513 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:17:09,513 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:17:09,513 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:17:09,514 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:17:09,514 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:17:09,514 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:17:09,514 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:17:09,514 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:17:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-10-10 15:17:09,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-10 15:17:09,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:09,573 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] [2018-10-10 15:17:09,578 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:09,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:09,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1460050407, now seen corresponding path program 1 times [2018-10-10 15:17:09,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:10,818 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:10,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:17:10,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-10 15:17:10,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 15:17:10,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 15:17:10,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:17:10,847 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 14 states. [2018-10-10 15:17:11,405 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-10 15:17:12,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:12,720 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2018-10-10 15:17:12,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 15:17:12,722 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2018-10-10 15:17:12,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:12,737 INFO L225 Difference]: With dead ends: 133 [2018-10-10 15:17:12,738 INFO L226 Difference]: Without dead ends: 133 [2018-10-10 15:17:12,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=213, Invalid=599, Unknown=0, NotChecked=0, Total=812 [2018-10-10 15:17:12,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-10 15:17:12,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2018-10-10 15:17:12,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-10 15:17:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-10-10 15:17:12,790 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 54 [2018-10-10 15:17:12,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:12,791 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-10-10 15:17:12,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 15:17:12,791 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-10-10 15:17:12,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-10 15:17:12,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:12,794 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-10 15:17:12,795 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:12,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:12,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1706373082, now seen corresponding path program 1 times [2018-10-10 15:17:12,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:13,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:17:13,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-10 15:17:13,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 15:17:13,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 15:17:13,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:17:13,332 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 16 states. [2018-10-10 15:17:14,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:14,530 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2018-10-10 15:17:14,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 15:17:14,533 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-10-10 15:17:14,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:14,538 INFO L225 Difference]: With dead ends: 142 [2018-10-10 15:17:14,538 INFO L226 Difference]: Without dead ends: 142 [2018-10-10 15:17:14,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:17:14,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-10 15:17:14,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 71. [2018-10-10 15:17:14,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-10 15:17:14,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-10-10 15:17:14,548 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 60 [2018-10-10 15:17:14,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:14,549 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-10-10 15:17:14,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 15:17:14,549 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-10-10 15:17:14,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-10 15:17:14,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:14,551 INFO L375 BasicCegarLoop]: trace histogram [2, 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] [2018-10-10 15:17:14,552 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:14,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:14,552 INFO L82 PathProgramCache]: Analyzing trace with hash 630589741, now seen corresponding path program 1 times [2018-10-10 15:17:14,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:14,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:14,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:14,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 15:17:14,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 15:17:14,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 15:17:14,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:17:14,671 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 6 states. [2018-10-10 15:17:14,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:14,789 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2018-10-10 15:17:14,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 15:17:14,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-10-10 15:17:14,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:14,799 INFO L225 Difference]: With dead ends: 126 [2018-10-10 15:17:14,799 INFO L226 Difference]: Without dead ends: 76 [2018-10-10 15:17:14,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:17:14,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-10 15:17:14,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2018-10-10 15:17:14,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-10 15:17:14,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-10-10 15:17:14,814 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 66 [2018-10-10 15:17:14,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:14,816 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-10-10 15:17:14,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 15:17:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-10-10 15:17:14,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-10 15:17:14,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:14,819 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-10-10 15:17:14,820 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:14,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:14,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1215056544, now seen corresponding path program 1 times [2018-10-10 15:17:14,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:15,437 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:15,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:15,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 15:17:15,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:17:15,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:17:15,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:17:15,439 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 19 states. [2018-10-10 15:17:17,035 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2018-10-10 15:17:17,347 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-10-10 15:17:17,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:17,525 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2018-10-10 15:17:17,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 15:17:17,526 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2018-10-10 15:17:17,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:17,527 INFO L225 Difference]: With dead ends: 98 [2018-10-10 15:17:17,528 INFO L226 Difference]: Without dead ends: 98 [2018-10-10 15:17:17,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=425, Invalid=1381, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:17:17,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-10 15:17:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2018-10-10 15:17:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-10 15:17:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-10-10 15:17:17,535 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 72 [2018-10-10 15:17:17,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:17,536 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-10-10 15:17:17,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:17:17,536 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-10-10 15:17:17,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-10 15:17:17,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:17,538 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2018-10-10 15:17:17,538 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:17,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:17,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1734120346, now seen corresponding path program 2 times [2018-10-10 15:17:17,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:17,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:17,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:17:17,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:17:17,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:17:17,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:17:17,828 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 10 states. [2018-10-10 15:17:18,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:18,032 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2018-10-10 15:17:18,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:17:18,032 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2018-10-10 15:17:18,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:18,033 INFO L225 Difference]: With dead ends: 156 [2018-10-10 15:17:18,033 INFO L226 Difference]: Without dead ends: 94 [2018-10-10 15:17:18,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:17:18,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-10 15:17:18,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-10-10 15:17:18,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-10 15:17:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-10-10 15:17:18,039 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 84 [2018-10-10 15:17:18,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:18,040 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-10-10 15:17:18,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:17:18,040 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-10-10 15:17:18,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-10 15:17:18,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:18,042 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-10 15:17:18,042 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:18,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:18,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1739237607, now seen corresponding path program 3 times [2018-10-10 15:17:18,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:18,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:18,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 15:17:18,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 15:17:18,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 15:17:18,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:17:18,515 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 24 states. [2018-10-10 15:17:20,557 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2018-10-10 15:17:20,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:20,823 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2018-10-10 15:17:20,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 15:17:20,825 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2018-10-10 15:17:20,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:20,827 INFO L225 Difference]: With dead ends: 116 [2018-10-10 15:17:20,828 INFO L226 Difference]: Without dead ends: 116 [2018-10-10 15:17:20,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=561, Invalid=2195, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 15:17:20,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-10 15:17:20,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2018-10-10 15:17:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-10 15:17:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-10-10 15:17:20,837 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 90 [2018-10-10 15:17:20,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:20,838 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-10-10 15:17:20,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 15:17:20,838 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-10-10 15:17:20,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-10 15:17:20,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:20,840 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2018-10-10 15:17:20,841 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:20,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:20,841 INFO L82 PathProgramCache]: Analyzing trace with hash 860392287, now seen corresponding path program 4 times [2018-10-10 15:17:20,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:21,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:21,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 15:17:21,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 15:17:21,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 15:17:21,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:17:21,046 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 14 states. [2018-10-10 15:17:21,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:21,451 INFO L93 Difference]: Finished difference Result 186 states and 187 transitions. [2018-10-10 15:17:21,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 15:17:21,452 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 102 [2018-10-10 15:17:21,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:21,453 INFO L225 Difference]: With dead ends: 186 [2018-10-10 15:17:21,453 INFO L226 Difference]: Without dead ends: 112 [2018-10-10 15:17:21,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:17:21,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-10 15:17:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-10-10 15:17:21,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-10 15:17:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-10-10 15:17:21,459 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 102 [2018-10-10 15:17:21,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:21,460 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-10-10 15:17:21,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 15:17:21,460 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-10-10 15:17:21,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-10 15:17:21,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:21,461 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-10 15:17:21,462 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:21,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:21,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1808380078, now seen corresponding path program 5 times [2018-10-10 15:17:21,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:22,085 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 24 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:22,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:22,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:17:22,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:17:22,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:17:22,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:17:22,087 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 30 states. [2018-10-10 15:17:25,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:25,053 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2018-10-10 15:17:25,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 15:17:25,053 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 108 [2018-10-10 15:17:25,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:25,055 INFO L225 Difference]: With dead ends: 134 [2018-10-10 15:17:25,055 INFO L226 Difference]: Without dead ends: 134 [2018-10-10 15:17:25,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=825, Invalid=3335, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 15:17:25,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-10 15:17:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2018-10-10 15:17:25,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-10 15:17:25,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-10-10 15:17:25,062 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 108 [2018-10-10 15:17:25,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:25,063 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-10-10 15:17:25,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:17:25,063 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-10-10 15:17:25,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-10 15:17:25,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:25,065 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-10-10 15:17:25,065 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:25,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:25,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1755444760, now seen corresponding path program 6 times [2018-10-10 15:17:25,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:26,153 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 58 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:26,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:26,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 15:17:26,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 15:17:26,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 15:17:26,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:17:26,155 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 18 states. [2018-10-10 15:17:26,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:26,602 INFO L93 Difference]: Finished difference Result 216 states and 217 transitions. [2018-10-10 15:17:26,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:17:26,603 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 120 [2018-10-10 15:17:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:26,605 INFO L225 Difference]: With dead ends: 216 [2018-10-10 15:17:26,605 INFO L226 Difference]: Without dead ends: 130 [2018-10-10 15:17:26,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:17:26,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-10 15:17:26,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2018-10-10 15:17:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-10 15:17:26,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-10-10 15:17:26,610 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 120 [2018-10-10 15:17:26,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:26,610 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-10-10 15:17:26,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 15:17:26,611 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-10-10 15:17:26,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-10 15:17:26,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:26,612 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-10-10 15:17:26,613 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:26,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:26,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1233109835, now seen corresponding path program 7 times [2018-10-10 15:17:26,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 44 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:27,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:27,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 15:17:27,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 15:17:27,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 15:17:27,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:17:27,361 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 32 states. [2018-10-10 15:17:30,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:30,499 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2018-10-10 15:17:30,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 15:17:30,500 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 126 [2018-10-10 15:17:30,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:30,501 INFO L225 Difference]: With dead ends: 152 [2018-10-10 15:17:30,501 INFO L226 Difference]: Without dead ends: 152 [2018-10-10 15:17:30,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=867, Invalid=4103, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 15:17:30,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-10 15:17:30,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 139. [2018-10-10 15:17:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-10 15:17:30,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-10-10 15:17:30,507 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 126 [2018-10-10 15:17:30,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:30,508 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-10-10 15:17:30,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 15:17:30,508 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-10-10 15:17:30,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-10 15:17:30,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:30,510 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2018-10-10 15:17:30,510 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:30,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:30,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1372077201, now seen corresponding path program 8 times [2018-10-10 15:17:30,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:31,215 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 100 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:31,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:31,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 15:17:31,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 15:17:31,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 15:17:31,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:17:31,217 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 22 states. [2018-10-10 15:17:31,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:31,759 INFO L93 Difference]: Finished difference Result 246 states and 247 transitions. [2018-10-10 15:17:31,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 15:17:31,759 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 138 [2018-10-10 15:17:31,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:31,761 INFO L225 Difference]: With dead ends: 246 [2018-10-10 15:17:31,761 INFO L226 Difference]: Without dead ends: 148 [2018-10-10 15:17:31,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=334, Invalid=1646, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:17:31,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-10 15:17:31,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2018-10-10 15:17:31,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-10 15:17:31,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-10-10 15:17:31,766 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 138 [2018-10-10 15:17:31,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:31,766 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-10-10 15:17:31,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 15:17:31,766 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-10-10 15:17:31,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-10 15:17:31,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:31,768 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:31,768 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:31,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:31,769 INFO L82 PathProgramCache]: Analyzing trace with hash -23182588, now seen corresponding path program 9 times [2018-10-10 15:17:31,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:32,599 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 70 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:32,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:32,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 15:17:32,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 15:17:32,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 15:17:32,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1147, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:17:32,601 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 36 states. [2018-10-10 15:17:34,471 WARN L178 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-10 15:17:37,915 WARN L178 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-10-10 15:17:38,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:38,248 INFO L93 Difference]: Finished difference Result 170 states and 171 transitions. [2018-10-10 15:17:38,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 15:17:38,248 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 144 [2018-10-10 15:17:38,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:38,250 INFO L225 Difference]: With dead ends: 170 [2018-10-10 15:17:38,250 INFO L226 Difference]: Without dead ends: 170 [2018-10-10 15:17:38,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1044, Invalid=5276, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 15:17:38,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-10 15:17:38,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2018-10-10 15:17:38,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-10 15:17:38,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-10-10 15:17:38,256 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 144 [2018-10-10 15:17:38,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:38,257 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-10-10 15:17:38,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 15:17:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-10-10 15:17:38,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-10 15:17:38,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:38,258 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:38,258 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:38,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:38,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1496322358, now seen corresponding path program 10 times [2018-10-10 15:17:38,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 154 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:38,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:38,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 15:17:38,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 15:17:38,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 15:17:38,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:17:38,702 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 26 states. [2018-10-10 15:17:39,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:39,302 INFO L93 Difference]: Finished difference Result 276 states and 277 transitions. [2018-10-10 15:17:39,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 15:17:39,303 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 156 [2018-10-10 15:17:39,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:39,305 INFO L225 Difference]: With dead ends: 276 [2018-10-10 15:17:39,307 INFO L226 Difference]: Without dead ends: 166 [2018-10-10 15:17:39,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=471, Invalid=2391, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:17:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-10 15:17:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2018-10-10 15:17:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-10 15:17:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-10-10 15:17:39,312 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 156 [2018-10-10 15:17:39,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:39,312 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-10-10 15:17:39,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 15:17:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-10-10 15:17:39,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-10 15:17:39,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:39,314 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:39,314 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:39,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:39,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1811570301, now seen corresponding path program 11 times [2018-10-10 15:17:39,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 102 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:40,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:40,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 15:17:40,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 15:17:40,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 15:17:40,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1567, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:17:40,165 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 42 states. [2018-10-10 15:17:43,220 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2018-10-10 15:17:43,724 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2018-10-10 15:17:44,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:44,924 INFO L93 Difference]: Finished difference Result 188 states and 189 transitions. [2018-10-10 15:17:44,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-10 15:17:44,925 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 162 [2018-10-10 15:17:44,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:44,926 INFO L225 Difference]: With dead ends: 188 [2018-10-10 15:17:44,926 INFO L226 Difference]: Without dead ends: 188 [2018-10-10 15:17:44,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1961 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1538, Invalid=7018, Unknown=0, NotChecked=0, Total=8556 [2018-10-10 15:17:44,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-10 15:17:44,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2018-10-10 15:17:44,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-10 15:17:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-10-10 15:17:44,934 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 162 [2018-10-10 15:17:44,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:44,934 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-10-10 15:17:44,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 15:17:44,934 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-10-10 15:17:44,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-10 15:17:44,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:44,935 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:44,936 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:44,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:44,936 INFO L82 PathProgramCache]: Analyzing trace with hash 2009701571, now seen corresponding path program 12 times [2018-10-10 15:17:44,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 220 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:45,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:45,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:17:45,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:17:45,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:17:45,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:17:45,603 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 30 states. [2018-10-10 15:17:46,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:46,565 INFO L93 Difference]: Finished difference Result 306 states and 307 transitions. [2018-10-10 15:17:46,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 15:17:46,566 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 174 [2018-10-10 15:17:46,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:46,567 INFO L225 Difference]: With dead ends: 306 [2018-10-10 15:17:46,567 INFO L226 Difference]: Without dead ends: 184 [2018-10-10 15:17:46,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=632, Invalid=3274, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 15:17:46,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-10 15:17:46,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-10-10 15:17:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-10 15:17:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-10-10 15:17:46,573 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 174 [2018-10-10 15:17:46,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:46,573 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-10-10 15:17:46,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:17:46,573 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-10-10 15:17:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-10 15:17:46,574 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:46,574 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:46,575 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:46,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:46,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1258773066, now seen corresponding path program 13 times [2018-10-10 15:17:46,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:47,643 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 140 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:47,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:47,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 15:17:47,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 15:17:47,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 15:17:47,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1883, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:17:47,646 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 46 states. [2018-10-10 15:17:51,226 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-10-10 15:17:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:53,221 INFO L93 Difference]: Finished difference Result 206 states and 207 transitions. [2018-10-10 15:17:53,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 15:17:53,222 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 180 [2018-10-10 15:17:53,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:53,224 INFO L225 Difference]: With dead ends: 206 [2018-10-10 15:17:53,224 INFO L226 Difference]: Without dead ends: 206 [2018-10-10 15:17:53,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2473 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1880, Invalid=8626, Unknown=0, NotChecked=0, Total=10506 [2018-10-10 15:17:53,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-10 15:17:53,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 193. [2018-10-10 15:17:53,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-10 15:17:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-10-10 15:17:53,247 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 180 [2018-10-10 15:17:53,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:53,248 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-10-10 15:17:53,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 15:17:53,248 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-10-10 15:17:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-10 15:17:53,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:53,249 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:53,250 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:53,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:53,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1514023300, now seen corresponding path program 14 times [2018-10-10 15:17:53,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:53,980 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 298 proven. 218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:53,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:53,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:17:53,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:17:53,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:17:53,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:17:53,982 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 34 states. [2018-10-10 15:17:55,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:55,099 INFO L93 Difference]: Finished difference Result 336 states and 337 transitions. [2018-10-10 15:17:55,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 15:17:55,100 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 192 [2018-10-10 15:17:55,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:55,102 INFO L225 Difference]: With dead ends: 336 [2018-10-10 15:17:55,102 INFO L226 Difference]: Without dead ends: 202 [2018-10-10 15:17:55,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=817, Invalid=4295, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:17:55,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-10 15:17:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2018-10-10 15:17:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-10 15:17:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-10-10 15:17:55,107 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 192 [2018-10-10 15:17:55,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:55,107 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-10-10 15:17:55,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:17:55,107 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-10-10 15:17:55,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-10 15:17:55,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:55,109 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:55,109 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:55,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:55,109 INFO L82 PathProgramCache]: Analyzing trace with hash 553232559, now seen corresponding path program 15 times [2018-10-10 15:17:55,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 184 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:56,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:56,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 15:17:56,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 15:17:56,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 15:17:56,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2227, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:17:56,373 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 50 states. [2018-10-10 15:17:58,543 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2018-10-10 15:17:59,122 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2018-10-10 15:17:59,290 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2018-10-10 15:18:00,264 WARN L178 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2018-10-10 15:18:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:02,682 INFO L93 Difference]: Finished difference Result 224 states and 225 transitions. [2018-10-10 15:18:02,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-10 15:18:02,683 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 198 [2018-10-10 15:18:02,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:02,688 INFO L225 Difference]: With dead ends: 224 [2018-10-10 15:18:02,688 INFO L226 Difference]: Without dead ends: 224 [2018-10-10 15:18:02,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3044 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2257, Invalid=10399, Unknown=0, NotChecked=0, Total=12656 [2018-10-10 15:18:02,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-10 15:18:02,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 211. [2018-10-10 15:18:02,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-10 15:18:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-10-10 15:18:02,694 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 198 [2018-10-10 15:18:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:02,695 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-10-10 15:18:02,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 15:18:02,695 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-10-10 15:18:02,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-10 15:18:02,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:02,696 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:02,696 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:02,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:02,696 INFO L82 PathProgramCache]: Analyzing trace with hash 465644533, now seen corresponding path program 16 times [2018-10-10 15:18:02,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 388 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:03,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:03,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 15:18:03,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 15:18:03,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 15:18:03,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1203, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:18:03,684 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 38 states. [2018-10-10 15:18:05,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:05,038 INFO L93 Difference]: Finished difference Result 366 states and 367 transitions. [2018-10-10 15:18:05,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-10 15:18:05,038 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 210 [2018-10-10 15:18:05,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:05,040 INFO L225 Difference]: With dead ends: 366 [2018-10-10 15:18:05,040 INFO L226 Difference]: Without dead ends: 220 [2018-10-10 15:18:05,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1026, Invalid=5454, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 15:18:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-10 15:18:05,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2018-10-10 15:18:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-10 15:18:05,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-10-10 15:18:05,045 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 210 [2018-10-10 15:18:05,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:05,045 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-10-10 15:18:05,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 15:18:05,046 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-10-10 15:18:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-10 15:18:05,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:05,047 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:05,047 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:05,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:05,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1806043288, now seen corresponding path program 17 times [2018-10-10 15:18:05,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 154 proven. 94 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2018-10-10 15:18:05,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:05,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 15:18:05,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 15:18:05,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 15:18:05,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:18:05,869 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 20 states. [2018-10-10 15:18:06,293 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-10 15:18:07,746 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2018-10-10 15:18:08,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:08,160 INFO L93 Difference]: Finished difference Result 215 states and 216 transitions. [2018-10-10 15:18:08,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 15:18:08,161 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 216 [2018-10-10 15:18:08,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:08,162 INFO L225 Difference]: With dead ends: 215 [2018-10-10 15:18:08,162 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 15:18:08,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=540, Invalid=1530, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:18:08,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 15:18:08,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 15:18:08,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 15:18:08,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 15:18:08,164 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 216 [2018-10-10 15:18:08,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:08,164 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 15:18:08,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 15:18:08,165 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 15:18:08,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 15:18:08,170 INFO L202 PluginConnector]: Adding new model 960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 03:18:08 BoogieIcfgContainer [2018-10-10 15:18:08,170 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 15:18:08,171 INFO L168 Benchmark]: Toolchain (without parser) took 59476.56 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 511.7 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -292.2 MB). Peak memory consumption was 219.5 MB. Max. memory is 7.1 GB. [2018-10-10 15:18:08,173 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 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:18:08,173 INFO L168 Benchmark]: Boogie Preprocessor took 72.77 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:18:08,174 INFO L168 Benchmark]: RCFGBuilder took 643.89 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-10 15:18:08,175 INFO L168 Benchmark]: TraceAbstraction took 58753.94 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 511.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -323.9 MB). Peak memory consumption was 187.8 MB. Max. memory is 7.1 GB. [2018-10-10 15:18:08,178 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.15 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 72.77 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 643.89 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 58753.94 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 511.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -323.9 MB). Peak memory consumption was 187.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 135]: 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, 68 locations, 1 error locations. SAFE Result, 58.6s OverallTime, 20 OverallIterations, 10 TraceHistogramMax, 44.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1427 SDtfs, 12821 SDslu, 15626 SDs, 0 SdLazy, 12482 SolverSat, 1481 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1156 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1095 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17399 ImplicationChecksByTransitivity, 40.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=19, 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.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 225 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 2652 NumberOfCodeBlocks, 2652 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2632 ConstructedInterpolants, 0 QuantifiedInterpolants, 2772001 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 2455/4718 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/960521-1_1_true-valid-memsafety.i_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-10_15-18-08-189.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-10_15-18-08-189.csv Received shutdown request...