java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/loop__barthe2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:57:19,515 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:57:19,517 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:57:19,535 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:57:19,536 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:57:19,537 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:57:19,538 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:57:19,543 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:57:19,546 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:57:19,546 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:57:19,547 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:57:19,547 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:57:19,548 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:57:19,551 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:57:19,552 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:57:19,553 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:57:19,565 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:57:19,566 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:57:19,570 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:57:19,571 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:57:19,572 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:57:19,574 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:57:19,574 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:57:19,574 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:57:19,575 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:57:19,575 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:57:19,576 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:57:19,577 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:57:19,578 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:57:19,578 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:57:19,578 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:57:19,579 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:57:19,579 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:57:19,580 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:57:19,580 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:57:19,581 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:57:19,604 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:57:19,604 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:57:19,604 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:57:19,604 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:57:19,605 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:57:19,606 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:57:19,606 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:57:19,606 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:57:19,606 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:57:19,606 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:57:19,607 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:57:19,607 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:57:19,607 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:57:19,608 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:57:19,608 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:57:19,608 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:57:19,608 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:57:19,608 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:57:19,609 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:57:19,610 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:57:19,610 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:57:19,653 INFO ]: Repository-Root is: /tmp [2018-06-22 11:57:19,670 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:57:19,676 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:57:19,678 INFO ]: Initializing SmtParser... [2018-06-22 11:57:19,678 INFO ]: SmtParser initialized [2018-06-22 11:57:19,678 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__barthe2.smt2 [2018-06-22 11:57:19,680 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/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-06-22 11:57:19,764 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@532e5b40 [2018-06-22 11:57:19,906 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2.smt2 [2018-06-22 11:57:19,911 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:57:19,916 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:57:19,916 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:57:19,916 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:57:19,917 INFO ]: ChcToBoogie initialized [2018-06-22 11:57:19,919 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:57:19" (1/1) ... [2018-06-22 11:57:19,966 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:19 Unit [2018-06-22 11:57:19,966 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:57:19,967 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:57:19,967 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:57:19,967 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:57:19,988 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:19" (1/1) ... [2018-06-22 11:57:19,988 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:19" (1/1) ... [2018-06-22 11:57:19,997 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:19" (1/1) ... [2018-06-22 11:57:19,997 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:19" (1/1) ... [2018-06-22 11:57:19,999 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:19" (1/1) ... [2018-06-22 11:57:20,000 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:19" (1/1) ... [2018-06-22 11:57:20,002 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:19" (1/1) ... [2018-06-22 11:57:20,003 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:57:20,003 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:57:20,003 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:57:20,003 INFO ]: RCFGBuilder initialized [2018-06-22 11:57:20,004 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:19" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:57:20,017 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:57:20,017 INFO ]: Found specification of procedure False [2018-06-22 11:57:20,018 INFO ]: Found implementation of procedure False [2018-06-22 11:57:20,018 INFO ]: Specification and implementation of procedure INV_MAIN_1 given in one single declaration [2018-06-22 11:57:20,018 INFO ]: Found specification of procedure INV_MAIN_1 [2018-06-22 11:57:20,018 INFO ]: Found implementation of procedure INV_MAIN_1 [2018-06-22 11:57:20,018 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:57:20,018 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:57:20,018 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:57:20,226 INFO ]: Using library mode [2018-06-22 11:57:20,227 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:57:20 BoogieIcfgContainer [2018-06-22 11:57:20,227 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:57:20,228 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:57:20,228 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:57:20,231 INFO ]: TraceAbstraction initialized [2018-06-22 11:57:20,232 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:57:19" (1/3) ... [2018-06-22 11:57:20,233 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698d56ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:57:20, skipping insertion in model container [2018-06-22 11:57:20,233 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:19" (2/3) ... [2018-06-22 11:57:20,233 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698d56ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:57:20, skipping insertion in model container [2018-06-22 11:57:20,233 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:57:20" (3/3) ... [2018-06-22 11:57:20,235 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:57:20,244 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:57:20,251 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:57:20,284 INFO ]: Using default assertion order modulation [2018-06-22 11:57:20,284 INFO ]: Interprodecural is true [2018-06-22 11:57:20,284 INFO ]: Hoare is false [2018-06-22 11:57:20,284 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:57:20,284 INFO ]: Backedges is TWOTRACK [2018-06-22 11:57:20,284 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:57:20,284 INFO ]: Difference is false [2018-06-22 11:57:20,284 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:57:20,284 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:57:20,298 INFO ]: Start isEmpty. Operand 15 states. [2018-06-22 11:57:20,308 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:57:20,308 INFO ]: Found error trace [2018-06-22 11:57:20,309 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:20,309 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:20,314 INFO ]: Analyzing trace with hash -1036880812, now seen corresponding path program 1 times [2018-06-22 11:57:20,316 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:20,316 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:20,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:20,356 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:20,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:20,391 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:20,574 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:57:20,578 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:57:20,579 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:57:20,580 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:57:20,596 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:57:20,597 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:57:20,599 INFO ]: Start difference. First operand 15 states. Second operand 4 states. [2018-06-22 11:57:20,705 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:20,705 INFO ]: Finished difference Result 15 states and 22 transitions. [2018-06-22 11:57:20,708 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:57:20,710 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:57:20,710 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:20,724 INFO ]: With dead ends: 15 [2018-06-22 11:57:20,724 INFO ]: Without dead ends: 15 [2018-06-22 11:57:20,727 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:57:20,744 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 11:57:20,779 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 11:57:20,780 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 11:57:20,781 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-22 11:57:20,783 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 9 [2018-06-22 11:57:20,784 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:20,785 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-22 11:57:20,785 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:57:20,785 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-22 11:57:20,787 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:57:20,787 INFO ]: Found error trace [2018-06-22 11:57:20,787 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:20,787 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:20,787 INFO ]: Analyzing trace with hash -929726366, now seen corresponding path program 1 times [2018-06-22 11:57:20,788 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:20,788 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:20,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:20,788 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:20,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:20,812 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:21,175 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:57:21,175 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:21,175 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:21,190 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:21,217 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:21,223 INFO ]: Computing forward predicates... [2018-06-22 11:57:21,619 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:57:21,641 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:21,642 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:57:21,642 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:57:21,642 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:57:21,642 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:57:21,643 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 9 states. [2018-06-22 11:57:21,933 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:21,933 INFO ]: Finished difference Result 21 states and 35 transitions. [2018-06-22 11:57:21,933 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:57:21,933 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:57:21,934 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:21,935 INFO ]: With dead ends: 21 [2018-06-22 11:57:21,935 INFO ]: Without dead ends: 21 [2018-06-22 11:57:21,935 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:57:21,936 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:57:21,942 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-22 11:57:21,942 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:57:21,943 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2018-06-22 11:57:21,943 INFO ]: Start accepts. Automaton has 17 states and 26 transitions. Word has length 13 [2018-06-22 11:57:21,943 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:21,943 INFO ]: Abstraction has 17 states and 26 transitions. [2018-06-22 11:57:21,943 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:57:21,944 INFO ]: Start isEmpty. Operand 17 states and 26 transitions. [2018-06-22 11:57:21,944 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:57:21,945 INFO ]: Found error trace [2018-06-22 11:57:21,945 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:21,945 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:21,945 INFO ]: Analyzing trace with hash -1174977219, now seen corresponding path program 1 times [2018-06-22 11:57:21,945 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:21,945 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:21,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:21,946 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:21,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:21,959 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:22,134 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:57:22,134 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:22,134 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:22,143 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:22,156 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:22,158 INFO ]: Computing forward predicates... [2018-06-22 11:57:22,306 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:57:22,326 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:22,326 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:57:22,327 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:57:22,327 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:57:22,327 INFO ]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:57:22,327 INFO ]: Start difference. First operand 17 states and 26 transitions. Second operand 9 states. [2018-06-22 11:57:22,801 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:22,801 INFO ]: Finished difference Result 23 states and 40 transitions. [2018-06-22 11:57:22,801 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:57:22,801 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:57:22,801 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:22,802 INFO ]: With dead ends: 23 [2018-06-22 11:57:22,802 INFO ]: Without dead ends: 23 [2018-06-22 11:57:22,803 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:57:22,803 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:57:22,810 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-06-22 11:57:22,810 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:57:22,810 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. [2018-06-22 11:57:22,810 INFO ]: Start accepts. Automaton has 19 states and 30 transitions. Word has length 13 [2018-06-22 11:57:22,810 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:22,810 INFO ]: Abstraction has 19 states and 30 transitions. [2018-06-22 11:57:22,810 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:57:22,810 INFO ]: Start isEmpty. Operand 19 states and 30 transitions. [2018-06-22 11:57:22,811 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:57:22,811 INFO ]: Found error trace [2018-06-22 11:57:22,811 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:22,811 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:22,812 INFO ]: Analyzing trace with hash -1420228072, now seen corresponding path program 1 times [2018-06-22 11:57:22,812 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:22,812 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:22,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:22,812 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:22,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:22,819 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:22,861 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:57:22,861 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:57:22,861 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:57:22,861 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:57:22,861 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:57:22,861 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:57:22,862 INFO ]: Start difference. First operand 19 states and 30 transitions. Second operand 4 states. [2018-06-22 11:57:22,929 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:22,929 INFO ]: Finished difference Result 23 states and 38 transitions. [2018-06-22 11:57:22,930 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:57:22,930 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:57:22,930 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:22,931 INFO ]: With dead ends: 23 [2018-06-22 11:57:22,931 INFO ]: Without dead ends: 23 [2018-06-22 11:57:22,931 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:57:22,931 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:57:22,937 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-06-22 11:57:22,937 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:57:22,938 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. [2018-06-22 11:57:22,938 INFO ]: Start accepts. Automaton has 19 states and 29 transitions. Word has length 13 [2018-06-22 11:57:22,938 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:22,938 INFO ]: Abstraction has 19 states and 29 transitions. [2018-06-22 11:57:22,938 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:57:22,938 INFO ]: Start isEmpty. Operand 19 states and 29 transitions. [2018-06-22 11:57:22,939 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:57:22,939 INFO ]: Found error trace [2018-06-22 11:57:22,940 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:22,940 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:22,940 INFO ]: Analyzing trace with hash -1886102160, now seen corresponding path program 2 times [2018-06-22 11:57:22,940 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:22,940 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:22,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:22,941 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:22,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:22,957 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:23,041 INFO ]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:57:23,041 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:23,041 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:23,049 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:57:23,067 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:57:23,067 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:23,069 INFO ]: Computing forward predicates... [2018-06-22 11:57:23,280 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:57:23,299 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:23,299 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-06-22 11:57:23,299 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:57:23,300 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:57:23,300 INFO ]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:57:23,300 INFO ]: Start difference. First operand 19 states and 29 transitions. Second operand 12 states. [2018-06-22 11:57:23,603 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:23,603 INFO ]: Finished difference Result 31 states and 54 transitions. [2018-06-22 11:57:23,604 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:57:23,604 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:57:23,604 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:23,605 INFO ]: With dead ends: 31 [2018-06-22 11:57:23,605 INFO ]: Without dead ends: 31 [2018-06-22 11:57:23,606 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:57:23,606 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:57:23,611 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 21. [2018-06-22 11:57:23,611 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:57:23,612 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2018-06-22 11:57:23,612 INFO ]: Start accepts. Automaton has 21 states and 33 transitions. Word has length 17 [2018-06-22 11:57:23,612 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:23,612 INFO ]: Abstraction has 21 states and 33 transitions. [2018-06-22 11:57:23,612 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:57:23,612 INFO ]: Start isEmpty. Operand 21 states and 33 transitions. [2018-06-22 11:57:23,613 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:57:23,613 INFO ]: Found error trace [2018-06-22 11:57:23,614 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:23,614 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:23,614 INFO ]: Analyzing trace with hash -648475701, now seen corresponding path program 1 times [2018-06-22 11:57:23,614 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:23,614 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:23,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:23,615 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:23,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:23,629 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:23,735 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:57:23,735 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:23,735 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:23,749 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:23,776 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:23,778 INFO ]: Computing forward predicates... [2018-06-22 11:57:23,904 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:57:23,927 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:23,927 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 11:57:23,927 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:57:23,927 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:57:23,927 INFO ]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:57:23,928 INFO ]: Start difference. First operand 21 states and 33 transitions. Second operand 12 states. [2018-06-22 11:57:24,506 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:24,507 INFO ]: Finished difference Result 29 states and 51 transitions. [2018-06-22 11:57:24,507 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:57:24,507 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:57:24,507 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:24,508 INFO ]: With dead ends: 29 [2018-06-22 11:57:24,508 INFO ]: Without dead ends: 29 [2018-06-22 11:57:24,508 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:57:24,508 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:57:24,514 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-06-22 11:57:24,514 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:57:24,515 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2018-06-22 11:57:24,515 INFO ]: Start accepts. Automaton has 23 states and 37 transitions. Word has length 17 [2018-06-22 11:57:24,515 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:24,515 INFO ]: Abstraction has 23 states and 37 transitions. [2018-06-22 11:57:24,515 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:57:24,515 INFO ]: Start isEmpty. Operand 23 states and 37 transitions. [2018-06-22 11:57:24,516 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:57:24,516 INFO ]: Found error trace [2018-06-22 11:57:24,516 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:24,516 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:24,517 INFO ]: Analyzing trace with hash -1348970613, now seen corresponding path program 2 times [2018-06-22 11:57:24,517 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:24,517 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:24,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:24,517 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:24,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:24,525 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:24,555 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:57:24,555 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:57:24,555 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:57:24,555 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:57:24,556 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:57:24,556 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:57:24,556 INFO ]: Start difference. First operand 23 states and 37 transitions. Second operand 4 states. [2018-06-22 11:57:24,605 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:24,605 INFO ]: Finished difference Result 38 states and 58 transitions. [2018-06-22 11:57:24,606 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:57:24,606 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:57:24,606 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:24,607 INFO ]: With dead ends: 38 [2018-06-22 11:57:24,607 INFO ]: Without dead ends: 38 [2018-06-22 11:57:24,607 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:57:24,607 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:57:24,613 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-06-22 11:57:24,613 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:57:24,614 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2018-06-22 11:57:24,614 INFO ]: Start accepts. Automaton has 28 states and 45 transitions. Word has length 17 [2018-06-22 11:57:24,614 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:24,614 INFO ]: Abstraction has 28 states and 45 transitions. [2018-06-22 11:57:24,614 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:57:24,614 INFO ]: Start isEmpty. Operand 28 states and 45 transitions. [2018-06-22 11:57:24,615 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:57:24,615 INFO ]: Found error trace [2018-06-22 11:57:24,615 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:24,615 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:24,616 INFO ]: Analyzing trace with hash -111344154, now seen corresponding path program 2 times [2018-06-22 11:57:24,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:24,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:24,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:24,616 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:24,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:24,624 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:24,659 INFO ]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:57:24,659 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:24,659 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:24,665 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:57:24,679 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:57:24,679 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:24,680 INFO ]: Computing forward predicates... [2018-06-22 11:57:24,770 INFO ]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:57:24,789 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:24,789 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2018-06-22 11:57:24,789 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:57:24,789 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:57:24,789 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:57:24,789 INFO ]: Start difference. First operand 28 states and 45 transitions. Second operand 11 states. [2018-06-22 11:57:25,028 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:25,028 INFO ]: Finished difference Result 45 states and 60 transitions. [2018-06-22 11:57:25,029 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:57:25,029 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:57:25,029 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:25,029 INFO ]: With dead ends: 45 [2018-06-22 11:57:25,029 INFO ]: Without dead ends: 24 [2018-06-22 11:57:25,030 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:57:25,030 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:57:25,033 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-06-22 11:57:25,033 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:57:25,034 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-06-22 11:57:25,034 INFO ]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 17 [2018-06-22 11:57:25,034 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:25,034 INFO ]: Abstraction has 22 states and 27 transitions. [2018-06-22 11:57:25,034 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:57:25,034 INFO ]: Start isEmpty. Operand 22 states and 27 transitions. [2018-06-22 11:57:25,035 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:57:25,035 INFO ]: Found error trace [2018-06-22 11:57:25,035 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:25,035 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:25,035 INFO ]: Analyzing trace with hash 829645657, now seen corresponding path program 3 times [2018-06-22 11:57:25,035 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:25,035 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:25,036 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:25,036 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:25,036 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:25,050 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:25,176 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:57:25,176 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:25,176 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:25,181 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:57:25,204 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:57:25,204 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:25,207 INFO ]: Computing forward predicates... [2018-06-22 11:57:25,528 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:57:25,547 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:25,547 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 11:57:25,548 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:57:25,548 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:57:25,548 INFO ]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:57:25,548 INFO ]: Start difference. First operand 22 states and 27 transitions. Second operand 18 states. [2018-06-22 11:57:26,067 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:26,067 INFO ]: Finished difference Result 34 states and 41 transitions. [2018-06-22 11:57:26,068 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:57:26,068 INFO ]: Start accepts. Automaton has 18 states. Word has length 21 [2018-06-22 11:57:26,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:26,068 INFO ]: With dead ends: 34 [2018-06-22 11:57:26,068 INFO ]: Without dead ends: 34 [2018-06-22 11:57:26,069 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:57:26,069 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:57:26,072 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-06-22 11:57:26,072 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 11:57:26,073 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2018-06-22 11:57:26,073 INFO ]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 21 [2018-06-22 11:57:26,073 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:26,073 INFO ]: Abstraction has 20 states and 24 transitions. [2018-06-22 11:57:26,073 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:57:26,073 INFO ]: Start isEmpty. Operand 20 states and 24 transitions. [2018-06-22 11:57:26,073 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:57:26,074 INFO ]: Found error trace [2018-06-22 11:57:26,074 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:26,074 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:26,074 INFO ]: Analyzing trace with hash 482731764, now seen corresponding path program 4 times [2018-06-22 11:57:26,074 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:26,075 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:26,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:26,075 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:26,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:26,084 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:26,144 INFO ]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:57:26,144 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:26,144 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:26,153 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:57:26,180 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:57:26,180 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:26,182 INFO ]: Computing forward predicates... [2018-06-22 11:57:26,426 INFO ]: Checked inductivity of 19 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:57:26,445 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:26,445 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 14 [2018-06-22 11:57:26,445 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:57:26,445 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:57:26,445 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:57:26,445 INFO ]: Start difference. First operand 20 states and 24 transitions. Second operand 14 states. [2018-06-22 11:57:26,605 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:26,605 INFO ]: Finished difference Result 22 states and 26 transitions. [2018-06-22 11:57:26,605 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:57:26,605 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 11:57:26,606 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:26,606 INFO ]: With dead ends: 22 [2018-06-22 11:57:26,606 INFO ]: Without dead ends: 0 [2018-06-22 11:57:26,606 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:57:26,606 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:57:26,606 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:57:26,606 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:57:26,606 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:57:26,606 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-06-22 11:57:26,606 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:26,606 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:57:26,606 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:57:26,606 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:57:26,606 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:57:26,611 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:57:26 BoogieIcfgContainer [2018-06-22 11:57:26,611 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:57:26,612 INFO ]: Toolchain (without parser) took 6701.06 ms. Allocated memory was 306.2 MB in the beginning and 363.9 MB in the end (delta: 57.7 MB). Free memory was 262.7 MB in the beginning and 209.8 MB in the end (delta: 53.0 MB). Peak memory consumption was 110.6 MB. Max. memory is 3.6 GB. [2018-06-22 11:57:26,615 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 306.2 MB. Free memory is still 271.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:57:26,616 INFO ]: ChcToBoogie took 50.41 ms. Allocated memory is still 306.2 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:57:26,616 INFO ]: Boogie Preprocessor took 35.82 ms. Allocated memory is still 306.2 MB. Free memory was 260.7 MB in the beginning and 259.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:57:26,617 INFO ]: RCFGBuilder took 223.45 ms. Allocated memory is still 306.2 MB. Free memory was 259.6 MB in the beginning and 252.6 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:57:26,617 INFO ]: TraceAbstraction took 6383.22 ms. Allocated memory was 306.2 MB in the beginning and 363.9 MB in the end (delta: 57.7 MB). Free memory was 251.6 MB in the beginning and 209.8 MB in the end (delta: 41.9 MB). Peak memory consumption was 99.5 MB. Max. memory is 3.6 GB. [2018-06-22 11:57:26,620 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 306.2 MB. Free memory is still 271.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 50.41 ms. Allocated memory is still 306.2 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 35.82 ms. Allocated memory is still 306.2 MB. Free memory was 260.7 MB in the beginning and 259.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 223.45 ms. Allocated memory is still 306.2 MB. Free memory was 259.6 MB in the beginning and 252.6 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 6383.22 ms. Allocated memory was 306.2 MB in the beginning and 363.9 MB in the end (delta: 57.7 MB). Free memory was 251.6 MB in the beginning and 209.8 MB in the end (delta: 41.9 MB). Peak memory consumption was 99.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : 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 3 procedures, 15 locations, 1 error locations. SAFE Result, 6.3s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 163 SDtfs, 69 SDslu, 533 SDs, 0 SdLazy, 940 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 54 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 277 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 21928 SizeOfPredicates, 52 NumberOfNonLiveVariables, 593 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 76/158 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/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-57-26-631.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-57-26-631.csv Received shutdown request...