java -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/chccomp2018/chcToBoogie_automizer.epf -i /storage/chc-comp/vmt-chc-benchmarks/lustre/Gas_e7_435_e8_532.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-55b8104 [2018-06-18 15:45:30,107 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-18 15:45:30,110 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-18 15:45:30,126 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-18 15:45:30,126 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-18 15:45:30,129 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-18 15:45:30,131 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-18 15:45:30,133 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-18 15:45:30,135 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-18 15:45:30,137 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-18 15:45:30,137 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-18 15:45:30,138 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-18 15:45:30,139 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-18 15:45:30,142 INFO L177 SettingsManager]: ChcToBoogie provides no preferences, ignoring... [2018-06-18 15:45:30,142 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-18 15:45:30,143 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-18 15:45:30,145 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-18 15:45:30,154 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-18 15:45:30,159 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-18 15:45:30,160 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-18 15:45:30,161 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-18 15:45:30,163 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-18 15:45:30,163 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-18 15:45:30,164 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-18 15:45:30,166 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-18 15:45:30,167 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-18 15:45:30,168 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-18 15:45:30,169 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-18 15:45:30,171 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-18 15:45:30,171 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-18 15:45:30,172 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-18 15:45:30,173 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-18 15:45:30,173 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-18 15:45:30,173 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-18 15:45:30,178 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-18 15:45:30,178 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chccomp2018/chcToBoogie_automizer.epf [2018-06-18 15:45:30,203 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-18 15:45:30,203 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-18 15:45:30,204 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-18 15:45:30,204 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-18 15:45:30,209 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-18 15:45:30,209 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-18 15:45:30,209 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-18 15:45:30,209 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-18 15:45:30,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-18 15:45:30,210 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-18 15:45:30,210 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-18 15:45:30,210 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-18 15:45:30,210 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-18 15:45:30,210 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-18 15:45:30,210 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-18 15:45:30,211 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-18 15:45:30,211 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-18 15:45:30,213 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-18 15:45:30,214 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-18 15:45:30,265 INFO ]: Repository-Root is: /tmp [2018-06-18 15:45:30,283 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-18 15:45:30,287 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-18 15:45:30,288 INFO ]: Initializing SmtParser... [2018-06-18 15:45:30,289 INFO ]: SmtParser initialized [2018-06-18 15:45:30,289 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/Gas_e7_435_e8_532.smt2 [2018-06-18 15:45:30,291 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-18 15:45:30,366 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/Gas_e7_435_e8_532.smt2 unknown [2018-06-18 15:45:30,602 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/Gas_e7_435_e8_532.smt2 [2018-06-18 15:45:30,607 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-18 15:45:30,620 INFO ]: Walking toolchain with 4 elements. [2018-06-18 15:45:30,621 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-18 15:45:30,621 INFO ]: Initializing ChcToBoogie... [2018-06-18 15:45:30,621 INFO ]: ChcToBoogie initialized [2018-06-18 15:45:30,628 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 03:45:30" (1/1) ... [2018-06-18 15:45:30,698 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 03:45:30 Unit [2018-06-18 15:45:30,698 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-18 15:45:30,699 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-18 15:45:30,699 INFO ]: Initializing Boogie Preprocessor... [2018-06-18 15:45:30,699 INFO ]: Boogie Preprocessor initialized [2018-06-18 15:45:30,725 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 03:45:30" (1/1) ... [2018-06-18 15:45:30,725 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 03:45:30" (1/1) ... [2018-06-18 15:45:30,738 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 03:45:30" (1/1) ... [2018-06-18 15:45:30,739 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 03:45:30" (1/1) ... [2018-06-18 15:45:30,751 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 03:45:30" (1/1) ... [2018-06-18 15:45:30,753 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 03:45:30" (1/1) ... [2018-06-18 15:45:30,754 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 03:45:30" (1/1) ... [2018-06-18 15:45:30,756 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-18 15:45:30,756 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-18 15:45:30,756 INFO ]: Initializing RCFGBuilder... [2018-06-18 15:45:30,756 INFO ]: RCFGBuilder initialized [2018-06-18 15:45:30,757 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 03:45:30" (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-18 15:45:30,780 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-18 15:45:30,780 INFO ]: Found specification of procedure False [2018-06-18 15:45:30,781 INFO ]: Found implementation of procedure False [2018-06-18 15:45:30,781 INFO ]: Specification and implementation of procedure state given in one single declaration [2018-06-18 15:45:30,781 INFO ]: Found specification of procedure state [2018-06-18 15:45:30,781 INFO ]: Found implementation of procedure state [2018-06-18 15:45:30,781 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-18 15:45:30,781 INFO ]: Found specification of procedure Ultimate.START [2018-06-18 15:45:30,781 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-18 15:45:31,133 INFO ]: Using library mode [2018-06-18 15:45:31,134 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 03:45:31 BoogieIcfgContainer [2018-06-18 15:45:31,134 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-18 15:45:31,135 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-18 15:45:31,135 INFO ]: Initializing TraceAbstraction... [2018-06-18 15:45:31,148 INFO ]: TraceAbstraction initialized [2018-06-18 15:45:31,148 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 03:45:30" (1/3) ... [2018-06-18 15:45:31,149 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284c36f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 18.06 03:45:31, skipping insertion in model container [2018-06-18 15:45:31,149 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 03:45:30" (2/3) ... [2018-06-18 15:45:31,149 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284c36f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.06 03:45:31, skipping insertion in model container [2018-06-18 15:45:31,149 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 03:45:31" (3/3) ... [2018-06-18 15:45:31,151 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-18 15:45:31,159 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-18 15:45:31,168 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-18 15:45:31,216 INFO ]: Using default assertion order modulation [2018-06-18 15:45:31,216 INFO ]: Interprodecural is true [2018-06-18 15:45:31,216 INFO ]: Hoare is false [2018-06-18 15:45:31,216 INFO ]: Compute interpolants for FPandBP [2018-06-18 15:45:31,216 INFO ]: Backedges is TWOTRACK [2018-06-18 15:45:31,216 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-18 15:45:31,216 INFO ]: Difference is false [2018-06-18 15:45:31,217 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-18 15:45:31,217 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-18 15:45:31,236 INFO ]: Start isEmpty. Operand 13 states. [2018-06-18 15:45:31,250 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 15:45:31,250 INFO ]: Found error trace [2018-06-18 15:45:31,252 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:45:31,252 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:45:31,259 INFO ]: Analyzing trace with hash -683425083, now seen corresponding path program 1 times [2018-06-18 15:45:31,261 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:45:31,262 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:45:31,315 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:31,315 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 15:45:31,315 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:31,396 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:31,407 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 15:45:31,585 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 15:45:31,587 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 15:45:31,587 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 15:45:31,588 INFO ]: Interpolant automaton has 4 states [2018-06-18 15:45:31,599 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 15:45:31,600 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 15:45:31,602 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-18 15:45:31,674 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 15:45:31,674 INFO ]: Finished difference Result 13 states and 14 transitions. [2018-06-18 15:45:31,674 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 15:45:31,676 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 15:45:31,676 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 15:45:31,688 INFO ]: With dead ends: 13 [2018-06-18 15:45:31,688 INFO ]: Without dead ends: 13 [2018-06-18 15:45:31,690 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 15:45:31,703 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-18 15:45:31,733 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-18 15:45:31,734 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-18 15:45:31,736 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-18 15:45:31,737 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2018-06-18 15:45:31,737 INFO ]: Finished accepts. word is rejected. [2018-06-18 15:45:31,737 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-18 15:45:31,738 INFO ]: Interpolant automaton has 4 states. [2018-06-18 15:45:31,738 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-18 15:45:31,739 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 15:45:31,739 INFO ]: Found error trace [2018-06-18 15:45:31,739 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:45:31,739 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:45:31,740 INFO ]: Analyzing trace with hash 204343015, now seen corresponding path program 1 times [2018-06-18 15:45:31,740 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:45:31,740 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:45:31,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:31,741 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 15:45:31,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:31,779 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:31,780 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 15:45:32,368 WARN ]: Spent 409.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 16 [2018-06-18 15:45:32,534 WARN ]: Spent 140.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-06-18 15:45:32,536 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 15:45:32,536 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 15:45:32,536 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-18 15:45:32,545 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 15:45:32,627 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:32,644 INFO ]: Computing forward predicates... [2018-06-18 15:45:32,927 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 15:45:32,963 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 15:45:32,963 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-18 15:45:32,963 INFO ]: Interpolant automaton has 9 states [2018-06-18 15:45:32,963 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-18 15:45:32,964 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-18 15:45:32,964 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 9 states. [2018-06-18 15:45:33,307 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 15:45:33,307 INFO ]: Finished difference Result 15 states and 16 transitions. [2018-06-18 15:45:33,308 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 15:45:33,308 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-18 15:45:33,308 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 15:45:33,308 INFO ]: With dead ends: 15 [2018-06-18 15:45:33,308 INFO ]: Without dead ends: 15 [2018-06-18 15:45:33,309 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-06-18 15:45:33,310 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-18 15:45:33,312 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-18 15:45:33,312 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-18 15:45:33,313 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-18 15:45:33,313 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-18 15:45:33,313 INFO ]: Finished accepts. word is rejected. [2018-06-18 15:45:33,313 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-18 15:45:33,313 INFO ]: Interpolant automaton has 9 states. [2018-06-18 15:45:33,313 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-18 15:45:33,314 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 15:45:33,314 INFO ]: Found error trace [2018-06-18 15:45:33,314 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:45:33,314 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:45:33,314 INFO ]: Analyzing trace with hash -1649658231, now seen corresponding path program 2 times [2018-06-18 15:45:33,314 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:45:33,314 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:45:33,315 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:33,315 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 15:45:33,315 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:33,365 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:33,366 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 15:45:33,601 WARN ]: Spent 139.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2018-06-18 15:45:33,817 WARN ]: Spent 135.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-06-18 15:45:33,888 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 15:45:33,888 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 15:45:33,888 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-18 15:45:33,898 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 15:45:33,950 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 15:45:33,950 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:33,955 INFO ]: Computing forward predicates... [2018-06-18 15:45:34,406 WARN ]: Spent 123.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-06-18 15:45:34,466 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 15:45:34,501 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 15:45:34,501 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-18 15:45:34,501 INFO ]: Interpolant automaton has 12 states [2018-06-18 15:45:34,502 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-18 15:45:34,502 INFO ]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-18 15:45:34,502 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 12 states. [2018-06-18 15:45:34,920 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 15:45:34,920 INFO ]: Finished difference Result 17 states and 18 transitions. [2018-06-18 15:45:34,920 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-18 15:45:34,920 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-18 15:45:34,921 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 15:45:34,921 INFO ]: With dead ends: 17 [2018-06-18 15:45:34,921 INFO ]: Without dead ends: 17 [2018-06-18 15:45:34,922 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-06-18 15:45:34,922 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-18 15:45:34,924 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-18 15:45:34,925 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-18 15:45:34,925 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-18 15:45:34,925 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 17 [2018-06-18 15:45:34,925 INFO ]: Finished accepts. word is rejected. [2018-06-18 15:45:34,925 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-18 15:45:34,925 INFO ]: Interpolant automaton has 12 states. [2018-06-18 15:45:34,926 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-18 15:45:34,927 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-18 15:45:34,927 INFO ]: Found error trace [2018-06-18 15:45:34,927 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:45:34,927 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:45:34,927 INFO ]: Analyzing trace with hash 2119922091, now seen corresponding path program 3 times [2018-06-18 15:45:34,927 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:45:34,927 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:45:34,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:34,928 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 15:45:34,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:34,970 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:34,971 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 15:45:35,312 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-18 15:45:35,312 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 15:45:35,312 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-18 15:45:35,319 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-18 15:45:35,418 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-18 15:45:35,418 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:35,422 INFO ]: Computing forward predicates... [2018-06-18 15:45:35,837 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-18 15:45:35,867 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 15:45:35,867 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-06-18 15:45:35,867 INFO ]: Interpolant automaton has 16 states [2018-06-18 15:45:35,867 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-18 15:45:35,868 INFO ]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-06-18 15:45:35,868 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 16 states. [2018-06-18 15:45:36,176 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 15:45:36,176 INFO ]: Finished difference Result 19 states and 20 transitions. [2018-06-18 15:45:36,177 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 15:45:36,177 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-18 15:45:36,177 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 15:45:36,177 INFO ]: With dead ends: 19 [2018-06-18 15:45:36,178 INFO ]: Without dead ends: 19 [2018-06-18 15:45:36,178 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-06-18 15:45:36,178 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-18 15:45:36,181 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-18 15:45:36,181 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-18 15:45:36,182 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-18 15:45:36,182 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 21 [2018-06-18 15:45:36,182 INFO ]: Finished accepts. word is rejected. [2018-06-18 15:45:36,182 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-18 15:45:36,182 INFO ]: Interpolant automaton has 16 states. [2018-06-18 15:45:36,182 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-18 15:45:36,183 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-18 15:45:36,183 INFO ]: Found error trace [2018-06-18 15:45:36,183 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:45:36,183 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:45:36,183 INFO ]: Analyzing trace with hash 1762711629, now seen corresponding path program 4 times [2018-06-18 15:45:36,183 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:45:36,183 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:45:36,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:36,186 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 15:45:36,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:36,258 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:36,259 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 15:45:36,471 INFO ]: Checked inductivity of 36 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-18 15:45:36,472 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 15:45:36,472 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-18 15:45:36,481 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-18 15:45:36,573 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-18 15:45:36,573 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:36,578 INFO ]: Computing forward predicates... [2018-06-18 15:45:36,751 INFO ]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-18 15:45:36,771 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 15:45:36,773 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-06-18 15:45:36,774 INFO ]: Interpolant automaton has 17 states [2018-06-18 15:45:36,774 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-18 15:45:36,774 INFO ]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-06-18 15:45:36,774 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 17 states. [2018-06-18 15:45:37,046 WARN ]: Spent 133.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2018-06-18 15:45:37,186 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 15:45:37,186 INFO ]: Finished difference Result 21 states and 22 transitions. [2018-06-18 15:45:37,189 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-18 15:45:37,189 INFO ]: Start accepts. Automaton has 17 states. Word has length 25 [2018-06-18 15:45:37,189 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 15:45:37,190 INFO ]: With dead ends: 21 [2018-06-18 15:45:37,190 INFO ]: Without dead ends: 21 [2018-06-18 15:45:37,190 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-06-18 15:45:37,191 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-18 15:45:37,194 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-18 15:45:37,194 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-18 15:45:37,194 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-18 15:45:37,194 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 25 [2018-06-18 15:45:37,195 INFO ]: Finished accepts. word is rejected. [2018-06-18 15:45:37,195 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-18 15:45:37,195 INFO ]: Interpolant automaton has 17 states. [2018-06-18 15:45:37,195 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-18 15:45:37,195 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-18 15:45:37,195 INFO ]: Found error trace [2018-06-18 15:45:37,196 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:45:37,196 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:45:37,196 INFO ]: Analyzing trace with hash 853117551, now seen corresponding path program 5 times [2018-06-18 15:45:37,196 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:45:37,196 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:45:37,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:37,197 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 15:45:37,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:37,247 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:37,248 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 15:45:37,828 WARN ]: Spent 391.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2018-06-18 15:45:38,042 WARN ]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-18 15:45:38,147 INFO ]: Checked inductivity of 55 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-18 15:45:38,147 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 15:45:38,147 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-18 15:45:38,153 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-18 15:45:38,266 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-18 15:45:38,266 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:38,271 INFO ]: Computing forward predicates... [2018-06-18 15:45:38,888 INFO ]: Checked inductivity of 55 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-18 15:45:38,909 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 15:45:38,909 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2018-06-18 15:45:38,909 INFO ]: Interpolant automaton has 21 states [2018-06-18 15:45:38,909 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-18 15:45:38,909 INFO ]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-06-18 15:45:38,910 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 21 states. [2018-06-18 15:45:39,608 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 15:45:39,608 INFO ]: Finished difference Result 23 states and 24 transitions. [2018-06-18 15:45:39,610 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-18 15:45:39,610 INFO ]: Start accepts. Automaton has 21 states. Word has length 29 [2018-06-18 15:45:39,611 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 15:45:39,611 INFO ]: With dead ends: 23 [2018-06-18 15:45:39,611 INFO ]: Without dead ends: 23 [2018-06-18 15:45:39,612 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-06-18 15:45:39,612 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-18 15:45:39,615 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-18 15:45:39,615 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-18 15:45:39,616 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-18 15:45:39,616 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 29 [2018-06-18 15:45:39,616 INFO ]: Finished accepts. word is rejected. [2018-06-18 15:45:39,616 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-18 15:45:39,616 INFO ]: Interpolant automaton has 21 states. [2018-06-18 15:45:39,616 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-18 15:45:39,617 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-18 15:45:39,617 INFO ]: Found error trace [2018-06-18 15:45:39,617 INFO ]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:45:39,617 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:45:39,617 INFO ]: Analyzing trace with hash -1661294575, now seen corresponding path program 6 times [2018-06-18 15:45:39,617 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:45:39,617 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:45:39,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:39,618 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 15:45:39,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:39,667 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:39,680 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 15:45:40,074 INFO ]: Checked inductivity of 78 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-18 15:45:40,074 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 15:45:40,074 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-18 15:45:40,081 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-18 15:45:40,172 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-18 15:45:40,172 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:40,178 INFO ]: Computing forward predicates... [2018-06-18 15:45:40,440 INFO ]: Checked inductivity of 78 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-18 15:45:40,473 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 15:45:40,473 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2018-06-18 15:45:40,473 INFO ]: Interpolant automaton has 25 states [2018-06-18 15:45:40,473 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-18 15:45:40,474 INFO ]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2018-06-18 15:45:40,474 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 25 states. [2018-06-18 15:45:40,971 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 15:45:40,971 INFO ]: Finished difference Result 25 states and 26 transitions. [2018-06-18 15:45:40,971 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-18 15:45:40,971 INFO ]: Start accepts. Automaton has 25 states. Word has length 33 [2018-06-18 15:45:40,971 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 15:45:40,972 INFO ]: With dead ends: 25 [2018-06-18 15:45:40,972 INFO ]: Without dead ends: 25 [2018-06-18 15:45:40,973 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2018-06-18 15:45:40,973 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-18 15:45:40,976 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-18 15:45:40,976 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 15:45:40,976 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-18 15:45:40,977 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 33 [2018-06-18 15:45:40,977 INFO ]: Finished accepts. word is rejected. [2018-06-18 15:45:40,977 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-18 15:45:40,977 INFO ]: Interpolant automaton has 25 states. [2018-06-18 15:45:40,977 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-18 15:45:40,978 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-18 15:45:40,978 INFO ]: Found error trace [2018-06-18 15:45:40,978 INFO ]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:45:40,978 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:45:40,978 INFO ]: Analyzing trace with hash -1494134477, now seen corresponding path program 7 times [2018-06-18 15:45:40,978 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:45:40,978 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:45:40,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:40,979 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 15:45:40,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:41,015 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:41,016 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 15:45:41,550 WARN ]: Spent 365.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2018-06-18 15:45:41,812 WARN ]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-18 15:45:42,113 INFO ]: Checked inductivity of 105 backedges. 6 proven. 67 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-18 15:45:42,113 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 15:45:42,113 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-18 15:45:42,120 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 15:45:42,203 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:42,208 INFO ]: Computing forward predicates... [2018-06-18 15:45:42,427 INFO ]: Checked inductivity of 105 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-18 15:45:42,450 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 15:45:42,450 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 24 [2018-06-18 15:45:42,450 INFO ]: Interpolant automaton has 24 states [2018-06-18 15:45:42,450 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-18 15:45:42,451 INFO ]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2018-06-18 15:45:42,451 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 24 states. [2018-06-18 15:45:42,891 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 15:45:42,891 INFO ]: Finished difference Result 27 states and 28 transitions. [2018-06-18 15:45:42,891 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-18 15:45:42,891 INFO ]: Start accepts. Automaton has 24 states. Word has length 37 [2018-06-18 15:45:42,892 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 15:45:42,892 INFO ]: With dead ends: 27 [2018-06-18 15:45:42,892 INFO ]: Without dead ends: 27 [2018-06-18 15:45:42,893 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=272, Invalid=784, Unknown=0, NotChecked=0, Total=1056 [2018-06-18 15:45:42,893 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-18 15:45:42,897 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-18 15:45:42,897 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-18 15:45:42,897 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-18 15:45:42,897 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 37 [2018-06-18 15:45:42,898 INFO ]: Finished accepts. word is rejected. [2018-06-18 15:45:42,898 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-18 15:45:42,898 INFO ]: Interpolant automaton has 24 states. [2018-06-18 15:45:42,898 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-18 15:45:42,899 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-18 15:45:42,899 INFO ]: Found error trace [2018-06-18 15:45:42,899 INFO ]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:45:42,899 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:45:42,899 INFO ]: Analyzing trace with hash 1618126293, now seen corresponding path program 8 times [2018-06-18 15:45:42,899 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:45:42,899 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:45:42,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:42,900 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 15:45:42,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:42,939 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:42,940 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 15:45:43,428 INFO ]: Checked inductivity of 136 backedges. 3 proven. 87 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-18 15:45:43,428 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 15:45:43,428 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-18 15:45:43,434 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 15:45:43,551 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 15:45:43,551 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:43,559 INFO ]: Computing forward predicates... [2018-06-18 15:45:43,804 INFO ]: Checked inductivity of 136 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-18 15:45:43,825 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 15:45:43,825 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 26 [2018-06-18 15:45:43,826 INFO ]: Interpolant automaton has 26 states [2018-06-18 15:45:43,826 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-18 15:45:43,826 INFO ]: CoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2018-06-18 15:45:43,826 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 26 states. [2018-06-18 15:45:44,623 WARN ]: Spent 281.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2018-06-18 15:45:44,663 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 15:45:44,664 INFO ]: Finished difference Result 29 states and 30 transitions. [2018-06-18 15:45:44,664 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-18 15:45:44,664 INFO ]: Start accepts. Automaton has 26 states. Word has length 41 [2018-06-18 15:45:44,664 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 15:45:44,665 INFO ]: With dead ends: 29 [2018-06-18 15:45:44,665 INFO ]: Without dead ends: 29 [2018-06-18 15:45:44,665 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=329, Invalid=931, Unknown=0, NotChecked=0, Total=1260 [2018-06-18 15:45:44,665 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-18 15:45:44,669 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-18 15:45:44,669 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-18 15:45:44,670 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-18 15:45:44,670 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 41 [2018-06-18 15:45:44,670 INFO ]: Finished accepts. word is rejected. [2018-06-18 15:45:44,670 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-18 15:45:44,670 INFO ]: Interpolant automaton has 26 states. [2018-06-18 15:45:44,670 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-18 15:45:44,671 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-18 15:45:44,671 INFO ]: Found error trace [2018-06-18 15:45:44,672 INFO ]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:45:44,672 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:45:44,672 INFO ]: Analyzing trace with hash 996918775, now seen corresponding path program 9 times [2018-06-18 15:45:44,672 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:45:44,672 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:45:44,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:44,672 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 15:45:44,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:44,714 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:44,715 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 15:45:45,341 INFO ]: Checked inductivity of 171 backedges. 8 proven. 107 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-18 15:45:45,341 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 15:45:45,341 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-18 15:45:45,347 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-18 15:45:45,504 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-18 15:45:45,504 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:45,510 INFO ]: Computing forward predicates... [2018-06-18 15:45:46,000 INFO ]: Checked inductivity of 171 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-06-18 15:45:46,022 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 15:45:46,022 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2018-06-18 15:45:46,022 INFO ]: Interpolant automaton has 30 states [2018-06-18 15:45:46,022 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-18 15:45:46,023 INFO ]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2018-06-18 15:45:46,023 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 30 states. [2018-06-18 15:45:46,801 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 15:45:46,802 INFO ]: Finished difference Result 31 states and 32 transitions. [2018-06-18 15:45:46,802 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-18 15:45:46,802 INFO ]: Start accepts. Automaton has 30 states. Word has length 45 [2018-06-18 15:45:46,802 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 15:45:46,803 INFO ]: With dead ends: 31 [2018-06-18 15:45:46,803 INFO ]: Without dead ends: 31 [2018-06-18 15:45:46,803 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=391, Invalid=1249, Unknown=0, NotChecked=0, Total=1640 [2018-06-18 15:45:46,803 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-18 15:45:46,807 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-18 15:45:46,807 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-18 15:45:46,809 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-18 15:45:46,809 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 45 [2018-06-18 15:45:46,810 INFO ]: Finished accepts. word is rejected. [2018-06-18 15:45:46,810 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-18 15:45:46,810 INFO ]: Interpolant automaton has 30 states. [2018-06-18 15:45:46,810 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-18 15:45:46,811 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-18 15:45:46,811 INFO ]: Found error trace [2018-06-18 15:45:46,811 INFO ]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:45:46,811 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:45:46,811 INFO ]: Analyzing trace with hash -570306151, now seen corresponding path program 10 times [2018-06-18 15:45:46,811 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:45:46,811 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:45:46,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:46,812 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 15:45:46,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:46,854 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:46,856 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 15:45:47,342 INFO ]: Checked inductivity of 210 backedges. 12 proven. 131 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-18 15:45:47,342 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 15:45:47,374 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-18 15:45:47,380 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-18 15:45:47,529 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-18 15:45:47,529 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:47,538 INFO ]: Computing forward predicates... [2018-06-18 15:45:49,414 INFO ]: Checked inductivity of 210 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-06-18 15:45:49,456 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 15:45:49,456 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2018-06-18 15:45:49,457 INFO ]: Interpolant automaton has 32 states [2018-06-18 15:45:49,457 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-18 15:45:49,457 INFO ]: CoverageRelationStatistics Valid=196, Invalid=796, Unknown=0, NotChecked=0, Total=992 [2018-06-18 15:45:49,457 INFO ]: Start difference. First operand 31 states and 32 transitions. Second operand 32 states. [2018-06-18 15:45:50,107 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 15:45:50,107 INFO ]: Finished difference Result 33 states and 34 transitions. [2018-06-18 15:45:50,107 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-18 15:45:50,107 INFO ]: Start accepts. Automaton has 32 states. Word has length 49 [2018-06-18 15:45:50,108 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 15:45:50,108 INFO ]: With dead ends: 33 [2018-06-18 15:45:50,108 INFO ]: Without dead ends: 33 [2018-06-18 15:45:50,109 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=480, Invalid=1412, Unknown=0, NotChecked=0, Total=1892 [2018-06-18 15:45:50,109 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-18 15:45:50,113 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-18 15:45:50,113 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-18 15:45:50,113 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-06-18 15:45:50,114 INFO ]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 49 [2018-06-18 15:45:50,114 INFO ]: Finished accepts. word is rejected. [2018-06-18 15:45:50,114 INFO ]: Abstraction has 33 states and 34 transitions. [2018-06-18 15:45:50,114 INFO ]: Interpolant automaton has 32 states. [2018-06-18 15:45:50,114 INFO ]: Start isEmpty. Operand 33 states and 34 transitions. [2018-06-18 15:45:50,114 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-18 15:45:50,114 INFO ]: Found error trace [2018-06-18 15:45:50,114 INFO ]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:45:50,114 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:45:50,114 INFO ]: Analyzing trace with hash 1955719355, now seen corresponding path program 11 times [2018-06-18 15:45:50,114 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:45:50,114 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:45:50,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:50,117 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 15:45:50,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:50,161 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:50,162 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 15:45:50,911 INFO ]: Checked inductivity of 253 backedges. 18 proven. 151 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-06-18 15:45:50,911 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 15:45:50,911 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-18 15:45:50,917 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-18 15:45:51,171 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-18 15:45:51,171 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:51,177 INFO ]: Computing forward predicates... [2018-06-18 15:45:51,669 INFO ]: Checked inductivity of 253 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-18 15:45:51,692 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 15:45:51,692 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 34 [2018-06-18 15:45:51,692 INFO ]: Interpolant automaton has 34 states [2018-06-18 15:45:51,692 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-18 15:45:51,693 INFO ]: CoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2018-06-18 15:45:51,693 INFO ]: Start difference. First operand 33 states and 34 transitions. Second operand 34 states. [2018-06-18 15:45:53,047 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 15:45:53,047 INFO ]: Finished difference Result 35 states and 36 transitions. [2018-06-18 15:45:53,083 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-18 15:45:53,083 INFO ]: Start accepts. Automaton has 34 states. Word has length 53 [2018-06-18 15:45:53,084 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 15:45:53,084 INFO ]: With dead ends: 35 [2018-06-18 15:45:53,084 INFO ]: Without dead ends: 35 [2018-06-18 15:45:53,085 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=478, Invalid=1684, Unknown=0, NotChecked=0, Total=2162 [2018-06-18 15:45:53,085 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-18 15:45:53,088 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-18 15:45:53,089 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-18 15:45:53,089 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-06-18 15:45:53,089 INFO ]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 53 [2018-06-18 15:45:53,090 INFO ]: Finished accepts. word is rejected. [2018-06-18 15:45:53,090 INFO ]: Abstraction has 35 states and 36 transitions. [2018-06-18 15:45:53,090 INFO ]: Interpolant automaton has 34 states. [2018-06-18 15:45:53,090 INFO ]: Start isEmpty. Operand 35 states and 36 transitions. [2018-06-18 15:45:53,090 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-18 15:45:53,090 INFO ]: Found error trace [2018-06-18 15:45:53,091 INFO ]: trace histogram [13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:45:53,091 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:45:53,091 INFO ]: Analyzing trace with hash -2085541027, now seen corresponding path program 12 times [2018-06-18 15:45:53,091 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:45:53,091 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:45:53,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:53,091 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 15:45:53,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:53,139 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:53,140 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 15:45:53,707 INFO ]: Checked inductivity of 300 backedges. 14 proven. 184 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-06-18 15:45:53,707 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 15:45:53,707 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-18 15:45:53,713 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-18 15:45:53,908 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-18 15:45:53,908 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:53,919 INFO ]: Computing forward predicates... [2018-06-18 15:45:54,479 INFO ]: Checked inductivity of 300 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-18 15:45:54,501 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 15:45:54,501 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 37 [2018-06-18 15:45:54,501 INFO ]: Interpolant automaton has 37 states [2018-06-18 15:45:54,502 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-18 15:45:54,502 INFO ]: CoverageRelationStatistics Valid=216, Invalid=1116, Unknown=0, NotChecked=0, Total=1332 [2018-06-18 15:45:54,502 INFO ]: Start difference. First operand 35 states and 36 transitions. Second operand 37 states. [2018-06-18 15:45:55,439 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 15:45:55,439 INFO ]: Finished difference Result 37 states and 38 transitions. [2018-06-18 15:45:55,440 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-18 15:45:55,440 INFO ]: Start accepts. Automaton has 37 states. Word has length 57 [2018-06-18 15:45:55,441 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 15:45:55,441 INFO ]: With dead ends: 37 [2018-06-18 15:45:55,441 INFO ]: Without dead ends: 37 [2018-06-18 15:45:55,442 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=603, Invalid=1947, Unknown=0, NotChecked=0, Total=2550 [2018-06-18 15:45:55,442 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-18 15:45:55,446 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-18 15:45:55,446 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-18 15:45:55,447 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-06-18 15:45:55,447 INFO ]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 57 [2018-06-18 15:45:55,447 INFO ]: Finished accepts. word is rejected. [2018-06-18 15:45:55,447 INFO ]: Abstraction has 37 states and 38 transitions. [2018-06-18 15:45:55,447 INFO ]: Interpolant automaton has 37 states. [2018-06-18 15:45:55,447 INFO ]: Start isEmpty. Operand 37 states and 38 transitions. [2018-06-18 15:45:55,448 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-18 15:45:55,448 INFO ]: Found error trace [2018-06-18 15:45:55,448 INFO ]: trace histogram [14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:45:55,449 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:45:55,449 INFO ]: Analyzing trace with hash 976009599, now seen corresponding path program 13 times [2018-06-18 15:45:55,449 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:45:55,449 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:45:55,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:55,449 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 15:45:55,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:55,493 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:55,496 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 15:45:56,066 INFO ]: Checked inductivity of 351 backedges. 20 proven. 215 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-06-18 15:45:56,066 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 15:45:56,066 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-18 15:45:56,077 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 15:45:56,212 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:56,221 INFO ]: Computing forward predicates... [2018-06-18 15:45:56,786 INFO ]: Checked inductivity of 351 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-06-18 15:45:56,807 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 15:45:56,807 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 36 [2018-06-18 15:45:56,807 INFO ]: Interpolant automaton has 36 states [2018-06-18 15:45:56,808 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-18 15:45:56,808 INFO ]: CoverageRelationStatistics Valid=312, Invalid=948, Unknown=0, NotChecked=0, Total=1260 [2018-06-18 15:45:56,808 INFO ]: Start difference. First operand 37 states and 38 transitions. Second operand 36 states. [2018-06-18 15:45:57,498 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 15:45:57,498 INFO ]: Finished difference Result 39 states and 40 transitions. [2018-06-18 15:45:57,500 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-18 15:45:57,500 INFO ]: Start accepts. Automaton has 36 states. Word has length 61 [2018-06-18 15:45:57,500 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 15:45:57,501 INFO ]: With dead ends: 39 [2018-06-18 15:45:57,501 INFO ]: Without dead ends: 39 [2018-06-18 15:45:57,502 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=704, Invalid=1846, Unknown=0, NotChecked=0, Total=2550 [2018-06-18 15:45:57,502 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-18 15:45:57,506 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-18 15:45:57,506 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-18 15:45:57,506 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-06-18 15:45:57,506 INFO ]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 61 [2018-06-18 15:45:57,507 INFO ]: Finished accepts. word is rejected. [2018-06-18 15:45:57,507 INFO ]: Abstraction has 39 states and 40 transitions. [2018-06-18 15:45:57,507 INFO ]: Interpolant automaton has 36 states. [2018-06-18 15:45:57,507 INFO ]: Start isEmpty. Operand 39 states and 40 transitions. [2018-06-18 15:45:57,508 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-18 15:45:57,508 INFO ]: Found error trace [2018-06-18 15:45:57,508 INFO ]: trace histogram [15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:45:57,508 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:45:57,508 INFO ]: Analyzing trace with hash 1124709153, now seen corresponding path program 14 times [2018-06-18 15:45:57,508 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:45:57,508 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:45:57,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:57,509 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 15:45:57,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:45:57,558 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:57,561 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 15:45:57,901 WARN ]: Spent 120.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2018-06-18 15:45:58,426 INFO ]: Checked inductivity of 406 backedges. 12 proven. 250 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-06-18 15:45:58,426 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 15:45:58,426 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 15:45:58,454 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 15:45:58,601 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 15:45:58,601 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:45:58,609 INFO ]: Computing forward predicates... [2018-06-18 15:45:59,485 INFO ]: Checked inductivity of 406 backedges. 0 proven. 223 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-06-18 15:45:59,506 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 15:45:59,506 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 38 [2018-06-18 15:45:59,507 INFO ]: Interpolant automaton has 38 states [2018-06-18 15:45:59,507 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-18 15:45:59,507 INFO ]: CoverageRelationStatistics Valid=355, Invalid=1051, Unknown=0, NotChecked=0, Total=1406 [2018-06-18 15:45:59,508 INFO ]: Start difference. First operand 39 states and 40 transitions. Second operand 38 states. [2018-06-18 15:46:00,098 WARN ]: Spent 201.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-06-18 15:46:00,456 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 15:46:00,456 INFO ]: Finished difference Result 41 states and 42 transitions. [2018-06-18 15:46:00,456 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-18 15:46:00,456 INFO ]: Start accepts. Automaton has 38 states. Word has length 65 [2018-06-18 15:46:00,457 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 15:46:00,457 INFO ]: With dead ends: 41 [2018-06-18 15:46:00,457 INFO ]: Without dead ends: 41 [2018-06-18 15:46:00,458 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=797, Invalid=2065, Unknown=0, NotChecked=0, Total=2862 [2018-06-18 15:46:00,458 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-18 15:46:00,462 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-18 15:46:00,462 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-18 15:46:00,463 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-06-18 15:46:00,463 INFO ]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 65 [2018-06-18 15:46:00,464 INFO ]: Finished accepts. word is rejected. [2018-06-18 15:46:00,464 INFO ]: Abstraction has 41 states and 42 transitions. [2018-06-18 15:46:00,464 INFO ]: Interpolant automaton has 38 states. [2018-06-18 15:46:00,464 INFO ]: Start isEmpty. Operand 41 states and 42 transitions. [2018-06-18 15:46:00,469 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-18 15:46:00,469 INFO ]: Found error trace [2018-06-18 15:46:00,469 INFO ]: trace histogram [16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:46:00,469 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:46:00,469 INFO ]: Analyzing trace with hash 394606659, now seen corresponding path program 15 times [2018-06-18 15:46:00,469 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:46:00,469 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:46:00,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:46:00,470 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 15:46:00,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:46:00,514 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:46:00,516 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 15:46:01,055 WARN ]: Spent 319.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2018-06-18 15:46:01,498 INFO ]: Checked inductivity of 465 backedges. 21 proven. 282 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-06-18 15:46:01,498 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 15:46:01,498 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 15:46:01,504 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-18 15:46:01,760 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-06-18 15:46:01,760 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:46:01,771 INFO ]: Computing forward predicates... [2018-06-18 15:46:02,418 WARN ]: Spent 207.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 5 [2018-06-18 15:46:02,978 WARN ]: Spent 197.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-06-18 15:46:04,108 INFO ]: Checked inductivity of 465 backedges. 0 proven. 309 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-06-18 15:46:04,130 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 15:46:04,130 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 42 [2018-06-18 15:46:04,130 INFO ]: Interpolant automaton has 42 states [2018-06-18 15:46:04,130 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-18 15:46:04,131 INFO ]: CoverageRelationStatistics Valid=324, Invalid=1398, Unknown=0, NotChecked=0, Total=1722 [2018-06-18 15:46:04,131 INFO ]: Start difference. First operand 41 states and 42 transitions. Second operand 42 states. [2018-06-18 15:46:05,042 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 15:46:05,042 INFO ]: Finished difference Result 43 states and 44 transitions. [2018-06-18 15:46:05,042 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-18 15:46:05,042 INFO ]: Start accepts. Automaton has 42 states. Word has length 69 [2018-06-18 15:46:05,043 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 15:46:05,043 INFO ]: With dead ends: 43 [2018-06-18 15:46:05,043 INFO ]: Without dead ends: 43 [2018-06-18 15:46:05,044 INFO ]: 0 DeclaredPredicates, 119 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=853, Invalid=2569, Unknown=0, NotChecked=0, Total=3422 [2018-06-18 15:46:05,045 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-18 15:46:05,054 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-18 15:46:05,054 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-18 15:46:05,055 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-06-18 15:46:05,055 INFO ]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 69 [2018-06-18 15:46:05,055 INFO ]: Finished accepts. word is rejected. [2018-06-18 15:46:05,055 INFO ]: Abstraction has 43 states and 44 transitions. [2018-06-18 15:46:05,055 INFO ]: Interpolant automaton has 42 states. [2018-06-18 15:46:05,055 INFO ]: Start isEmpty. Operand 43 states and 44 transitions. [2018-06-18 15:46:05,056 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-18 15:46:05,056 INFO ]: Found error trace [2018-06-18 15:46:05,056 INFO ]: trace histogram [17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:46:05,056 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:46:05,057 INFO ]: Analyzing trace with hash -787191579, now seen corresponding path program 16 times [2018-06-18 15:46:05,057 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:46:05,057 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:46:05,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:46:05,057 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 15:46:05,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:46:05,103 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:46:05,105 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 15:46:05,971 INFO ]: Checked inductivity of 528 backedges. 12 proven. 322 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-06-18 15:46:05,971 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 15:46:05,971 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 15:46:05,979 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-18 15:46:06,150 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-18 15:46:06,150 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:46:06,158 INFO ]: Computing forward predicates... [2018-06-18 15:46:07,098 INFO ]: Checked inductivity of 528 backedges. 0 proven. 314 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-06-18 15:46:07,119 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 15:46:07,119 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2018-06-18 15:46:07,119 INFO ]: Interpolant automaton has 44 states [2018-06-18 15:46:07,119 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-18 15:46:07,120 INFO ]: CoverageRelationStatistics Valid=441, Invalid=1451, Unknown=0, NotChecked=0, Total=1892 [2018-06-18 15:46:07,120 INFO ]: Start difference. First operand 43 states and 44 transitions. Second operand 44 states. [2018-06-18 15:46:08,157 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 15:46:08,157 INFO ]: Finished difference Result 45 states and 46 transitions. [2018-06-18 15:46:08,159 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-18 15:46:08,159 INFO ]: Start accepts. Automaton has 44 states. Word has length 73 [2018-06-18 15:46:08,159 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 15:46:08,159 INFO ]: With dead ends: 45 [2018-06-18 15:46:08,159 INFO ]: Without dead ends: 45 [2018-06-18 15:46:08,160 INFO ]: 0 DeclaredPredicates, 126 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1028, Invalid=2754, Unknown=0, NotChecked=0, Total=3782 [2018-06-18 15:46:08,160 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-18 15:46:08,163 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-18 15:46:08,163 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-18 15:46:08,164 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-06-18 15:46:08,164 INFO ]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 73 [2018-06-18 15:46:08,164 INFO ]: Finished accepts. word is rejected. [2018-06-18 15:46:08,164 INFO ]: Abstraction has 45 states and 46 transitions. [2018-06-18 15:46:08,164 INFO ]: Interpolant automaton has 44 states. [2018-06-18 15:46:08,164 INFO ]: Start isEmpty. Operand 45 states and 46 transitions. [2018-06-18 15:46:08,165 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-18 15:46:08,165 INFO ]: Found error trace [2018-06-18 15:46:08,165 INFO ]: trace histogram [18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:46:08,166 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:46:08,166 INFO ]: Analyzing trace with hash 2070177031, now seen corresponding path program 17 times [2018-06-18 15:46:08,166 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:46:08,166 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:46:08,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:46:08,166 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 15:46:08,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:46:08,220 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:46:08,221 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 15:46:08,815 WARN ]: Spent 387.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2018-06-18 15:46:09,028 WARN ]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-18 15:46:09,602 INFO ]: Checked inductivity of 595 backedges. 39 proven. 352 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-06-18 15:46:09,602 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 15:46:09,602 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 15:46:09,608 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-18 15:46:09,921 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-06-18 15:46:09,922 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:46:09,932 INFO ]: Computing forward predicates... [2018-06-18 15:46:10,530 INFO ]: Checked inductivity of 595 backedges. 12 proven. 393 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-06-18 15:46:10,552 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 15:46:10,552 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 46 [2018-06-18 15:46:10,552 INFO ]: Interpolant automaton has 46 states [2018-06-18 15:46:10,552 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-18 15:46:10,553 INFO ]: CoverageRelationStatistics Valid=315, Invalid=1755, Unknown=0, NotChecked=0, Total=2070 [2018-06-18 15:46:10,553 INFO ]: Start difference. First operand 45 states and 46 transitions. Second operand 46 states. [2018-06-18 15:46:11,981 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 15:46:11,981 INFO ]: Finished difference Result 47 states and 48 transitions. [2018-06-18 15:46:11,982 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-18 15:46:11,982 INFO ]: Start accepts. Automaton has 46 states. Word has length 77 [2018-06-18 15:46:11,982 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 15:46:11,983 INFO ]: With dead ends: 47 [2018-06-18 15:46:11,983 INFO ]: Without dead ends: 47 [2018-06-18 15:46:11,984 INFO ]: 0 DeclaredPredicates, 133 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=981, Invalid=3179, Unknown=0, NotChecked=0, Total=4160 [2018-06-18 15:46:11,984 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-18 15:46:11,989 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-06-18 15:46:11,994 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-18 15:46:11,995 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-06-18 15:46:11,995 INFO ]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 77 [2018-06-18 15:46:11,996 INFO ]: Finished accepts. word is rejected. [2018-06-18 15:46:11,996 INFO ]: Abstraction has 47 states and 48 transitions. [2018-06-18 15:46:11,996 INFO ]: Interpolant automaton has 46 states. [2018-06-18 15:46:11,996 INFO ]: Start isEmpty. Operand 47 states and 48 transitions. [2018-06-18 15:46:11,996 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-18 15:46:11,996 INFO ]: Found error trace [2018-06-18 15:46:11,997 INFO ]: trace histogram [19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:46:11,997 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:46:11,997 INFO ]: Analyzing trace with hash -430289751, now seen corresponding path program 18 times [2018-06-18 15:46:11,997 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:46:11,997 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:46:11,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:46:11,997 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 15:46:11,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:46:12,056 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:46:12,057 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 15:46:12,657 WARN ]: Spent 363.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2018-06-18 15:46:13,307 INFO ]: Checked inductivity of 666 backedges. 31 proven. 399 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-06-18 15:46:13,307 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 15:46:13,308 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 15:46:13,314 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-18 15:46:13,689 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-06-18 15:46:13,689 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:46:13,698 INFO ]: Computing forward predicates... [2018-06-18 15:46:14,470 INFO ]: Checked inductivity of 666 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-06-18 15:46:14,492 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 15:46:14,492 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 49 [2018-06-18 15:46:14,493 INFO ]: Interpolant automaton has 49 states [2018-06-18 15:46:14,493 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-18 15:46:14,494 INFO ]: CoverageRelationStatistics Valid=416, Invalid=1936, Unknown=0, NotChecked=0, Total=2352 [2018-06-18 15:46:14,494 INFO ]: Start difference. First operand 47 states and 48 transitions. Second operand 49 states. [2018-06-18 15:46:15,785 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 15:46:15,785 INFO ]: Finished difference Result 49 states and 50 transitions. [2018-06-18 15:46:15,785 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-18 15:46:15,785 INFO ]: Start accepts. Automaton has 49 states. Word has length 81 [2018-06-18 15:46:15,785 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 15:46:15,786 INFO ]: With dead ends: 49 [2018-06-18 15:46:15,786 INFO ]: Without dead ends: 49 [2018-06-18 15:46:15,787 INFO ]: 0 DeclaredPredicates, 140 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1148, Invalid=3544, Unknown=0, NotChecked=0, Total=4692 [2018-06-18 15:46:15,787 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-18 15:46:15,791 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-06-18 15:46:15,791 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-18 15:46:15,794 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-06-18 15:46:15,794 INFO ]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 81 [2018-06-18 15:46:15,794 INFO ]: Finished accepts. word is rejected. [2018-06-18 15:46:15,794 INFO ]: Abstraction has 49 states and 50 transitions. [2018-06-18 15:46:15,794 INFO ]: Interpolant automaton has 49 states. [2018-06-18 15:46:15,794 INFO ]: Start isEmpty. Operand 49 states and 50 transitions. [2018-06-18 15:46:15,795 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-18 15:46:15,795 INFO ]: Found error trace [2018-06-18 15:46:15,795 INFO ]: trace histogram [20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:46:15,796 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:46:15,796 INFO ]: Analyzing trace with hash -132956213, now seen corresponding path program 19 times [2018-06-18 15:46:15,796 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:46:15,796 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:46:15,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:46:15,796 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 15:46:15,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:46:15,857 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:46:15,858 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 15:46:16,451 WARN ]: Spent 376.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2018-06-18 15:46:16,846 WARN ]: Spent 163.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-06-18 15:46:17,728 INFO ]: Checked inductivity of 741 backedges. 40 proven. 441 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-06-18 15:46:17,729 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 15:46:17,729 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 15:46:17,735 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 15:46:17,936 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:46:17,945 INFO ]: Computing forward predicates... [2018-06-18 15:46:19,757 WARN ]: Spent 102.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-06-18 15:46:20,569 INFO ]: Checked inductivity of 741 backedges. 0 proven. 398 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-06-18 15:46:20,591 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 15:46:20,591 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 48 [2018-06-18 15:46:20,591 INFO ]: Interpolant automaton has 48 states [2018-06-18 15:46:20,591 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-18 15:46:20,591 INFO ]: CoverageRelationStatistics Valid=615, Invalid=1641, Unknown=0, NotChecked=0, Total=2256 [2018-06-18 15:46:20,591 INFO ]: Start difference. First operand 49 states and 50 transitions. Second operand 48 states. [2018-06-18 15:46:21,716 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 15:46:21,716 INFO ]: Finished difference Result 51 states and 52 transitions. [2018-06-18 15:46:21,716 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-18 15:46:21,716 INFO ]: Start accepts. Automaton has 48 states. Word has length 85 [2018-06-18 15:46:21,716 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 15:46:21,717 INFO ]: With dead ends: 51 [2018-06-18 15:46:21,717 INFO ]: Without dead ends: 51 [2018-06-18 15:46:21,718 INFO ]: 0 DeclaredPredicates, 147 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1352, Invalid=3340, Unknown=0, NotChecked=0, Total=4692 [2018-06-18 15:46:21,718 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-18 15:46:21,722 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-06-18 15:46:21,723 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-18 15:46:21,723 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-06-18 15:46:21,723 INFO ]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 85 [2018-06-18 15:46:21,724 INFO ]: Finished accepts. word is rejected. [2018-06-18 15:46:21,724 INFO ]: Abstraction has 51 states and 52 transitions. [2018-06-18 15:46:21,724 INFO ]: Interpolant automaton has 48 states. [2018-06-18 15:46:21,724 INFO ]: Start isEmpty. Operand 51 states and 52 transitions. [2018-06-18 15:46:21,724 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-18 15:46:21,724 INFO ]: Found error trace [2018-06-18 15:46:21,724 INFO ]: trace histogram [21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:46:21,725 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:46:21,725 INFO ]: Analyzing trace with hash 2128895597, now seen corresponding path program 20 times [2018-06-18 15:46:21,725 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:46:21,725 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:46:21,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:46:21,725 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 15:46:21,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:46:21,779 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:46:21,780 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 15:46:22,169 WARN ]: Spent 179.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2018-06-18 15:46:22,842 INFO ]: Checked inductivity of 820 backedges. 45 proven. 484 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-06-18 15:46:22,842 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 15:46:22,842 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 15:46:22,850 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 15:46:23,061 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 15:46:23,061 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:46:23,070 INFO ]: Computing forward predicates... [2018-06-18 15:46:23,865 INFO ]: Checked inductivity of 820 backedges. 0 proven. 439 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-06-18 15:46:23,888 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 15:46:23,888 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 50 [2018-06-18 15:46:23,888 INFO ]: Interpolant automaton has 50 states [2018-06-18 15:46:23,888 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-18 15:46:23,889 INFO ]: CoverageRelationStatistics Valid=676, Invalid=1774, Unknown=0, NotChecked=0, Total=2450 [2018-06-18 15:46:23,889 INFO ]: Start difference. First operand 51 states and 52 transitions. Second operand 50 states. [2018-06-18 15:46:24,994 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 15:46:24,994 INFO ]: Finished difference Result 53 states and 54 transitions. [2018-06-18 15:46:24,995 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-18 15:46:24,995 INFO ]: Start accepts. Automaton has 50 states. Word has length 89 [2018-06-18 15:46:24,995 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 15:46:24,995 INFO ]: With dead ends: 53 [2018-06-18 15:46:24,995 INFO ]: Without dead ends: 53 [2018-06-18 15:46:24,997 INFO ]: 0 DeclaredPredicates, 154 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1481, Invalid=3631, Unknown=0, NotChecked=0, Total=5112 [2018-06-18 15:46:24,997 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-18 15:46:25,000 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-06-18 15:46:25,000 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-18 15:46:25,002 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-06-18 15:46:25,002 INFO ]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 89 [2018-06-18 15:46:25,002 INFO ]: Finished accepts. word is rejected. [2018-06-18 15:46:25,002 INFO ]: Abstraction has 53 states and 54 transitions. [2018-06-18 15:46:25,002 INFO ]: Interpolant automaton has 50 states. [2018-06-18 15:46:25,002 INFO ]: Start isEmpty. Operand 53 states and 54 transitions. [2018-06-18 15:46:25,003 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-18 15:46:25,003 INFO ]: Found error trace [2018-06-18 15:46:25,003 INFO ]: trace histogram [22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 15:46:25,004 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 15:46:25,004 INFO ]: Analyzing trace with hash -2091202417, now seen corresponding path program 21 times [2018-06-18 15:46:25,004 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 15:46:25,004 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 15:46:25,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:46:25,004 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 15:46:25,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 15:46:25,065 INFO ]: Conjunction of SSA is unsat [2018-06-18 15:46:25,066 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-06-18 15:46:25,553 WARN ]: Verification canceled [2018-06-18 15:46:25,556 WARN ]: Timeout [2018-06-18 15:46:25,557 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.06 03:46:25 BoogieIcfgContainer [2018-06-18 15:46:25,557 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-18 15:46:25,557 INFO ]: Toolchain (without parser) took 54949.84 ms. Allocated memory was 308.8 MB in the beginning and 1.1 GB in the end (delta: 808.5 MB). Free memory was 261.2 MB in the beginning and 338.8 MB in the end (delta: -77.6 MB). Peak memory consumption was 730.9 MB. Max. memory is 3.6 GB. [2018-06-18 15:46:25,558 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-18 15:46:25,558 INFO ]: ChcToBoogie took 77.84 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 258.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-18 15:46:25,559 INFO ]: Boogie Preprocessor took 56.61 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 257.2 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. [2018-06-18 15:46:25,559 INFO ]: RCFGBuilder took 377.48 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 245.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-18 15:46:25,559 INFO ]: TraceAbstraction took 54421.57 ms. Allocated memory was 308.8 MB in the beginning and 1.1 GB in the end (delta: 808.5 MB). Free memory was 245.2 MB in the beginning and 338.8 MB in the end (delta: -93.6 MB). Peak memory consumption was 714.9 MB. Max. memory is 3.6 GB. [2018-06-18 15:46:25,562 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 77.84 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 258.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 56.61 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 257.2 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. * RCFGBuilder took 377.48 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 245.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54421.57 ms. Allocated memory was 308.8 MB in the beginning and 1.1 GB in the end (delta: 808.5 MB). Free memory was 245.2 MB in the beginning and 338.8 MB in the end (delta: -93.6 MB). Peak memory consumption was 714.9 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 94 with TraceHistMax 22, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 13 locations, 1 error locations. TIMEOUT Result, 54.3s OverallTime, 22 OverallIterations, 22 TraceHistogramMax, 16.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 231 SDtfs, 1531 SDslu, 2019 SDs, 0 SdLazy, 1660 SolverSat, 1705 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1753 GetRequests, 904 SyntacticMatches, 2 SemanticMatches, 847 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5565 ImplicationChecksByTransitivity, 39.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 31.9s InterpolantComputationTime, 2049 NumberOfCodeBlocks, 2049 NumberOfCodeBlocksAsserted, 144 NumberOfCheckSat, 2008 ConstructedInterpolants, 0 QuantifiedInterpolants, 674696 SizeOfPredicates, 960 NumberOfNonLiveVariables, 21740 ConjunctsInSsa, 1182 ConjunctsInUnsatCore, 41 InterpolantComputations, 1 PerfectInterpolantSequences, 4652/11900 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/Gas_e7_435_e8_532.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-18_15-46-25-572.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Gas_e7_435_e8_532.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-18_15-46-25-572.csv Completed graceful shutdown