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/eldarica-misc/LIA/Consistency/fortune-full.16.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:33:38,285 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:33:38,295 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:33:38,309 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:33:38,309 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:33:38,310 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:33:38,311 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:33:38,313 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:33:38,314 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:33:38,315 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:33:38,316 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:33:38,316 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:33:38,317 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:33:38,318 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:33:38,319 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:33:38,320 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:33:38,321 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:33:38,323 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:33:38,324 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:33:38,325 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:33:38,326 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:33:38,329 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:33:38,329 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:33:38,329 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:33:38,330 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:33:38,331 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:33:38,332 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:33:38,333 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:33:38,334 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:33:38,334 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:33:38,334 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:33:38,335 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:33:38,335 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:33:38,336 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:33:38,337 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:33:38,337 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 10:33:38,350 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:33:38,350 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:33:38,350 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:33:38,351 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:33:38,352 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:33:38,352 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:33:38,352 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:33:38,352 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:33:38,352 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:33:38,353 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:33:38,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:33:38,353 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:33:38,353 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:33:38,354 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:33:38,354 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:33:38,354 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:33:38,354 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:33:38,354 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:33:38,355 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:33:38,356 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:33:38,356 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:33:38,401 INFO ]: Repository-Root is: /tmp [2018-06-22 10:33:38,412 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:33:38,418 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:33:38,419 INFO ]: Initializing SmtParser... [2018-06-22 10:33:38,419 INFO ]: SmtParser initialized [2018-06-22 10:33:38,420 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.16.smt2 [2018-06-22 10:33:38,421 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 10:33:38,514 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.16.smt2 unknown [2018-06-22 10:33:39,277 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.16.smt2 [2018-06-22 10:33:39,282 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:33:39,287 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:33:39,288 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:33:39,288 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:33:39,288 INFO ]: ChcToBoogie initialized [2018-06-22 10:33:39,291 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:33:39" (1/1) ... [2018-06-22 10:33:39,374 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:33:39 Unit [2018-06-22 10:33:39,374 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:33:39,375 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:33:39,375 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:33:39,375 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:33:39,396 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:33:39" (1/1) ... [2018-06-22 10:33:39,396 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:33:39" (1/1) ... [2018-06-22 10:33:39,418 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:33:39" (1/1) ... [2018-06-22 10:33:39,419 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:33:39" (1/1) ... [2018-06-22 10:33:39,458 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:33:39" (1/1) ... [2018-06-22 10:33:39,463 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:33:39" (1/1) ... [2018-06-22 10:33:39,470 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:33:39" (1/1) ... [2018-06-22 10:33:39,488 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:33:39,489 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:33:39,489 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:33:39,489 INFO ]: RCFGBuilder initialized [2018-06-22 10:33:39,490 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:33:39" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:33:39,507 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:33:39,508 INFO ]: Found specification of procedure False [2018-06-22 10:33:39,508 INFO ]: Found implementation of procedure False [2018-06-22 10:33:39,508 INFO ]: Specification and implementation of procedure combined_lturn__bar given in one single declaration [2018-06-22 10:33:39,508 INFO ]: Found specification of procedure combined_lturn__bar [2018-06-22 10:33:39,508 INFO ]: Found implementation of procedure combined_lturn__bar [2018-06-22 10:33:39,508 INFO ]: Specification and implementation of procedure lturn__bar given in one single declaration [2018-06-22 10:33:39,508 INFO ]: Found specification of procedure lturn__bar [2018-06-22 10:33:39,508 INFO ]: Found implementation of procedure lturn__bar [2018-06-22 10:33:39,508 INFO ]: Specification and implementation of procedure step_lturn__bar given in one single declaration [2018-06-22 10:33:39,508 INFO ]: Found specification of procedure step_lturn__bar [2018-06-22 10:33:39,508 INFO ]: Found implementation of procedure step_lturn__bar [2018-06-22 10:33:39,508 INFO ]: Specification and implementation of procedure step_lturn given in one single declaration [2018-06-22 10:33:39,508 INFO ]: Found specification of procedure step_lturn [2018-06-22 10:33:39,508 INFO ]: Found implementation of procedure step_lturn [2018-06-22 10:33:39,508 INFO ]: Specification and implementation of procedure combined_lturn given in one single declaration [2018-06-22 10:33:39,508 INFO ]: Found specification of procedure combined_lturn [2018-06-22 10:33:39,508 INFO ]: Found implementation of procedure combined_lturn [2018-06-22 10:33:39,508 INFO ]: Specification and implementation of procedure lturn given in one single declaration [2018-06-22 10:33:39,508 INFO ]: Found specification of procedure lturn [2018-06-22 10:33:39,508 INFO ]: Found implementation of procedure lturn [2018-06-22 10:33:39,508 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:33:39,508 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:33:39,508 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 10:33:41,141 INFO ]: Using library mode [2018-06-22 10:33:41,141 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:33:41 BoogieIcfgContainer [2018-06-22 10:33:41,141 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:33:41,143 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:33:41,143 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:33:41,146 INFO ]: TraceAbstraction initialized [2018-06-22 10:33:41,146 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:33:39" (1/3) ... [2018-06-22 10:33:41,147 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b90be67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:33:41, skipping insertion in model container [2018-06-22 10:33:41,147 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:33:39" (2/3) ... [2018-06-22 10:33:41,147 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b90be67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:33:41, skipping insertion in model container [2018-06-22 10:33:41,147 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:33:41" (3/3) ... [2018-06-22 10:33:41,149 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:33:41,158 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:33:41,169 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:33:41,221 INFO ]: Using default assertion order modulation [2018-06-22 10:33:41,221 INFO ]: Interprodecural is true [2018-06-22 10:33:41,221 INFO ]: Hoare is false [2018-06-22 10:33:41,221 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:33:41,221 INFO ]: Backedges is TWOTRACK [2018-06-22 10:33:41,222 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:33:41,222 INFO ]: Difference is false [2018-06-22 10:33:41,222 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:33:41,222 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:33:41,247 INFO ]: Start isEmpty. Operand 162 states. [2018-06-22 10:33:41,290 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:33:41,290 INFO ]: Found error trace [2018-06-22 10:33:41,291 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:33:41,291 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:33:41,296 INFO ]: Analyzing trace with hash 1011717463, now seen corresponding path program 1 times [2018-06-22 10:33:41,298 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:33:41,298 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:33:41,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:41,331 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:33:41,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:41,576 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:33:42,233 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:33:42,235 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:33:42,235 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:33:42,237 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:33:42,252 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:33:42,252 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:33:42,255 INFO ]: Start difference. First operand 162 states. Second operand 6 states. [2018-06-22 10:33:44,752 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:33:44,752 INFO ]: Finished difference Result 204 states and 532 transitions. [2018-06-22 10:33:44,753 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:33:44,754 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:33:44,754 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:33:44,778 INFO ]: With dead ends: 204 [2018-06-22 10:33:44,778 INFO ]: Without dead ends: 201 [2018-06-22 10:33:44,780 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:33:44,796 INFO ]: Start minimizeSevpa. Operand 201 states. [2018-06-22 10:33:44,907 INFO ]: Finished minimizeSevpa. Reduced states from 201 to 199. [2018-06-22 10:33:44,909 INFO ]: Start removeUnreachable. Operand 199 states. [2018-06-22 10:33:44,916 INFO ]: Finished removeUnreachable. Reduced from 199 states to 199 states and 526 transitions. [2018-06-22 10:33:44,917 INFO ]: Start accepts. Automaton has 199 states and 526 transitions. Word has length 17 [2018-06-22 10:33:44,918 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:33:44,918 INFO ]: Abstraction has 199 states and 526 transitions. [2018-06-22 10:33:44,918 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:33:44,918 INFO ]: Start isEmpty. Operand 199 states and 526 transitions. [2018-06-22 10:33:44,925 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:33:44,925 INFO ]: Found error trace [2018-06-22 10:33:44,925 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:33:44,925 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:33:44,926 INFO ]: Analyzing trace with hash 18780799, now seen corresponding path program 1 times [2018-06-22 10:33:44,926 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:33:44,926 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:33:44,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:44,927 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:33:44,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:44,973 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:33:45,194 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:33:45,194 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:33:45,194 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:33:45,195 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:33:45,196 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:33:45,196 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:33:45,196 INFO ]: Start difference. First operand 199 states and 526 transitions. Second operand 6 states. [2018-06-22 10:33:47,080 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:33:47,080 INFO ]: Finished difference Result 267 states and 971 transitions. [2018-06-22 10:33:47,080 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:33:47,081 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:33:47,081 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:33:47,090 INFO ]: With dead ends: 267 [2018-06-22 10:33:47,090 INFO ]: Without dead ends: 267 [2018-06-22 10:33:47,091 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:33:47,091 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-22 10:33:47,207 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 265. [2018-06-22 10:33:47,207 INFO ]: Start removeUnreachable. Operand 265 states. [2018-06-22 10:33:47,212 INFO ]: Finished removeUnreachable. Reduced from 265 states to 265 states and 969 transitions. [2018-06-22 10:33:47,212 INFO ]: Start accepts. Automaton has 265 states and 969 transitions. Word has length 17 [2018-06-22 10:33:47,213 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:33:47,213 INFO ]: Abstraction has 265 states and 969 transitions. [2018-06-22 10:33:47,213 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:33:47,213 INFO ]: Start isEmpty. Operand 265 states and 969 transitions. [2018-06-22 10:33:47,219 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:33:47,219 INFO ]: Found error trace [2018-06-22 10:33:47,219 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:33:47,220 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:33:47,220 INFO ]: Analyzing trace with hash -390423661, now seen corresponding path program 1 times [2018-06-22 10:33:47,220 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:33:47,220 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:33:47,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:47,221 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:33:47,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:47,275 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:33:47,475 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:33:47,476 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:33:47,476 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:33:47,476 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:33:47,476 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:33:47,476 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:33:47,476 INFO ]: Start difference. First operand 265 states and 969 transitions. Second operand 6 states. [2018-06-22 10:33:49,110 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:33:49,110 INFO ]: Finished difference Result 323 states and 1414 transitions. [2018-06-22 10:33:49,110 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:33:49,111 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 10:33:49,111 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:33:49,127 INFO ]: With dead ends: 323 [2018-06-22 10:33:49,127 INFO ]: Without dead ends: 323 [2018-06-22 10:33:49,127 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:33:49,128 INFO ]: Start minimizeSevpa. Operand 323 states. [2018-06-22 10:33:49,307 INFO ]: Finished minimizeSevpa. Reduced states from 323 to 319. [2018-06-22 10:33:49,307 INFO ]: Start removeUnreachable. Operand 319 states. [2018-06-22 10:33:49,347 INFO ]: Finished removeUnreachable. Reduced from 319 states to 319 states and 1409 transitions. [2018-06-22 10:33:49,348 INFO ]: Start accepts. Automaton has 319 states and 1409 transitions. Word has length 21 [2018-06-22 10:33:49,348 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:33:49,348 INFO ]: Abstraction has 319 states and 1409 transitions. [2018-06-22 10:33:49,349 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:33:49,349 INFO ]: Start isEmpty. Operand 319 states and 1409 transitions. [2018-06-22 10:33:49,356 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:33:49,356 INFO ]: Found error trace [2018-06-22 10:33:49,356 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:33:49,356 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:33:49,356 INFO ]: Analyzing trace with hash -1908147597, now seen corresponding path program 1 times [2018-06-22 10:33:49,357 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:33:49,357 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:33:49,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:49,358 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:33:49,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:49,411 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:33:49,837 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:33:49,838 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:33:49,838 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:33:49,838 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:33:49,838 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:33:49,838 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:33:49,838 INFO ]: Start difference. First operand 319 states and 1409 transitions. Second operand 6 states. [2018-06-22 10:33:51,816 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:33:51,816 INFO ]: Finished difference Result 467 states and 2904 transitions. [2018-06-22 10:33:51,817 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:33:51,817 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 10:33:51,817 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:33:51,838 INFO ]: With dead ends: 467 [2018-06-22 10:33:51,838 INFO ]: Without dead ends: 467 [2018-06-22 10:33:51,838 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:33:51,839 INFO ]: Start minimizeSevpa. Operand 467 states. [2018-06-22 10:33:52,198 INFO ]: Finished minimizeSevpa. Reduced states from 467 to 458. [2018-06-22 10:33:52,198 INFO ]: Start removeUnreachable. Operand 458 states. [2018-06-22 10:33:52,210 INFO ]: Finished removeUnreachable. Reduced from 458 states to 458 states and 2873 transitions. [2018-06-22 10:33:52,210 INFO ]: Start accepts. Automaton has 458 states and 2873 transitions. Word has length 21 [2018-06-22 10:33:52,211 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:33:52,211 INFO ]: Abstraction has 458 states and 2873 transitions. [2018-06-22 10:33:52,211 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:33:52,211 INFO ]: Start isEmpty. Operand 458 states and 2873 transitions. [2018-06-22 10:33:52,219 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:33:52,219 INFO ]: Found error trace [2018-06-22 10:33:52,219 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:33:52,219 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:33:52,220 INFO ]: Analyzing trace with hash -140972210, now seen corresponding path program 1 times [2018-06-22 10:33:52,220 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:33:52,220 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:33:52,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:52,221 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:33:52,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:52,270 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:33:52,476 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:33:52,476 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:33:52,476 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:33:52,476 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:33:52,476 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:33:52,476 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:33:52,476 INFO ]: Start difference. First operand 458 states and 2873 transitions. Second operand 7 states. [2018-06-22 10:33:53,765 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:33:53,765 INFO ]: Finished difference Result 493 states and 3209 transitions. [2018-06-22 10:33:53,766 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:33:53,767 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 10:33:53,767 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:33:53,787 INFO ]: With dead ends: 493 [2018-06-22 10:33:53,787 INFO ]: Without dead ends: 493 [2018-06-22 10:33:53,788 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:33:53,788 INFO ]: Start minimizeSevpa. Operand 493 states. [2018-06-22 10:33:54,211 INFO ]: Finished minimizeSevpa. Reduced states from 493 to 484. [2018-06-22 10:33:54,211 INFO ]: Start removeUnreachable. Operand 484 states. [2018-06-22 10:33:54,225 INFO ]: Finished removeUnreachable. Reduced from 484 states to 484 states and 3150 transitions. [2018-06-22 10:33:54,225 INFO ]: Start accepts. Automaton has 484 states and 3150 transitions. Word has length 21 [2018-06-22 10:33:54,225 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:33:54,225 INFO ]: Abstraction has 484 states and 3150 transitions. [2018-06-22 10:33:54,225 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:33:54,225 INFO ]: Start isEmpty. Operand 484 states and 3150 transitions. [2018-06-22 10:33:54,236 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:33:54,236 INFO ]: Found error trace [2018-06-22 10:33:54,236 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:33:54,236 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:33:54,237 INFO ]: Analyzing trace with hash -888774678, now seen corresponding path program 1 times [2018-06-22 10:33:54,237 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:33:54,237 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:33:54,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:54,237 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:33:54,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:33:54,288 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:33:54,845 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 10:33:54,845 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:33:54,845 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 10:33:54,863 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:33:54,971 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:33:54,986 INFO ]: Computing forward predicates... [2018-06-22 10:33:56,420 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 10:33:56,459 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:33:56,459 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-06-22 10:33:56,459 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:33:56,459 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:33:56,459 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:33:56,460 INFO ]: Start difference. First operand 484 states and 3150 transitions. Second operand 13 states. [2018-06-22 10:33:57,285 WARN ]: Spent 161.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-06-22 10:34:05,098 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:34:05,098 INFO ]: Finished difference Result 829 states and 8194 transitions. [2018-06-22 10:34:05,099 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:34:05,099 INFO ]: Start accepts. Automaton has 13 states. Word has length 25 [2018-06-22 10:34:05,099 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:34:05,175 INFO ]: With dead ends: 829 [2018-06-22 10:34:05,188 INFO ]: Without dead ends: 828 [2018-06-22 10:34:05,189 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-06-22 10:34:05,190 INFO ]: Start minimizeSevpa. Operand 828 states. [2018-06-22 10:34:06,403 INFO ]: Finished minimizeSevpa. Reduced states from 828 to 737. [2018-06-22 10:34:06,403 INFO ]: Start removeUnreachable. Operand 737 states. [2018-06-22 10:34:06,448 INFO ]: Finished removeUnreachable. Reduced from 737 states to 737 states and 7197 transitions. [2018-06-22 10:34:06,448 INFO ]: Start accepts. Automaton has 737 states and 7197 transitions. Word has length 25 [2018-06-22 10:34:06,449 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:34:06,449 INFO ]: Abstraction has 737 states and 7197 transitions. [2018-06-22 10:34:06,449 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:34:06,449 INFO ]: Start isEmpty. Operand 737 states and 7197 transitions. [2018-06-22 10:34:06,541 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:34:06,541 INFO ]: Found error trace [2018-06-22 10:34:06,542 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:34:06,542 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:34:06,543 INFO ]: Analyzing trace with hash -791246432, now seen corresponding path program 1 times [2018-06-22 10:34:06,543 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:34:06,543 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:34:06,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:34:06,543 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:34:06,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:34:06,586 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:34:07,145 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:34:07,145 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:34:07,145 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:34:07,145 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:34:07,145 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:34:07,145 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:34:07,145 INFO ]: Start difference. First operand 737 states and 7197 transitions. Second operand 7 states. [2018-06-22 10:34:08,705 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:34:08,705 INFO ]: Finished difference Result 830 states and 8548 transitions. [2018-06-22 10:34:08,707 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:34:08,707 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 10:34:08,707 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:34:08,761 INFO ]: With dead ends: 830 [2018-06-22 10:34:08,761 INFO ]: Without dead ends: 830 [2018-06-22 10:34:08,761 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:34:08,763 INFO ]: Start minimizeSevpa. Operand 830 states. [2018-06-22 10:34:09,675 INFO ]: Finished minimizeSevpa. Reduced states from 830 to 790. [2018-06-22 10:34:09,675 INFO ]: Start removeUnreachable. Operand 790 states. [2018-06-22 10:34:09,711 INFO ]: Finished removeUnreachable. Reduced from 790 states to 790 states and 8109 transitions. [2018-06-22 10:34:09,711 INFO ]: Start accepts. Automaton has 790 states and 8109 transitions. Word has length 21 [2018-06-22 10:34:09,712 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:34:09,712 INFO ]: Abstraction has 790 states and 8109 transitions. [2018-06-22 10:34:09,712 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:34:09,718 INFO ]: Start isEmpty. Operand 790 states and 8109 transitions. [2018-06-22 10:34:09,726 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:34:09,726 INFO ]: Found error trace [2018-06-22 10:34:09,727 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:34:09,727 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:34:09,727 INFO ]: Analyzing trace with hash 653536316, now seen corresponding path program 1 times [2018-06-22 10:34:09,727 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:34:09,727 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:34:09,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:34:09,728 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:34:09,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:34:09,766 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:34:09,996 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:34:09,996 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:34:09,996 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:34:09,996 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:34:09,996 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:34:09,996 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:34:09,996 INFO ]: Start difference. First operand 790 states and 8109 transitions. Second operand 7 states. [2018-06-22 10:34:13,131 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:34:13,131 INFO ]: Finished difference Result 1354 states and 18362 transitions. [2018-06-22 10:34:13,131 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:34:13,131 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 10:34:13,131 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:34:13,264 INFO ]: With dead ends: 1354 [2018-06-22 10:34:13,264 INFO ]: Without dead ends: 1354 [2018-06-22 10:34:13,264 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:34:13,265 INFO ]: Start minimizeSevpa. Operand 1354 states. [2018-06-22 10:34:14,803 INFO ]: Finished minimizeSevpa. Reduced states from 1354 to 1303. [2018-06-22 10:34:14,803 INFO ]: Start removeUnreachable. Operand 1303 states. [2018-06-22 10:34:14,990 INFO ]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 17679 transitions. [2018-06-22 10:34:14,990 INFO ]: Start accepts. Automaton has 1303 states and 17679 transitions. Word has length 25 [2018-06-22 10:34:14,991 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:34:14,991 INFO ]: Abstraction has 1303 states and 17679 transitions. [2018-06-22 10:34:14,991 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:34:14,991 INFO ]: Start isEmpty. Operand 1303 states and 17679 transitions. [2018-06-22 10:34:15,001 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:34:15,001 INFO ]: Found error trace [2018-06-22 10:34:15,001 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:34:15,001 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:34:15,001 INFO ]: Analyzing trace with hash 1594036019, now seen corresponding path program 1 times [2018-06-22 10:34:15,001 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:34:15,002 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:34:15,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:34:15,005 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:34:15,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:34:15,046 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:34:15,577 INFO ]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 10:34:15,577 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:34:15,577 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) [2018-06-22 10:34:15,592 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:34:15,689 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:34:15,694 INFO ]: Computing forward predicates... [2018-06-22 10:34:16,009 INFO ]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 10:34:16,029 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:34:16,029 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-06-22 10:34:16,029 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:34:16,029 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:34:16,029 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:34:16,029 INFO ]: Start difference. First operand 1303 states and 17679 transitions. Second operand 14 states. [2018-06-22 10:34:22,096 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:34:22,096 INFO ]: Finished difference Result 1506 states and 20163 transitions. [2018-06-22 10:34:22,097 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 10:34:22,097 INFO ]: Start accepts. Automaton has 14 states. Word has length 29 [2018-06-22 10:34:22,097 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:34:22,202 INFO ]: With dead ends: 1506 [2018-06-22 10:34:22,202 INFO ]: Without dead ends: 1506 [2018-06-22 10:34:22,202 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2018-06-22 10:34:22,203 INFO ]: Start minimizeSevpa. Operand 1506 states. [2018-06-22 10:34:23,960 INFO ]: Finished minimizeSevpa. Reduced states from 1506 to 1337. [2018-06-22 10:34:23,961 INFO ]: Start removeUnreachable. Operand 1337 states. [2018-06-22 10:34:24,213 INFO ]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 17670 transitions. [2018-06-22 10:34:24,213 INFO ]: Start accepts. Automaton has 1337 states and 17670 transitions. Word has length 29 [2018-06-22 10:34:24,213 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:34:24,213 INFO ]: Abstraction has 1337 states and 17670 transitions. [2018-06-22 10:34:24,213 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:34:24,213 INFO ]: Start isEmpty. Operand 1337 states and 17670 transitions. [2018-06-22 10:34:24,228 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:34:24,228 INFO ]: Found error trace [2018-06-22 10:34:24,228 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:34:24,228 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:34:24,231 INFO ]: Analyzing trace with hash -137169628, now seen corresponding path program 1 times [2018-06-22 10:34:24,231 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:34:24,232 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:34:24,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:34:24,232 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:34:24,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:34:24,266 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:34:24,733 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:34:24,733 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:34:24,733 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:34:24,733 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:34:24,733 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:34:24,733 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:34:24,733 INFO ]: Start difference. First operand 1337 states and 17670 transitions. Second operand 7 states. [2018-06-22 10:34:25,694 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:34:25,694 INFO ]: Finished difference Result 1668 states and 30963 transitions. [2018-06-22 10:34:25,695 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:34:25,695 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 10:34:25,695 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:34:25,847 INFO ]: With dead ends: 1668 [2018-06-22 10:34:25,847 INFO ]: Without dead ends: 1668 [2018-06-22 10:34:25,847 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:34:25,849 INFO ]: Start minimizeSevpa. Operand 1668 states. [2018-06-22 10:34:28,965 INFO ]: Finished minimizeSevpa. Reduced states from 1668 to 1550. [2018-06-22 10:34:28,965 INFO ]: Start removeUnreachable. Operand 1550 states. [2018-06-22 10:34:29,109 INFO ]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 26363 transitions. [2018-06-22 10:34:29,150 INFO ]: Start accepts. Automaton has 1550 states and 26363 transitions. Word has length 25 [2018-06-22 10:34:29,150 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:34:29,150 INFO ]: Abstraction has 1550 states and 26363 transitions. [2018-06-22 10:34:29,150 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:34:29,150 INFO ]: Start isEmpty. Operand 1550 states and 26363 transitions. [2018-06-22 10:34:29,161 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:34:29,161 INFO ]: Found error trace [2018-06-22 10:34:29,161 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:34:29,161 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:34:29,162 INFO ]: Analyzing trace with hash -1949326227, now seen corresponding path program 1 times [2018-06-22 10:34:29,162 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:34:29,162 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:34:29,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:34:29,163 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:34:29,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:34:29,205 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:34:29,345 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:34:29,345 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:34:29,346 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:34:29,346 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:34:29,346 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:34:29,346 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:34:29,346 INFO ]: Start difference. First operand 1550 states and 26363 transitions. Second operand 7 states. [2018-06-22 10:34:30,424 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:34:30,424 INFO ]: Finished difference Result 1647 states and 30076 transitions. [2018-06-22 10:34:30,424 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:34:30,424 INFO ]: Start accepts. Automaton has 7 states. Word has length 29 [2018-06-22 10:34:30,425 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:34:30,577 INFO ]: With dead ends: 1647 [2018-06-22 10:34:30,577 INFO ]: Without dead ends: 1647 [2018-06-22 10:34:30,577 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:34:30,578 INFO ]: Start minimizeSevpa. Operand 1647 states. Received shutdown request... [2018-06-22 10:34:33,183 WARN ]: Verification canceled [2018-06-22 10:34:33,188 WARN ]: Timeout [2018-06-22 10:34:33,188 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:34:33 BoogieIcfgContainer [2018-06-22 10:34:33,188 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:34:33,189 INFO ]: Toolchain (without parser) took 53906.83 ms. Allocated memory was 303.0 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 210.6 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 3.6 GB. [2018-06-22 10:34:33,190 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 303.0 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:34:33,190 INFO ]: ChcToBoogie took 86.63 ms. Allocated memory is still 303.0 MB. Free memory was 210.6 MB in the beginning and 205.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:34:33,191 INFO ]: Boogie Preprocessor took 113.46 ms. Allocated memory is still 303.0 MB. Free memory was 205.6 MB in the beginning and 202.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 3.6 GB. [2018-06-22 10:34:33,191 INFO ]: RCFGBuilder took 1652.45 ms. Allocated memory was 303.0 MB in the beginning and 321.9 MB in the end (delta: 18.9 MB). Free memory was 202.5 MB in the beginning and 200.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 25.4 MB. Max. memory is 3.6 GB. [2018-06-22 10:34:33,192 INFO ]: TraceAbstraction took 52045.46 ms. Allocated memory was 321.9 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 198.9 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 3.6 GB. [2018-06-22 10:34:33,197 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 303.0 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 86.63 ms. Allocated memory is still 303.0 MB. Free memory was 210.6 MB in the beginning and 205.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 113.46 ms. Allocated memory is still 303.0 MB. Free memory was 205.6 MB in the beginning and 202.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1652.45 ms. Allocated memory was 303.0 MB in the beginning and 321.9 MB in the end (delta: 18.9 MB). Free memory was 202.5 MB in the beginning and 200.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 25.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 52045.46 ms. Allocated memory was 321.9 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 198.9 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 162 locations, 1 error locations. TIMEOUT Result, 51.9s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 31.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4119 SDtfs, 152 SDslu, 21685 SDs, 0 SdLazy, 22632 SolverSat, 993 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1550occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 13.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 495 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 305 NumberOfCodeBlocks, 305 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 18120 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1627 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 39/57 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full.16.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-34-33-211.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full.16.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-34-33-211.csv Completed graceful shutdown