java -Xss4m -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_Goto.epf -i /storage/chc-comp/hopv/lia/mochi/queen.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:33:07,432 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:33:07,434 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:33:07,446 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:33:07,446 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:33:07,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:33:07,450 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:33:07,452 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:33:07,454 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:33:07,454 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:33:07,456 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:33:07,456 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:33:07,457 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:33:07,458 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:33:07,459 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:33:07,461 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:33:07,463 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:33:07,472 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:33:07,473 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:33:07,474 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:33:07,475 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:33:07,480 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:33:07,482 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:33:07,482 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:33:07,483 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:33:07,483 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:33:07,484 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:33:07,484 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:33:07,488 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:33:07,488 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:33:07,489 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:33:07,489 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:33:07,489 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:33:07,490 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:33:07,490 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:33:07,493 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:33:07,513 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:33:07,513 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:33:07,513 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:33:07,513 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:33:07,516 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:33:07,516 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:33:07,516 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:33:07,516 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:33:07,517 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:33:07,517 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:33:07,517 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:33:07,517 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:33:07,517 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:33:07,518 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:33:07,518 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:33:07,518 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:33:07,518 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:33:07,518 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:33:07,518 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:33:07,519 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:33:07,520 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:33:07,521 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:33:07,521 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:33:07,578 INFO ]: Repository-Root is: /tmp [2018-06-25 09:33:07,592 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:33:07,595 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:33:07,598 INFO ]: Initializing SmtParser... [2018-06-25 09:33:07,598 INFO ]: SmtParser initialized [2018-06-25 09:33:07,601 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/queen.smt2 [2018-06-25 09:33:07,603 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-25 09:33:07,676 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/queen.smt2 unknown [2018-06-25 09:33:08,278 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/queen.smt2 [2018-06-25 09:33:08,283 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:33:08,289 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:33:08,289 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:33:08,289 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:33:08,290 INFO ]: ChcToBoogie initialized [2018-06-25 09:33:08,299 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:33:08" (1/1) ... [2018-06-25 09:33:08,389 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:33:08 Unit [2018-06-25 09:33:08,389 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:33:08,390 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:33:08,390 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:33:08,390 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:33:08,411 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:33:08" (1/1) ... [2018-06-25 09:33:08,411 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:33:08" (1/1) ... [2018-06-25 09:33:08,428 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:33:08" (1/1) ... [2018-06-25 09:33:08,429 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:33:08" (1/1) ... [2018-06-25 09:33:08,450 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:33:08" (1/1) ... [2018-06-25 09:33:08,454 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:33:08" (1/1) ... [2018-06-25 09:33:08,461 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:33:08" (1/1) ... [2018-06-25 09:33:08,465 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:33:08,465 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:33:08,465 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:33:08,465 INFO ]: RCFGBuilder initialized [2018-06-25 09:33:08,466 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:33:08" (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-25 09:33:08,493 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:33:08,493 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:33:08,493 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:33:08,493 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:33:08,493 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:33:08,493 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-25 09:33:09,642 INFO ]: Using library mode [2018-06-25 09:33:09,643 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:33:09 BoogieIcfgContainer [2018-06-25 09:33:09,643 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:33:09,644 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:33:09,644 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:33:09,647 INFO ]: TraceAbstraction initialized [2018-06-25 09:33:09,647 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:33:08" (1/3) ... [2018-06-25 09:33:09,648 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9803de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:33:09, skipping insertion in model container [2018-06-25 09:33:09,648 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:33:08" (2/3) ... [2018-06-25 09:33:09,648 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9803de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:33:09, skipping insertion in model container [2018-06-25 09:33:09,648 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:33:09" (3/3) ... [2018-06-25 09:33:09,650 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:33:09,660 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:33:09,670 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:33:09,724 INFO ]: Using default assertion order modulation [2018-06-25 09:33:09,725 INFO ]: Interprodecural is true [2018-06-25 09:33:09,725 INFO ]: Hoare is false [2018-06-25 09:33:09,725 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:33:09,725 INFO ]: Backedges is TWOTRACK [2018-06-25 09:33:09,725 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:33:09,725 INFO ]: Difference is false [2018-06-25 09:33:09,725 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:33:09,725 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:33:09,749 INFO ]: Start isEmpty. Operand 123 states. [2018-06-25 09:33:09,767 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:33:09,768 INFO ]: Found error trace [2018-06-25 09:33:09,769 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:33:09,769 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:33:09,774 INFO ]: Analyzing trace with hash -816178194, now seen corresponding path program 1 times [2018-06-25 09:33:09,776 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:33:09,776 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:33:09,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:09,812 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:09,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:09,839 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:09,944 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:33:09,945 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:33:09,946 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:33:09,947 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:33:09,960 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:33:09,960 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:33:09,962 INFO ]: Start difference. First operand 123 states. Second operand 4 states. [2018-06-25 09:33:11,961 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:33:11,961 INFO ]: Finished difference Result 225 states and 378 transitions. [2018-06-25 09:33:11,961 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:33:11,962 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:33:11,963 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:33:11,998 INFO ]: With dead ends: 225 [2018-06-25 09:33:11,998 INFO ]: Without dead ends: 225 [2018-06-25 09:33:12,000 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:33:12,018 INFO ]: Start minimizeSevpa. Operand 225 states. [2018-06-25 09:33:12,095 INFO ]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-06-25 09:33:12,096 INFO ]: Start removeUnreachable. Operand 225 states. [2018-06-25 09:33:12,112 INFO ]: Finished removeUnreachable. Reduced from 225 states to 225 states and 378 transitions. [2018-06-25 09:33:12,113 INFO ]: Start accepts. Automaton has 225 states and 378 transitions. Word has length 9 [2018-06-25 09:33:12,113 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:33:12,113 INFO ]: Abstraction has 225 states and 378 transitions. [2018-06-25 09:33:12,113 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:33:12,114 INFO ]: Start isEmpty. Operand 225 states and 378 transitions. [2018-06-25 09:33:12,116 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:33:12,116 INFO ]: Found error trace [2018-06-25 09:33:12,116 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:33:12,117 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:33:12,117 INFO ]: Analyzing trace with hash -691811935, now seen corresponding path program 1 times [2018-06-25 09:33:12,117 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:33:12,117 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:33:12,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:12,118 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:12,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:12,123 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:12,232 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:33:12,233 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:33:12,233 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:33:12,234 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:33:12,234 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:33:12,234 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:33:12,234 INFO ]: Start difference. First operand 225 states and 378 transitions. Second operand 4 states. [2018-06-25 09:33:13,657 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:33:13,657 INFO ]: Finished difference Result 316 states and 532 transitions. [2018-06-25 09:33:13,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:33:13,658 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-25 09:33:13,658 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:33:13,679 INFO ]: With dead ends: 316 [2018-06-25 09:33:13,679 INFO ]: Without dead ends: 316 [2018-06-25 09:33:13,680 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:33:13,680 INFO ]: Start minimizeSevpa. Operand 316 states. [2018-06-25 09:33:13,734 INFO ]: Finished minimizeSevpa. Reduced states from 316 to 316. [2018-06-25 09:33:13,734 INFO ]: Start removeUnreachable. Operand 316 states. [2018-06-25 09:33:13,747 INFO ]: Finished removeUnreachable. Reduced from 316 states to 316 states and 532 transitions. [2018-06-25 09:33:13,747 INFO ]: Start accepts. Automaton has 316 states and 532 transitions. Word has length 11 [2018-06-25 09:33:13,748 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:33:13,748 INFO ]: Abstraction has 316 states and 532 transitions. [2018-06-25 09:33:13,748 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:33:13,748 INFO ]: Start isEmpty. Operand 316 states and 532 transitions. [2018-06-25 09:33:13,753 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:33:13,753 INFO ]: Found error trace [2018-06-25 09:33:13,753 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:33:13,753 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:33:13,754 INFO ]: Analyzing trace with hash 1300053904, now seen corresponding path program 1 times [2018-06-25 09:33:13,754 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:33:13,754 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:33:13,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:13,754 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:13,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:13,761 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:13,785 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:33:13,785 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:33:13,785 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:33:13,785 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:33:13,785 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:33:13,785 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:33:13,786 INFO ]: Start difference. First operand 316 states and 532 transitions. Second operand 4 states. [2018-06-25 09:33:14,375 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:33:14,375 INFO ]: Finished difference Result 403 states and 680 transitions. [2018-06-25 09:33:14,375 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:33:14,375 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-25 09:33:14,375 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:33:14,406 INFO ]: With dead ends: 403 [2018-06-25 09:33:14,406 INFO ]: Without dead ends: 403 [2018-06-25 09:33:14,406 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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-25 09:33:14,407 INFO ]: Start minimizeSevpa. Operand 403 states. [2018-06-25 09:33:14,448 INFO ]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-06-25 09:33:14,448 INFO ]: Start removeUnreachable. Operand 403 states. [2018-06-25 09:33:14,464 INFO ]: Finished removeUnreachable. Reduced from 403 states to 403 states and 680 transitions. [2018-06-25 09:33:14,464 INFO ]: Start accepts. Automaton has 403 states and 680 transitions. Word has length 13 [2018-06-25 09:33:14,464 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:33:14,464 INFO ]: Abstraction has 403 states and 680 transitions. [2018-06-25 09:33:14,464 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:33:14,464 INFO ]: Start isEmpty. Operand 403 states and 680 transitions. [2018-06-25 09:33:14,470 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:33:14,471 INFO ]: Found error trace [2018-06-25 09:33:14,471 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:33:14,471 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:33:14,471 INFO ]: Analyzing trace with hash -1453859684, now seen corresponding path program 1 times [2018-06-25 09:33:14,471 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:33:14,471 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:33:14,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:14,472 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:14,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:14,482 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:14,544 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:33:14,545 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:33:14,545 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:33:14,545 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:33:14,545 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:33:14,545 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:33:14,545 INFO ]: Start difference. First operand 403 states and 680 transitions. Second operand 4 states. [2018-06-25 09:33:15,332 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:33:15,332 INFO ]: Finished difference Result 490 states and 828 transitions. [2018-06-25 09:33:15,332 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:33:15,332 INFO ]: Start accepts. Automaton has 4 states. Word has length 18 [2018-06-25 09:33:15,332 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:33:15,369 INFO ]: With dead ends: 490 [2018-06-25 09:33:15,369 INFO ]: Without dead ends: 490 [2018-06-25 09:33:15,369 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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-25 09:33:15,370 INFO ]: Start minimizeSevpa. Operand 490 states. [2018-06-25 09:33:15,406 INFO ]: Finished minimizeSevpa. Reduced states from 490 to 490. [2018-06-25 09:33:15,406 INFO ]: Start removeUnreachable. Operand 490 states. [2018-06-25 09:33:15,420 INFO ]: Finished removeUnreachable. Reduced from 490 states to 490 states and 828 transitions. [2018-06-25 09:33:15,420 INFO ]: Start accepts. Automaton has 490 states and 828 transitions. Word has length 18 [2018-06-25 09:33:15,421 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:33:15,421 INFO ]: Abstraction has 490 states and 828 transitions. [2018-06-25 09:33:15,421 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:33:15,421 INFO ]: Start isEmpty. Operand 490 states and 828 transitions. [2018-06-25 09:33:15,426 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:33:15,426 INFO ]: Found error trace [2018-06-25 09:33:15,426 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-25 09:33:15,426 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:33:15,426 INFO ]: Analyzing trace with hash -928992891, now seen corresponding path program 1 times [2018-06-25 09:33:15,426 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:33:15,426 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:33:15,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:15,427 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:15,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:15,431 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:15,497 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:33:15,497 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:33:15,497 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:33:15,498 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:33:15,498 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:33:15,498 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:33:15,498 INFO ]: Start difference. First operand 490 states and 828 transitions. Second operand 4 states. [2018-06-25 09:33:15,965 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:33:15,966 INFO ]: Finished difference Result 577 states and 976 transitions. [2018-06-25 09:33:15,966 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:33:15,966 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-25 09:33:15,966 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:33:15,998 INFO ]: With dead ends: 577 [2018-06-25 09:33:15,998 INFO ]: Without dead ends: 577 [2018-06-25 09:33:15,999 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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-25 09:33:15,999 INFO ]: Start minimizeSevpa. Operand 577 states. [2018-06-25 09:33:16,047 INFO ]: Finished minimizeSevpa. Reduced states from 577 to 577. [2018-06-25 09:33:16,048 INFO ]: Start removeUnreachable. Operand 577 states. [2018-06-25 09:33:16,066 INFO ]: Finished removeUnreachable. Reduced from 577 states to 577 states and 976 transitions. [2018-06-25 09:33:16,066 INFO ]: Start accepts. Automaton has 577 states and 976 transitions. Word has length 21 [2018-06-25 09:33:16,066 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:33:16,066 INFO ]: Abstraction has 577 states and 976 transitions. [2018-06-25 09:33:16,066 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:33:16,066 INFO ]: Start isEmpty. Operand 577 states and 976 transitions. [2018-06-25 09:33:16,073 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 09:33:16,073 INFO ]: Found error trace [2018-06-25 09:33:16,073 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:33:16,073 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:33:16,073 INFO ]: Analyzing trace with hash 1286299910, now seen corresponding path program 1 times [2018-06-25 09:33:16,073 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:33:16,073 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:33:16,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:16,074 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:16,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:16,080 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:16,222 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:33:16,222 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:33:16,222 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:33:16,222 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:33:16,222 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:33:16,222 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:33:16,223 INFO ]: Start difference. First operand 577 states and 976 transitions. Second operand 4 states. [2018-06-25 09:33:18,804 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:33:18,804 INFO ]: Finished difference Result 664 states and 1124 transitions. [2018-06-25 09:33:18,804 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:33:18,804 INFO ]: Start accepts. Automaton has 4 states. Word has length 22 [2018-06-25 09:33:18,804 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:33:18,845 INFO ]: With dead ends: 664 [2018-06-25 09:33:18,846 INFO ]: Without dead ends: 664 [2018-06-25 09:33:18,846 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:33:18,846 INFO ]: Start minimizeSevpa. Operand 664 states. [2018-06-25 09:33:18,898 INFO ]: Finished minimizeSevpa. Reduced states from 664 to 664. [2018-06-25 09:33:18,898 INFO ]: Start removeUnreachable. Operand 664 states. [2018-06-25 09:33:18,918 INFO ]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1124 transitions. [2018-06-25 09:33:18,918 INFO ]: Start accepts. Automaton has 664 states and 1124 transitions. Word has length 22 [2018-06-25 09:33:18,918 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:33:18,918 INFO ]: Abstraction has 664 states and 1124 transitions. [2018-06-25 09:33:18,918 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:33:18,918 INFO ]: Start isEmpty. Operand 664 states and 1124 transitions. [2018-06-25 09:33:19,005 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-25 09:33:19,006 INFO ]: Found error trace [2018-06-25 09:33:19,006 INFO ]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:33:19,006 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:33:19,007 INFO ]: Analyzing trace with hash 944902781, now seen corresponding path program 1 times [2018-06-25 09:33:19,007 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:33:19,007 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:33:19,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:19,008 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:19,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:19,031 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:19,182 INFO ]: Checked inductivity of 50 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-25 09:33:19,182 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:33:19,182 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-25 09:33:19,193 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:19,246 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:19,257 INFO ]: Computing forward predicates... [2018-06-25 09:33:19,305 INFO ]: Checked inductivity of 50 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-25 09:33:19,336 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:33:19,336 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:33:19,336 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:33:19,337 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:33:19,337 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:33:19,337 INFO ]: Start difference. First operand 664 states and 1124 transitions. Second operand 4 states. [2018-06-25 09:33:22,360 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:33:22,360 INFO ]: Finished difference Result 751 states and 1272 transitions. [2018-06-25 09:33:22,361 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:33:22,361 INFO ]: Start accepts. Automaton has 4 states. Word has length 65 [2018-06-25 09:33:22,361 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:33:22,434 INFO ]: With dead ends: 751 [2018-06-25 09:33:22,434 INFO ]: Without dead ends: 751 [2018-06-25 09:33:22,434 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:33:22,435 INFO ]: Start minimizeSevpa. Operand 751 states. [2018-06-25 09:33:22,519 INFO ]: Finished minimizeSevpa. Reduced states from 751 to 751. [2018-06-25 09:33:22,520 INFO ]: Start removeUnreachable. Operand 751 states. [2018-06-25 09:33:22,546 INFO ]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1272 transitions. [2018-06-25 09:33:22,546 INFO ]: Start accepts. Automaton has 751 states and 1272 transitions. Word has length 65 [2018-06-25 09:33:22,550 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:33:22,550 INFO ]: Abstraction has 751 states and 1272 transitions. [2018-06-25 09:33:22,550 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:33:22,550 INFO ]: Start isEmpty. Operand 751 states and 1272 transitions. [2018-06-25 09:33:22,650 INFO ]: Finished isEmpty. Found accepting run of length 76 [2018-06-25 09:33:22,650 INFO ]: Found error trace [2018-06-25 09:33:22,650 INFO ]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:33:22,651 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:33:22,651 INFO ]: Analyzing trace with hash 1841117446, now seen corresponding path program 1 times [2018-06-25 09:33:22,651 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:33:22,651 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:33:22,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:22,652 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:22,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:22,674 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:22,831 INFO ]: Checked inductivity of 72 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-25 09:33:22,831 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:33:22,831 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-25 09:33:22,849 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-25 09:33:22,906 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:22,910 INFO ]: Computing forward predicates... [2018-06-25 09:33:22,926 INFO ]: Checked inductivity of 72 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-25 09:33:22,961 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:33:22,961 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-25 09:33:22,962 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:33:22,962 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:33:22,962 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:33:22,962 INFO ]: Start difference. First operand 751 states and 1272 transitions. Second operand 4 states. [2018-06-25 09:33:23,552 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:33:23,552 INFO ]: Finished difference Result 846 states and 1432 transitions. [2018-06-25 09:33:23,552 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:33:23,552 INFO ]: Start accepts. Automaton has 4 states. Word has length 75 [2018-06-25 09:33:23,552 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:33:23,589 INFO ]: With dead ends: 846 [2018-06-25 09:33:23,589 INFO ]: Without dead ends: 846 [2018-06-25 09:33:23,589 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:33:23,590 INFO ]: Start minimizeSevpa. Operand 846 states. [2018-06-25 09:33:23,641 INFO ]: Finished minimizeSevpa. Reduced states from 846 to 846. [2018-06-25 09:33:23,641 INFO ]: Start removeUnreachable. Operand 846 states. [2018-06-25 09:33:23,669 INFO ]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1432 transitions. [2018-06-25 09:33:23,669 INFO ]: Start accepts. Automaton has 846 states and 1432 transitions. Word has length 75 [2018-06-25 09:33:23,669 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:33:23,669 INFO ]: Abstraction has 846 states and 1432 transitions. [2018-06-25 09:33:23,669 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:33:23,669 INFO ]: Start isEmpty. Operand 846 states and 1432 transitions. [2018-06-25 09:33:23,736 INFO ]: Finished isEmpty. Found accepting run of length 188 [2018-06-25 09:33:23,736 INFO ]: Found error trace [2018-06-25 09:33:23,736 INFO ]: trace histogram [13, 13, 12, 9, 9, 9, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:33:23,736 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:33:23,736 INFO ]: Analyzing trace with hash 1313451968, now seen corresponding path program 1 times [2018-06-25 09:33:23,736 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:33:23,736 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:33:23,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:23,737 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:23,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:23,770 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:23,934 INFO ]: Checked inductivity of 597 backedges. 56 proven. 94 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2018-06-25 09:33:23,934 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:33:23,934 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-25 09:33:23,942 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:24,033 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:24,049 INFO ]: Computing forward predicates... [2018-06-25 09:33:24,089 INFO ]: Checked inductivity of 597 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2018-06-25 09:33:24,115 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:33:24,115 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-25 09:33:24,116 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:33:24,116 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:33:24,116 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:33:24,116 INFO ]: Start difference. First operand 846 states and 1432 transitions. Second operand 4 states. [2018-06-25 09:33:25,085 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:33:25,085 INFO ]: Finished difference Result 1228 states and 2067 transitions. [2018-06-25 09:33:25,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:33:25,085 INFO ]: Start accepts. Automaton has 4 states. Word has length 187 [2018-06-25 09:33:25,085 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:33:25,150 INFO ]: With dead ends: 1228 [2018-06-25 09:33:25,150 INFO ]: Without dead ends: 933 [2018-06-25 09:33:25,151 INFO ]: 0 DeclaredPredicates, 192 GetRequests, 189 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-25 09:33:25,151 INFO ]: Start minimizeSevpa. Operand 933 states. [2018-06-25 09:33:25,218 INFO ]: Finished minimizeSevpa. Reduced states from 933 to 933. [2018-06-25 09:33:25,218 INFO ]: Start removeUnreachable. Operand 933 states. [2018-06-25 09:33:25,244 INFO ]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1517 transitions. [2018-06-25 09:33:25,244 INFO ]: Start accepts. Automaton has 933 states and 1517 transitions. Word has length 187 [2018-06-25 09:33:25,244 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:33:25,244 INFO ]: Abstraction has 933 states and 1517 transitions. [2018-06-25 09:33:25,244 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:33:25,244 INFO ]: Start isEmpty. Operand 933 states and 1517 transitions. [2018-06-25 09:33:25,281 INFO ]: Finished isEmpty. Found accepting run of length 222 [2018-06-25 09:33:25,281 INFO ]: Found error trace [2018-06-25 09:33:25,281 INFO ]: trace histogram [15, 15, 14, 11, 11, 11, 10, 10, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:33:25,282 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:33:25,282 INFO ]: Analyzing trace with hash 1179692872, now seen corresponding path program 1 times [2018-06-25 09:33:25,282 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:33:25,282 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:33:25,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:25,282 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:25,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:25,295 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:25,395 INFO ]: Checked inductivity of 874 backedges. 72 proven. 121 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2018-06-25 09:33:25,395 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:33:25,395 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-25 09:33:25,401 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:25,501 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:25,510 INFO ]: Computing forward predicates... [2018-06-25 09:33:25,552 INFO ]: Checked inductivity of 874 backedges. 360 proven. 12 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2018-06-25 09:33:25,585 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:33:25,585 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:33:25,586 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:33:25,586 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:33:25,586 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:33:25,586 INFO ]: Start difference. First operand 933 states and 1517 transitions. Second operand 4 states. [2018-06-25 09:33:26,016 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:33:26,016 INFO ]: Finished difference Result 1086 states and 1774 transitions. [2018-06-25 09:33:26,017 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:33:26,017 INFO ]: Start accepts. Automaton has 4 states. Word has length 221 [2018-06-25 09:33:26,017 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:33:26,062 INFO ]: With dead ends: 1086 [2018-06-25 09:33:26,062 INFO ]: Without dead ends: 1020 [2018-06-25 09:33:26,062 INFO ]: 0 DeclaredPredicates, 226 GetRequests, 223 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-25 09:33:26,063 INFO ]: Start minimizeSevpa. Operand 1020 states. [2018-06-25 09:33:26,130 INFO ]: Finished minimizeSevpa. Reduced states from 1020 to 1020. [2018-06-25 09:33:26,130 INFO ]: Start removeUnreachable. Operand 1020 states. [2018-06-25 09:33:26,157 INFO ]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1658 transitions. [2018-06-25 09:33:26,157 INFO ]: Start accepts. Automaton has 1020 states and 1658 transitions. Word has length 221 [2018-06-25 09:33:26,157 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:33:26,157 INFO ]: Abstraction has 1020 states and 1658 transitions. [2018-06-25 09:33:26,157 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:33:26,157 INFO ]: Start isEmpty. Operand 1020 states and 1658 transitions. [2018-06-25 09:33:26,222 INFO ]: Finished isEmpty. Found accepting run of length 245 [2018-06-25 09:33:26,223 INFO ]: Found error trace [2018-06-25 09:33:26,223 INFO ]: trace histogram [17, 17, 16, 12, 12, 12, 11, 11, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:33:26,223 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:33:26,223 INFO ]: Analyzing trace with hash -742630053, now seen corresponding path program 1 times [2018-06-25 09:33:26,223 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:33:26,223 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:33:26,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:26,224 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:26,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:26,257 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:26,366 INFO ]: Checked inductivity of 1096 backedges. 85 proven. 128 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2018-06-25 09:33:26,366 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:33:26,366 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-25 09:33:26,372 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:26,482 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:26,491 INFO ]: Computing forward predicates... [2018-06-25 09:33:26,593 INFO ]: Checked inductivity of 1096 backedges. 432 proven. 0 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2018-06-25 09:33:26,625 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:33:26,625 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-25 09:33:26,626 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:33:26,626 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:33:26,626 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:33:26,626 INFO ]: Start difference. First operand 1020 states and 1658 transitions. Second operand 4 states. [2018-06-25 09:33:27,417 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:33:27,417 INFO ]: Finished difference Result 1255 states and 2047 transitions. [2018-06-25 09:33:27,418 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:33:27,418 INFO ]: Start accepts. Automaton has 4 states. Word has length 244 [2018-06-25 09:33:27,418 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:33:27,466 INFO ]: With dead ends: 1255 [2018-06-25 09:33:27,466 INFO ]: Without dead ends: 1099 [2018-06-25 09:33:27,467 INFO ]: 0 DeclaredPredicates, 249 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:33:27,470 INFO ]: Start minimizeSevpa. Operand 1099 states. [2018-06-25 09:33:27,525 INFO ]: Finished minimizeSevpa. Reduced states from 1099 to 1099. [2018-06-25 09:33:27,525 INFO ]: Start removeUnreachable. Operand 1099 states. [2018-06-25 09:33:27,551 INFO ]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1747 transitions. [2018-06-25 09:33:27,551 INFO ]: Start accepts. Automaton has 1099 states and 1747 transitions. Word has length 244 [2018-06-25 09:33:27,551 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:33:27,551 INFO ]: Abstraction has 1099 states and 1747 transitions. [2018-06-25 09:33:27,551 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:33:27,551 INFO ]: Start isEmpty. Operand 1099 states and 1747 transitions. [2018-06-25 09:33:27,608 INFO ]: Finished isEmpty. Found accepting run of length 289 [2018-06-25 09:33:27,608 INFO ]: Found error trace [2018-06-25 09:33:27,608 INFO ]: trace histogram [21, 21, 20, 16, 16, 16, 11, 9, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:33:27,608 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:33:27,608 INFO ]: Analyzing trace with hash 1420877575, now seen corresponding path program 1 times [2018-06-25 09:33:27,608 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:33:27,608 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:33:27,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:27,609 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:27,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:27,630 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:27,860 INFO ]: Checked inductivity of 1646 backedges. 141 proven. 160 refuted. 0 times theorem prover too weak. 1345 trivial. 0 not checked. [2018-06-25 09:33:27,860 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:33:27,860 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-25 09:33:27,876 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:28,058 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:28,068 INFO ]: Computing forward predicates... [2018-06-25 09:33:28,135 INFO ]: Checked inductivity of 1646 backedges. 755 proven. 0 refuted. 0 times theorem prover too weak. 891 trivial. 0 not checked. [2018-06-25 09:33:28,165 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:33:28,165 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-25 09:33:28,166 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:33:28,166 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:33:28,166 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:33:28,166 INFO ]: Start difference. First operand 1099 states and 1747 transitions. Second operand 4 states. [2018-06-25 09:33:29,303 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:33:29,303 INFO ]: Finished difference Result 1245 states and 1983 transitions. [2018-06-25 09:33:29,304 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:33:29,304 INFO ]: Start accepts. Automaton has 4 states. Word has length 288 [2018-06-25 09:33:29,304 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:33:29,333 INFO ]: With dead ends: 1245 [2018-06-25 09:33:29,333 INFO ]: Without dead ends: 1186 [2018-06-25 09:33:29,333 INFO ]: 0 DeclaredPredicates, 293 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:33:29,334 INFO ]: Start minimizeSevpa. Operand 1186 states. [2018-06-25 09:33:29,393 INFO ]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2018-06-25 09:33:29,393 INFO ]: Start removeUnreachable. Operand 1186 states. [2018-06-25 09:33:29,421 INFO ]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1875 transitions. [2018-06-25 09:33:29,421 INFO ]: Start accepts. Automaton has 1186 states and 1875 transitions. Word has length 288 [2018-06-25 09:33:29,421 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:33:29,421 INFO ]: Abstraction has 1186 states and 1875 transitions. [2018-06-25 09:33:29,421 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:33:29,422 INFO ]: Start isEmpty. Operand 1186 states and 1875 transitions. [2018-06-25 09:33:29,487 INFO ]: Finished isEmpty. Found accepting run of length 415 [2018-06-25 09:33:29,487 INFO ]: Found error trace [2018-06-25 09:33:29,488 INFO ]: trace histogram [33, 33, 32, 25, 25, 25, 18, 14, 11, 11, 11, 11, 11, 11, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:33:29,488 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:33:29,488 INFO ]: Analyzing trace with hash 1260335483, now seen corresponding path program 1 times [2018-06-25 09:33:29,488 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:33:29,488 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:33:29,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:29,489 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:29,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:29,516 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:29,845 INFO ]: Checked inductivity of 4091 backedges. 227 proven. 297 refuted. 0 times theorem prover too weak. 3567 trivial. 0 not checked. [2018-06-25 09:33:29,845 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:33:29,845 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-25 09:33:29,851 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:30,024 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:30,040 INFO ]: Computing forward predicates... [2018-06-25 09:33:30,120 INFO ]: Checked inductivity of 4091 backedges. 1836 proven. 18 refuted. 0 times theorem prover too weak. 2237 trivial. 0 not checked. [2018-06-25 09:33:30,140 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:33:30,140 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:33:30,140 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:33:30,141 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:33:30,141 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:33:30,141 INFO ]: Start difference. First operand 1186 states and 1875 transitions. Second operand 4 states. [2018-06-25 09:33:30,526 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:33:30,526 INFO ]: Finished difference Result 1328 states and 2105 transitions. [2018-06-25 09:33:30,526 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:33:30,526 INFO ]: Start accepts. Automaton has 4 states. Word has length 414 [2018-06-25 09:33:30,526 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:33:30,560 INFO ]: With dead ends: 1328 [2018-06-25 09:33:30,560 INFO ]: Without dead ends: 1273 [2018-06-25 09:33:30,560 INFO ]: 0 DeclaredPredicates, 419 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:33:30,560 INFO ]: Start minimizeSevpa. Operand 1273 states. [2018-06-25 09:33:30,616 INFO ]: Finished minimizeSevpa. Reduced states from 1273 to 1273. [2018-06-25 09:33:30,616 INFO ]: Start removeUnreachable. Operand 1273 states. [2018-06-25 09:33:30,679 INFO ]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 2009 transitions. [2018-06-25 09:33:30,679 INFO ]: Start accepts. Automaton has 1273 states and 2009 transitions. Word has length 414 [2018-06-25 09:33:30,679 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:33:30,679 INFO ]: Abstraction has 1273 states and 2009 transitions. [2018-06-25 09:33:30,679 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:33:30,679 INFO ]: Start isEmpty. Operand 1273 states and 2009 transitions. [2018-06-25 09:33:30,726 INFO ]: Finished isEmpty. Found accepting run of length 463 [2018-06-25 09:33:30,726 INFO ]: Found error trace [2018-06-25 09:33:30,726 INFO ]: trace histogram [36, 36, 35, 28, 28, 28, 18, 17, 11, 11, 11, 11, 11, 11, 10, 7, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:33:30,726 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:33:30,726 INFO ]: Analyzing trace with hash 1501180265, now seen corresponding path program 1 times [2018-06-25 09:33:30,726 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:33:30,726 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:33:30,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:30,727 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:30,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:30,749 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:30,991 INFO ]: Checked inductivity of 4943 backedges. 251 proven. 343 refuted. 0 times theorem prover too weak. 4349 trivial. 0 not checked. [2018-06-25 09:33:30,991 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:33:30,991 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:33:30,998 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:31,209 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:31,220 INFO ]: Computing forward predicates... [2018-06-25 09:33:31,369 INFO ]: Checked inductivity of 4943 backedges. 2222 proven. 25 refuted. 0 times theorem prover too weak. 2696 trivial. 0 not checked. [2018-06-25 09:33:31,389 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:33:31,389 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:33:31,391 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:33:31,391 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:33:31,391 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:33:31,391 INFO ]: Start difference. First operand 1273 states and 2009 transitions. Second operand 4 states. [2018-06-25 09:33:31,823 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:33:31,823 INFO ]: Finished difference Result 1415 states and 2239 transitions. [2018-06-25 09:33:31,823 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:33:31,824 INFO ]: Start accepts. Automaton has 4 states. Word has length 462 [2018-06-25 09:33:31,824 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:33:31,883 INFO ]: With dead ends: 1415 [2018-06-25 09:33:31,883 INFO ]: Without dead ends: 1360 [2018-06-25 09:33:31,883 INFO ]: 0 DeclaredPredicates, 467 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:33:31,884 INFO ]: Start minimizeSevpa. Operand 1360 states. [2018-06-25 09:33:31,946 INFO ]: Finished minimizeSevpa. Reduced states from 1360 to 1360. [2018-06-25 09:33:31,946 INFO ]: Start removeUnreachable. Operand 1360 states. [2018-06-25 09:33:31,978 INFO ]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 2143 transitions. [2018-06-25 09:33:31,978 INFO ]: Start accepts. Automaton has 1360 states and 2143 transitions. Word has length 462 [2018-06-25 09:33:31,978 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:33:31,978 INFO ]: Abstraction has 1360 states and 2143 transitions. [2018-06-25 09:33:31,978 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:33:31,978 INFO ]: Start isEmpty. Operand 1360 states and 2143 transitions. [2018-06-25 09:33:32,053 INFO ]: Finished isEmpty. Found accepting run of length 565 [2018-06-25 09:33:32,053 INFO ]: Found error trace [2018-06-25 09:33:32,054 INFO ]: trace histogram [45, 45, 44, 34, 34, 34, 24, 20, 14, 14, 14, 14, 14, 14, 10, 10, 10, 10, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:33:32,054 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:33:32,054 INFO ]: Analyzing trace with hash -1808589916, now seen corresponding path program 1 times [2018-06-25 09:33:32,054 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:33:32,054 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:33:32,055 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:32,055 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:32,055 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:33:32,137 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:32,698 INFO ]: Checked inductivity of 7652 backedges. 188 proven. 30 refuted. 0 times theorem prover too weak. 7434 trivial. 0 not checked. [2018-06-25 09:33:32,698 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:33:32,698 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:33:32,705 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:33:32,941 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:33:32,959 INFO ]: Computing forward predicates... [2018-06-25 09:33:33,792 INFO ]: Checked inductivity of 7652 backedges. 3354 proven. 182 refuted. 0 times theorem prover too weak. 4116 trivial. 0 not checked. [2018-06-25 09:33:33,812 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:33:33,812 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 21] total 26 [2018-06-25 09:33:33,813 INFO ]: Interpolant automaton has 26 states [2018-06-25 09:33:33,813 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-25 09:33:33,813 INFO ]: CoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2018-06-25 09:33:33,813 INFO ]: Start difference. First operand 1360 states and 2143 transitions. Second operand 26 states. Received shutdown request... [2018-06-25 09:34:04,629 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-06-25 09:34:04,629 WARN ]: Verification canceled [2018-06-25 09:34:04,635 WARN ]: Timeout [2018-06-25 09:34:04,635 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:34:04 BoogieIcfgContainer [2018-06-25 09:34:04,635 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:34:04,636 INFO ]: Toolchain (without parser) took 56352.75 ms. Allocated memory was 308.8 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 235.4 MB in the beginning and 863.0 MB in the end (delta: -627.6 MB). Peak memory consumption was 448.8 MB. Max. memory is 3.6 GB. [2018-06-25 09:34:04,637 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:34:04,638 INFO ]: ChcToBoogie took 99.94 ms. Allocated memory is still 308.8 MB. Free memory was 234.4 MB in the beginning and 231.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:34:04,638 INFO ]: Boogie Preprocessor took 75.32 ms. Allocated memory is still 308.8 MB. Free memory was 231.4 MB in the beginning and 229.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:34:04,638 INFO ]: RCFGBuilder took 1177.73 ms. Allocated memory was 308.8 MB in the beginning and 324.5 MB in the end (delta: 15.7 MB). Free memory was 229.4 MB in the beginning and 292.4 MB in the end (delta: -63.0 MB). Peak memory consumption was 47.4 MB. Max. memory is 3.6 GB. [2018-06-25 09:34:04,639 INFO ]: TraceAbstraction took 54991.18 ms. Allocated memory was 324.5 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 292.4 MB in the beginning and 863.0 MB in the end (delta: -570.6 MB). Peak memory consumption was 490.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:34:04,641 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 99.94 ms. Allocated memory is still 308.8 MB. Free memory was 234.4 MB in the beginning and 231.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 75.32 ms. Allocated memory is still 308.8 MB. Free memory was 231.4 MB in the beginning and 229.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1177.73 ms. Allocated memory was 308.8 MB in the beginning and 324.5 MB in the end (delta: 15.7 MB). Free memory was 229.4 MB in the beginning and 292.4 MB in the end (delta: -63.0 MB). Peak memory consumption was 47.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54991.18 ms. Allocated memory was 324.5 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 292.4 MB in the beginning and 863.0 MB in the end (delta: -570.6 MB). Peak memory consumption was 490.0 MB. 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 BasicCegarLoop was constructing difference of abstraction (1360states) and interpolant automaton (currently 78 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (4077 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. TIMEOUT Result, 54.9s OverallTime, 15 OverallIterations, 45 TraceHistogramMax, 47.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4055 SDtfs, 5069 SDslu, 19223 SDs, 0 SdLazy, 39303 SolverSat, 6939 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2696 GetRequests, 2561 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2383 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1360occurred in iteration=14, 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: 1.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 5134 NumberOfCodeBlocks, 5134 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 5110 ConstructedInterpolants, 0 QuantifiedInterpolants, 2164576 SizeOfPredicates, 29 NumberOfNonLiveVariables, 9024 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 24 InterpolantComputations, 10 PerfectInterpolantSequences, 40576/42042 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/queen.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-34-04-649.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/queen.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-34-04-649.csv Completed graceful shutdown