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/reve/009b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:12:22,458 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:12:22,460 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:12:22,471 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:12:22,472 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:12:22,472 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:12:22,474 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:12:22,475 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:12:22,477 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:12:22,477 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:12:22,478 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:12:22,478 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:12:22,482 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:12:22,483 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:12:22,484 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:12:22,485 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:12:22,488 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:12:22,500 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:12:22,502 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:12:22,503 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:12:22,504 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:12:22,506 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:12:22,506 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:12:22,506 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:12:22,507 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:12:22,512 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:12:22,513 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:12:22,513 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:12:22,514 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:12:22,514 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:12:22,515 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:12:22,515 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:12:22,519 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:12:22,520 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:12:22,521 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:12:22,521 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:12:22,544 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:12:22,544 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:12:22,545 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:12:22,545 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:12:22,546 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:12:22,546 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:12:22,546 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:12:22,546 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:12:22,546 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:12:22,547 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:12:22,548 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:12:22,548 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:12:22,548 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:12:22,548 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:12:22,548 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:12:22,549 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:12:22,549 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:12:22,549 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:12:22,549 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:12:22,550 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:12:22,551 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:12:22,597 INFO ]: Repository-Root is: /tmp [2018-06-22 11:12:22,612 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:12:22,615 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:12:22,616 INFO ]: Initializing SmtParser... [2018-06-22 11:12:22,616 INFO ]: SmtParser initialized [2018-06-22 11:12:22,618 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/009b-horn.smt2 [2018-06-22 11:12:22,619 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:12:22,712 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/009b-horn.smt2 unknown [2018-06-22 11:12:23,237 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/009b-horn.smt2 [2018-06-22 11:12:23,245 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:12:23,250 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:12:23,251 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:12:23,251 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:12:23,251 INFO ]: ChcToBoogie initialized [2018-06-22 11:12:23,254 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:12:23" (1/1) ... [2018-06-22 11:12:23,319 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:12:23 Unit [2018-06-22 11:12:23,320 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:12:23,324 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:12:23,324 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:12:23,324 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:12:23,345 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:12:23" (1/1) ... [2018-06-22 11:12:23,345 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:12:23" (1/1) ... [2018-06-22 11:12:23,364 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:12:23" (1/1) ... [2018-06-22 11:12:23,364 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:12:23" (1/1) ... [2018-06-22 11:12:23,381 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:12:23" (1/1) ... [2018-06-22 11:12:23,384 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:12:23" (1/1) ... [2018-06-22 11:12:23,387 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:12:23" (1/1) ... [2018-06-22 11:12:23,391 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:12:23,391 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:12:23,391 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:12:23,391 INFO ]: RCFGBuilder initialized [2018-06-22 11:12:23,392 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:12:23" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:12:23,406 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:12:23,406 INFO ]: Found specification of procedure False [2018-06-22 11:12:23,406 INFO ]: Found implementation of procedure False [2018-06-22 11:12:23,406 INFO ]: Specification and implementation of procedure INV1 given in one single declaration [2018-06-22 11:12:23,406 INFO ]: Found specification of procedure INV1 [2018-06-22 11:12:23,407 INFO ]: Found implementation of procedure INV1 [2018-06-22 11:12:23,407 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:12:23,407 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:12:23,407 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:12:24,775 INFO ]: Using library mode [2018-06-22 11:12:24,775 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:12:24 BoogieIcfgContainer [2018-06-22 11:12:24,775 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:12:24,777 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:12:24,777 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:12:24,781 INFO ]: TraceAbstraction initialized [2018-06-22 11:12:24,781 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:12:23" (1/3) ... [2018-06-22 11:12:24,782 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c4c91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:12:24, skipping insertion in model container [2018-06-22 11:12:24,782 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:12:23" (2/3) ... [2018-06-22 11:12:24,782 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c4c91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:12:24, skipping insertion in model container [2018-06-22 11:12:24,782 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:12:24" (3/3) ... [2018-06-22 11:12:24,785 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:12:24,794 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:12:24,804 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:12:24,851 INFO ]: Using default assertion order modulation [2018-06-22 11:12:24,852 INFO ]: Interprodecural is true [2018-06-22 11:12:24,852 INFO ]: Hoare is false [2018-06-22 11:12:24,852 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:12:24,852 INFO ]: Backedges is TWOTRACK [2018-06-22 11:12:24,852 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:12:24,852 INFO ]: Difference is false [2018-06-22 11:12:24,852 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:12:24,852 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:12:24,873 INFO ]: Start isEmpty. Operand 41 states. [2018-06-22 11:12:24,913 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:12:24,913 INFO ]: Found error trace [2018-06-22 11:12:24,914 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:24,914 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:24,919 INFO ]: Analyzing trace with hash -847232749, now seen corresponding path program 1 times [2018-06-22 11:12:24,920 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:24,921 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:24,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:24,953 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:24,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:24,992 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:25,162 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:12:25,165 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:25,165 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:25,167 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:25,187 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:25,187 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:25,190 INFO ]: Start difference. First operand 41 states. Second operand 4 states. [2018-06-22 11:12:26,284 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:26,284 INFO ]: Finished difference Result 41 states and 126 transitions. [2018-06-22 11:12:26,285 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:12:26,286 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:12:26,286 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:26,298 INFO ]: With dead ends: 41 [2018-06-22 11:12:26,298 INFO ]: Without dead ends: 41 [2018-06-22 11:12:26,300 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:26,312 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:12:26,363 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-22 11:12:26,364 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:12:26,367 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 126 transitions. [2018-06-22 11:12:26,368 INFO ]: Start accepts. Automaton has 41 states and 126 transitions. Word has length 9 [2018-06-22 11:12:26,369 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:26,369 INFO ]: Abstraction has 41 states and 126 transitions. [2018-06-22 11:12:26,369 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:26,369 INFO ]: Start isEmpty. Operand 41 states and 126 transitions. [2018-06-22 11:12:26,380 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:26,380 INFO ]: Found error trace [2018-06-22 11:12:26,380 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:26,380 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:26,380 INFO ]: Analyzing trace with hash 756140963, now seen corresponding path program 1 times [2018-06-22 11:12:26,380 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:26,380 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:26,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:26,381 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:26,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:26,407 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:26,772 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:26,772 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:26,772 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:26,780 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:26,815 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:26,822 INFO ]: Computing forward predicates... [2018-06-22 11:12:26,996 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:27,035 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:12:27,035 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-22 11:12:27,036 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:12:27,036 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:12:27,036 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:12:27,036 INFO ]: Start difference. First operand 41 states and 126 transitions. Second operand 8 states. [2018-06-22 11:12:30,637 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:30,637 INFO ]: Finished difference Result 75 states and 487 transitions. [2018-06-22 11:12:30,638 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:12:30,638 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:12:30,638 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:30,650 INFO ]: With dead ends: 75 [2018-06-22 11:12:30,650 INFO ]: Without dead ends: 75 [2018-06-22 11:12:30,651 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:12:30,651 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 11:12:30,740 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 65. [2018-06-22 11:12:30,740 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:12:30,743 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 354 transitions. [2018-06-22 11:12:30,744 INFO ]: Start accepts. Automaton has 65 states and 354 transitions. Word has length 13 [2018-06-22 11:12:30,744 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:30,744 INFO ]: Abstraction has 65 states and 354 transitions. [2018-06-22 11:12:30,744 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:12:30,744 INFO ]: Start isEmpty. Operand 65 states and 354 transitions. [2018-06-22 11:12:30,752 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:30,752 INFO ]: Found error trace [2018-06-22 11:12:30,752 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:30,753 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:30,753 INFO ]: Analyzing trace with hash 1322044003, now seen corresponding path program 1 times [2018-06-22 11:12:30,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:30,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:30,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:30,754 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:30,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:30,775 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:30,843 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:30,843 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:30,843 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:30,852 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:30,870 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:30,871 INFO ]: Computing forward predicates... [2018-06-22 11:12:30,914 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:30,933 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:12:30,933 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-22 11:12:30,934 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:12:30,934 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:12:30,934 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:12:30,934 INFO ]: Start difference. First operand 65 states and 354 transitions. Second operand 8 states. [2018-06-22 11:12:33,926 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:33,926 INFO ]: Finished difference Result 81 states and 579 transitions. [2018-06-22 11:12:33,926 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:12:33,926 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:12:33,926 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:33,934 INFO ]: With dead ends: 81 [2018-06-22 11:12:33,934 INFO ]: Without dead ends: 81 [2018-06-22 11:12:33,934 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:12:33,934 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 11:12:33,997 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 65. [2018-06-22 11:12:33,997 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:12:34,001 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 342 transitions. [2018-06-22 11:12:34,001 INFO ]: Start accepts. Automaton has 65 states and 342 transitions. Word has length 13 [2018-06-22 11:12:34,001 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:34,001 INFO ]: Abstraction has 65 states and 342 transitions. [2018-06-22 11:12:34,001 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:12:34,001 INFO ]: Start isEmpty. Operand 65 states and 342 transitions. [2018-06-22 11:12:34,011 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:34,011 INFO ]: Found error trace [2018-06-22 11:12:34,011 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:34,011 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:34,011 INFO ]: Analyzing trace with hash 1076793150, now seen corresponding path program 1 times [2018-06-22 11:12:34,011 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:34,011 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:34,012 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:34,012 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:34,012 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:34,030 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:34,142 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:34,142 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:34,142 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:34,148 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:34,167 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:34,171 INFO ]: Computing forward predicates... [2018-06-22 11:12:34,352 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:34,374 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:34,374 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:12:34,374 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:12:34,374 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:12:34,374 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:12:34,375 INFO ]: Start difference. First operand 65 states and 342 transitions. Second operand 10 states. [2018-06-22 11:12:35,967 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:35,967 INFO ]: Finished difference Result 91 states and 755 transitions. [2018-06-22 11:12:35,969 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:12:35,969 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:12:35,969 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:35,974 INFO ]: With dead ends: 91 [2018-06-22 11:12:35,974 INFO ]: Without dead ends: 91 [2018-06-22 11:12:35,975 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:12:35,975 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 11:12:36,051 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-06-22 11:12:36,051 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-22 11:12:36,056 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 715 transitions. [2018-06-22 11:12:36,056 INFO ]: Start accepts. Automaton has 87 states and 715 transitions. Word has length 13 [2018-06-22 11:12:36,057 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:36,057 INFO ]: Abstraction has 87 states and 715 transitions. [2018-06-22 11:12:36,057 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:12:36,057 INFO ]: Start isEmpty. Operand 87 states and 715 transitions. [2018-06-22 11:12:36,068 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:36,068 INFO ]: Found error trace [2018-06-22 11:12:36,068 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:36,068 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:36,068 INFO ]: Analyzing trace with hash -2111467939, now seen corresponding path program 1 times [2018-06-22 11:12:36,068 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:36,068 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:36,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:36,069 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:36,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:36,080 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:36,234 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:36,234 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:36,234 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:36,243 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:36,261 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:36,263 INFO ]: Computing forward predicates... [2018-06-22 11:12:36,394 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:36,413 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:12:36,414 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-22 11:12:36,414 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:12:36,414 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:12:36,414 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:12:36,414 INFO ]: Start difference. First operand 87 states and 715 transitions. Second operand 8 states. [2018-06-22 11:12:37,018 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:37,019 INFO ]: Finished difference Result 91 states and 778 transitions. [2018-06-22 11:12:37,020 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:12:37,020 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:12:37,020 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:37,024 INFO ]: With dead ends: 91 [2018-06-22 11:12:37,024 INFO ]: Without dead ends: 91 [2018-06-22 11:12:37,024 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:12:37,025 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 11:12:37,085 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-06-22 11:12:37,085 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-22 11:12:37,088 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 708 transitions. [2018-06-22 11:12:37,088 INFO ]: Start accepts. Automaton has 87 states and 708 transitions. Word has length 13 [2018-06-22 11:12:37,088 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:37,088 INFO ]: Abstraction has 87 states and 708 transitions. [2018-06-22 11:12:37,089 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:12:37,089 INFO ]: Start isEmpty. Operand 87 states and 708 transitions. [2018-06-22 11:12:37,100 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:37,100 INFO ]: Found error trace [2018-06-22 11:12:37,100 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:37,100 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:37,100 INFO ]: Analyzing trace with hash 265639257, now seen corresponding path program 1 times [2018-06-22 11:12:37,100 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:37,100 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:37,102 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:37,102 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:37,102 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:37,109 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:37,186 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:37,187 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:37,187 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:37,193 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:37,201 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:37,202 INFO ]: Computing forward predicates... [2018-06-22 11:12:37,225 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:37,244 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:12:37,245 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-22 11:12:37,245 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:12:37,245 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:12:37,245 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:12:37,245 INFO ]: Start difference. First operand 87 states and 708 transitions. Second operand 8 states. [2018-06-22 11:12:38,929 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:38,929 INFO ]: Finished difference Result 88 states and 722 transitions. [2018-06-22 11:12:38,930 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:12:38,930 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:12:38,930 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:38,933 INFO ]: With dead ends: 88 [2018-06-22 11:12:38,933 INFO ]: Without dead ends: 88 [2018-06-22 11:12:38,934 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:12:38,934 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 11:12:38,992 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 78. [2018-06-22 11:12:38,992 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-22 11:12:38,995 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 564 transitions. [2018-06-22 11:12:38,995 INFO ]: Start accepts. Automaton has 78 states and 564 transitions. Word has length 13 [2018-06-22 11:12:38,995 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:38,995 INFO ]: Abstraction has 78 states and 564 transitions. [2018-06-22 11:12:38,995 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:12:38,995 INFO ]: Start isEmpty. Operand 78 states and 564 transitions. [2018-06-22 11:12:39,003 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:39,003 INFO ]: Found error trace [2018-06-22 11:12:39,004 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:39,004 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:39,008 INFO ]: Analyzing trace with hash 1938248504, now seen corresponding path program 1 times [2018-06-22 11:12:39,008 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:39,008 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:39,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:39,008 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:39,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:39,024 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:39,423 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:39,423 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:39,423 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:39,445 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:39,470 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:39,471 INFO ]: Computing forward predicates... [2018-06-22 11:12:39,515 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:39,548 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:39,548 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:12:39,548 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:12:39,548 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:12:39,548 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:12:39,548 INFO ]: Start difference. First operand 78 states and 564 transitions. Second operand 8 states. [2018-06-22 11:12:40,078 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:40,079 INFO ]: Finished difference Result 92 states and 772 transitions. [2018-06-22 11:12:40,080 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:12:40,080 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:12:40,080 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:40,083 INFO ]: With dead ends: 92 [2018-06-22 11:12:40,083 INFO ]: Without dead ends: 92 [2018-06-22 11:12:40,084 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:12:40,084 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-22 11:12:40,131 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 80. [2018-06-22 11:12:40,132 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 11:12:40,135 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 595 transitions. [2018-06-22 11:12:40,135 INFO ]: Start accepts. Automaton has 80 states and 595 transitions. Word has length 13 [2018-06-22 11:12:40,135 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:40,136 INFO ]: Abstraction has 80 states and 595 transitions. [2018-06-22 11:12:40,136 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:12:40,136 INFO ]: Start isEmpty. Operand 80 states and 595 transitions. [2018-06-22 11:12:40,142 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:40,142 INFO ]: Found error trace [2018-06-22 11:12:40,142 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:40,143 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:40,143 INFO ]: Analyzing trace with hash 2086024661, now seen corresponding path program 1 times [2018-06-22 11:12:40,143 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:40,143 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:40,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:40,143 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:40,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:40,170 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:40,404 WARN ]: Spent 103.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-06-22 11:12:40,413 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:40,413 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:40,413 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:40,421 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:40,431 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:40,434 INFO ]: Computing forward predicates... [2018-06-22 11:12:40,475 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:40,494 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:40,494 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:12:40,494 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:12:40,495 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:12:40,495 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:12:40,495 INFO ]: Start difference. First operand 80 states and 595 transitions. Second operand 9 states. [2018-06-22 11:12:41,008 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:41,008 INFO ]: Finished difference Result 92 states and 776 transitions. [2018-06-22 11:12:41,011 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:12:41,011 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:12:41,011 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:41,015 INFO ]: With dead ends: 92 [2018-06-22 11:12:41,016 INFO ]: Without dead ends: 92 [2018-06-22 11:12:41,016 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:12:41,016 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-22 11:12:41,091 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 82. [2018-06-22 11:12:41,091 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-22 11:12:41,101 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 630 transitions. [2018-06-22 11:12:41,101 INFO ]: Start accepts. Automaton has 82 states and 630 transitions. Word has length 13 [2018-06-22 11:12:41,101 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:41,101 INFO ]: Abstraction has 82 states and 630 transitions. [2018-06-22 11:12:41,101 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:12:41,101 INFO ]: Start isEmpty. Operand 82 states and 630 transitions. [2018-06-22 11:12:41,109 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:41,109 INFO ]: Found error trace [2018-06-22 11:12:41,109 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:41,109 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:41,109 INFO ]: Analyzing trace with hash 586291444, now seen corresponding path program 1 times [2018-06-22 11:12:41,109 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:41,109 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:41,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:41,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:41,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:41,120 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:41,389 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:41,389 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:41,389 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-22 11:12:41,395 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:41,405 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:41,406 INFO ]: Computing forward predicates... [2018-06-22 11:12:41,434 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:41,454 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:12:41,454 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-22 11:12:41,454 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:12:41,454 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:12:41,454 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:12:41,454 INFO ]: Start difference. First operand 82 states and 630 transitions. Second operand 8 states. [2018-06-22 11:12:42,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:42,247 INFO ]: Finished difference Result 100 states and 832 transitions. [2018-06-22 11:12:42,247 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:12:42,247 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:12:42,247 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:42,251 INFO ]: With dead ends: 100 [2018-06-22 11:12:42,251 INFO ]: Without dead ends: 100 [2018-06-22 11:12:42,251 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:12:42,251 INFO ]: Start minimizeSevpa. Operand 100 states. [2018-06-22 11:12:42,299 INFO ]: Finished minimizeSevpa. Reduced states from 100 to 84. [2018-06-22 11:12:42,299 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 11:12:42,301 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 614 transitions. [2018-06-22 11:12:42,301 INFO ]: Start accepts. Automaton has 84 states and 614 transitions. Word has length 13 [2018-06-22 11:12:42,301 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:42,301 INFO ]: Abstraction has 84 states and 614 transitions. [2018-06-22 11:12:42,302 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:12:42,302 INFO ]: Start isEmpty. Operand 84 states and 614 transitions. [2018-06-22 11:12:42,308 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:42,308 INFO ]: Found error trace [2018-06-22 11:12:42,308 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:42,308 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:42,308 INFO ]: Analyzing trace with hash -470113302, now seen corresponding path program 1 times [2018-06-22 11:12:42,308 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:42,308 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:42,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:42,311 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:42,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:42,329 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:42,593 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:42,594 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:42,594 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-22 11:12:42,599 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:42,613 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:42,615 INFO ]: Computing forward predicates... [2018-06-22 11:12:42,637 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:42,657 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:12:42,657 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-22 11:12:42,657 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:12:42,657 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:12:42,657 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:12:42,657 INFO ]: Start difference. First operand 84 states and 614 transitions. Second operand 8 states. [2018-06-22 11:12:44,333 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:44,333 INFO ]: Finished difference Result 96 states and 784 transitions. [2018-06-22 11:12:44,334 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:12:44,334 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:12:44,334 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:44,338 INFO ]: With dead ends: 96 [2018-06-22 11:12:44,338 INFO ]: Without dead ends: 96 [2018-06-22 11:12:44,339 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:12:44,339 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-22 11:12:44,381 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 82. [2018-06-22 11:12:44,381 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-22 11:12:44,383 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 544 transitions. [2018-06-22 11:12:44,383 INFO ]: Start accepts. Automaton has 82 states and 544 transitions. Word has length 13 [2018-06-22 11:12:44,383 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:44,384 INFO ]: Abstraction has 82 states and 544 transitions. [2018-06-22 11:12:44,384 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:12:44,384 INFO ]: Start isEmpty. Operand 82 states and 544 transitions. [2018-06-22 11:12:44,388 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:44,388 INFO ]: Found error trace [2018-06-22 11:12:44,388 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:44,388 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:44,388 INFO ]: Analyzing trace with hash -715364155, now seen corresponding path program 1 times [2018-06-22 11:12:44,388 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:44,388 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:44,389 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:44,389 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:44,389 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:44,397 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:44,513 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:44,513 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:44,513 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:44,520 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:44,555 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:44,557 INFO ]: Computing forward predicates... [2018-06-22 11:12:44,632 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:44,658 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:44,658 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:12:44,658 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:12:44,658 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:12:44,658 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:12:44,659 INFO ]: Start difference. First operand 82 states and 544 transitions. Second operand 10 states. [2018-06-22 11:12:46,029 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:46,029 INFO ]: Finished difference Result 88 states and 604 transitions. [2018-06-22 11:12:46,029 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:12:46,029 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:12:46,029 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:46,032 INFO ]: With dead ends: 88 [2018-06-22 11:12:46,032 INFO ]: Without dead ends: 88 [2018-06-22 11:12:46,032 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:12:46,032 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 11:12:46,057 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 82. [2018-06-22 11:12:46,057 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-22 11:12:46,059 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 540 transitions. [2018-06-22 11:12:46,059 INFO ]: Start accepts. Automaton has 82 states and 540 transitions. Word has length 13 [2018-06-22 11:12:46,059 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:46,059 INFO ]: Abstraction has 82 states and 540 transitions. [2018-06-22 11:12:46,059 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:12:46,059 INFO ]: Start isEmpty. Operand 82 states and 540 transitions. [2018-06-22 11:12:46,063 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:46,063 INFO ]: Found error trace [2018-06-22 11:12:46,063 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:46,063 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:46,063 INFO ]: Analyzing trace with hash -960615008, now seen corresponding path program 1 times [2018-06-22 11:12:46,063 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:46,063 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:46,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:46,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:46,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:46,075 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:46,167 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:46,167 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:46,167 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:46,178 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:46,187 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:46,188 INFO ]: Computing forward predicates... [2018-06-22 11:12:46,213 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:46,234 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:46,234 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:12:46,234 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:12:46,234 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:12:46,234 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:12:46,234 INFO ]: Start difference. First operand 82 states and 540 transitions. Second operand 9 states. [2018-06-22 11:12:46,569 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:46,569 INFO ]: Finished difference Result 94 states and 699 transitions. [2018-06-22 11:12:46,569 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:12:46,569 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:12:46,569 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:46,572 INFO ]: With dead ends: 94 [2018-06-22 11:12:46,572 INFO ]: Without dead ends: 94 [2018-06-22 11:12:46,572 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:12:46,572 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-22 11:12:46,603 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 82. [2018-06-22 11:12:46,603 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-22 11:12:46,605 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 540 transitions. [2018-06-22 11:12:46,605 INFO ]: Start accepts. Automaton has 82 states and 540 transitions. Word has length 13 [2018-06-22 11:12:46,605 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:46,605 INFO ]: Abstraction has 82 states and 540 transitions. [2018-06-22 11:12:46,605 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:12:46,605 INFO ]: Start isEmpty. Operand 82 states and 540 transitions. [2018-06-22 11:12:46,609 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:12:46,609 INFO ]: Found error trace [2018-06-22 11:12:46,609 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:46,609 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:46,609 INFO ]: Analyzing trace with hash -1130464527, now seen corresponding path program 1 times [2018-06-22 11:12:46,609 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:46,609 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:46,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:46,610 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:46,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:46,653 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:46,730 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:46,730 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:46,730 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:46,746 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:46,773 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:46,774 INFO ]: Computing forward predicates... [2018-06-22 11:12:46,884 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:12:46,904 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:46,904 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:12:46,905 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:12:46,905 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:12:46,905 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:12:46,905 INFO ]: Start difference. First operand 82 states and 540 transitions. Second operand 9 states. [2018-06-22 11:12:47,225 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:47,225 INFO ]: Finished difference Result 90 states and 629 transitions. [2018-06-22 11:12:47,225 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:12:47,225 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:12:47,225 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:47,228 INFO ]: With dead ends: 90 [2018-06-22 11:12:47,228 INFO ]: Without dead ends: 90 [2018-06-22 11:12:47,228 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:12:47,228 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-22 11:12:47,252 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 82. [2018-06-22 11:12:47,252 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-22 11:12:47,254 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 540 transitions. [2018-06-22 11:12:47,254 INFO ]: Start accepts. Automaton has 82 states and 540 transitions. Word has length 13 [2018-06-22 11:12:47,255 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:47,255 INFO ]: Abstraction has 82 states and 540 transitions. [2018-06-22 11:12:47,255 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:12:47,255 INFO ]: Start isEmpty. Operand 82 states and 540 transitions. [2018-06-22 11:12:47,258 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:47,258 INFO ]: Found error trace [2018-06-22 11:12:47,259 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:47,259 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:47,259 INFO ]: Analyzing trace with hash 128437744, now seen corresponding path program 1 times [2018-06-22 11:12:47,259 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:47,259 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:47,259 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:47,259 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:47,259 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:47,269 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:47,311 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:12:47,311 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:47,311 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:47,311 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:47,311 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:47,311 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:47,312 INFO ]: Start difference. First operand 82 states and 540 transitions. Second operand 4 states. [2018-06-22 11:12:47,563 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:47,563 INFO ]: Finished difference Result 90 states and 609 transitions. [2018-06-22 11:12:47,563 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:12:47,563 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:47,563 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:47,566 INFO ]: With dead ends: 90 [2018-06-22 11:12:47,566 INFO ]: Without dead ends: 90 [2018-06-22 11:12:47,568 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:47,569 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-22 11:12:47,591 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-06-22 11:12:47,591 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-22 11:12:47,593 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 605 transitions. [2018-06-22 11:12:47,593 INFO ]: Start accepts. Automaton has 88 states and 605 transitions. Word has length 17 [2018-06-22 11:12:47,593 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:47,593 INFO ]: Abstraction has 88 states and 605 transitions. [2018-06-22 11:12:47,593 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:47,593 INFO ]: Start isEmpty. Operand 88 states and 605 transitions. [2018-06-22 11:12:47,597 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:47,598 INFO ]: Found error trace [2018-06-22 11:12:47,598 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:47,598 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:47,598 INFO ]: Analyzing trace with hash -167878045, now seen corresponding path program 1 times [2018-06-22 11:12:47,598 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:47,598 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:47,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:47,598 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:47,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:47,604 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:47,648 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:12:47,648 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:47,648 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:47,648 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:47,648 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:47,648 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:47,648 INFO ]: Start difference. First operand 88 states and 605 transitions. Second operand 4 states. [2018-06-22 11:12:47,927 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:47,927 INFO ]: Finished difference Result 125 states and 984 transitions. [2018-06-22 11:12:47,927 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:12:47,927 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:47,928 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:47,937 INFO ]: With dead ends: 125 [2018-06-22 11:12:47,937 INFO ]: Without dead ends: 125 [2018-06-22 11:12:47,937 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:12:47,938 INFO ]: Start minimizeSevpa. Operand 125 states. [2018-06-22 11:12:47,979 INFO ]: Finished minimizeSevpa. Reduced states from 125 to 113. [2018-06-22 11:12:47,979 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-22 11:12:47,982 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 820 transitions. [2018-06-22 11:12:47,982 INFO ]: Start accepts. Automaton has 113 states and 820 transitions. Word has length 17 [2018-06-22 11:12:47,983 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:47,983 INFO ]: Abstraction has 113 states and 820 transitions. [2018-06-22 11:12:47,983 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:47,983 INFO ]: Start isEmpty. Operand 113 states and 820 transitions. [2018-06-22 11:12:47,988 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:47,988 INFO ]: Found error trace [2018-06-22 11:12:47,988 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:47,988 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:47,988 INFO ]: Analyzing trace with hash -1387672763, now seen corresponding path program 1 times [2018-06-22 11:12:47,988 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:47,988 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:47,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:47,989 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:47,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:47,995 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:48,125 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:12:48,125 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:48,125 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:48,125 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:48,125 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:48,125 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:48,125 INFO ]: Start difference. First operand 113 states and 820 transitions. Second operand 4 states. [2018-06-22 11:12:48,454 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:48,454 INFO ]: Finished difference Result 127 states and 866 transitions. [2018-06-22 11:12:48,454 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:12:48,454 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:48,454 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:48,458 INFO ]: With dead ends: 127 [2018-06-22 11:12:48,458 INFO ]: Without dead ends: 127 [2018-06-22 11:12:48,459 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 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-22 11:12:48,459 INFO ]: Start minimizeSevpa. Operand 127 states. [2018-06-22 11:12:48,494 INFO ]: Finished minimizeSevpa. Reduced states from 127 to 113. [2018-06-22 11:12:48,494 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-22 11:12:48,497 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 702 transitions. [2018-06-22 11:12:48,497 INFO ]: Start accepts. Automaton has 113 states and 702 transitions. Word has length 17 [2018-06-22 11:12:48,497 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:48,497 INFO ]: Abstraction has 113 states and 702 transitions. [2018-06-22 11:12:48,497 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:48,497 INFO ]: Start isEmpty. Operand 113 states and 702 transitions. [2018-06-22 11:12:48,503 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:48,503 INFO ]: Found error trace [2018-06-22 11:12:48,503 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:48,503 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:48,503 INFO ]: Analyzing trace with hash -1987592423, now seen corresponding path program 1 times [2018-06-22 11:12:48,503 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:48,503 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:48,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:48,503 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:48,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:48,511 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:48,640 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:12:48,640 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:48,640 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:48,640 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:48,641 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:48,641 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:48,641 INFO ]: Start difference. First operand 113 states and 702 transitions. Second operand 4 states. [2018-06-22 11:12:48,888 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:48,889 INFO ]: Finished difference Result 129 states and 812 transitions. [2018-06-22 11:12:48,889 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:12:48,889 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:48,889 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:48,892 INFO ]: With dead ends: 129 [2018-06-22 11:12:48,892 INFO ]: Without dead ends: 129 [2018-06-22 11:12:48,893 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 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-22 11:12:48,893 INFO ]: Start minimizeSevpa. Operand 129 states. [2018-06-22 11:12:48,916 INFO ]: Finished minimizeSevpa. Reduced states from 129 to 113. [2018-06-22 11:12:48,916 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-22 11:12:48,919 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 670 transitions. [2018-06-22 11:12:48,919 INFO ]: Start accepts. Automaton has 113 states and 670 transitions. Word has length 17 [2018-06-22 11:12:48,919 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:48,919 INFO ]: Abstraction has 113 states and 670 transitions. [2018-06-22 11:12:48,919 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:48,919 INFO ]: Start isEmpty. Operand 113 states and 670 transitions. [2018-06-22 11:12:48,924 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:48,924 INFO ]: Found error trace [2018-06-22 11:12:48,924 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:48,924 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:48,924 INFO ]: Analyzing trace with hash 1669668074, now seen corresponding path program 1 times [2018-06-22 11:12:48,924 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:48,925 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:48,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:48,925 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:48,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:48,935 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:49,005 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:12:49,005 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:49,005 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:49,005 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:49,006 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:49,006 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:49,006 INFO ]: Start difference. First operand 113 states and 670 transitions. Second operand 4 states. [2018-06-22 11:12:49,500 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:49,501 INFO ]: Finished difference Result 127 states and 674 transitions. [2018-06-22 11:12:49,501 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:12:49,501 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:49,501 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:49,503 INFO ]: With dead ends: 127 [2018-06-22 11:12:49,503 INFO ]: Without dead ends: 121 [2018-06-22 11:12:49,503 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:12:49,503 INFO ]: Start minimizeSevpa. Operand 121 states. [2018-06-22 11:12:49,537 INFO ]: Finished minimizeSevpa. Reduced states from 121 to 103. [2018-06-22 11:12:49,537 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-22 11:12:49,538 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 496 transitions. [2018-06-22 11:12:49,538 INFO ]: Start accepts. Automaton has 103 states and 496 transitions. Word has length 17 [2018-06-22 11:12:49,538 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:49,538 INFO ]: Abstraction has 103 states and 496 transitions. [2018-06-22 11:12:49,538 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:49,538 INFO ]: Start isEmpty. Operand 103 states and 496 transitions. [2018-06-22 11:12:49,543 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:49,543 INFO ]: Found error trace [2018-06-22 11:12:49,543 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:49,543 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:49,543 INFO ]: Analyzing trace with hash -94427424, now seen corresponding path program 1 times [2018-06-22 11:12:49,543 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:49,543 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:49,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:49,543 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:49,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:49,547 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:49,674 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:12:49,674 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:49,674 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:49,674 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:49,674 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:49,674 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:49,674 INFO ]: Start difference. First operand 103 states and 496 transitions. Second operand 4 states. [2018-06-22 11:12:49,948 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:49,948 INFO ]: Finished difference Result 117 states and 491 transitions. [2018-06-22 11:12:49,948 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:12:49,948 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:49,949 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:49,950 INFO ]: With dead ends: 117 [2018-06-22 11:12:49,950 INFO ]: Without dead ends: 105 [2018-06-22 11:12:49,950 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 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-22 11:12:49,950 INFO ]: Start minimizeSevpa. Operand 105 states. [2018-06-22 11:12:49,968 INFO ]: Finished minimizeSevpa. Reduced states from 105 to 85. [2018-06-22 11:12:49,968 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-22 11:12:49,970 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 410 transitions. [2018-06-22 11:12:49,970 INFO ]: Start accepts. Automaton has 85 states and 410 transitions. Word has length 17 [2018-06-22 11:12:49,970 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:49,970 INFO ]: Abstraction has 85 states and 410 transitions. [2018-06-22 11:12:49,970 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:49,970 INFO ]: Start isEmpty. Operand 85 states and 410 transitions. [2018-06-22 11:12:49,974 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:49,974 INFO ]: Found error trace [2018-06-22 11:12:49,974 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:49,974 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:49,974 INFO ]: Analyzing trace with hash 202370426, now seen corresponding path program 1 times [2018-06-22 11:12:49,974 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:49,974 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:49,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:49,974 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:49,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:49,978 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:49,992 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:12:49,992 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:49,992 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:49,993 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:49,993 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:49,993 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:49,993 INFO ]: Start difference. First operand 85 states and 410 transitions. Second operand 4 states. [2018-06-22 11:12:50,320 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:50,320 INFO ]: Finished difference Result 134 states and 620 transitions. [2018-06-22 11:12:50,366 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:12:50,366 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:50,366 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:50,370 INFO ]: With dead ends: 134 [2018-06-22 11:12:50,370 INFO ]: Without dead ends: 123 [2018-06-22 11:12:50,370 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:50,370 INFO ]: Start minimizeSevpa. Operand 123 states. [2018-06-22 11:12:50,390 INFO ]: Finished minimizeSevpa. Reduced states from 123 to 113. [2018-06-22 11:12:50,390 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-22 11:12:50,392 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 455 transitions. [2018-06-22 11:12:50,392 INFO ]: Start accepts. Automaton has 113 states and 455 transitions. Word has length 17 [2018-06-22 11:12:50,392 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:50,392 INFO ]: Abstraction has 113 states and 455 transitions. [2018-06-22 11:12:50,392 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:50,392 INFO ]: Start isEmpty. Operand 113 states and 455 transitions. [2018-06-22 11:12:50,395 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:50,395 INFO ]: Found error trace [2018-06-22 11:12:50,395 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:50,395 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:50,396 INFO ]: Analyzing trace with hash 1348714523, now seen corresponding path program 1 times [2018-06-22 11:12:50,396 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:50,396 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:50,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:50,396 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:50,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:50,400 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:50,426 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:12:50,426 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:50,426 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:50,426 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:50,426 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:50,426 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:50,426 INFO ]: Start difference. First operand 113 states and 455 transitions. Second operand 4 states. [2018-06-22 11:12:50,818 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:50,818 INFO ]: Finished difference Result 144 states and 574 transitions. [2018-06-22 11:12:50,818 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:12:50,818 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:50,818 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:50,822 INFO ]: With dead ends: 144 [2018-06-22 11:12:50,822 INFO ]: Without dead ends: 144 [2018-06-22 11:12:50,822 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:50,823 INFO ]: Start minimizeSevpa. Operand 144 states. [2018-06-22 11:12:50,839 INFO ]: Finished minimizeSevpa. Reduced states from 144 to 140. [2018-06-22 11:12:50,839 INFO ]: Start removeUnreachable. Operand 140 states. [2018-06-22 11:12:50,842 INFO ]: Finished removeUnreachable. Reduced from 140 states to 140 states and 562 transitions. [2018-06-22 11:12:50,842 INFO ]: Start accepts. Automaton has 140 states and 562 transitions. Word has length 17 [2018-06-22 11:12:50,842 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:50,842 INFO ]: Abstraction has 140 states and 562 transitions. [2018-06-22 11:12:50,842 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:50,842 INFO ]: Start isEmpty. Operand 140 states and 562 transitions. [2018-06-22 11:12:50,846 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:50,846 INFO ]: Found error trace [2018-06-22 11:12:50,846 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:50,846 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:50,846 INFO ]: Analyzing trace with hash 1366546264, now seen corresponding path program 1 times [2018-06-22 11:12:50,846 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:50,846 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:50,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:50,847 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:50,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:50,853 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:50,937 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:12:50,937 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:12:50,937 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:12:50,937 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:12:50,937 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:12:50,937 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:12:50,937 INFO ]: Start difference. First operand 140 states and 562 transitions. Second operand 4 states. [2018-06-22 11:12:51,329 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:51,330 INFO ]: Finished difference Result 156 states and 578 transitions. [2018-06-22 11:12:51,331 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:12:51,331 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:12:51,331 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:51,333 INFO ]: With dead ends: 156 [2018-06-22 11:12:51,333 INFO ]: Without dead ends: 121 [2018-06-22 11:12:51,333 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:12:51,333 INFO ]: Start minimizeSevpa. Operand 121 states. [2018-06-22 11:12:51,345 INFO ]: Finished minimizeSevpa. Reduced states from 121 to 103. [2018-06-22 11:12:51,346 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-22 11:12:51,351 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 370 transitions. [2018-06-22 11:12:51,351 INFO ]: Start accepts. Automaton has 103 states and 370 transitions. Word has length 17 [2018-06-22 11:12:51,351 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:51,351 INFO ]: Abstraction has 103 states and 370 transitions. [2018-06-22 11:12:51,351 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:12:51,351 INFO ]: Start isEmpty. Operand 103 states and 370 transitions. [2018-06-22 11:12:51,354 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:51,354 INFO ]: Found error trace [2018-06-22 11:12:51,354 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:51,354 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:51,354 INFO ]: Analyzing trace with hash -599181799, now seen corresponding path program 2 times [2018-06-22 11:12:51,354 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:51,354 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:51,354 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:51,355 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:51,355 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:51,361 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:51,506 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:12:51,506 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:51,506 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:51,512 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:12:51,566 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:12:51,566 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:51,568 INFO ]: Computing forward predicates... [2018-06-22 11:12:51,656 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:12:51,675 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:12:51,675 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-22 11:12:51,675 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:12:51,675 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:12:51,675 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:12:51,675 INFO ]: Start difference. First operand 103 states and 370 transitions. Second operand 8 states. [2018-06-22 11:12:51,865 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:51,865 INFO ]: Finished difference Result 139 states and 469 transitions. [2018-06-22 11:12:51,865 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:12:51,865 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:12:51,865 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:51,867 INFO ]: With dead ends: 139 [2018-06-22 11:12:51,867 INFO ]: Without dead ends: 139 [2018-06-22 11:12:51,867 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:12:51,867 INFO ]: Start minimizeSevpa. Operand 139 states. [2018-06-22 11:12:51,880 INFO ]: Finished minimizeSevpa. Reduced states from 139 to 107. [2018-06-22 11:12:51,880 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-22 11:12:51,881 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 407 transitions. [2018-06-22 11:12:51,881 INFO ]: Start accepts. Automaton has 107 states and 407 transitions. Word has length 17 [2018-06-22 11:12:51,881 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:51,882 INFO ]: Abstraction has 107 states and 407 transitions. [2018-06-22 11:12:51,882 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:12:51,882 INFO ]: Start isEmpty. Operand 107 states and 407 transitions. [2018-06-22 11:12:51,885 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:12:51,885 INFO ]: Found error trace [2018-06-22 11:12:51,885 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:51,885 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:51,885 INFO ]: Analyzing trace with hash -752051044, now seen corresponding path program 1 times [2018-06-22 11:12:51,885 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:51,885 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:51,886 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:51,886 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:12:51,886 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:51,904 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:52,009 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:12:52,009 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:52,009 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:52,017 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:52,036 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:52,038 INFO ]: Computing forward predicates... [2018-06-22 11:12:54,060 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:12:54,089 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:12:54,089 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-06-22 11:12:54,089 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:12:54,089 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:12:54,089 INFO ]: CoverageRelationStatistics Valid=30, Invalid=101, Unknown=1, NotChecked=0, Total=132 [2018-06-22 11:12:54,090 INFO ]: Start difference. First operand 107 states and 407 transitions. Second operand 12 states. [2018-06-22 11:13:17,160 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:17,160 INFO ]: Finished difference Result 168 states and 514 transitions. [2018-06-22 11:13:17,160 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:13:17,160 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:13:17,160 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:17,162 INFO ]: With dead ends: 168 [2018-06-22 11:13:17,162 INFO ]: Without dead ends: 167 [2018-06-22 11:13:17,163 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=115, Invalid=302, Unknown=3, NotChecked=0, Total=420 [2018-06-22 11:13:17,163 INFO ]: Start minimizeSevpa. Operand 167 states. [2018-06-22 11:13:17,175 INFO ]: Finished minimizeSevpa. Reduced states from 167 to 109. [2018-06-22 11:13:17,175 INFO ]: Start removeUnreachable. Operand 109 states. [2018-06-22 11:13:17,176 INFO ]: Finished removeUnreachable. Reduced from 109 states to 109 states and 411 transitions. [2018-06-22 11:13:17,176 INFO ]: Start accepts. Automaton has 109 states and 411 transitions. Word has length 17 [2018-06-22 11:13:17,176 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:17,176 INFO ]: Abstraction has 109 states and 411 transitions. [2018-06-22 11:13:17,176 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:13:17,176 INFO ]: Start isEmpty. Operand 109 states and 411 transitions. [2018-06-22 11:13:17,179 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:17,179 INFO ]: Found error trace [2018-06-22 11:13:17,179 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:17,179 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:17,179 INFO ]: Analyzing trace with hash -152131384, now seen corresponding path program 1 times [2018-06-22 11:13:17,179 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:17,179 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:17,180 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:17,180 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:17,180 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:17,205 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:17,662 WARN ]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:13:17,694 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:13:17,694 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:17,694 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:17,700 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:17,721 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:17,723 INFO ]: Computing forward predicates... [2018-06-22 11:13:17,847 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:13:17,867 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:13:17,867 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-06-22 11:13:17,867 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:13:17,867 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:13:17,867 INFO ]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:13:17,867 INFO ]: Start difference. First operand 109 states and 411 transitions. Second operand 12 states. [2018-06-22 11:13:30,293 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:30,293 INFO ]: Finished difference Result 151 states and 486 transitions. [2018-06-22 11:13:30,293 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:13:30,293 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:13:30,293 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:30,296 INFO ]: With dead ends: 151 [2018-06-22 11:13:30,296 INFO ]: Without dead ends: 149 [2018-06-22 11:13:30,296 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:13:30,296 INFO ]: Start minimizeSevpa. Operand 149 states. [2018-06-22 11:13:30,309 INFO ]: Finished minimizeSevpa. Reduced states from 149 to 109. [2018-06-22 11:13:30,309 INFO ]: Start removeUnreachable. Operand 109 states. [2018-06-22 11:13:30,310 INFO ]: Finished removeUnreachable. Reduced from 109 states to 109 states and 407 transitions. [2018-06-22 11:13:30,310 INFO ]: Start accepts. Automaton has 109 states and 407 transitions. Word has length 17 [2018-06-22 11:13:30,311 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:30,311 INFO ]: Abstraction has 109 states and 407 transitions. [2018-06-22 11:13:30,311 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:13:30,311 INFO ]: Start isEmpty. Operand 109 states and 407 transitions. [2018-06-22 11:13:30,315 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:30,315 INFO ]: Found error trace [2018-06-22 11:13:30,315 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:30,315 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:30,315 INFO ]: Analyzing trace with hash -1407589584, now seen corresponding path program 1 times [2018-06-22 11:13:30,315 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:30,315 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:30,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:30,316 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:30,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:30,329 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:30,459 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:13:30,459 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:30,459 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:30,484 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:30,503 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:30,505 INFO ]: Computing forward predicates... [2018-06-22 11:13:30,716 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:13:30,735 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:13:30,735 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-06-22 11:13:30,735 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:13:30,735 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:13:30,735 INFO ]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:13:30,735 INFO ]: Start difference. First operand 109 states and 407 transitions. Second operand 12 states. Received shutdown request... [2018-06-22 11:13:31,904 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:13:31,904 WARN ]: Verification canceled [2018-06-22 11:13:31,907 WARN ]: Timeout [2018-06-22 11:13:31,908 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:13:31 BoogieIcfgContainer [2018-06-22 11:13:31,908 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:13:31,908 INFO ]: Toolchain (without parser) took 68663.31 ms. Allocated memory was 308.8 MB in the beginning and 574.6 MB in the end (delta: 265.8 MB). Free memory was 236.3 MB in the beginning and 488.9 MB in the end (delta: -252.6 MB). Peak memory consumption was 13.2 MB. Max. memory is 3.6 GB. [2018-06-22 11:13:31,909 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:13:31,909 INFO ]: ChcToBoogie took 73.29 ms. Allocated memory is still 308.8 MB. Free memory was 235.3 MB in the beginning and 233.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:13:31,910 INFO ]: Boogie Preprocessor took 66.48 ms. Allocated memory is still 308.8 MB. Free memory was 233.3 MB in the beginning and 231.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:13:31,910 INFO ]: RCFGBuilder took 1384.00 ms. Allocated memory was 308.8 MB in the beginning and 324.5 MB in the end (delta: 15.7 MB). Free memory was 231.3 MB in the beginning and 283.8 MB in the end (delta: -52.5 MB). Peak memory consumption was 48.6 MB. Max. memory is 3.6 GB. [2018-06-22 11:13:31,911 INFO ]: TraceAbstraction took 67131.08 ms. Allocated memory was 324.5 MB in the beginning and 574.6 MB in the end (delta: 250.1 MB). Free memory was 283.8 MB in the beginning and 488.9 MB in the end (delta: -205.1 MB). Peak memory consumption was 45.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:13:31,913 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 73.29 ms. Allocated memory is still 308.8 MB. Free memory was 235.3 MB in the beginning and 233.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 66.48 ms. Allocated memory is still 308.8 MB. Free memory was 233.3 MB in the beginning and 231.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1384.00 ms. Allocated memory was 308.8 MB in the beginning and 324.5 MB in the end (delta: 15.7 MB). Free memory was 231.3 MB in the beginning and 283.8 MB in the end (delta: -52.5 MB). Peak memory consumption was 48.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 67131.08 ms. Allocated memory was 324.5 MB in the beginning and 574.6 MB in the end (delta: 250.1 MB). Free memory was 283.8 MB in the beginning and 488.9 MB in the end (delta: -205.1 MB). Peak memory consumption was 45.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 (109states) and interpolant automaton (currently 7 states, 12 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 1 error locations. TIMEOUT Result, 67.0s OverallTime, 26 OverallIterations, 3 TraceHistogramMax, 57.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2223 SDtfs, 224 SDslu, 2651 SDs, 0 SdLazy, 14531 SolverSat, 1484 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 49.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 404 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=21, 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.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 366 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 610 NumberOfCodeBlocks, 610 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 568 ConstructedInterpolants, 23 QuantifiedInterpolants, 28820 SizeOfPredicates, 87 NumberOfNonLiveVariables, 1962 ConjunctsInSsa, 182 ConjunctsInUnsatCore, 42 InterpolantComputations, 20 PerfectInterpolantSequences, 173/225 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/009b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-13-31-931.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/009b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-13-31-931.csv Completed graceful shutdown