java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/rec__rec_while.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 12:18:32,905 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 12:18:32,908 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 12:18:32,922 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 12:18:32,922 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 12:18:32,923 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 12:18:32,926 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 12:18:32,928 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 12:18:32,929 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 12:18:32,931 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 12:18:32,932 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 12:18:32,932 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 12:18:32,933 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 12:18:32,934 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 12:18:32,937 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 12:18:32,938 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 12:18:32,939 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 12:18:32,949 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 12:18:32,950 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 12:18:32,951 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 12:18:32,952 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 12:18:32,957 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 12:18:32,957 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 12:18:32,957 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 12:18:32,958 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 12:18:32,959 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 12:18:32,961 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 12:18:32,962 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 12:18:32,963 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 12:18:32,963 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 12:18:32,963 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 12:18:32,964 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 12:18:32,964 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 12:18:32,968 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 12:18:32,969 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 12:18:32,969 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 12:18:32,989 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 12:18:32,990 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 12:18:32,991 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 12:18:32,991 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 12:18:32,992 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 12:18:32,993 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 12:18:32,993 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 12:18:32,993 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 12:18:32,993 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 12:18:32,993 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 12:18:32,994 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 12:18:32,994 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 12:18:32,994 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 12:18:32,994 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 12:18:32,994 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 12:18:32,994 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 12:18:32,995 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 12:18:32,997 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 12:18:32,997 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 12:18:32,999 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 12:18:32,999 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 12:18:33,045 INFO ]: Repository-Root is: /tmp [2018-06-22 12:18:33,061 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 12:18:33,065 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 12:18:33,067 INFO ]: Initializing SmtParser... [2018-06-22 12:18:33,067 INFO ]: SmtParser initialized [2018-06-22 12:18:33,069 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/rec__rec_while.smt2 [2018-06-22 12:18:33,070 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 12:18:33,165 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/rec__rec_while.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@41212890 [2018-06-22 12:18:33,457 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/rec__rec_while.smt2 [2018-06-22 12:18:33,464 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 12:18:33,469 INFO ]: Walking toolchain with 4 elements. [2018-06-22 12:18:33,469 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 12:18:33,469 INFO ]: Initializing ChcToBoogie... [2018-06-22 12:18:33,470 INFO ]: ChcToBoogie initialized [2018-06-22 12:18:33,473 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:18:33" (1/1) ... [2018-06-22 12:18:33,528 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:18:33 Unit [2018-06-22 12:18:33,528 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 12:18:33,529 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 12:18:33,529 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 12:18:33,529 INFO ]: Boogie Preprocessor initialized [2018-06-22 12:18:33,551 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:18:33" (1/1) ... [2018-06-22 12:18:33,552 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:18:33" (1/1) ... [2018-06-22 12:18:33,561 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:18:33" (1/1) ... [2018-06-22 12:18:33,563 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:18:33" (1/1) ... [2018-06-22 12:18:33,569 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:18:33" (1/1) ... [2018-06-22 12:18:33,584 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:18:33" (1/1) ... [2018-06-22 12:18:33,585 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:18:33" (1/1) ... [2018-06-22 12:18:33,587 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 12:18:33,588 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 12:18:33,588 INFO ]: Initializing RCFGBuilder... [2018-06-22 12:18:33,588 INFO ]: RCFGBuilder initialized [2018-06-22 12:18:33,589 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:18:33" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 12:18:33,605 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 12:18:33,605 INFO ]: Found specification of procedure False [2018-06-22 12:18:33,605 INFO ]: Found implementation of procedure False [2018-06-22 12:18:33,605 INFO ]: Specification and implementation of procedure INV_REC_f^f_PRE given in one single declaration [2018-06-22 12:18:33,605 INFO ]: Found specification of procedure INV_REC_f^f_PRE [2018-06-22 12:18:33,605 INFO ]: Found implementation of procedure INV_REC_f^f_PRE [2018-06-22 12:18:33,605 INFO ]: Specification and implementation of procedure INV_REC_f__1 given in one single declaration [2018-06-22 12:18:33,605 INFO ]: Found specification of procedure INV_REC_f__1 [2018-06-22 12:18:33,605 INFO ]: Found implementation of procedure INV_REC_f__1 [2018-06-22 12:18:33,605 INFO ]: Specification and implementation of procedure INV_REC_f__1_PRE given in one single declaration [2018-06-22 12:18:33,605 INFO ]: Found specification of procedure INV_REC_f__1_PRE [2018-06-22 12:18:33,605 INFO ]: Found implementation of procedure INV_REC_f__1_PRE [2018-06-22 12:18:33,605 INFO ]: Specification and implementation of procedure INV_42__1_PRE given in one single declaration [2018-06-22 12:18:33,605 INFO ]: Found specification of procedure INV_42__1_PRE [2018-06-22 12:18:33,606 INFO ]: Found implementation of procedure INV_42__1_PRE [2018-06-22 12:18:33,606 INFO ]: Specification and implementation of procedure INV_42__1 given in one single declaration [2018-06-22 12:18:33,606 INFO ]: Found specification of procedure INV_42__1 [2018-06-22 12:18:33,606 INFO ]: Found implementation of procedure INV_42__1 [2018-06-22 12:18:33,606 INFO ]: Specification and implementation of procedure INV_42_PRE given in one single declaration [2018-06-22 12:18:33,606 INFO ]: Found specification of procedure INV_42_PRE [2018-06-22 12:18:33,606 INFO ]: Found implementation of procedure INV_42_PRE [2018-06-22 12:18:33,606 INFO ]: Specification and implementation of procedure INV_REC_f^f given in one single declaration [2018-06-22 12:18:33,606 INFO ]: Found specification of procedure INV_REC_f^f [2018-06-22 12:18:33,606 INFO ]: Found implementation of procedure INV_REC_f^f [2018-06-22 12:18:33,606 INFO ]: Specification and implementation of procedure INV_42 given in one single declaration [2018-06-22 12:18:33,606 INFO ]: Found specification of procedure INV_42 [2018-06-22 12:18:33,606 INFO ]: Found implementation of procedure INV_42 [2018-06-22 12:18:33,606 INFO ]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration [2018-06-22 12:18:33,606 INFO ]: Found specification of procedure INV_MAIN_42 [2018-06-22 12:18:33,606 INFO ]: Found implementation of procedure INV_MAIN_42 [2018-06-22 12:18:33,606 INFO ]: Specification and implementation of procedure INV_REC_f__2 given in one single declaration [2018-06-22 12:18:33,606 INFO ]: Found specification of procedure INV_REC_f__2 [2018-06-22 12:18:33,606 INFO ]: Found implementation of procedure INV_REC_f__2 [2018-06-22 12:18:33,606 INFO ]: Specification and implementation of procedure INV_42__2 given in one single declaration [2018-06-22 12:18:33,606 INFO ]: Found specification of procedure INV_42__2 [2018-06-22 12:18:33,606 INFO ]: Found implementation of procedure INV_42__2 [2018-06-22 12:18:33,606 INFO ]: Specification and implementation of procedure INV_42__2_PRE given in one single declaration [2018-06-22 12:18:33,606 INFO ]: Found specification of procedure INV_42__2_PRE [2018-06-22 12:18:33,606 INFO ]: Found implementation of procedure INV_42__2_PRE [2018-06-22 12:18:33,606 INFO ]: Specification and implementation of procedure INV_REC_f__2_PRE given in one single declaration [2018-06-22 12:18:33,606 INFO ]: Found specification of procedure INV_REC_f__2_PRE [2018-06-22 12:18:33,606 INFO ]: Found implementation of procedure INV_REC_f__2_PRE [2018-06-22 12:18:33,606 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 12:18:33,607 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 12:18:33,607 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 12:18:34,188 INFO ]: Using library mode [2018-06-22 12:18:34,189 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:18:34 BoogieIcfgContainer [2018-06-22 12:18:34,189 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 12:18:34,190 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 12:18:34,190 INFO ]: Initializing TraceAbstraction... [2018-06-22 12:18:34,200 INFO ]: TraceAbstraction initialized [2018-06-22 12:18:34,200 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:18:33" (1/3) ... [2018-06-22 12:18:34,201 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f07b711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 12:18:34, skipping insertion in model container [2018-06-22 12:18:34,201 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:18:33" (2/3) ... [2018-06-22 12:18:34,201 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f07b711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:18:34, skipping insertion in model container [2018-06-22 12:18:34,201 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:18:34" (3/3) ... [2018-06-22 12:18:34,203 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 12:18:34,214 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 12:18:34,223 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 12:18:34,257 INFO ]: Using default assertion order modulation [2018-06-22 12:18:34,257 INFO ]: Interprodecural is true [2018-06-22 12:18:34,257 INFO ]: Hoare is false [2018-06-22 12:18:34,257 INFO ]: Compute interpolants for FPandBP [2018-06-22 12:18:34,257 INFO ]: Backedges is TWOTRACK [2018-06-22 12:18:34,257 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 12:18:34,257 INFO ]: Difference is false [2018-06-22 12:18:34,257 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 12:18:34,257 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 12:18:34,273 INFO ]: Start isEmpty. Operand 91 states. [2018-06-22 12:18:34,285 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 12:18:34,285 INFO ]: Found error trace [2018-06-22 12:18:34,285 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 12:18:34,286 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:34,289 INFO ]: Analyzing trace with hash 263374851, now seen corresponding path program 1 times [2018-06-22 12:18:34,290 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:34,290 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:34,322 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:34,322 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:34,322 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:34,335 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:34,361 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:18:34,363 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:18:34,363 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 12:18:34,365 INFO ]: Interpolant automaton has 2 states [2018-06-22 12:18:34,382 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 12:18:34,382 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 12:18:34,385 INFO ]: Start difference. First operand 91 states. Second operand 2 states. [2018-06-22 12:18:34,422 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:34,422 INFO ]: Finished difference Result 76 states and 114 transitions. [2018-06-22 12:18:34,422 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 12:18:34,424 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 12:18:34,424 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:34,436 INFO ]: With dead ends: 76 [2018-06-22 12:18:34,436 INFO ]: Without dead ends: 63 [2018-06-22 12:18:34,438 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 12:18:34,455 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 12:18:34,496 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-06-22 12:18:34,498 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 12:18:34,501 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 96 transitions. [2018-06-22 12:18:34,502 INFO ]: Start accepts. Automaton has 63 states and 96 transitions. Word has length 5 [2018-06-22 12:18:34,503 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:34,503 INFO ]: Abstraction has 63 states and 96 transitions. [2018-06-22 12:18:34,503 INFO ]: Interpolant automaton has 2 states. [2018-06-22 12:18:34,503 INFO ]: Start isEmpty. Operand 63 states and 96 transitions. [2018-06-22 12:18:34,506 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 12:18:34,506 INFO ]: Found error trace [2018-06-22 12:18:34,506 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:34,506 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:34,507 INFO ]: Analyzing trace with hash -1859120652, now seen corresponding path program 1 times [2018-06-22 12:18:34,507 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:34,507 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:34,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:34,508 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:34,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:34,533 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:34,627 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:18:34,627 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:18:34,627 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 12:18:34,629 INFO ]: Interpolant automaton has 5 states [2018-06-22 12:18:34,629 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 12:18:34,629 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:18:34,629 INFO ]: Start difference. First operand 63 states and 96 transitions. Second operand 5 states. [2018-06-22 12:18:35,091 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:35,091 INFO ]: Finished difference Result 69 states and 111 transitions. [2018-06-22 12:18:35,092 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 12:18:35,093 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 12:18:35,093 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:35,095 INFO ]: With dead ends: 69 [2018-06-22 12:18:35,095 INFO ]: Without dead ends: 69 [2018-06-22 12:18:35,096 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:18:35,096 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 12:18:35,127 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-06-22 12:18:35,127 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 12:18:35,129 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 109 transitions. [2018-06-22 12:18:35,129 INFO ]: Start accepts. Automaton has 67 states and 109 transitions. Word has length 13 [2018-06-22 12:18:35,129 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:35,129 INFO ]: Abstraction has 67 states and 109 transitions. [2018-06-22 12:18:35,129 INFO ]: Interpolant automaton has 5 states. [2018-06-22 12:18:35,129 INFO ]: Start isEmpty. Operand 67 states and 109 transitions. [2018-06-22 12:18:35,133 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 12:18:35,133 INFO ]: Found error trace [2018-06-22 12:18:35,133 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:35,133 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:35,134 INFO ]: Analyzing trace with hash 572978013, now seen corresponding path program 1 times [2018-06-22 12:18:35,134 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:35,134 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:35,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:35,134 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:35,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:35,142 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:35,242 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:18:35,242 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:18:35,242 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 12:18:35,242 INFO ]: Interpolant automaton has 5 states [2018-06-22 12:18:35,242 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 12:18:35,243 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:18:35,243 INFO ]: Start difference. First operand 67 states and 109 transitions. Second operand 5 states. [2018-06-22 12:18:35,367 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:35,367 INFO ]: Finished difference Result 69 states and 110 transitions. [2018-06-22 12:18:35,367 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 12:18:35,367 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 12:18:35,368 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:35,371 INFO ]: With dead ends: 69 [2018-06-22 12:18:35,371 INFO ]: Without dead ends: 69 [2018-06-22 12:18:35,371 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:18:35,371 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 12:18:35,386 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-06-22 12:18:35,386 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 12:18:35,389 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 108 transitions. [2018-06-22 12:18:35,389 INFO ]: Start accepts. Automaton has 67 states and 108 transitions. Word has length 13 [2018-06-22 12:18:35,390 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:35,390 INFO ]: Abstraction has 67 states and 108 transitions. [2018-06-22 12:18:35,390 INFO ]: Interpolant automaton has 5 states. [2018-06-22 12:18:35,390 INFO ]: Start isEmpty. Operand 67 states and 108 transitions. [2018-06-22 12:18:35,392 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 12:18:35,392 INFO ]: Found error trace [2018-06-22 12:18:35,392 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:35,392 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:35,392 INFO ]: Analyzing trace with hash -1418233160, now seen corresponding path program 1 times [2018-06-22 12:18:35,392 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:35,392 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:35,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:35,393 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:35,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:35,433 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:35,504 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:18:35,504 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:18:35,504 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 12:18:35,505 INFO ]: Interpolant automaton has 7 states [2018-06-22 12:18:35,505 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 12:18:35,505 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:18:35,505 INFO ]: Start difference. First operand 67 states and 108 transitions. Second operand 7 states. [2018-06-22 12:18:36,099 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:36,099 INFO ]: Finished difference Result 71 states and 115 transitions. [2018-06-22 12:18:36,100 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:18:36,100 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 12:18:36,100 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:36,101 INFO ]: With dead ends: 71 [2018-06-22 12:18:36,101 INFO ]: Without dead ends: 71 [2018-06-22 12:18:36,102 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 12:18:36,102 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 12:18:36,111 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-06-22 12:18:36,111 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 12:18:36,113 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 113 transitions. [2018-06-22 12:18:36,113 INFO ]: Start accepts. Automaton has 69 states and 113 transitions. Word has length 17 [2018-06-22 12:18:36,113 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:36,113 INFO ]: Abstraction has 69 states and 113 transitions. [2018-06-22 12:18:36,113 INFO ]: Interpolant automaton has 7 states. [2018-06-22 12:18:36,113 INFO ]: Start isEmpty. Operand 69 states and 113 transitions. [2018-06-22 12:18:36,115 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 12:18:36,115 INFO ]: Found error trace [2018-06-22 12:18:36,115 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:36,115 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:36,115 INFO ]: Analyzing trace with hash 161411233, now seen corresponding path program 1 times [2018-06-22 12:18:36,115 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:36,115 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:36,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:36,116 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:36,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:36,127 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:36,169 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:18:36,169 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:18:36,169 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 12:18:36,169 INFO ]: Interpolant automaton has 7 states [2018-06-22 12:18:36,169 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 12:18:36,169 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:18:36,169 INFO ]: Start difference. First operand 69 states and 113 transitions. Second operand 7 states. [2018-06-22 12:18:36,447 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:36,447 INFO ]: Finished difference Result 71 states and 114 transitions. [2018-06-22 12:18:36,447 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:18:36,447 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 12:18:36,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:36,449 INFO ]: With dead ends: 71 [2018-06-22 12:18:36,449 INFO ]: Without dead ends: 71 [2018-06-22 12:18:36,450 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 12:18:36,450 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 12:18:36,457 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 65. [2018-06-22 12:18:36,457 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 12:18:36,458 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 100 transitions. [2018-06-22 12:18:36,459 INFO ]: Start accepts. Automaton has 65 states and 100 transitions. Word has length 17 [2018-06-22 12:18:36,459 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:36,459 INFO ]: Abstraction has 65 states and 100 transitions. [2018-06-22 12:18:36,459 INFO ]: Interpolant automaton has 7 states. [2018-06-22 12:18:36,459 INFO ]: Start isEmpty. Operand 65 states and 100 transitions. [2018-06-22 12:18:36,460 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:18:36,460 INFO ]: Found error trace [2018-06-22 12:18:36,460 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:36,460 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:36,460 INFO ]: Analyzing trace with hash -1992449797, now seen corresponding path program 1 times [2018-06-22 12:18:36,461 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:36,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:36,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:36,461 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:36,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:36,470 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:36,535 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:18:36,535 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:18:36,535 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 12:18:36,535 INFO ]: Interpolant automaton has 5 states [2018-06-22 12:18:36,536 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 12:18:36,536 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:18:36,536 INFO ]: Start difference. First operand 65 states and 100 transitions. Second operand 5 states. [2018-06-22 12:18:36,737 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:36,737 INFO ]: Finished difference Result 71 states and 116 transitions. [2018-06-22 12:18:36,737 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 12:18:36,737 INFO ]: Start accepts. Automaton has 5 states. Word has length 21 [2018-06-22 12:18:36,738 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:36,739 INFO ]: With dead ends: 71 [2018-06-22 12:18:36,739 INFO ]: Without dead ends: 71 [2018-06-22 12:18:36,739 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:18:36,739 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 12:18:36,748 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-06-22 12:18:36,748 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 12:18:36,749 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 114 transitions. [2018-06-22 12:18:36,749 INFO ]: Start accepts. Automaton has 69 states and 114 transitions. Word has length 21 [2018-06-22 12:18:36,749 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:36,749 INFO ]: Abstraction has 69 states and 114 transitions. [2018-06-22 12:18:36,749 INFO ]: Interpolant automaton has 5 states. [2018-06-22 12:18:36,749 INFO ]: Start isEmpty. Operand 69 states and 114 transitions. [2018-06-22 12:18:36,751 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:18:36,751 INFO ]: Found error trace [2018-06-22 12:18:36,751 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:36,751 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:36,751 INFO ]: Analyzing trace with hash -919114908, now seen corresponding path program 1 times [2018-06-22 12:18:36,751 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:36,751 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:36,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:36,752 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:36,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:36,761 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:36,803 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:18:36,803 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:18:36,877 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 12:18:36,878 INFO ]: Interpolant automaton has 5 states [2018-06-22 12:18:36,878 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 12:18:36,878 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:18:36,878 INFO ]: Start difference. First operand 69 states and 114 transitions. Second operand 5 states. [2018-06-22 12:18:37,016 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:37,017 INFO ]: Finished difference Result 71 states and 115 transitions. [2018-06-22 12:18:37,017 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 12:18:37,017 INFO ]: Start accepts. Automaton has 5 states. Word has length 21 [2018-06-22 12:18:37,018 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:37,019 INFO ]: With dead ends: 71 [2018-06-22 12:18:37,019 INFO ]: Without dead ends: 71 [2018-06-22 12:18:37,020 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:18:37,020 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 12:18:37,029 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 67. [2018-06-22 12:18:37,029 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 12:18:37,031 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 109 transitions. [2018-06-22 12:18:37,031 INFO ]: Start accepts. Automaton has 67 states and 109 transitions. Word has length 21 [2018-06-22 12:18:37,031 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:37,031 INFO ]: Abstraction has 67 states and 109 transitions. [2018-06-22 12:18:37,031 INFO ]: Interpolant automaton has 5 states. [2018-06-22 12:18:37,031 INFO ]: Start isEmpty. Operand 67 states and 109 transitions. [2018-06-22 12:18:37,032 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:18:37,032 INFO ]: Found error trace [2018-06-22 12:18:37,032 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:37,032 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:37,032 INFO ]: Analyzing trace with hash 1781616776, now seen corresponding path program 1 times [2018-06-22 12:18:37,032 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:37,033 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:37,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:37,033 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:37,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:37,046 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:37,085 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:18:37,085 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:18:37,085 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:18:37,091 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:37,127 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:37,133 INFO ]: Computing forward predicates... [2018-06-22 12:18:37,504 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:18:37,524 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 12:18:37,524 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2018-06-22 12:18:37,524 INFO ]: Interpolant automaton has 10 states [2018-06-22 12:18:37,525 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 12:18:37,525 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 12:18:37,525 INFO ]: Start difference. First operand 67 states and 109 transitions. Second operand 10 states. [2018-06-22 12:18:37,686 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:37,686 INFO ]: Finished difference Result 77 states and 128 transitions. [2018-06-22 12:18:37,686 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:18:37,686 INFO ]: Start accepts. Automaton has 10 states. Word has length 21 [2018-06-22 12:18:37,686 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:37,687 INFO ]: With dead ends: 77 [2018-06-22 12:18:37,687 INFO ]: Without dead ends: 77 [2018-06-22 12:18:37,688 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 12:18:37,688 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-22 12:18:37,697 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-06-22 12:18:37,697 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 12:18:37,699 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 123 transitions. [2018-06-22 12:18:37,699 INFO ]: Start accepts. Automaton has 73 states and 123 transitions. Word has length 21 [2018-06-22 12:18:37,699 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:37,699 INFO ]: Abstraction has 73 states and 123 transitions. [2018-06-22 12:18:37,699 INFO ]: Interpolant automaton has 10 states. [2018-06-22 12:18:37,699 INFO ]: Start isEmpty. Operand 73 states and 123 transitions. [2018-06-22 12:18:37,700 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:18:37,700 INFO ]: Found error trace [2018-06-22 12:18:37,700 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:37,700 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:37,700 INFO ]: Analyzing trace with hash 1510486027, now seen corresponding path program 1 times [2018-06-22 12:18:37,700 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:37,700 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:37,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:37,701 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:37,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:37,709 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:37,768 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:18:37,768 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:18:37,768 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:18:37,768 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:18:37,768 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:18:37,769 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:18:37,769 INFO ]: Start difference. First operand 73 states and 123 transitions. Second operand 4 states. [2018-06-22 12:18:37,830 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:37,830 INFO ]: Finished difference Result 75 states and 124 transitions. [2018-06-22 12:18:37,830 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:18:37,830 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 12:18:37,830 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:37,831 INFO ]: With dead ends: 75 [2018-06-22 12:18:37,831 INFO ]: Without dead ends: 75 [2018-06-22 12:18:37,831 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:18:37,832 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 12:18:37,839 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-06-22 12:18:37,839 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 12:18:37,840 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 122 transitions. [2018-06-22 12:18:37,840 INFO ]: Start accepts. Automaton has 73 states and 122 transitions. Word has length 21 [2018-06-22 12:18:37,841 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:37,841 INFO ]: Abstraction has 73 states and 122 transitions. [2018-06-22 12:18:37,841 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:18:37,841 INFO ]: Start isEmpty. Operand 73 states and 122 transitions. [2018-06-22 12:18:37,842 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 12:18:37,842 INFO ]: Found error trace [2018-06-22 12:18:37,842 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:37,842 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:37,842 INFO ]: Analyzing trace with hash 1473602525, now seen corresponding path program 1 times [2018-06-22 12:18:37,842 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:37,842 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:37,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:37,843 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:37,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:37,852 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:37,893 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:18:37,893 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:18:37,893 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:18:37,901 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:37,918 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:37,920 INFO ]: Computing forward predicates... [2018-06-22 12:18:37,972 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:18:37,993 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 12:18:37,993 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-06-22 12:18:37,993 INFO ]: Interpolant automaton has 10 states [2018-06-22 12:18:37,993 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 12:18:37,993 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 12:18:37,994 INFO ]: Start difference. First operand 73 states and 122 transitions. Second operand 10 states. [2018-06-22 12:18:38,329 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:38,329 INFO ]: Finished difference Result 75 states and 123 transitions. [2018-06-22 12:18:38,329 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:18:38,329 INFO ]: Start accepts. Automaton has 10 states. Word has length 29 [2018-06-22 12:18:38,329 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:38,330 INFO ]: With dead ends: 75 [2018-06-22 12:18:38,330 INFO ]: Without dead ends: 75 [2018-06-22 12:18:38,330 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-22 12:18:38,330 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 12:18:38,337 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-06-22 12:18:38,337 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 12:18:38,338 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 121 transitions. [2018-06-22 12:18:38,338 INFO ]: Start accepts. Automaton has 73 states and 121 transitions. Word has length 29 [2018-06-22 12:18:38,338 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:38,338 INFO ]: Abstraction has 73 states and 121 transitions. [2018-06-22 12:18:38,338 INFO ]: Interpolant automaton has 10 states. [2018-06-22 12:18:38,338 INFO ]: Start isEmpty. Operand 73 states and 121 transitions. [2018-06-22 12:18:38,340 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:18:38,340 INFO ]: Found error trace [2018-06-22 12:18:38,340 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:38,340 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:38,340 INFO ]: Analyzing trace with hash 540288420, now seen corresponding path program 1 times [2018-06-22 12:18:38,340 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:38,340 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:38,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:38,341 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:38,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:38,352 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:38,379 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:18:38,379 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:18:38,379 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:18:38,380 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:18:38,380 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:18:38,380 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:18:38,380 INFO ]: Start difference. First operand 73 states and 121 transitions. Second operand 4 states. [2018-06-22 12:18:38,410 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:38,410 INFO ]: Finished difference Result 75 states and 122 transitions. [2018-06-22 12:18:38,410 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:18:38,410 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 12:18:38,410 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:38,411 INFO ]: With dead ends: 75 [2018-06-22 12:18:38,411 INFO ]: Without dead ends: 75 [2018-06-22 12:18:38,411 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:18:38,411 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 12:18:38,419 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-06-22 12:18:38,419 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 12:18:38,420 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2018-06-22 12:18:38,420 INFO ]: Start accepts. Automaton has 73 states and 120 transitions. Word has length 21 [2018-06-22 12:18:38,420 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:38,420 INFO ]: Abstraction has 73 states and 120 transitions. [2018-06-22 12:18:38,420 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:18:38,420 INFO ]: Start isEmpty. Operand 73 states and 120 transitions. [2018-06-22 12:18:38,421 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 12:18:38,421 INFO ]: Found error trace [2018-06-22 12:18:38,422 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:38,422 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:38,422 INFO ]: Analyzing trace with hash -1017050929, now seen corresponding path program 1 times [2018-06-22 12:18:38,422 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:38,422 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:38,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:38,423 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:38,423 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:38,431 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:38,475 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 12:18:38,475 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:18:38,475 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 12:18:38,476 INFO ]: Interpolant automaton has 7 states [2018-06-22 12:18:38,476 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 12:18:38,476 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:18:38,476 INFO ]: Start difference. First operand 73 states and 120 transitions. Second operand 7 states. [2018-06-22 12:18:38,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:38,668 INFO ]: Finished difference Result 75 states and 121 transitions. [2018-06-22 12:18:38,668 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:18:38,668 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 12:18:38,668 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:38,668 INFO ]: With dead ends: 75 [2018-06-22 12:18:38,668 INFO ]: Without dead ends: 73 [2018-06-22 12:18:38,669 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 12:18:38,669 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 12:18:38,673 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-06-22 12:18:38,673 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 12:18:38,674 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 115 transitions. [2018-06-22 12:18:38,674 INFO ]: Start accepts. Automaton has 71 states and 115 transitions. Word has length 25 [2018-06-22 12:18:38,674 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:38,674 INFO ]: Abstraction has 71 states and 115 transitions. [2018-06-22 12:18:38,674 INFO ]: Interpolant automaton has 7 states. [2018-06-22 12:18:38,674 INFO ]: Start isEmpty. Operand 71 states and 115 transitions. [2018-06-22 12:18:38,678 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 12:18:38,678 INFO ]: Found error trace [2018-06-22 12:18:38,678 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:38,678 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:38,679 INFO ]: Analyzing trace with hash -2098527768, now seen corresponding path program 1 times [2018-06-22 12:18:38,679 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:38,679 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:38,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:38,679 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:38,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:38,688 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:38,731 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 12:18:38,731 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:18:38,731 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 12:18:38,731 INFO ]: Interpolant automaton has 7 states [2018-06-22 12:18:38,731 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 12:18:38,731 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:18:38,731 INFO ]: Start difference. First operand 71 states and 115 transitions. Second operand 7 states. [2018-06-22 12:18:38,935 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:38,935 INFO ]: Finished difference Result 73 states and 116 transitions. [2018-06-22 12:18:38,936 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:18:38,936 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 12:18:38,936 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:38,937 INFO ]: With dead ends: 73 [2018-06-22 12:18:38,937 INFO ]: Without dead ends: 71 [2018-06-22 12:18:38,937 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 12:18:38,937 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 12:18:38,944 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-06-22 12:18:38,944 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 12:18:38,945 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 110 transitions. [2018-06-22 12:18:38,945 INFO ]: Start accepts. Automaton has 69 states and 110 transitions. Word has length 25 [2018-06-22 12:18:38,945 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:38,945 INFO ]: Abstraction has 69 states and 110 transitions. [2018-06-22 12:18:38,945 INFO ]: Interpolant automaton has 7 states. [2018-06-22 12:18:38,945 INFO ]: Start isEmpty. Operand 69 states and 110 transitions. [2018-06-22 12:18:38,946 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 12:18:38,946 INFO ]: Found error trace [2018-06-22 12:18:38,946 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:38,946 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:38,946 INFO ]: Analyzing trace with hash -1681594932, now seen corresponding path program 1 times [2018-06-22 12:18:38,946 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:38,946 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:38,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:38,947 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:38,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:38,955 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:39,139 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 12:18:39,139 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:18:39,139 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:18:39,145 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:39,161 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:39,162 INFO ]: Computing forward predicates... [2018-06-22 12:18:39,181 INFO ]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:18:39,200 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 12:18:39,200 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2018-06-22 12:18:39,200 INFO ]: Interpolant automaton has 8 states [2018-06-22 12:18:39,200 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 12:18:39,200 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 12:18:39,201 INFO ]: Start difference. First operand 69 states and 110 transitions. Second operand 8 states. [2018-06-22 12:18:39,297 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:39,297 INFO ]: Finished difference Result 73 states and 116 transitions. [2018-06-22 12:18:39,297 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:18:39,297 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 12:18:39,297 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:39,298 INFO ]: With dead ends: 73 [2018-06-22 12:18:39,298 INFO ]: Without dead ends: 73 [2018-06-22 12:18:39,298 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 12:18:39,298 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 12:18:39,303 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-06-22 12:18:39,303 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 12:18:39,309 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 113 transitions. [2018-06-22 12:18:39,309 INFO ]: Start accepts. Automaton has 71 states and 113 transitions. Word has length 25 [2018-06-22 12:18:39,309 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:39,309 INFO ]: Abstraction has 71 states and 113 transitions. [2018-06-22 12:18:39,309 INFO ]: Interpolant automaton has 8 states. [2018-06-22 12:18:39,309 INFO ]: Start isEmpty. Operand 71 states and 113 transitions. [2018-06-22 12:18:39,310 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 12:18:39,310 INFO ]: Found error trace [2018-06-22 12:18:39,310 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:39,310 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:39,311 INFO ]: Analyzing trace with hash 614711585, now seen corresponding path program 1 times [2018-06-22 12:18:39,311 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:39,311 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:39,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:39,311 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:39,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:39,331 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:39,391 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 12:18:39,391 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:18:39,391 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 12:18:39,391 INFO ]: Interpolant automaton has 7 states [2018-06-22 12:18:39,391 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 12:18:39,391 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:18:39,391 INFO ]: Start difference. First operand 71 states and 113 transitions. Second operand 7 states. [2018-06-22 12:18:39,514 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:39,515 INFO ]: Finished difference Result 71 states and 112 transitions. [2018-06-22 12:18:39,515 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:18:39,515 INFO ]: Start accepts. Automaton has 7 states. Word has length 29 [2018-06-22 12:18:39,515 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:39,515 INFO ]: With dead ends: 71 [2018-06-22 12:18:39,515 INFO ]: Without dead ends: 70 [2018-06-22 12:18:39,516 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 12:18:39,516 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 12:18:39,522 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-06-22 12:18:39,522 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 12:18:39,523 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 110 transitions. [2018-06-22 12:18:39,523 INFO ]: Start accepts. Automaton has 70 states and 110 transitions. Word has length 29 [2018-06-22 12:18:39,523 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:39,523 INFO ]: Abstraction has 70 states and 110 transitions. [2018-06-22 12:18:39,523 INFO ]: Interpolant automaton has 7 states. [2018-06-22 12:18:39,523 INFO ]: Start isEmpty. Operand 70 states and 110 transitions. [2018-06-22 12:18:39,524 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 12:18:39,524 INFO ]: Found error trace [2018-06-22 12:18:39,524 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:39,524 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:39,524 INFO ]: Analyzing trace with hash 984052874, now seen corresponding path program 1 times [2018-06-22 12:18:39,525 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:39,525 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:39,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:39,527 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:39,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:39,540 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:39,605 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 12:18:39,605 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:18:39,605 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 12:18:39,605 INFO ]: Interpolant automaton has 7 states [2018-06-22 12:18:39,605 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 12:18:39,605 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:18:39,605 INFO ]: Start difference. First operand 70 states and 110 transitions. Second operand 7 states. [2018-06-22 12:18:39,710 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:39,710 INFO ]: Finished difference Result 70 states and 109 transitions. [2018-06-22 12:18:39,710 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:18:39,710 INFO ]: Start accepts. Automaton has 7 states. Word has length 29 [2018-06-22 12:18:39,711 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:39,712 INFO ]: With dead ends: 70 [2018-06-22 12:18:39,712 INFO ]: Without dead ends: 69 [2018-06-22 12:18:39,712 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 12:18:39,712 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 12:18:39,716 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-06-22 12:18:39,716 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 12:18:39,717 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2018-06-22 12:18:39,717 INFO ]: Start accepts. Automaton has 65 states and 94 transitions. Word has length 29 [2018-06-22 12:18:39,717 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:39,717 INFO ]: Abstraction has 65 states and 94 transitions. [2018-06-22 12:18:39,717 INFO ]: Interpolant automaton has 7 states. [2018-06-22 12:18:39,717 INFO ]: Start isEmpty. Operand 65 states and 94 transitions. [2018-06-22 12:18:39,718 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 12:18:39,718 INFO ]: Found error trace [2018-06-22 12:18:39,718 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:39,718 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:39,718 INFO ]: Analyzing trace with hash 1480393363, now seen corresponding path program 1 times [2018-06-22 12:18:39,718 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:39,718 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:39,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:39,719 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:39,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:39,724 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:39,783 INFO ]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 12:18:39,783 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:18:39,783 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 12:18:39,783 INFO ]: Interpolant automaton has 7 states [2018-06-22 12:18:39,783 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 12:18:39,783 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:18:39,783 INFO ]: Start difference. First operand 65 states and 94 transitions. Second operand 7 states. [2018-06-22 12:18:39,889 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:39,889 INFO ]: Finished difference Result 75 states and 114 transitions. [2018-06-22 12:18:39,889 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:18:39,889 INFO ]: Start accepts. Automaton has 7 states. Word has length 33 [2018-06-22 12:18:39,889 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:39,890 INFO ]: With dead ends: 75 [2018-06-22 12:18:39,890 INFO ]: Without dead ends: 75 [2018-06-22 12:18:39,890 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 12:18:39,890 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 12:18:39,894 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 69. [2018-06-22 12:18:39,894 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 12:18:39,895 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 107 transitions. [2018-06-22 12:18:39,895 INFO ]: Start accepts. Automaton has 69 states and 107 transitions. Word has length 33 [2018-06-22 12:18:39,895 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:39,895 INFO ]: Abstraction has 69 states and 107 transitions. [2018-06-22 12:18:39,895 INFO ]: Interpolant automaton has 7 states. [2018-06-22 12:18:39,895 INFO ]: Start isEmpty. Operand 69 states and 107 transitions. [2018-06-22 12:18:39,896 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 12:18:39,896 INFO ]: Found error trace [2018-06-22 12:18:39,896 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:39,896 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:39,897 INFO ]: Analyzing trace with hash -1924442754, now seen corresponding path program 1 times [2018-06-22 12:18:39,897 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:39,897 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:39,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:39,897 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:39,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:39,910 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:40,113 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 12:18:40,113 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:18:40,113 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:18:40,119 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:40,132 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:40,134 INFO ]: Computing forward predicates... [2018-06-22 12:18:40,261 INFO ]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:18:40,285 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:18:40,285 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-22 12:18:40,285 INFO ]: Interpolant automaton has 10 states [2018-06-22 12:18:40,285 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 12:18:40,285 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 12:18:40,285 INFO ]: Start difference. First operand 69 states and 107 transitions. Second operand 10 states. [2018-06-22 12:18:40,473 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:40,473 INFO ]: Finished difference Result 77 states and 126 transitions. [2018-06-22 12:18:40,473 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 12:18:40,473 INFO ]: Start accepts. Automaton has 10 states. Word has length 33 [2018-06-22 12:18:40,474 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:40,474 INFO ]: With dead ends: 77 [2018-06-22 12:18:40,474 INFO ]: Without dead ends: 77 [2018-06-22 12:18:40,475 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-06-22 12:18:40,475 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-22 12:18:40,480 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-06-22 12:18:40,480 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 12:18:40,480 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 124 transitions. [2018-06-22 12:18:40,480 INFO ]: Start accepts. Automaton has 75 states and 124 transitions. Word has length 33 [2018-06-22 12:18:40,481 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:40,481 INFO ]: Abstraction has 75 states and 124 transitions. [2018-06-22 12:18:40,481 INFO ]: Interpolant automaton has 10 states. [2018-06-22 12:18:40,481 INFO ]: Start isEmpty. Operand 75 states and 124 transitions. [2018-06-22 12:18:40,482 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 12:18:40,482 INFO ]: Found error trace [2018-06-22 12:18:40,482 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:40,482 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:40,482 INFO ]: Analyzing trace with hash 1190848501, now seen corresponding path program 1 times [2018-06-22 12:18:40,482 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:40,482 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:40,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:40,483 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:40,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:40,491 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:40,970 INFO ]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 12:18:40,970 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:18:40,970 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 12:18:40,970 INFO ]: Interpolant automaton has 7 states [2018-06-22 12:18:40,970 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 12:18:40,970 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:18:40,970 INFO ]: Start difference. First operand 75 states and 124 transitions. Second operand 7 states. [2018-06-22 12:18:41,137 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:41,137 INFO ]: Finished difference Result 75 states and 123 transitions. [2018-06-22 12:18:41,137 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:18:41,137 INFO ]: Start accepts. Automaton has 7 states. Word has length 37 [2018-06-22 12:18:41,137 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:41,138 INFO ]: With dead ends: 75 [2018-06-22 12:18:41,138 INFO ]: Without dead ends: 75 [2018-06-22 12:18:41,138 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 12:18:41,138 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 12:18:41,144 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-06-22 12:18:41,144 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 12:18:41,145 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2018-06-22 12:18:41,145 INFO ]: Start accepts. Automaton has 73 states and 120 transitions. Word has length 37 [2018-06-22 12:18:41,145 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:41,145 INFO ]: Abstraction has 73 states and 120 transitions. [2018-06-22 12:18:41,145 INFO ]: Interpolant automaton has 7 states. [2018-06-22 12:18:41,145 INFO ]: Start isEmpty. Operand 73 states and 120 transitions. [2018-06-22 12:18:41,146 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 12:18:41,146 INFO ]: Found error trace [2018-06-22 12:18:41,146 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:41,146 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:41,146 INFO ]: Analyzing trace with hash -1104333919, now seen corresponding path program 1 times [2018-06-22 12:18:41,146 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:41,146 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:41,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:41,147 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:41,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:41,153 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:41,269 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 12:18:41,269 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:18:41,269 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:18:41,275 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:41,289 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:41,291 INFO ]: Computing forward predicates... [2018-06-22 12:18:41,316 INFO ]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:18:41,336 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:18:41,336 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-22 12:18:41,336 INFO ]: Interpolant automaton has 10 states [2018-06-22 12:18:41,336 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 12:18:41,337 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 12:18:41,337 INFO ]: Start difference. First operand 73 states and 120 transitions. Second operand 10 states. [2018-06-22 12:18:41,616 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:41,616 INFO ]: Finished difference Result 75 states and 121 transitions. [2018-06-22 12:18:41,616 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 12:18:41,616 INFO ]: Start accepts. Automaton has 10 states. Word has length 33 [2018-06-22 12:18:41,616 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:41,617 INFO ]: With dead ends: 75 [2018-06-22 12:18:41,617 INFO ]: Without dead ends: 75 [2018-06-22 12:18:41,617 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-06-22 12:18:41,617 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 12:18:41,622 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-06-22 12:18:41,622 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 12:18:41,623 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 119 transitions. [2018-06-22 12:18:41,623 INFO ]: Start accepts. Automaton has 73 states and 119 transitions. Word has length 33 [2018-06-22 12:18:41,623 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:41,623 INFO ]: Abstraction has 73 states and 119 transitions. [2018-06-22 12:18:41,623 INFO ]: Interpolant automaton has 10 states. [2018-06-22 12:18:41,623 INFO ]: Start isEmpty. Operand 73 states and 119 transitions. [2018-06-22 12:18:41,624 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 12:18:41,624 INFO ]: Found error trace [2018-06-22 12:18:41,624 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:41,624 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:41,624 INFO ]: Analyzing trace with hash 1181499842, now seen corresponding path program 2 times [2018-06-22 12:18:41,624 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:41,625 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:41,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:41,625 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:41,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:41,634 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:41,826 INFO ]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 12:18:41,826 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:18:41,826 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:18:41,832 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 12:18:41,850 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 12:18:41,851 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:41,853 INFO ]: Computing forward predicates... [2018-06-22 12:18:41,898 INFO ]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:18:41,917 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 12:18:41,917 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 13 [2018-06-22 12:18:41,917 INFO ]: Interpolant automaton has 13 states [2018-06-22 12:18:41,918 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 12:18:41,918 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-22 12:18:41,918 INFO ]: Start difference. First operand 73 states and 119 transitions. Second operand 13 states. [2018-06-22 12:18:42,685 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:42,685 INFO ]: Finished difference Result 84 states and 144 transitions. [2018-06-22 12:18:42,685 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 12:18:42,685 INFO ]: Start accepts. Automaton has 13 states. Word has length 37 [2018-06-22 12:18:42,685 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:42,686 INFO ]: With dead ends: 84 [2018-06-22 12:18:42,686 INFO ]: Without dead ends: 83 [2018-06-22 12:18:42,687 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-06-22 12:18:42,687 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-22 12:18:42,692 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-06-22 12:18:42,692 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 12:18:42,693 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 138 transitions. [2018-06-22 12:18:42,693 INFO ]: Start accepts. Automaton has 79 states and 138 transitions. Word has length 37 [2018-06-22 12:18:42,693 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:42,693 INFO ]: Abstraction has 79 states and 138 transitions. [2018-06-22 12:18:42,693 INFO ]: Interpolant automaton has 13 states. [2018-06-22 12:18:42,693 INFO ]: Start isEmpty. Operand 79 states and 138 transitions. [2018-06-22 12:18:42,694 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 12:18:42,694 INFO ]: Found error trace [2018-06-22 12:18:42,694 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:42,694 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:42,695 INFO ]: Analyzing trace with hash -129050395, now seen corresponding path program 2 times [2018-06-22 12:18:42,695 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:42,695 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:42,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:42,695 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:18:42,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:42,703 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:42,781 INFO ]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 12:18:42,781 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:18:42,781 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:18:42,788 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 12:18:42,822 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 12:18:42,822 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:42,825 INFO ]: Computing forward predicates... [2018-06-22 12:18:43,040 INFO ]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:18:43,059 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 12:18:43,059 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 13 [2018-06-22 12:18:43,059 INFO ]: Interpolant automaton has 13 states [2018-06-22 12:18:43,059 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 12:18:43,059 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-22 12:18:43,059 INFO ]: Start difference. First operand 79 states and 138 transitions. Second operand 13 states. [2018-06-22 12:18:43,302 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:43,302 INFO ]: Finished difference Result 82 states and 140 transitions. [2018-06-22 12:18:43,304 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 12:18:43,304 INFO ]: Start accepts. Automaton has 13 states. Word has length 37 [2018-06-22 12:18:43,304 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:43,305 INFO ]: With dead ends: 82 [2018-06-22 12:18:43,305 INFO ]: Without dead ends: 81 [2018-06-22 12:18:43,305 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-06-22 12:18:43,305 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 12:18:43,310 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-06-22 12:18:43,310 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 12:18:43,311 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 136 transitions. [2018-06-22 12:18:43,311 INFO ]: Start accepts. Automaton has 79 states and 136 transitions. Word has length 37 [2018-06-22 12:18:43,311 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:43,311 INFO ]: Abstraction has 79 states and 136 transitions. [2018-06-22 12:18:43,311 INFO ]: Interpolant automaton has 13 states. [2018-06-22 12:18:43,311 INFO ]: Start isEmpty. Operand 79 states and 136 transitions. [2018-06-22 12:18:43,313 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 12:18:43,313 INFO ]: Found error trace [2018-06-22 12:18:43,313 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:43,313 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:43,313 INFO ]: Analyzing trace with hash 1295576416, now seen corresponding path program 1 times [2018-06-22 12:18:43,313 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:43,313 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:43,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:43,313 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:18:43,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:43,320 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:43,419 INFO ]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 12:18:43,419 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:18:43,419 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 12:18:43,419 INFO ]: Interpolant automaton has 7 states [2018-06-22 12:18:43,420 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 12:18:43,420 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:18:43,420 INFO ]: Start difference. First operand 79 states and 136 transitions. Second operand 7 states. [2018-06-22 12:18:43,482 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:43,482 INFO ]: Finished difference Result 83 states and 141 transitions. [2018-06-22 12:18:43,482 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:18:43,482 INFO ]: Start accepts. Automaton has 7 states. Word has length 37 [2018-06-22 12:18:43,482 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:43,483 INFO ]: With dead ends: 83 [2018-06-22 12:18:43,483 INFO ]: Without dead ends: 82 [2018-06-22 12:18:43,483 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 12:18:43,483 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-22 12:18:43,489 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 79. [2018-06-22 12:18:43,489 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 12:18:43,490 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 135 transitions. [2018-06-22 12:18:43,490 INFO ]: Start accepts. Automaton has 79 states and 135 transitions. Word has length 37 [2018-06-22 12:18:43,490 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:43,490 INFO ]: Abstraction has 79 states and 135 transitions. [2018-06-22 12:18:43,490 INFO ]: Interpolant automaton has 7 states. [2018-06-22 12:18:43,490 INFO ]: Start isEmpty. Operand 79 states and 135 transitions. [2018-06-22 12:18:43,491 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 12:18:43,491 INFO ]: Found error trace [2018-06-22 12:18:43,491 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:43,491 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:43,491 INFO ]: Analyzing trace with hash -14973821, now seen corresponding path program 1 times [2018-06-22 12:18:43,491 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:43,491 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:43,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:43,492 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:43,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:43,498 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:43,638 INFO ]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 12:18:43,638 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:18:43,638 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 12:18:43,638 INFO ]: Interpolant automaton has 7 states [2018-06-22 12:18:43,638 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 12:18:43,638 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:18:43,638 INFO ]: Start difference. First operand 79 states and 135 transitions. Second operand 7 states. [2018-06-22 12:18:43,716 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:43,716 INFO ]: Finished difference Result 80 states and 136 transitions. [2018-06-22 12:18:43,716 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:18:43,716 INFO ]: Start accepts. Automaton has 7 states. Word has length 37 [2018-06-22 12:18:43,716 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:43,717 INFO ]: With dead ends: 80 [2018-06-22 12:18:43,717 INFO ]: Without dead ends: 79 [2018-06-22 12:18:43,717 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 12:18:43,718 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 12:18:43,722 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 71. [2018-06-22 12:18:43,722 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 12:18:43,723 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 111 transitions. [2018-06-22 12:18:43,723 INFO ]: Start accepts. Automaton has 71 states and 111 transitions. Word has length 37 [2018-06-22 12:18:43,723 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:43,723 INFO ]: Abstraction has 71 states and 111 transitions. [2018-06-22 12:18:43,723 INFO ]: Interpolant automaton has 7 states. [2018-06-22 12:18:43,723 INFO ]: Start isEmpty. Operand 71 states and 111 transitions. [2018-06-22 12:18:43,724 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 12:18:43,724 INFO ]: Found error trace [2018-06-22 12:18:43,724 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:43,724 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:43,724 INFO ]: Analyzing trace with hash 682264133, now seen corresponding path program 1 times [2018-06-22 12:18:43,724 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:43,724 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:43,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:43,725 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:43,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:43,731 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:43,903 INFO ]: Checked inductivity of 16 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 12:18:43,904 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:18:43,904 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:18:43,909 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:43,925 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:43,930 INFO ]: Computing forward predicates... [2018-06-22 12:18:43,962 INFO ]: Checked inductivity of 16 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 12:18:43,984 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:18:43,984 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 8 [2018-06-22 12:18:43,984 INFO ]: Interpolant automaton has 8 states [2018-06-22 12:18:43,985 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 12:18:43,985 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 12:18:43,986 INFO ]: Start difference. First operand 71 states and 111 transitions. Second operand 8 states. [2018-06-22 12:18:44,051 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:44,051 INFO ]: Finished difference Result 73 states and 112 transitions. [2018-06-22 12:18:44,051 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 12:18:44,051 INFO ]: Start accepts. Automaton has 8 states. Word has length 41 [2018-06-22 12:18:44,051 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:44,052 INFO ]: With dead ends: 73 [2018-06-22 12:18:44,052 INFO ]: Without dead ends: 73 [2018-06-22 12:18:44,052 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 12:18:44,052 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 12:18:44,056 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-06-22 12:18:44,056 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 12:18:44,056 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 107 transitions. [2018-06-22 12:18:44,056 INFO ]: Start accepts. Automaton has 69 states and 107 transitions. Word has length 41 [2018-06-22 12:18:44,057 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:44,057 INFO ]: Abstraction has 69 states and 107 transitions. [2018-06-22 12:18:44,057 INFO ]: Interpolant automaton has 8 states. [2018-06-22 12:18:44,057 INFO ]: Start isEmpty. Operand 69 states and 107 transitions. [2018-06-22 12:18:44,057 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 12:18:44,057 INFO ]: Found error trace [2018-06-22 12:18:44,058 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:44,058 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:44,058 INFO ]: Analyzing trace with hash 110540874, now seen corresponding path program 1 times [2018-06-22 12:18:44,058 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:44,058 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:44,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:44,058 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:44,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:44,066 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:44,202 INFO ]: Checked inductivity of 22 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 12:18:44,202 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:18:44,202 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:18:44,208 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:44,239 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:44,242 INFO ]: Computing forward predicates... [2018-06-22 12:18:44,285 INFO ]: Checked inductivity of 22 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 12:18:44,304 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:18:44,304 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-22 12:18:44,304 INFO ]: Interpolant automaton has 10 states [2018-06-22 12:18:44,304 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 12:18:44,304 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 12:18:44,304 INFO ]: Start difference. First operand 69 states and 107 transitions. Second operand 10 states. [2018-06-22 12:18:44,473 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:44,473 INFO ]: Finished difference Result 79 states and 130 transitions. [2018-06-22 12:18:44,473 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 12:18:44,473 INFO ]: Start accepts. Automaton has 10 states. Word has length 45 [2018-06-22 12:18:44,473 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:44,474 INFO ]: With dead ends: 79 [2018-06-22 12:18:44,474 INFO ]: Without dead ends: 79 [2018-06-22 12:18:44,474 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-06-22 12:18:44,475 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 12:18:44,478 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-06-22 12:18:44,478 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 12:18:44,479 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 125 transitions. [2018-06-22 12:18:44,479 INFO ]: Start accepts. Automaton has 75 states and 125 transitions. Word has length 45 [2018-06-22 12:18:44,479 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:44,479 INFO ]: Abstraction has 75 states and 125 transitions. [2018-06-22 12:18:44,479 INFO ]: Interpolant automaton has 10 states. [2018-06-22 12:18:44,479 INFO ]: Start isEmpty. Operand 75 states and 125 transitions. [2018-06-22 12:18:44,480 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 12:18:44,480 INFO ]: Found error trace [2018-06-22 12:18:44,480 INFO ]: trace histogram [5, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:44,480 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:44,480 INFO ]: Analyzing trace with hash -592291866, now seen corresponding path program 1 times [2018-06-22 12:18:44,480 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:44,480 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:44,481 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:44,481 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:44,481 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:44,487 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:45,214 INFO ]: Checked inductivity of 45 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-22 12:18:45,214 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:18:45,214 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:18:45,229 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:45,271 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:45,275 INFO ]: Computing forward predicates... [2018-06-22 12:18:45,716 INFO ]: Checked inductivity of 45 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 12:18:45,747 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 12:18:45,747 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2018-06-22 12:18:45,747 INFO ]: Interpolant automaton has 11 states [2018-06-22 12:18:45,747 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 12:18:45,747 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 12:18:45,748 INFO ]: Start difference. First operand 75 states and 125 transitions. Second operand 11 states. [2018-06-22 12:18:45,898 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:45,899 INFO ]: Finished difference Result 86 states and 141 transitions. [2018-06-22 12:18:45,899 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 12:18:45,899 INFO ]: Start accepts. Automaton has 11 states. Word has length 53 [2018-06-22 12:18:45,899 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:45,899 INFO ]: With dead ends: 86 [2018-06-22 12:18:45,899 INFO ]: Without dead ends: 77 [2018-06-22 12:18:45,900 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-06-22 12:18:45,900 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-22 12:18:45,903 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-06-22 12:18:45,903 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 12:18:45,904 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 124 transitions. [2018-06-22 12:18:45,904 INFO ]: Start accepts. Automaton has 75 states and 124 transitions. Word has length 53 [2018-06-22 12:18:45,904 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:45,904 INFO ]: Abstraction has 75 states and 124 transitions. [2018-06-22 12:18:45,904 INFO ]: Interpolant automaton has 11 states. [2018-06-22 12:18:45,904 INFO ]: Start isEmpty. Operand 75 states and 124 transitions. [2018-06-22 12:18:45,906 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 12:18:45,906 INFO ]: Found error trace [2018-06-22 12:18:45,906 INFO ]: trace histogram [7, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:45,906 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:45,906 INFO ]: Analyzing trace with hash -388701433, now seen corresponding path program 1 times [2018-06-22 12:18:45,906 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:45,906 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:45,907 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:45,907 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:45,907 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:45,916 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:45,974 INFO ]: Checked inductivity of 172 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-06-22 12:18:45,974 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:18:45,974 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:18:45,980 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:46,028 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:46,031 INFO ]: Computing forward predicates... [2018-06-22 12:18:46,069 INFO ]: Checked inductivity of 172 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-06-22 12:18:46,089 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:18:46,089 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-06-22 12:18:46,090 INFO ]: Interpolant automaton has 11 states [2018-06-22 12:18:46,090 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 12:18:46,090 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 12:18:46,090 INFO ]: Start difference. First operand 75 states and 124 transitions. Second operand 11 states. [2018-06-22 12:18:46,352 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:46,352 INFO ]: Finished difference Result 76 states and 121 transitions. [2018-06-22 12:18:46,353 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 12:18:46,353 INFO ]: Start accepts. Automaton has 11 states. Word has length 93 [2018-06-22 12:18:46,353 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:46,354 INFO ]: With dead ends: 76 [2018-06-22 12:18:46,354 INFO ]: Without dead ends: 58 [2018-06-22 12:18:46,354 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-06-22 12:18:46,354 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 12:18:46,358 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-06-22 12:18:46,358 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 12:18:46,358 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2018-06-22 12:18:46,358 INFO ]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 93 [2018-06-22 12:18:46,358 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:46,358 INFO ]: Abstraction has 56 states and 81 transitions. [2018-06-22 12:18:46,358 INFO ]: Interpolant automaton has 11 states. [2018-06-22 12:18:46,358 INFO ]: Start isEmpty. Operand 56 states and 81 transitions. [2018-06-22 12:18:46,359 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 12:18:46,359 INFO ]: Found error trace [2018-06-22 12:18:46,359 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:46,359 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:46,359 INFO ]: Analyzing trace with hash 796929831, now seen corresponding path program 1 times [2018-06-22 12:18:46,359 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:46,359 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:46,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:46,360 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:46,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:46,367 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:46,478 INFO ]: Checked inductivity of 22 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 12:18:46,478 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:18:46,478 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:18:46,485 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:46,502 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:46,503 INFO ]: Computing forward predicates... [2018-06-22 12:18:46,544 INFO ]: Checked inductivity of 22 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 12:18:46,563 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:18:46,563 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-22 12:18:46,563 INFO ]: Interpolant automaton has 10 states [2018-06-22 12:18:46,564 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 12:18:46,564 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 12:18:46,564 INFO ]: Start difference. First operand 56 states and 81 transitions. Second operand 10 states. [2018-06-22 12:18:46,741 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:46,741 INFO ]: Finished difference Result 58 states and 82 transitions. [2018-06-22 12:18:46,742 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 12:18:46,742 INFO ]: Start accepts. Automaton has 10 states. Word has length 45 [2018-06-22 12:18:46,742 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:46,742 INFO ]: With dead ends: 58 [2018-06-22 12:18:46,742 INFO ]: Without dead ends: 58 [2018-06-22 12:18:46,742 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-06-22 12:18:46,743 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 12:18:46,745 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 52. [2018-06-22 12:18:46,745 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 12:18:46,745 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2018-06-22 12:18:46,745 INFO ]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 45 [2018-06-22 12:18:46,746 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:46,746 INFO ]: Abstraction has 52 states and 74 transitions. [2018-06-22 12:18:46,746 INFO ]: Interpolant automaton has 10 states. [2018-06-22 12:18:46,746 INFO ]: Start isEmpty. Operand 52 states and 74 transitions. [2018-06-22 12:18:46,746 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 12:18:46,746 INFO ]: Found error trace [2018-06-22 12:18:46,746 INFO ]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:46,746 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:46,746 INFO ]: Analyzing trace with hash -1484421460, now seen corresponding path program 2 times [2018-06-22 12:18:46,746 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:46,747 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:46,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:46,747 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:18:46,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:46,754 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:46,861 INFO ]: Checked inductivity of 32 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 12:18:46,861 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:18:46,896 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:18:46,904 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 12:18:46,923 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 12:18:46,923 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:46,925 INFO ]: Computing forward predicates... [2018-06-22 12:18:47,397 INFO ]: Checked inductivity of 32 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 12:18:47,416 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:18:47,416 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2018-06-22 12:18:47,416 INFO ]: Interpolant automaton has 20 states [2018-06-22 12:18:47,416 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 12:18:47,416 INFO ]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-06-22 12:18:47,416 INFO ]: Start difference. First operand 52 states and 74 transitions. Second operand 20 states. [2018-06-22 12:18:47,783 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:47,783 INFO ]: Finished difference Result 49 states and 66 transitions. [2018-06-22 12:18:47,784 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 12:18:47,784 INFO ]: Start accepts. Automaton has 20 states. Word has length 49 [2018-06-22 12:18:47,784 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:47,785 INFO ]: With dead ends: 49 [2018-06-22 12:18:47,785 INFO ]: Without dead ends: 48 [2018-06-22 12:18:47,786 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2018-06-22 12:18:47,786 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 12:18:47,788 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-06-22 12:18:47,788 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 12:18:47,788 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2018-06-22 12:18:47,789 INFO ]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 49 [2018-06-22 12:18:47,789 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:47,789 INFO ]: Abstraction has 47 states and 62 transitions. [2018-06-22 12:18:47,789 INFO ]: Interpolant automaton has 20 states. [2018-06-22 12:18:47,789 INFO ]: Start isEmpty. Operand 47 states and 62 transitions. [2018-06-22 12:18:47,789 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 12:18:47,789 INFO ]: Found error trace [2018-06-22 12:18:47,789 INFO ]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:18:47,789 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:18:47,790 INFO ]: Analyzing trace with hash 852457677, now seen corresponding path program 2 times [2018-06-22 12:18:47,790 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:18:47,790 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:18:47,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:47,790 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:18:47,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:18:47,799 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:48,175 INFO ]: Checked inductivity of 42 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 12:18:48,175 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:18:48,175 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:18:48,181 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 12:18:48,210 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 12:18:48,210 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:18:48,212 INFO ]: Computing forward predicates... [2018-06-22 12:18:48,311 INFO ]: Checked inductivity of 42 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 12:18:48,330 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:18:48,331 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-06-22 12:18:48,331 INFO ]: Interpolant automaton has 19 states [2018-06-22 12:18:48,331 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 12:18:48,331 INFO ]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-06-22 12:18:48,331 INFO ]: Start difference. First operand 47 states and 62 transitions. Second operand 19 states. [2018-06-22 12:18:48,724 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:18:48,724 INFO ]: Finished difference Result 57 states and 77 transitions. [2018-06-22 12:18:48,724 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 12:18:48,724 INFO ]: Start accepts. Automaton has 19 states. Word has length 53 [2018-06-22 12:18:48,724 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:18:48,724 INFO ]: With dead ends: 57 [2018-06-22 12:18:48,724 INFO ]: Without dead ends: 0 [2018-06-22 12:18:48,725 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=980, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 12:18:48,725 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 12:18:48,725 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 12:18:48,725 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 12:18:48,725 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 12:18:48,725 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2018-06-22 12:18:48,725 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:18:48,725 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 12:18:48,725 INFO ]: Interpolant automaton has 19 states. [2018-06-22 12:18:48,725 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 12:18:48,725 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 12:18:48,730 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:18:48 BoogieIcfgContainer [2018-06-22 12:18:48,730 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 12:18:48,731 INFO ]: Toolchain (without parser) took 15266.75 ms. Allocated memory was 308.3 MB in the beginning and 441.5 MB in the end (delta: 133.2 MB). Free memory was 258.7 MB in the beginning and 395.9 MB in the end (delta: -137.2 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 12:18:48,735 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 12:18:48,735 INFO ]: ChcToBoogie took 58.91 ms. Allocated memory is still 308.3 MB. Free memory was 258.7 MB in the beginning and 256.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 12:18:48,736 INFO ]: Boogie Preprocessor took 58.73 ms. Allocated memory is still 308.3 MB. Free memory was 256.7 MB in the beginning and 254.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 12:18:48,736 INFO ]: RCFGBuilder took 601.02 ms. Allocated memory is still 308.3 MB. Free memory was 254.7 MB in the beginning and 236.7 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. [2018-06-22 12:18:48,737 INFO ]: TraceAbstraction took 14540.08 ms. Allocated memory was 308.3 MB in the beginning and 441.5 MB in the end (delta: 133.2 MB). Free memory was 234.7 MB in the beginning and 395.9 MB in the end (delta: -161.2 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 12:18:48,739 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 58.91 ms. Allocated memory is still 308.3 MB. Free memory was 258.7 MB in the beginning and 256.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 58.73 ms. Allocated memory is still 308.3 MB. Free memory was 256.7 MB in the beginning and 254.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 601.02 ms. Allocated memory is still 308.3 MB. Free memory was 254.7 MB in the beginning and 236.7 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 14540.08 ms. Allocated memory was 308.3 MB in the beginning and 441.5 MB in the end (delta: 133.2 MB). Free memory was 234.7 MB in the beginning and 395.9 MB in the end (delta: -161.2 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 91 locations, 1 error locations. SAFE Result, 14.4s OverallTime, 31 OverallIterations, 7 TraceHistogramMax, 6.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2399 SDtfs, 98 SDslu, 10587 SDs, 0 SdLazy, 4477 SolverSat, 123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 887 GetRequests, 617 SyntacticMatches, 7 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=0, 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.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 86 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1589 NumberOfCodeBlocks, 1589 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1544 ConstructedInterpolants, 0 QuantifiedInterpolants, 110160 SizeOfPredicates, 42 NumberOfNonLiveVariables, 2536 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 45 InterpolantComputations, 23 PerfectInterpolantSequences, 809/949 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__rec_while.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_12-18-48-747.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__rec_while.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_12-18-48-747.csv Received shutdown request...