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/HOLA/34.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:54:15,053 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:54:15,055 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:54:15,069 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:54:15,069 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:54:15,071 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:54:15,072 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:54:15,075 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:54:15,076 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:54:15,077 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:54:15,079 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:54:15,079 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:54:15,080 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:54:15,081 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:54:15,081 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:54:15,084 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:54:15,085 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:54:15,094 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:54:15,096 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:54:15,096 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:54:15,097 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:54:15,103 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:54:15,103 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:54:15,103 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:54:15,104 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:54:15,105 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:54:15,105 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:54:15,107 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:54:15,108 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:54:15,108 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:54:15,109 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:54:15,109 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:54:15,114 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:54:15,115 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:54:15,115 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:54:15,116 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 10:54:15,138 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:54:15,140 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:54:15,140 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:54:15,140 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:54:15,141 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:54:15,141 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:54:15,142 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:54:15,142 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:54:15,142 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:54:15,142 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:54:15,142 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:54:15,143 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:54:15,146 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:54:15,146 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:54:15,146 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:54:15,146 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:54:15,146 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:54:15,147 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:54:15,147 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:54:15,148 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:54:15,148 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:54:15,195 INFO ]: Repository-Root is: /tmp [2018-06-22 10:54:15,210 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:54:15,216 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:54:15,217 INFO ]: Initializing SmtParser... [2018-06-22 10:54:15,218 INFO ]: SmtParser initialized [2018-06-22 10:54:15,218 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/34.c.smt2 [2018-06-22 10:54:15,220 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 10:54:15,306 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/34.c.smt2 unknown [2018-06-22 10:54:15,638 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/34.c.smt2 [2018-06-22 10:54:15,643 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:54:15,651 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:54:15,651 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:54:15,651 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:54:15,651 INFO ]: ChcToBoogie initialized [2018-06-22 10:54:15,654 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:54:15" (1/1) ... [2018-06-22 10:54:15,705 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:54:15 Unit [2018-06-22 10:54:15,705 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:54:15,705 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:54:15,706 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:54:15,706 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:54:15,747 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:54:15" (1/1) ... [2018-06-22 10:54:15,747 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:54:15" (1/1) ... [2018-06-22 10:54:15,765 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:54:15" (1/1) ... [2018-06-22 10:54:15,765 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:54:15" (1/1) ... [2018-06-22 10:54:15,779 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:54:15" (1/1) ... [2018-06-22 10:54:15,786 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:54:15" (1/1) ... [2018-06-22 10:54:15,788 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:54:15" (1/1) ... [2018-06-22 10:54:15,790 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:54:15,791 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:54:15,791 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:54:15,791 INFO ]: RCFGBuilder initialized [2018-06-22 10:54:15,792 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:54:15" (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 10:54:15,829 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:54:15,829 INFO ]: Found specification of procedure False [2018-06-22 10:54:15,829 INFO ]: Found implementation of procedure False [2018-06-22 10:54:15,829 INFO ]: Specification and implementation of procedure h24 given in one single declaration [2018-06-22 10:54:15,829 INFO ]: Found specification of procedure h24 [2018-06-22 10:54:15,829 INFO ]: Found implementation of procedure h24 [2018-06-22 10:54:15,829 INFO ]: Specification and implementation of procedure h19 given in one single declaration [2018-06-22 10:54:15,829 INFO ]: Found specification of procedure h19 [2018-06-22 10:54:15,829 INFO ]: Found implementation of procedure h19 [2018-06-22 10:54:15,829 INFO ]: Specification and implementation of procedure h18 given in one single declaration [2018-06-22 10:54:15,829 INFO ]: Found specification of procedure h18 [2018-06-22 10:54:15,829 INFO ]: Found implementation of procedure h18 [2018-06-22 10:54:15,829 INFO ]: Specification and implementation of procedure h17 given in one single declaration [2018-06-22 10:54:15,829 INFO ]: Found specification of procedure h17 [2018-06-22 10:54:15,829 INFO ]: Found implementation of procedure h17 [2018-06-22 10:54:15,829 INFO ]: Specification and implementation of procedure h11 given in one single declaration [2018-06-22 10:54:15,829 INFO ]: Found specification of procedure h11 [2018-06-22 10:54:15,829 INFO ]: Found implementation of procedure h11 [2018-06-22 10:54:15,829 INFO ]: Specification and implementation of procedure h10 given in one single declaration [2018-06-22 10:54:15,830 INFO ]: Found specification of procedure h10 [2018-06-22 10:54:15,830 INFO ]: Found implementation of procedure h10 [2018-06-22 10:54:15,830 INFO ]: Specification and implementation of procedure h9 given in one single declaration [2018-06-22 10:54:15,830 INFO ]: Found specification of procedure h9 [2018-06-22 10:54:15,830 INFO ]: Found implementation of procedure h9 [2018-06-22 10:54:15,830 INFO ]: Specification and implementation of procedure h6 given in one single declaration [2018-06-22 10:54:15,830 INFO ]: Found specification of procedure h6 [2018-06-22 10:54:15,830 INFO ]: Found implementation of procedure h6 [2018-06-22 10:54:15,830 INFO ]: Specification and implementation of procedure h5 given in one single declaration [2018-06-22 10:54:15,830 INFO ]: Found specification of procedure h5 [2018-06-22 10:54:15,830 INFO ]: Found implementation of procedure h5 [2018-06-22 10:54:15,830 INFO ]: Specification and implementation of procedure h16 given in one single declaration [2018-06-22 10:54:15,830 INFO ]: Found specification of procedure h16 [2018-06-22 10:54:15,830 INFO ]: Found implementation of procedure h16 [2018-06-22 10:54:15,830 INFO ]: Specification and implementation of procedure h12 given in one single declaration [2018-06-22 10:54:15,830 INFO ]: Found specification of procedure h12 [2018-06-22 10:54:15,830 INFO ]: Found implementation of procedure h12 [2018-06-22 10:54:15,830 INFO ]: Specification and implementation of procedure h8 given in one single declaration [2018-06-22 10:54:15,830 INFO ]: Found specification of procedure h8 [2018-06-22 10:54:15,830 INFO ]: Found implementation of procedure h8 [2018-06-22 10:54:15,830 INFO ]: Specification and implementation of procedure h7 given in one single declaration [2018-06-22 10:54:15,830 INFO ]: Found specification of procedure h7 [2018-06-22 10:54:15,830 INFO ]: Found implementation of procedure h7 [2018-06-22 10:54:15,830 INFO ]: Specification and implementation of procedure h15 given in one single declaration [2018-06-22 10:54:15,830 INFO ]: Found specification of procedure h15 [2018-06-22 10:54:15,830 INFO ]: Found implementation of procedure h15 [2018-06-22 10:54:15,830 INFO ]: Specification and implementation of procedure h4 given in one single declaration [2018-06-22 10:54:15,830 INFO ]: Found specification of procedure h4 [2018-06-22 10:54:15,830 INFO ]: Found implementation of procedure h4 [2018-06-22 10:54:15,830 INFO ]: Specification and implementation of procedure h3 given in one single declaration [2018-06-22 10:54:15,830 INFO ]: Found specification of procedure h3 [2018-06-22 10:54:15,830 INFO ]: Found implementation of procedure h3 [2018-06-22 10:54:15,831 INFO ]: Specification and implementation of procedure h2 given in one single declaration [2018-06-22 10:54:15,831 INFO ]: Found specification of procedure h2 [2018-06-22 10:54:15,831 INFO ]: Found implementation of procedure h2 [2018-06-22 10:54:15,831 INFO ]: Specification and implementation of procedure h1 given in one single declaration [2018-06-22 10:54:15,831 INFO ]: Found specification of procedure h1 [2018-06-22 10:54:15,831 INFO ]: Found implementation of procedure h1 [2018-06-22 10:54:15,831 INFO ]: Specification and implementation of procedure h14 given in one single declaration [2018-06-22 10:54:15,831 INFO ]: Found specification of procedure h14 [2018-06-22 10:54:15,831 INFO ]: Found implementation of procedure h14 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:54:15,835 INFO ]: Specification and implementation of procedure h13 given in one single declaration [2018-06-22 10:54:15,835 INFO ]: Found specification of procedure h13 [2018-06-22 10:54:15,835 INFO ]: Found implementation of procedure h13 [2018-06-22 10:54:15,835 INFO ]: Specification and implementation of procedure h23 given in one single declaration [2018-06-22 10:54:15,835 INFO ]: Found specification of procedure h23 [2018-06-22 10:54:15,835 INFO ]: Found implementation of procedure h23 [2018-06-22 10:54:15,835 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:54:15,835 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:54:15,835 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 10:54:16,309 INFO ]: Using library mode [2018-06-22 10:54:16,309 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:54:16 BoogieIcfgContainer [2018-06-22 10:54:16,309 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:54:16,311 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:54:16,311 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:54:16,314 INFO ]: TraceAbstraction initialized [2018-06-22 10:54:16,314 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:54:15" (1/3) ... [2018-06-22 10:54:16,315 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f7c194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:54:16, skipping insertion in model container [2018-06-22 10:54:16,315 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:54:15" (2/3) ... [2018-06-22 10:54:16,316 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f7c194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:54:16, skipping insertion in model container [2018-06-22 10:54:16,316 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:54:16" (3/3) ... [2018-06-22 10:54:16,318 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:54:16,327 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:54:16,338 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:54:16,389 INFO ]: Using default assertion order modulation [2018-06-22 10:54:16,389 INFO ]: Interprodecural is true [2018-06-22 10:54:16,389 INFO ]: Hoare is false [2018-06-22 10:54:16,389 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:54:16,389 INFO ]: Backedges is TWOTRACK [2018-06-22 10:54:16,389 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:54:16,390 INFO ]: Difference is false [2018-06-22 10:54:16,390 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:54:16,390 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:54:16,420 INFO ]: Start isEmpty. Operand 96 states. [2018-06-22 10:54:16,445 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:54:16,445 INFO ]: Found error trace [2018-06-22 10:54:16,446 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:16,447 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:16,453 INFO ]: Analyzing trace with hash -1069486423, now seen corresponding path program 1 times [2018-06-22 10:54:16,455 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:16,455 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:16,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:16,493 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:16,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:16,581 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:17,159 WARN ]: Spent 122.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2018-06-22 10:54:17,458 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:54:17,461 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:54:17,461 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:54:17,464 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:54:17,479 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:54:17,480 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:54:17,483 INFO ]: Start difference. First operand 96 states. Second operand 12 states. [2018-06-22 10:54:18,041 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:18,041 INFO ]: Finished difference Result 106 states and 113 transitions. [2018-06-22 10:54:18,041 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:54:18,042 INFO ]: Start accepts. Automaton has 12 states. Word has length 57 [2018-06-22 10:54:18,043 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:18,054 INFO ]: With dead ends: 106 [2018-06-22 10:54:18,054 INFO ]: Without dead ends: 98 [2018-06-22 10:54:18,055 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:54:18,069 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 10:54:18,098 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-06-22 10:54:18,100 INFO ]: Start removeUnreachable. Operand 98 states. [2018-06-22 10:54:18,102 INFO ]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-06-22 10:54:18,103 INFO ]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 57 [2018-06-22 10:54:18,104 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:18,104 INFO ]: Abstraction has 98 states and 105 transitions. [2018-06-22 10:54:18,104 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:54:18,104 INFO ]: Start isEmpty. Operand 98 states and 105 transitions. [2018-06-22 10:54:18,108 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 10:54:18,108 INFO ]: Found error trace [2018-06-22 10:54:18,108 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:18,109 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:18,109 INFO ]: Analyzing trace with hash 1885254488, now seen corresponding path program 1 times [2018-06-22 10:54:18,109 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:18,109 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:18,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:18,110 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:18,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:18,146 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:18,836 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:54:18,836 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:54:18,836 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-22 10:54:18,838 INFO ]: Interpolant automaton has 19 states [2018-06-22 10:54:18,838 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 10:54:18,838 INFO ]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-22 10:54:18,838 INFO ]: Start difference. First operand 98 states and 105 transitions. Second operand 19 states. [2018-06-22 10:54:19,359 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:19,359 INFO ]: Finished difference Result 118 states and 127 transitions. [2018-06-22 10:54:19,375 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 10:54:19,376 INFO ]: Start accepts. Automaton has 19 states. Word has length 81 [2018-06-22 10:54:19,376 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:19,378 INFO ]: With dead ends: 118 [2018-06-22 10:54:19,378 INFO ]: Without dead ends: 110 [2018-06-22 10:54:19,379 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2018-06-22 10:54:19,379 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-22 10:54:19,394 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 106. [2018-06-22 10:54:19,394 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-22 10:54:19,396 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2018-06-22 10:54:19,397 INFO ]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 81 [2018-06-22 10:54:19,397 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:19,397 INFO ]: Abstraction has 106 states and 115 transitions. [2018-06-22 10:54:19,397 INFO ]: Interpolant automaton has 19 states. [2018-06-22 10:54:19,397 INFO ]: Start isEmpty. Operand 106 states and 115 transitions. [2018-06-22 10:54:19,401 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 10:54:19,401 INFO ]: Found error trace [2018-06-22 10:54:19,401 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:19,401 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:19,402 INFO ]: Analyzing trace with hash 1371428960, now seen corresponding path program 1 times [2018-06-22 10:54:19,402 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:19,402 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:19,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:19,402 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:19,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:19,427 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:19,796 WARN ]: Spent 197.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-06-22 10:54:20,217 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:54:20,217 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:54:20,217 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-22 10:54:20,218 INFO ]: Interpolant automaton has 19 states [2018-06-22 10:54:20,218 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 10:54:20,218 INFO ]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-22 10:54:20,218 INFO ]: Start difference. First operand 106 states and 115 transitions. Second operand 19 states. [2018-06-22 10:54:20,651 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:20,651 INFO ]: Finished difference Result 136 states and 149 transitions. [2018-06-22 10:54:20,652 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 10:54:20,652 INFO ]: Start accepts. Automaton has 19 states. Word has length 81 [2018-06-22 10:54:20,652 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:20,654 INFO ]: With dead ends: 136 [2018-06-22 10:54:20,654 INFO ]: Without dead ends: 128 [2018-06-22 10:54:20,655 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2018-06-22 10:54:20,655 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-22 10:54:20,669 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-06-22 10:54:20,669 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-22 10:54:20,670 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2018-06-22 10:54:20,670 INFO ]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 81 [2018-06-22 10:54:20,670 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:20,671 INFO ]: Abstraction has 128 states and 141 transitions. [2018-06-22 10:54:20,671 INFO ]: Interpolant automaton has 19 states. [2018-06-22 10:54:20,671 INFO ]: Start isEmpty. Operand 128 states and 141 transitions. [2018-06-22 10:54:20,672 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 10:54:20,673 INFO ]: Found error trace [2018-06-22 10:54:20,673 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:20,673 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:20,673 INFO ]: Analyzing trace with hash -1324445388, now seen corresponding path program 1 times [2018-06-22 10:54:20,673 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:20,673 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:20,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:20,674 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:20,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:20,695 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:21,048 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:54:21,048 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:54:21,048 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:54:21,054 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:21,139 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:21,154 INFO ]: Computing forward predicates... [2018-06-22 10:54:22,212 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:54:22,245 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:54:22,245 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 41 [2018-06-22 10:54:22,246 INFO ]: Interpolant automaton has 41 states [2018-06-22 10:54:22,246 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-22 10:54:22,247 INFO ]: CoverageRelationStatistics Valid=81, Invalid=1559, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 10:54:22,247 INFO ]: Start difference. First operand 128 states and 141 transitions. Second operand 41 states. [2018-06-22 10:54:23,624 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:23,624 INFO ]: Finished difference Result 144 states and 157 transitions. [2018-06-22 10:54:23,624 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 10:54:23,624 INFO ]: Start accepts. Automaton has 41 states. Word has length 85 [2018-06-22 10:54:23,625 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:23,627 INFO ]: With dead ends: 144 [2018-06-22 10:54:23,627 INFO ]: Without dead ends: 136 [2018-06-22 10:54:23,629 INFO ]: 0 DeclaredPredicates, 122 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=155, Invalid=3151, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 10:54:23,629 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-22 10:54:23,654 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-06-22 10:54:23,654 INFO ]: Start removeUnreachable. Operand 136 states. [2018-06-22 10:54:23,665 INFO ]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2018-06-22 10:54:23,665 INFO ]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 85 [2018-06-22 10:54:23,665 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:23,665 INFO ]: Abstraction has 136 states and 149 transitions. [2018-06-22 10:54:23,665 INFO ]: Interpolant automaton has 41 states. [2018-06-22 10:54:23,666 INFO ]: Start isEmpty. Operand 136 states and 149 transitions. [2018-06-22 10:54:23,667 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:54:23,667 INFO ]: Found error trace [2018-06-22 10:54:23,668 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:23,668 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:23,668 INFO ]: Analyzing trace with hash -1286272113, now seen corresponding path program 1 times [2018-06-22 10:54:23,668 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:23,668 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:23,669 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:23,669 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:23,669 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:23,695 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:24,118 WARN ]: Spent 196.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-06-22 10:54:24,608 INFO ]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 10:54:24,609 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:54:24,609 INFO ]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-06-22 10:54:24,609 INFO ]: Interpolant automaton has 20 states [2018-06-22 10:54:24,609 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 10:54:24,609 INFO ]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-06-22 10:54:24,609 INFO ]: Start difference. First operand 136 states and 149 transitions. Second operand 20 states. [2018-06-22 10:54:24,870 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:24,870 INFO ]: Finished difference Result 162 states and 178 transitions. [2018-06-22 10:54:24,871 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 10:54:24,871 INFO ]: Start accepts. Automaton has 20 states. Word has length 105 [2018-06-22 10:54:24,872 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:24,873 INFO ]: With dead ends: 162 [2018-06-22 10:54:24,873 INFO ]: Without dead ends: 154 [2018-06-22 10:54:24,874 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2018-06-22 10:54:24,874 INFO ]: Start minimizeSevpa. Operand 154 states. [2018-06-22 10:54:24,889 INFO ]: Finished minimizeSevpa. Reduced states from 154 to 142. [2018-06-22 10:54:24,889 INFO ]: Start removeUnreachable. Operand 142 states. [2018-06-22 10:54:24,890 INFO ]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2018-06-22 10:54:24,891 INFO ]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 105 [2018-06-22 10:54:24,891 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:24,891 INFO ]: Abstraction has 142 states and 156 transitions. [2018-06-22 10:54:24,891 INFO ]: Interpolant automaton has 20 states. [2018-06-22 10:54:24,891 INFO ]: Start isEmpty. Operand 142 states and 156 transitions. [2018-06-22 10:54:24,893 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:54:24,893 INFO ]: Found error trace [2018-06-22 10:54:24,893 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:24,893 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:24,894 INFO ]: Analyzing trace with hash 318970895, now seen corresponding path program 2 times [2018-06-22 10:54:24,894 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:24,894 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:24,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:24,894 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:24,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:24,913 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:25,237 INFO ]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 10:54:25,238 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:54:25,238 INFO ]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-06-22 10:54:25,238 INFO ]: Interpolant automaton has 20 states [2018-06-22 10:54:25,238 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 10:54:25,238 INFO ]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-06-22 10:54:25,238 INFO ]: Start difference. First operand 142 states and 156 transitions. Second operand 20 states. [2018-06-22 10:54:25,574 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:25,574 INFO ]: Finished difference Result 150 states and 163 transitions. [2018-06-22 10:54:25,578 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 10:54:25,578 INFO ]: Start accepts. Automaton has 20 states. Word has length 105 [2018-06-22 10:54:25,579 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:25,580 INFO ]: With dead ends: 150 [2018-06-22 10:54:25,580 INFO ]: Without dead ends: 142 [2018-06-22 10:54:25,581 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2018-06-22 10:54:25,581 INFO ]: Start minimizeSevpa. Operand 142 states. [2018-06-22 10:54:25,598 INFO ]: Finished minimizeSevpa. Reduced states from 142 to 126. [2018-06-22 10:54:25,598 INFO ]: Start removeUnreachable. Operand 126 states. [2018-06-22 10:54:25,600 INFO ]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2018-06-22 10:54:25,600 INFO ]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 105 [2018-06-22 10:54:25,600 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:25,600 INFO ]: Abstraction has 126 states and 137 transitions. [2018-06-22 10:54:25,600 INFO ]: Interpolant automaton has 20 states. [2018-06-22 10:54:25,600 INFO ]: Start isEmpty. Operand 126 states and 137 transitions. [2018-06-22 10:54:25,604 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 10:54:25,604 INFO ]: Found error trace [2018-06-22 10:54:25,604 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:25,604 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:25,605 INFO ]: Analyzing trace with hash 1870477928, now seen corresponding path program 1 times [2018-06-22 10:54:25,605 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:25,605 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:25,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:25,605 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:54:25,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:25,636 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:26,024 INFO ]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 10:54:26,024 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:54:26,024 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 10:54:26,033 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:26,101 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:26,111 INFO ]: Computing forward predicates... [2018-06-22 10:54:27,313 INFO ]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 10:54:27,333 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:54:27,333 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 53 [2018-06-22 10:54:27,334 INFO ]: Interpolant automaton has 53 states [2018-06-22 10:54:27,334 INFO ]: Constructing interpolant automaton starting with 53 interpolants. [2018-06-22 10:54:27,335 INFO ]: CoverageRelationStatistics Valid=117, Invalid=2639, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 10:54:27,335 INFO ]: Start difference. First operand 126 states and 137 transitions. Second operand 53 states. [2018-06-22 10:54:29,166 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:29,166 INFO ]: Finished difference Result 154 states and 167 transitions. [2018-06-22 10:54:29,166 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 10:54:29,166 INFO ]: Start accepts. Automaton has 53 states. Word has length 109 [2018-06-22 10:54:29,167 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:29,168 INFO ]: With dead ends: 154 [2018-06-22 10:54:29,168 INFO ]: Without dead ends: 146 [2018-06-22 10:54:29,169 INFO ]: 0 DeclaredPredicates, 159 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=235, Invalid=5465, Unknown=0, NotChecked=0, Total=5700 [2018-06-22 10:54:29,170 INFO ]: Start minimizeSevpa. Operand 146 states. [2018-06-22 10:54:29,179 INFO ]: Finished minimizeSevpa. Reduced states from 146 to 138. [2018-06-22 10:54:29,180 INFO ]: Start removeUnreachable. Operand 138 states. [2018-06-22 10:54:29,181 INFO ]: Finished removeUnreachable. Reduced from 138 states to 138 states and 151 transitions. [2018-06-22 10:54:29,181 INFO ]: Start accepts. Automaton has 138 states and 151 transitions. Word has length 109 [2018-06-22 10:54:29,181 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:29,181 INFO ]: Abstraction has 138 states and 151 transitions. [2018-06-22 10:54:29,181 INFO ]: Interpolant automaton has 53 states. [2018-06-22 10:54:29,181 INFO ]: Start isEmpty. Operand 138 states and 151 transitions. [2018-06-22 10:54:29,182 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 10:54:29,182 INFO ]: Found error trace [2018-06-22 10:54:29,182 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:29,183 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:29,183 INFO ]: Analyzing trace with hash -722523805, now seen corresponding path program 1 times [2018-06-22 10:54:29,183 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:29,183 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:29,183 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:29,183 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:29,183 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:29,199 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:29,585 INFO ]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 10:54:29,585 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:54:29,585 INFO ]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-06-22 10:54:29,586 INFO ]: Interpolant automaton has 21 states [2018-06-22 10:54:29,586 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 10:54:29,586 INFO ]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-06-22 10:54:29,586 INFO ]: Start difference. First operand 138 states and 151 transitions. Second operand 21 states. [2018-06-22 10:54:29,883 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:29,883 INFO ]: Finished difference Result 186 states and 204 transitions. [2018-06-22 10:54:29,884 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 10:54:29,884 INFO ]: Start accepts. Automaton has 21 states. Word has length 109 [2018-06-22 10:54:29,885 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:29,886 INFO ]: With dead ends: 186 [2018-06-22 10:54:29,886 INFO ]: Without dead ends: 178 [2018-06-22 10:54:29,886 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:54:29,887 INFO ]: Start minimizeSevpa. Operand 178 states. [2018-06-22 10:54:29,897 INFO ]: Finished minimizeSevpa. Reduced states from 178 to 174. [2018-06-22 10:54:29,897 INFO ]: Start removeUnreachable. Operand 174 states. [2018-06-22 10:54:29,898 INFO ]: Finished removeUnreachable. Reduced from 174 states to 174 states and 192 transitions. [2018-06-22 10:54:29,898 INFO ]: Start accepts. Automaton has 174 states and 192 transitions. Word has length 109 [2018-06-22 10:54:29,899 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:29,899 INFO ]: Abstraction has 174 states and 192 transitions. [2018-06-22 10:54:29,899 INFO ]: Interpolant automaton has 21 states. [2018-06-22 10:54:29,899 INFO ]: Start isEmpty. Operand 174 states and 192 transitions. [2018-06-22 10:54:29,901 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 10:54:29,901 INFO ]: Found error trace [2018-06-22 10:54:29,901 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:29,901 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:29,901 INFO ]: Analyzing trace with hash 100347368, now seen corresponding path program 2 times [2018-06-22 10:54:29,901 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:29,901 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:29,902 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:29,902 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:29,902 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:29,930 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:30,277 INFO ]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 10:54:30,277 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:54:30,277 INFO ]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-06-22 10:54:30,278 INFO ]: Interpolant automaton has 21 states [2018-06-22 10:54:30,278 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 10:54:30,278 INFO ]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-06-22 10:54:30,278 INFO ]: Start difference. First operand 174 states and 192 transitions. Second operand 21 states. [2018-06-22 10:54:30,605 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:30,605 INFO ]: Finished difference Result 232 states and 258 transitions. [2018-06-22 10:54:30,605 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 10:54:30,605 INFO ]: Start accepts. Automaton has 21 states. Word has length 109 [2018-06-22 10:54:30,605 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:30,607 INFO ]: With dead ends: 232 [2018-06-22 10:54:30,607 INFO ]: Without dead ends: 224 [2018-06-22 10:54:30,608 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:54:30,608 INFO ]: Start minimizeSevpa. Operand 224 states. [2018-06-22 10:54:30,627 INFO ]: Finished minimizeSevpa. Reduced states from 224 to 220. [2018-06-22 10:54:30,627 INFO ]: Start removeUnreachable. Operand 220 states. [2018-06-22 10:54:30,629 INFO ]: Finished removeUnreachable. Reduced from 220 states to 220 states and 246 transitions. [2018-06-22 10:54:30,629 INFO ]: Start accepts. Automaton has 220 states and 246 transitions. Word has length 109 [2018-06-22 10:54:30,630 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:30,630 INFO ]: Abstraction has 220 states and 246 transitions. [2018-06-22 10:54:30,630 INFO ]: Interpolant automaton has 21 states. [2018-06-22 10:54:30,630 INFO ]: Start isEmpty. Operand 220 states and 246 transitions. [2018-06-22 10:54:30,631 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 10:54:30,632 INFO ]: Found error trace [2018-06-22 10:54:30,632 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:30,632 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:30,632 INFO ]: Analyzing trace with hash 1856375459, now seen corresponding path program 2 times [2018-06-22 10:54:30,632 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:30,632 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:30,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:30,633 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:54:30,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:30,649 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:31,148 INFO ]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 10:54:31,148 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:54:31,148 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 10:54:31,158 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:54:31,244 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:54:31,244 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:31,252 INFO ]: Computing forward predicates... [2018-06-22 10:54:31,923 INFO ]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 10:54:31,942 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:54:31,942 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2018-06-22 10:54:31,943 INFO ]: Interpolant automaton has 49 states [2018-06-22 10:54:31,943 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-22 10:54:31,943 INFO ]: CoverageRelationStatistics Valid=144, Invalid=2208, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 10:54:31,944 INFO ]: Start difference. First operand 220 states and 246 transitions. Second operand 49 states. [2018-06-22 10:54:32,392 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:32,392 INFO ]: Finished difference Result 248 states and 276 transitions. [2018-06-22 10:54:32,392 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 10:54:32,392 INFO ]: Start accepts. Automaton has 49 states. Word has length 109 [2018-06-22 10:54:32,393 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:32,394 INFO ]: With dead ends: 248 [2018-06-22 10:54:32,394 INFO ]: Without dead ends: 240 [2018-06-22 10:54:32,394 INFO ]: 0 DeclaredPredicates, 139 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=161, Invalid=2491, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 10:54:32,395 INFO ]: Start minimizeSevpa. Operand 240 states. [2018-06-22 10:54:32,409 INFO ]: Finished minimizeSevpa. Reduced states from 240 to 236. [2018-06-22 10:54:32,409 INFO ]: Start removeUnreachable. Operand 236 states. [2018-06-22 10:54:32,411 INFO ]: Finished removeUnreachable. Reduced from 236 states to 236 states and 264 transitions. [2018-06-22 10:54:32,411 INFO ]: Start accepts. Automaton has 236 states and 264 transitions. Word has length 109 [2018-06-22 10:54:32,413 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:32,413 INFO ]: Abstraction has 236 states and 264 transitions. [2018-06-22 10:54:32,413 INFO ]: Interpolant automaton has 49 states. [2018-06-22 10:54:32,413 INFO ]: Start isEmpty. Operand 236 states and 264 transitions. [2018-06-22 10:54:32,414 INFO ]: Finished isEmpty. Found accepting run of length 114 [2018-06-22 10:54:32,414 INFO ]: Found error trace [2018-06-22 10:54:32,415 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:32,415 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:32,415 INFO ]: Analyzing trace with hash -803032132, now seen corresponding path program 2 times [2018-06-22 10:54:32,415 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:32,415 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:32,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:32,415 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:54:32,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:32,436 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:33,020 INFO ]: Checked inductivity of 42 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 10:54:33,020 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:54:33,020 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 10:54:33,026 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:54:33,095 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:54:33,095 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:33,102 INFO ]: Computing forward predicates... [2018-06-22 10:54:33,971 INFO ]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 10:54:33,991 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:54:33,991 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 53 [2018-06-22 10:54:33,992 INFO ]: Interpolant automaton has 53 states [2018-06-22 10:54:33,992 INFO ]: Constructing interpolant automaton starting with 53 interpolants. [2018-06-22 10:54:33,993 INFO ]: CoverageRelationStatistics Valid=126, Invalid=2630, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 10:54:33,994 INFO ]: Start difference. First operand 236 states and 264 transitions. Second operand 53 states. [2018-06-22 10:54:35,211 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:35,211 INFO ]: Finished difference Result 266 states and 295 transitions. [2018-06-22 10:54:35,212 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 10:54:35,212 INFO ]: Start accepts. Automaton has 53 states. Word has length 113 [2018-06-22 10:54:35,212 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:35,214 INFO ]: With dead ends: 266 [2018-06-22 10:54:35,214 INFO ]: Without dead ends: 250 [2018-06-22 10:54:35,215 INFO ]: 0 DeclaredPredicates, 166 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=293, Invalid=5713, Unknown=0, NotChecked=0, Total=6006 [2018-06-22 10:54:35,215 INFO ]: Start minimizeSevpa. Operand 250 states. [2018-06-22 10:54:35,226 INFO ]: Finished minimizeSevpa. Reduced states from 250 to 228. [2018-06-22 10:54:35,226 INFO ]: Start removeUnreachable. Operand 228 states. [2018-06-22 10:54:35,229 INFO ]: Finished removeUnreachable. Reduced from 228 states to 228 states and 255 transitions. [2018-06-22 10:54:35,229 INFO ]: Start accepts. Automaton has 228 states and 255 transitions. Word has length 113 [2018-06-22 10:54:35,229 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:35,229 INFO ]: Abstraction has 228 states and 255 transitions. [2018-06-22 10:54:35,229 INFO ]: Interpolant automaton has 53 states. [2018-06-22 10:54:35,229 INFO ]: Start isEmpty. Operand 228 states and 255 transitions. [2018-06-22 10:54:35,231 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:54:35,231 INFO ]: Found error trace [2018-06-22 10:54:35,231 INFO ]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:35,231 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:35,231 INFO ]: Analyzing trace with hash -1030290286, now seen corresponding path program 3 times [2018-06-22 10:54:35,231 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:35,231 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:35,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:35,234 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:54:35,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:35,254 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:35,785 WARN ]: Spent 198.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-06-22 10:54:36,457 INFO ]: Checked inductivity of 83 backedges. 25 proven. 22 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 10:54:36,457 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:54:36,457 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 10:54:36,462 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:54:36,527 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 10:54:36,527 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:36,532 INFO ]: Computing forward predicates... [2018-06-22 10:54:37,237 INFO ]: Checked inductivity of 83 backedges. 32 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-22 10:54:37,258 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:54:37,258 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 18] total 48 [2018-06-22 10:54:37,258 INFO ]: Interpolant automaton has 48 states [2018-06-22 10:54:37,259 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-22 10:54:37,259 INFO ]: CoverageRelationStatistics Valid=108, Invalid=2148, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 10:54:37,259 INFO ]: Start difference. First operand 228 states and 255 transitions. Second operand 48 states. [2018-06-22 10:54:38,643 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:38,643 INFO ]: Finished difference Result 280 states and 312 transitions. [2018-06-22 10:54:38,644 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 10:54:38,644 INFO ]: Start accepts. Automaton has 48 states. Word has length 133 [2018-06-22 10:54:38,644 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:38,645 INFO ]: With dead ends: 280 [2018-06-22 10:54:38,645 INFO ]: Without dead ends: 272 [2018-06-22 10:54:38,646 INFO ]: 0 DeclaredPredicates, 192 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=277, Invalid=4979, Unknown=0, NotChecked=0, Total=5256 [2018-06-22 10:54:38,646 INFO ]: Start minimizeSevpa. Operand 272 states. [2018-06-22 10:54:38,658 INFO ]: Finished minimizeSevpa. Reduced states from 272 to 264. [2018-06-22 10:54:38,658 INFO ]: Start removeUnreachable. Operand 264 states. [2018-06-22 10:54:38,660 INFO ]: Finished removeUnreachable. Reduced from 264 states to 264 states and 296 transitions. [2018-06-22 10:54:38,660 INFO ]: Start accepts. Automaton has 264 states and 296 transitions. Word has length 133 [2018-06-22 10:54:38,660 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:38,660 INFO ]: Abstraction has 264 states and 296 transitions. [2018-06-22 10:54:38,660 INFO ]: Interpolant automaton has 48 states. [2018-06-22 10:54:38,660 INFO ]: Start isEmpty. Operand 264 states and 296 transitions. [2018-06-22 10:54:38,664 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:54:38,664 INFO ]: Found error trace [2018-06-22 10:54:38,665 INFO ]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:38,665 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:38,665 INFO ]: Analyzing trace with hash -697531305, now seen corresponding path program 1 times [2018-06-22 10:54:38,665 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:38,665 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:38,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:38,665 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:54:38,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:38,688 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:39,309 INFO ]: Checked inductivity of 78 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 10:54:39,309 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:54:39,309 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 10:54:39,315 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:39,393 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:39,401 INFO ]: Computing forward predicates... [2018-06-22 10:54:40,470 INFO ]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 10:54:40,490 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:54:40,490 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 63 [2018-06-22 10:54:40,490 INFO ]: Interpolant automaton has 63 states [2018-06-22 10:54:40,490 INFO ]: Constructing interpolant automaton starting with 63 interpolants. [2018-06-22 10:54:40,491 INFO ]: CoverageRelationStatistics Valid=162, Invalid=3744, Unknown=0, NotChecked=0, Total=3906 [2018-06-22 10:54:40,491 INFO ]: Start difference. First operand 264 states and 296 transitions. Second operand 63 states. [2018-06-22 10:54:42,598 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:42,599 INFO ]: Finished difference Result 494 states and 564 transitions. [2018-06-22 10:54:42,599 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-06-22 10:54:42,599 INFO ]: Start accepts. Automaton has 63 states. Word has length 133 [2018-06-22 10:54:42,599 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:42,602 INFO ]: With dead ends: 494 [2018-06-22 10:54:42,602 INFO ]: Without dead ends: 478 [2018-06-22 10:54:42,604 INFO ]: 0 DeclaredPredicates, 201 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1747 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=433, Invalid=8879, Unknown=0, NotChecked=0, Total=9312 [2018-06-22 10:54:42,605 INFO ]: Start minimizeSevpa. Operand 478 states. [2018-06-22 10:54:42,638 INFO ]: Finished minimizeSevpa. Reduced states from 478 to 478. [2018-06-22 10:54:42,638 INFO ]: Start removeUnreachable. Operand 478 states. [2018-06-22 10:54:42,641 INFO ]: Finished removeUnreachable. Reduced from 478 states to 478 states and 545 transitions. [2018-06-22 10:54:42,641 INFO ]: Start accepts. Automaton has 478 states and 545 transitions. Word has length 133 [2018-06-22 10:54:42,642 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:42,642 INFO ]: Abstraction has 478 states and 545 transitions. [2018-06-22 10:54:42,642 INFO ]: Interpolant automaton has 63 states. [2018-06-22 10:54:42,642 INFO ]: Start isEmpty. Operand 478 states and 545 transitions. [2018-06-22 10:54:42,645 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:54:42,645 INFO ]: Found error trace [2018-06-22 10:54:42,645 INFO ]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:42,645 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:42,645 INFO ]: Analyzing trace with hash -772557609, now seen corresponding path program 2 times [2018-06-22 10:54:42,645 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:42,645 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:42,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:42,646 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:42,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:42,662 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:43,352 INFO ]: Checked inductivity of 78 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 10:54:43,352 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:54:43,352 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 10:54:43,359 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:54:43,474 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:54:43,474 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:43,484 INFO ]: Computing forward predicates... [2018-06-22 10:54:44,542 INFO ]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 10:54:44,562 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:54:44,562 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 63 [2018-06-22 10:54:44,562 INFO ]: Interpolant automaton has 63 states [2018-06-22 10:54:44,562 INFO ]: Constructing interpolant automaton starting with 63 interpolants. [2018-06-22 10:54:44,563 INFO ]: CoverageRelationStatistics Valid=162, Invalid=3744, Unknown=0, NotChecked=0, Total=3906 [2018-06-22 10:54:44,563 INFO ]: Start difference. First operand 478 states and 545 transitions. Second operand 63 states. [2018-06-22 10:54:46,515 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:46,515 INFO ]: Finished difference Result 670 states and 769 transitions. [2018-06-22 10:54:46,516 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-06-22 10:54:46,516 INFO ]: Start accepts. Automaton has 63 states. Word has length 133 [2018-06-22 10:54:46,516 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:46,520 INFO ]: With dead ends: 670 [2018-06-22 10:54:46,520 INFO ]: Without dead ends: 654 [2018-06-22 10:54:46,522 INFO ]: 0 DeclaredPredicates, 201 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1747 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=433, Invalid=8879, Unknown=0, NotChecked=0, Total=9312 [2018-06-22 10:54:46,523 INFO ]: Start minimizeSevpa. Operand 654 states. [2018-06-22 10:54:46,549 INFO ]: Finished minimizeSevpa. Reduced states from 654 to 654. [2018-06-22 10:54:46,550 INFO ]: Start removeUnreachable. Operand 654 states. [2018-06-22 10:54:46,553 INFO ]: Finished removeUnreachable. Reduced from 654 states to 654 states and 750 transitions. [2018-06-22 10:54:46,553 INFO ]: Start accepts. Automaton has 654 states and 750 transitions. Word has length 133 [2018-06-22 10:54:46,553 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:46,553 INFO ]: Abstraction has 654 states and 750 transitions. [2018-06-22 10:54:46,553 INFO ]: Interpolant automaton has 63 states. [2018-06-22 10:54:46,553 INFO ]: Start isEmpty. Operand 654 states and 750 transitions. [2018-06-22 10:54:46,557 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:54:46,557 INFO ]: Found error trace [2018-06-22 10:54:46,558 INFO ]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:46,558 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:46,558 INFO ]: Analyzing trace with hash -1291958205, now seen corresponding path program 1 times [2018-06-22 10:54:46,558 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:46,558 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:46,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:46,559 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:54:46,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:46,585 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:46,941 WARN ]: Spent 191.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-06-22 10:54:47,276 INFO ]: Checked inductivity of 147 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-06-22 10:54:47,276 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:54:47,276 INFO ]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-06-22 10:54:47,276 INFO ]: Interpolant automaton has 22 states [2018-06-22 10:54:47,276 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 10:54:47,276 INFO ]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:54:47,276 INFO ]: Start difference. First operand 654 states and 750 transitions. Second operand 22 states. [2018-06-22 10:54:47,510 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:47,510 INFO ]: Finished difference Result 670 states and 766 transitions. [2018-06-22 10:54:47,510 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 10:54:47,510 INFO ]: Start accepts. Automaton has 22 states. Word has length 157 [2018-06-22 10:54:47,511 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:47,514 INFO ]: With dead ends: 670 [2018-06-22 10:54:47,514 INFO ]: Without dead ends: 662 [2018-06-22 10:54:47,515 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:54:47,515 INFO ]: Start minimizeSevpa. Operand 662 states. [2018-06-22 10:54:47,549 INFO ]: Finished minimizeSevpa. Reduced states from 662 to 576. [2018-06-22 10:54:47,549 INFO ]: Start removeUnreachable. Operand 576 states. [2018-06-22 10:54:47,551 INFO ]: Finished removeUnreachable. Reduced from 576 states to 576 states and 658 transitions. [2018-06-22 10:54:47,551 INFO ]: Start accepts. Automaton has 576 states and 658 transitions. Word has length 157 [2018-06-22 10:54:47,552 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:47,552 INFO ]: Abstraction has 576 states and 658 transitions. [2018-06-22 10:54:47,552 INFO ]: Interpolant automaton has 22 states. [2018-06-22 10:54:47,552 INFO ]: Start isEmpty. Operand 576 states and 658 transitions. [2018-06-22 10:54:47,555 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:54:47,555 INFO ]: Found error trace [2018-06-22 10:54:47,555 INFO ]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:47,555 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:47,556 INFO ]: Analyzing trace with hash 1286864848, now seen corresponding path program 3 times [2018-06-22 10:54:47,556 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:47,556 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:47,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:47,556 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:47,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:47,575 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:48,158 INFO ]: Checked inductivity of 157 backedges. 53 proven. 25 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-22 10:54:48,158 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:54:48,158 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 10:54:48,164 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:54:48,241 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 10:54:48,241 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:48,248 INFO ]: Computing forward predicates... [2018-06-22 10:54:48,691 INFO ]: Checked inductivity of 157 backedges. 57 proven. 11 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-06-22 10:54:48,724 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:54:48,724 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 18] total 49 [2018-06-22 10:54:48,725 INFO ]: Interpolant automaton has 49 states [2018-06-22 10:54:48,725 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-22 10:54:48,725 INFO ]: CoverageRelationStatistics Valid=112, Invalid=2240, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 10:54:48,725 INFO ]: Start difference. First operand 576 states and 658 transitions. Second operand 49 states. [2018-06-22 10:54:49,959 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:49,959 INFO ]: Finished difference Result 646 states and 737 transitions. [2018-06-22 10:54:49,959 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 10:54:49,959 INFO ]: Start accepts. Automaton has 49 states. Word has length 157 [2018-06-22 10:54:49,959 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:49,963 INFO ]: With dead ends: 646 [2018-06-22 10:54:49,963 INFO ]: Without dead ends: 638 [2018-06-22 10:54:49,964 INFO ]: 0 DeclaredPredicates, 222 GetRequests, 147 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=284, Invalid=5118, Unknown=0, NotChecked=0, Total=5402 [2018-06-22 10:54:49,964 INFO ]: Start minimizeSevpa. Operand 638 states. [2018-06-22 10:54:49,995 INFO ]: Finished minimizeSevpa. Reduced states from 638 to 638. [2018-06-22 10:54:49,995 INFO ]: Start removeUnreachable. Operand 638 states. [2018-06-22 10:54:49,997 INFO ]: Finished removeUnreachable. Reduced from 638 states to 638 states and 729 transitions. [2018-06-22 10:54:49,997 INFO ]: Start accepts. Automaton has 638 states and 729 transitions. Word has length 157 [2018-06-22 10:54:49,998 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:49,998 INFO ]: Abstraction has 638 states and 729 transitions. [2018-06-22 10:54:49,998 INFO ]: Interpolant automaton has 49 states. [2018-06-22 10:54:49,998 INFO ]: Start isEmpty. Operand 638 states and 729 transitions. [2018-06-22 10:54:50,002 INFO ]: Finished isEmpty. Found accepting run of length 158 [2018-06-22 10:54:50,002 INFO ]: Found error trace [2018-06-22 10:54:50,002 INFO ]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:50,002 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:50,002 INFO ]: Analyzing trace with hash 1684590214, now seen corresponding path program 3 times [2018-06-22 10:54:50,002 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:50,002 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:50,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:50,003 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:54:50,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:50,019 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:50,467 INFO ]: Checked inductivity of 147 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-06-22 10:54:50,467 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:54:50,467 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 10:54:50,472 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:54:50,553 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 10:54:50,553 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:50,559 INFO ]: Computing forward predicates... [2018-06-22 10:54:50,921 INFO ]: Checked inductivity of 147 backedges. 53 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-06-22 10:54:50,942 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:54:50,942 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 39 [2018-06-22 10:54:50,942 INFO ]: Interpolant automaton has 39 states [2018-06-22 10:54:50,942 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 10:54:50,942 INFO ]: CoverageRelationStatistics Valid=79, Invalid=1403, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 10:54:50,942 INFO ]: Start difference. First operand 638 states and 729 transitions. Second operand 39 states. [2018-06-22 10:54:51,639 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:51,639 INFO ]: Finished difference Result 628 states and 714 transitions. [2018-06-22 10:54:51,639 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 10:54:51,639 INFO ]: Start accepts. Automaton has 39 states. Word has length 157 [2018-06-22 10:54:51,639 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:51,643 INFO ]: With dead ends: 628 [2018-06-22 10:54:51,643 INFO ]: Without dead ends: 620 [2018-06-22 10:54:51,643 INFO ]: 0 DeclaredPredicates, 211 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=2817, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 10:54:51,644 INFO ]: Start minimizeSevpa. Operand 620 states. [2018-06-22 10:54:51,675 INFO ]: Finished minimizeSevpa. Reduced states from 620 to 466. [2018-06-22 10:54:51,675 INFO ]: Start removeUnreachable. Operand 466 states. [2018-06-22 10:54:51,677 INFO ]: Finished removeUnreachable. Reduced from 466 states to 466 states and 528 transitions. [2018-06-22 10:54:51,677 INFO ]: Start accepts. Automaton has 466 states and 528 transitions. Word has length 157 [2018-06-22 10:54:51,677 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:51,678 INFO ]: Abstraction has 466 states and 528 transitions. [2018-06-22 10:54:51,678 INFO ]: Interpolant automaton has 39 states. [2018-06-22 10:54:51,678 INFO ]: Start isEmpty. Operand 466 states and 528 transitions. [2018-06-22 10:54:51,680 INFO ]: Finished isEmpty. Found accepting run of length 166 [2018-06-22 10:54:51,680 INFO ]: Found error trace [2018-06-22 10:54:51,680 INFO ]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:51,680 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:51,681 INFO ]: Analyzing trace with hash 1761679283, now seen corresponding path program 4 times [2018-06-22 10:54:51,681 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:51,681 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:51,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:51,681 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:54:51,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:51,701 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:52,243 INFO ]: Checked inductivity of 169 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-06-22 10:54:52,243 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:54:52,243 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 10:54:52,249 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:54:52,341 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:54:52,341 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:52,348 INFO ]: Computing forward predicates... [2018-06-22 10:54:54,153 INFO ]: Checked inductivity of 169 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-06-22 10:54:54,173 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:54:54,173 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 43] total 72 [2018-06-22 10:54:54,174 INFO ]: Interpolant automaton has 72 states [2018-06-22 10:54:54,174 INFO ]: Constructing interpolant automaton starting with 72 interpolants. [2018-06-22 10:54:54,174 INFO ]: CoverageRelationStatistics Valid=157, Invalid=4955, Unknown=0, NotChecked=0, Total=5112 [2018-06-22 10:54:54,174 INFO ]: Start difference. First operand 466 states and 528 transitions. Second operand 72 states. [2018-06-22 10:54:56,936 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:56,936 INFO ]: Finished difference Result 572 states and 645 transitions. [2018-06-22 10:54:56,936 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-06-22 10:54:56,936 INFO ]: Start accepts. Automaton has 72 states. Word has length 165 [2018-06-22 10:54:56,936 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:56,938 INFO ]: With dead ends: 572 [2018-06-22 10:54:56,938 INFO ]: Without dead ends: 556 [2018-06-22 10:54:56,939 INFO ]: 0 DeclaredPredicates, 252 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2091 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=427, Invalid=13145, Unknown=0, NotChecked=0, Total=13572 [2018-06-22 10:54:56,940 INFO ]: Start minimizeSevpa. Operand 556 states. [2018-06-22 10:54:56,966 INFO ]: Finished minimizeSevpa. Reduced states from 556 to 512. [2018-06-22 10:54:56,966 INFO ]: Start removeUnreachable. Operand 512 states. [2018-06-22 10:54:56,967 INFO ]: Finished removeUnreachable. Reduced from 512 states to 512 states and 581 transitions. [2018-06-22 10:54:56,968 INFO ]: Start accepts. Automaton has 512 states and 581 transitions. Word has length 165 [2018-06-22 10:54:56,968 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:56,968 INFO ]: Abstraction has 512 states and 581 transitions. [2018-06-22 10:54:56,968 INFO ]: Interpolant automaton has 72 states. [2018-06-22 10:54:56,968 INFO ]: Start isEmpty. Operand 512 states and 581 transitions. [2018-06-22 10:54:56,970 INFO ]: Finished isEmpty. Found accepting run of length 166 [2018-06-22 10:54:56,970 INFO ]: Found error trace [2018-06-22 10:54:56,970 INFO ]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:56,970 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:56,970 INFO ]: Analyzing trace with hash -960061960, now seen corresponding path program 4 times [2018-06-22 10:54:56,970 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:56,970 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:56,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:56,971 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:54:56,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:56,989 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:57,492 WARN ]: Spent 184.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-06-22 10:54:57,899 INFO ]: Checked inductivity of 169 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-06-22 10:54:57,900 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:54:57,900 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 10:54:57,905 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:54:57,997 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:54:57,997 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:58,004 INFO ]: Computing forward predicates... [2018-06-22 10:55:00,588 INFO ]: Checked inductivity of 169 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-06-22 10:55:00,608 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:55:00,608 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 43] total 72 [2018-06-22 10:55:00,609 INFO ]: Interpolant automaton has 72 states [2018-06-22 10:55:00,609 INFO ]: Constructing interpolant automaton starting with 72 interpolants. [2018-06-22 10:55:00,609 INFO ]: CoverageRelationStatistics Valid=157, Invalid=4955, Unknown=0, NotChecked=0, Total=5112 [2018-06-22 10:55:00,610 INFO ]: Start difference. First operand 512 states and 581 transitions. Second operand 72 states. [2018-06-22 10:55:01,340 WARN ]: Spent 152.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-06-22 10:55:03,554 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:03,554 INFO ]: Finished difference Result 632 states and 714 transitions. [2018-06-22 10:55:03,554 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-06-22 10:55:03,554 INFO ]: Start accepts. Automaton has 72 states. Word has length 165 [2018-06-22 10:55:03,554 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:03,556 INFO ]: With dead ends: 632 [2018-06-22 10:55:03,556 INFO ]: Without dead ends: 616 [2018-06-22 10:55:03,558 INFO ]: 0 DeclaredPredicates, 252 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2091 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=427, Invalid=13145, Unknown=0, NotChecked=0, Total=13572 [2018-06-22 10:55:03,558 INFO ]: Start minimizeSevpa. Operand 616 states. [2018-06-22 10:55:03,582 INFO ]: Finished minimizeSevpa. Reduced states from 616 to 600. [2018-06-22 10:55:03,582 INFO ]: Start removeUnreachable. Operand 600 states. [2018-06-22 10:55:03,584 INFO ]: Finished removeUnreachable. Reduced from 600 states to 600 states and 682 transitions. [2018-06-22 10:55:03,584 INFO ]: Start accepts. Automaton has 600 states and 682 transitions. Word has length 165 [2018-06-22 10:55:03,585 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:03,585 INFO ]: Abstraction has 600 states and 682 transitions. [2018-06-22 10:55:03,585 INFO ]: Interpolant automaton has 72 states. [2018-06-22 10:55:03,585 INFO ]: Start isEmpty. Operand 600 states and 682 transitions. [2018-06-22 10:55:03,587 INFO ]: Finished isEmpty. Found accepting run of length 166 [2018-06-22 10:55:03,587 INFO ]: Found error trace [2018-06-22 10:55:03,587 INFO ]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:55:03,587 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:03,588 INFO ]: Analyzing trace with hash 1012155640, now seen corresponding path program 5 times [2018-06-22 10:55:03,588 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:03,588 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:03,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:03,588 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:55:03,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:03,609 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:04,820 INFO ]: Checked inductivity of 169 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-06-22 10:55:04,820 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:55:04,820 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 10:55:04,826 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:55:04,899 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 10:55:04,899 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:04,904 INFO ]: Computing forward predicates... [2018-06-22 10:55:05,283 INFO ]: Checked inductivity of 169 backedges. 70 proven. 1 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-06-22 10:55:05,303 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:55:05,303 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 10] total 48 [2018-06-22 10:55:05,303 INFO ]: Interpolant automaton has 48 states [2018-06-22 10:55:05,303 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-22 10:55:05,303 INFO ]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 10:55:05,304 INFO ]: Start difference. First operand 600 states and 682 transitions. Second operand 48 states. [2018-06-22 10:55:06,221 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:06,221 INFO ]: Finished difference Result 530 states and 591 transitions. [2018-06-22 10:55:06,221 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 10:55:06,221 INFO ]: Start accepts. Automaton has 48 states. Word has length 165 [2018-06-22 10:55:06,221 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:06,223 INFO ]: With dead ends: 530 [2018-06-22 10:55:06,223 INFO ]: Without dead ends: 530 [2018-06-22 10:55:06,224 INFO ]: 0 DeclaredPredicates, 224 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=231, Invalid=3551, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 10:55:06,224 INFO ]: Start minimizeSevpa. Operand 530 states. [2018-06-22 10:55:06,245 INFO ]: Finished minimizeSevpa. Reduced states from 530 to 430. [2018-06-22 10:55:06,245 INFO ]: Start removeUnreachable. Operand 430 states. [2018-06-22 10:55:06,247 INFO ]: Finished removeUnreachable. Reduced from 430 states to 430 states and 479 transitions. [2018-06-22 10:55:06,247 INFO ]: Start accepts. Automaton has 430 states and 479 transitions. Word has length 165 [2018-06-22 10:55:06,247 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:06,247 INFO ]: Abstraction has 430 states and 479 transitions. [2018-06-22 10:55:06,247 INFO ]: Interpolant automaton has 48 states. [2018-06-22 10:55:06,247 INFO ]: Start isEmpty. Operand 430 states and 479 transitions. [2018-06-22 10:55:06,249 INFO ]: Finished isEmpty. Found accepting run of length 182 [2018-06-22 10:55:06,249 INFO ]: Found error trace [2018-06-22 10:55:06,249 INFO ]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:55:06,249 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:06,249 INFO ]: Analyzing trace with hash -1561183563, now seen corresponding path program 4 times [2018-06-22 10:55:06,249 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:06,249 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:06,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:06,250 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:55:06,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:06,270 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:06,792 WARN ]: Spent 196.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-06-22 10:55:07,408 INFO ]: Checked inductivity of 240 backedges. 77 proven. 27 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-06-22 10:55:07,408 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:55:07,421 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 10:55:07,427 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:55:07,529 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:55:07,529 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:07,538 INFO ]: Computing forward predicates... [2018-06-22 10:55:10,802 INFO ]: Checked inductivity of 240 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-06-22 10:55:10,822 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:55:10,822 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 44] total 77 [2018-06-22 10:55:10,822 INFO ]: Interpolant automaton has 77 states [2018-06-22 10:55:10,822 INFO ]: Constructing interpolant automaton starting with 77 interpolants. [2018-06-22 10:55:10,823 INFO ]: CoverageRelationStatistics Valid=236, Invalid=5616, Unknown=0, NotChecked=0, Total=5852 [2018-06-22 10:55:10,823 INFO ]: Start difference. First operand 430 states and 479 transitions. Second operand 77 states. [2018-06-22 10:55:12,793 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:12,793 INFO ]: Finished difference Result 634 states and 709 transitions. [2018-06-22 10:55:12,796 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-06-22 10:55:12,796 INFO ]: Start accepts. Automaton has 77 states. Word has length 181 [2018-06-22 10:55:12,797 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:12,799 INFO ]: With dead ends: 634 [2018-06-22 10:55:12,799 INFO ]: Without dead ends: 618 [2018-06-22 10:55:12,802 INFO ]: 0 DeclaredPredicates, 275 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3257 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=717, Invalid=14783, Unknown=0, NotChecked=0, Total=15500 [2018-06-22 10:55:12,803 INFO ]: Start minimizeSevpa. Operand 618 states. [2018-06-22 10:55:12,826 INFO ]: Finished minimizeSevpa. Reduced states from 618 to 542. [2018-06-22 10:55:12,826 INFO ]: Start removeUnreachable. Operand 542 states. [2018-06-22 10:55:12,829 INFO ]: Finished removeUnreachable. Reduced from 542 states to 542 states and 607 transitions. [2018-06-22 10:55:12,829 INFO ]: Start accepts. Automaton has 542 states and 607 transitions. Word has length 181 [2018-06-22 10:55:12,829 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:12,829 INFO ]: Abstraction has 542 states and 607 transitions. [2018-06-22 10:55:12,829 INFO ]: Interpolant automaton has 77 states. [2018-06-22 10:55:12,829 INFO ]: Start isEmpty. Operand 542 states and 607 transitions. [2018-06-22 10:55:12,832 INFO ]: Finished isEmpty. Found accepting run of length 182 [2018-06-22 10:55:12,832 INFO ]: Found error trace [2018-06-22 10:55:12,832 INFO ]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:55:12,832 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:12,832 INFO ]: Analyzing trace with hash 208513727, now seen corresponding path program 5 times [2018-06-22 10:55:12,832 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:12,832 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:12,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:12,833 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:55:12,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:12,852 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:13,377 WARN ]: Spent 197.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 Received shutdown request... [2018-06-22 10:55:13,984 WARN ]: Removed 1 from assertion stack [2018-06-22 10:55:13,985 WARN ]: Verification canceled [2018-06-22 10:55:14,135 WARN ]: Timeout [2018-06-22 10:55:14,135 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:55:14 BoogieIcfgContainer [2018-06-22 10:55:14,135 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:55:14,136 INFO ]: Toolchain (without parser) took 58491.98 ms. Allocated memory was 308.3 MB in the beginning and 951.1 MB in the end (delta: 642.8 MB). Free memory was 251.6 MB in the beginning and 914.0 MB in the end (delta: -662.3 MB). Peak memory consumption was 571.7 MB. Max. memory is 3.6 GB. [2018-06-22 10:55:14,137 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:55:14,137 INFO ]: ChcToBoogie took 53.99 ms. Allocated memory is still 308.3 MB. Free memory was 250.6 MB in the beginning and 248.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:55:14,137 INFO ]: Boogie Preprocessor took 84.92 ms. Allocated memory is still 308.3 MB. Free memory was 248.7 MB in the beginning and 247.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 10:55:14,137 INFO ]: RCFGBuilder took 518.32 ms. Allocated memory is still 308.3 MB. Free memory was 246.7 MB in the beginning and 226.6 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:55:14,138 INFO ]: TraceAbstraction took 57824.27 ms. Allocated memory was 308.3 MB in the beginning and 951.1 MB in the end (delta: 642.8 MB). Free memory was 226.6 MB in the beginning and 914.0 MB in the end (delta: -687.3 MB). Peak memory consumption was 546.7 MB. Max. memory is 3.6 GB. [2018-06-22 10:55:14,139 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 53.99 ms. Allocated memory is still 308.3 MB. Free memory was 250.6 MB in the beginning and 248.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 84.92 ms. Allocated memory is still 308.3 MB. Free memory was 248.7 MB in the beginning and 247.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 518.32 ms. Allocated memory is still 308.3 MB. Free memory was 246.7 MB in the beginning and 226.6 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57824.27 ms. Allocated memory was 308.3 MB in the beginning and 951.1 MB in the end (delta: 642.8 MB). Free memory was 226.6 MB in the beginning and 914.0 MB in the end (delta: -687.3 MB). Peak memory consumption was 546.7 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 analyzing trace of length 182 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 96 locations, 1 error locations. TIMEOUT Result, 57.7s OverallTime, 22 OverallIterations, 6 TraceHistogramMax, 23.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1920 SDtfs, 141 SDslu, 58552 SDs, 0 SdLazy, 16866 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2825 GetRequests, 1596 SyntacticMatches, 29 SemanticMatches, 1200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15844 ImplicationChecksByTransitivity, 38.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=654occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 558 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 29.5s InterpolantComputationTime, 4414 NumberOfCodeBlocks, 4231 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 4380 ConstructedInterpolants, 0 QuantifiedInterpolants, 1917308 SizeOfPredicates, 63 NumberOfNonLiveVariables, 10187 ConjunctsInSsa, 702 ConjunctsInUnsatCore, 34 InterpolantComputations, 8 PerfectInterpolantSequences, 2346/3103 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/34.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-55-14-155.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/34.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-55-14-155.csv Completed graceful shutdown