java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/lustre/PRODUCER_CONSUMMER_luke_2_e7_1068_e8_1019.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-27 02:47:59,057 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-27 02:47:59,059 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-27 02:47:59,074 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-27 02:47:59,074 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-27 02:47:59,075 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-27 02:47:59,076 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-27 02:47:59,078 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-27 02:47:59,079 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-27 02:47:59,080 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-27 02:47:59,083 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-27 02:47:59,083 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-27 02:47:59,084 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-27 02:47:59,085 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-27 02:47:59,086 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-27 02:47:59,086 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-27 02:47:59,089 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-27 02:47:59,091 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-27 02:47:59,100 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-27 02:47:59,101 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-27 02:47:59,102 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-27 02:47:59,103 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-27 02:47:59,109 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-27 02:47:59,109 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-27 02:47:59,109 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-27 02:47:59,110 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-27 02:47:59,111 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-27 02:47:59,111 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-27 02:47:59,114 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-27 02:47:59,115 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-27 02:47:59,115 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-27 02:47:59,115 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-27 02:47:59,116 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-27 02:47:59,116 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-27 02:47:59,116 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-27 02:47:59,120 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-27 02:47:59,120 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-27 02:47:59,144 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-27 02:47:59,145 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-27 02:47:59,145 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-27 02:47:59,145 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-27 02:47:59,146 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-27 02:47:59,147 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-27 02:47:59,147 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-27 02:47:59,147 INFO L133 SettingsManager]: * Use SBE=true [2018-06-27 02:47:59,147 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-27 02:47:59,147 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-27 02:47:59,148 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-27 02:47:59,148 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-27 02:47:59,148 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-27 02:47:59,148 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-27 02:47:59,148 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-27 02:47:59,148 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-27 02:47:59,149 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-27 02:47:59,149 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-27 02:47:59,149 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-27 02:47:59,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-27 02:47:59,149 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-27 02:47:59,151 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-27 02:47:59,151 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-27 02:47:59,185 INFO ]: Repository-Root is: /tmp [2018-06-27 02:47:59,201 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-27 02:47:59,207 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-27 02:47:59,208 INFO ]: Initializing SmtParser... [2018-06-27 02:47:59,209 INFO ]: SmtParser initialized [2018-06-27 02:47:59,210 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/PRODUCER_CONSUMMER_luke_2_e7_1068_e8_1019.smt2 [2018-06-27 02:47:59,211 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-27 02:47:59,299 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/PRODUCER_CONSUMMER_luke_2_e7_1068_e8_1019.smt2 unknown [2018-06-27 02:47:59,645 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/PRODUCER_CONSUMMER_luke_2_e7_1068_e8_1019.smt2 [2018-06-27 02:47:59,649 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-27 02:47:59,655 INFO ]: Walking toolchain with 5 elements. [2018-06-27 02:47:59,656 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-27 02:47:59,656 INFO ]: Initializing ChcToBoogie... [2018-06-27 02:47:59,656 INFO ]: ChcToBoogie initialized [2018-06-27 02:47:59,659 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 02:47:59" (1/1) ... [2018-06-27 02:47:59,730 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 02:47:59 Unit [2018-06-27 02:47:59,730 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-27 02:47:59,731 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-27 02:47:59,734 INFO ]: Initializing Boogie Preprocessor... [2018-06-27 02:47:59,734 INFO ]: Boogie Preprocessor initialized [2018-06-27 02:47:59,754 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 02:47:59" (1/1) ... [2018-06-27 02:47:59,754 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 02:47:59" (1/1) ... [2018-06-27 02:47:59,761 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 02:47:59" (1/1) ... [2018-06-27 02:47:59,761 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 02:47:59" (1/1) ... [2018-06-27 02:47:59,767 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 02:47:59" (1/1) ... [2018-06-27 02:47:59,768 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 02:47:59" (1/1) ... [2018-06-27 02:47:59,770 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 02:47:59" (1/1) ... [2018-06-27 02:47:59,777 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-27 02:47:59,778 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-27 02:47:59,778 INFO ]: Initializing RCFGBuilder... [2018-06-27 02:47:59,778 INFO ]: RCFGBuilder initialized [2018-06-27 02:47:59,779 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 02:47:59" (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-27 02:47:59,793 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-27 02:47:59,793 INFO ]: Found specification of procedure gotoProc [2018-06-27 02:47:59,793 INFO ]: Found implementation of procedure gotoProc [2018-06-27 02:47:59,794 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-27 02:47:59,794 INFO ]: Found specification of procedure Ultimate.START [2018-06-27 02:47:59,794 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-27 02:48:00,210 INFO ]: Using library mode [2018-06-27 02:48:00,211 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 02:48:00 BoogieIcfgContainer [2018-06-27 02:48:00,211 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-27 02:48:00,211 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-27 02:48:00,211 INFO ]: Initializing BlockEncodingV2... [2018-06-27 02:48:00,212 INFO ]: BlockEncodingV2 initialized [2018-06-27 02:48:00,213 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 02:48:00" (1/1) ... [2018-06-27 02:48:00,231 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-27 02:48:00,232 INFO ]: Using Remove infeasible edges [2018-06-27 02:48:00,233 INFO ]: Using Maximize final states [2018-06-27 02:48:00,233 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-27 02:48:00,233 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-27 02:48:00,237 INFO ]: Using Remove sink states [2018-06-27 02:48:00,238 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-27 02:48:00,238 INFO ]: Using Use SBE [2018-06-27 02:48:00,243 WARN ]: expecting exponential blowup for input size 11 [2018-06-27 02:48:00,856 WARN ]: aborting because of expected exponential blowup for input size 49 [2018-06-27 02:48:00,858 WARN ]: expecting exponential blowup for input size 12 [2018-06-27 02:48:01,397 WARN ]: aborting because of expected exponential blowup for input size 49 [2018-06-27 02:48:01,432 INFO ]: SBE split 2 edges [2018-06-27 02:48:01,490 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-27 02:48:01,493 INFO ]: 0 new accepting states [2018-06-27 02:48:13,692 INFO ]: Removed 1338 edges and 2 locations by large block encoding [2018-06-27 02:48:13,694 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 02:48:13,744 INFO ]: Removed 54 edges and 0 locations because of local infeasibility [2018-06-27 02:48:13,745 INFO ]: 0 new accepting states [2018-06-27 02:48:13,746 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 02:48:13,747 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 02:48:13,776 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-27 02:48:13,777 INFO ]: 0 new accepting states [2018-06-27 02:48:13,778 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 02:48:13,779 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 02:48:13,829 INFO ]: Encoded RCFG 6 locations, 1286 edges [2018-06-27 02:48:13,830 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 02:48:13 BasicIcfg [2018-06-27 02:48:13,830 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-27 02:48:13,833 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-27 02:48:13,833 INFO ]: Initializing TraceAbstraction... [2018-06-27 02:48:13,835 INFO ]: TraceAbstraction initialized [2018-06-27 02:48:13,836 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 02:47:59" (1/4) ... [2018-06-27 02:48:13,837 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517904a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 27.06 02:48:13, skipping insertion in model container [2018-06-27 02:48:13,837 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 02:47:59" (2/4) ... [2018-06-27 02:48:13,837 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517904a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 02:48:13, skipping insertion in model container [2018-06-27 02:48:13,837 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 02:48:00" (3/4) ... [2018-06-27 02:48:13,837 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517904a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 02:48:13, skipping insertion in model container [2018-06-27 02:48:13,838 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 02:48:13" (4/4) ... [2018-06-27 02:48:13,839 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-27 02:48:13,852 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-27 02:48:13,860 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-27 02:48:13,901 INFO ]: Using default assertion order modulation [2018-06-27 02:48:13,902 INFO ]: Interprodecural is true [2018-06-27 02:48:13,902 INFO ]: Hoare is false [2018-06-27 02:48:13,902 INFO ]: Compute interpolants for FPandBP [2018-06-27 02:48:13,902 INFO ]: Backedges is TWOTRACK [2018-06-27 02:48:13,902 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-27 02:48:13,902 INFO ]: Difference is false [2018-06-27 02:48:13,902 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-27 02:48:13,902 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-27 02:48:13,919 INFO ]: Start isEmpty. Operand 6 states. [2018-06-27 02:48:13,938 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 02:48:13,938 INFO ]: Found error trace [2018-06-27 02:48:13,939 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 02:48:13,939 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:13,944 INFO ]: Analyzing trace with hash 98566209, now seen corresponding path program 1 times [2018-06-27 02:48:13,946 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:13,947 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:13,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:13,981 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:13,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:14,032 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:14,156 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:14,159 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 02:48:14,159 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 02:48:14,160 INFO ]: Interpolant automaton has 3 states [2018-06-27 02:48:14,176 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 02:48:14,176 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:14,180 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-27 02:48:16,893 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:16,893 INFO ]: Finished difference Result 7 states and 1287 transitions. [2018-06-27 02:48:16,893 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 02:48:16,894 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 02:48:16,894 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:16,911 INFO ]: With dead ends: 7 [2018-06-27 02:48:16,912 INFO ]: Without dead ends: 7 [2018-06-27 02:48:16,913 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:16,933 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 02:48:16,971 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 02:48:16,973 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 02:48:16,975 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1287 transitions. [2018-06-27 02:48:16,976 INFO ]: Start accepts. Automaton has 7 states and 1287 transitions. Word has length 5 [2018-06-27 02:48:16,977 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:16,977 INFO ]: Abstraction has 7 states and 1287 transitions. [2018-06-27 02:48:16,977 INFO ]: Interpolant automaton has 3 states. [2018-06-27 02:48:16,977 INFO ]: Start isEmpty. Operand 7 states and 1287 transitions. [2018-06-27 02:48:16,977 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 02:48:16,977 INFO ]: Found error trace [2018-06-27 02:48:16,978 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 02:48:16,978 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:16,978 INFO ]: Analyzing trace with hash -1313198316, now seen corresponding path program 1 times [2018-06-27 02:48:16,978 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:16,978 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:16,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:16,979 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:16,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:17,028 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:17,139 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:17,139 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 02:48:17,139 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 02:48:17,140 INFO ]: Interpolant automaton has 3 states [2018-06-27 02:48:17,140 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 02:48:17,140 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:17,140 INFO ]: Start difference. First operand 7 states and 1287 transitions. Second operand 3 states. [2018-06-27 02:48:19,183 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:19,183 INFO ]: Finished difference Result 8 states and 1287 transitions. [2018-06-27 02:48:19,208 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 02:48:19,208 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 02:48:19,208 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:19,210 INFO ]: With dead ends: 8 [2018-06-27 02:48:19,210 INFO ]: Without dead ends: 7 [2018-06-27 02:48:19,211 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:19,211 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 02:48:19,219 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 02:48:19,220 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 02:48:19,222 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1031 transitions. [2018-06-27 02:48:19,222 INFO ]: Start accepts. Automaton has 7 states and 1031 transitions. Word has length 6 [2018-06-27 02:48:19,222 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:19,222 INFO ]: Abstraction has 7 states and 1031 transitions. [2018-06-27 02:48:19,222 INFO ]: Interpolant automaton has 3 states. [2018-06-27 02:48:19,222 INFO ]: Start isEmpty. Operand 7 states and 1031 transitions. [2018-06-27 02:48:19,223 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 02:48:19,223 INFO ]: Found error trace [2018-06-27 02:48:19,223 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 02:48:19,223 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:19,223 INFO ]: Analyzing trace with hash -1312274795, now seen corresponding path program 1 times [2018-06-27 02:48:19,223 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:19,223 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:19,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:19,224 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:19,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:19,284 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:19,444 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:19,444 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 02:48:19,444 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 02:48:19,445 INFO ]: Interpolant automaton has 3 states [2018-06-27 02:48:19,445 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 02:48:19,445 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:19,445 INFO ]: Start difference. First operand 7 states and 1031 transitions. Second operand 3 states. [2018-06-27 02:48:20,764 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:20,764 INFO ]: Finished difference Result 8 states and 1031 transitions. [2018-06-27 02:48:20,766 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 02:48:20,766 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 02:48:20,766 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:20,767 INFO ]: With dead ends: 8 [2018-06-27 02:48:20,767 INFO ]: Without dead ends: 7 [2018-06-27 02:48:20,768 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:20,768 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 02:48:20,773 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 02:48:20,773 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 02:48:20,774 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 519 transitions. [2018-06-27 02:48:20,774 INFO ]: Start accepts. Automaton has 7 states and 519 transitions. Word has length 6 [2018-06-27 02:48:20,774 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:20,774 INFO ]: Abstraction has 7 states and 519 transitions. [2018-06-27 02:48:20,774 INFO ]: Interpolant automaton has 3 states. [2018-06-27 02:48:20,774 INFO ]: Start isEmpty. Operand 7 states and 519 transitions. [2018-06-27 02:48:20,778 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 02:48:20,778 INFO ]: Found error trace [2018-06-27 02:48:20,778 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 02:48:20,778 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:20,778 INFO ]: Analyzing trace with hash -1785117547, now seen corresponding path program 1 times [2018-06-27 02:48:20,778 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:20,778 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:20,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:20,779 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:20,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:20,804 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:20,889 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:20,889 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 02:48:20,889 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-27 02:48:20,896 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:20,955 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:20,962 INFO ]: Computing forward predicates... [2018-06-27 02:48:21,239 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:21,273 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 02:48:21,273 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-27 02:48:21,273 INFO ]: Interpolant automaton has 6 states [2018-06-27 02:48:21,273 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-27 02:48:21,273 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-27 02:48:21,273 INFO ]: Start difference. First operand 7 states and 519 transitions. Second operand 6 states. [2018-06-27 02:48:25,289 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:25,290 INFO ]: Finished difference Result 11 states and 427 transitions. [2018-06-27 02:48:25,290 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-27 02:48:25,290 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-27 02:48:25,290 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:25,290 INFO ]: With dead ends: 11 [2018-06-27 02:48:25,290 INFO ]: Without dead ends: 11 [2018-06-27 02:48:25,291 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-27 02:48:25,291 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-27 02:48:25,294 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-06-27 02:48:25,294 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 02:48:25,295 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 424 transitions. [2018-06-27 02:48:25,295 INFO ]: Start accepts. Automaton has 8 states and 424 transitions. Word has length 6 [2018-06-27 02:48:25,296 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:25,296 INFO ]: Abstraction has 8 states and 424 transitions. [2018-06-27 02:48:25,296 INFO ]: Interpolant automaton has 6 states. [2018-06-27 02:48:25,296 INFO ]: Start isEmpty. Operand 8 states and 424 transitions. [2018-06-27 02:48:25,296 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 02:48:25,296 INFO ]: Found error trace [2018-06-27 02:48:25,296 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 02:48:25,296 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:25,296 INFO ]: Analyzing trace with hash -1311350313, now seen corresponding path program 1 times [2018-06-27 02:48:25,296 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:25,296 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:25,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:25,297 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:25,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:25,317 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:25,402 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:25,402 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 02:48:25,402 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 02:48:25,402 INFO ]: Interpolant automaton has 3 states [2018-06-27 02:48:25,402 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 02:48:25,402 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:25,402 INFO ]: Start difference. First operand 8 states and 424 transitions. Second operand 3 states. [2018-06-27 02:48:26,013 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:26,013 INFO ]: Finished difference Result 10 states and 424 transitions. [2018-06-27 02:48:26,014 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 02:48:26,014 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 02:48:26,014 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:26,015 INFO ]: With dead ends: 10 [2018-06-27 02:48:26,015 INFO ]: Without dead ends: 8 [2018-06-27 02:48:26,015 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:26,015 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 02:48:26,019 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 02:48:26,019 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 02:48:26,020 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 392 transitions. [2018-06-27 02:48:26,020 INFO ]: Start accepts. Automaton has 8 states and 392 transitions. Word has length 6 [2018-06-27 02:48:26,020 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:26,020 INFO ]: Abstraction has 8 states and 392 transitions. [2018-06-27 02:48:26,020 INFO ]: Interpolant automaton has 3 states. [2018-06-27 02:48:26,020 INFO ]: Start isEmpty. Operand 8 states and 392 transitions. [2018-06-27 02:48:26,020 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 02:48:26,020 INFO ]: Found error trace [2018-06-27 02:48:26,020 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 02:48:26,020 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:26,021 INFO ]: Analyzing trace with hash -1299344540, now seen corresponding path program 1 times [2018-06-27 02:48:26,021 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:26,021 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:26,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:26,021 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:26,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:26,058 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:26,097 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:26,097 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 02:48:26,097 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 02:48:26,097 INFO ]: Interpolant automaton has 3 states [2018-06-27 02:48:26,097 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 02:48:26,097 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:26,097 INFO ]: Start difference. First operand 8 states and 392 transitions. Second operand 3 states. [2018-06-27 02:48:27,190 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:27,190 INFO ]: Finished difference Result 10 states and 392 transitions. [2018-06-27 02:48:27,191 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 02:48:27,191 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 02:48:27,191 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:27,191 INFO ]: With dead ends: 10 [2018-06-27 02:48:27,191 INFO ]: Without dead ends: 8 [2018-06-27 02:48:27,192 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:27,192 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 02:48:27,193 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 02:48:27,193 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 02:48:27,194 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 280 transitions. [2018-06-27 02:48:27,194 INFO ]: Start accepts. Automaton has 8 states and 280 transitions. Word has length 6 [2018-06-27 02:48:27,194 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:27,194 INFO ]: Abstraction has 8 states and 280 transitions. [2018-06-27 02:48:27,194 INFO ]: Interpolant automaton has 3 states. [2018-06-27 02:48:27,194 INFO ]: Start isEmpty. Operand 8 states and 280 transitions. [2018-06-27 02:48:27,194 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 02:48:27,194 INFO ]: Found error trace [2018-06-27 02:48:27,194 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 02:48:27,194 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:27,194 INFO ]: Analyzing trace with hash -1546848168, now seen corresponding path program 1 times [2018-06-27 02:48:27,194 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:27,194 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:27,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:27,195 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:27,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:27,215 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:27,300 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:27,300 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 02:48:27,300 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 02:48:27,300 INFO ]: Interpolant automaton has 3 states [2018-06-27 02:48:27,300 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 02:48:27,300 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:27,301 INFO ]: Start difference. First operand 8 states and 280 transitions. Second operand 3 states. [2018-06-27 02:48:27,596 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:27,597 INFO ]: Finished difference Result 10 states and 280 transitions. [2018-06-27 02:48:27,597 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 02:48:27,597 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 02:48:27,597 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:27,597 INFO ]: With dead ends: 10 [2018-06-27 02:48:27,597 INFO ]: Without dead ends: 8 [2018-06-27 02:48:27,598 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:27,598 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 02:48:27,600 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 02:48:27,600 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 02:48:27,600 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 264 transitions. [2018-06-27 02:48:27,600 INFO ]: Start accepts. Automaton has 8 states and 264 transitions. Word has length 6 [2018-06-27 02:48:27,600 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:27,600 INFO ]: Abstraction has 8 states and 264 transitions. [2018-06-27 02:48:27,600 INFO ]: Interpolant automaton has 3 states. [2018-06-27 02:48:27,600 INFO ]: Start isEmpty. Operand 8 states and 264 transitions. [2018-06-27 02:48:27,601 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 02:48:27,601 INFO ]: Found error trace [2018-06-27 02:48:27,601 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 02:48:27,601 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:27,601 INFO ]: Analyzing trace with hash -1903327274, now seen corresponding path program 1 times [2018-06-27 02:48:27,601 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:27,601 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:27,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:27,603 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:27,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:27,622 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:27,729 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:27,729 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 02:48:27,729 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 02:48:27,730 INFO ]: Interpolant automaton has 3 states [2018-06-27 02:48:27,730 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 02:48:27,730 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:27,730 INFO ]: Start difference. First operand 8 states and 264 transitions. Second operand 3 states. [2018-06-27 02:48:28,005 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:28,005 INFO ]: Finished difference Result 10 states and 264 transitions. [2018-06-27 02:48:28,005 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 02:48:28,005 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 02:48:28,005 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:28,006 INFO ]: With dead ends: 10 [2018-06-27 02:48:28,006 INFO ]: Without dead ends: 8 [2018-06-27 02:48:28,006 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:28,006 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 02:48:28,007 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 02:48:28,007 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 02:48:28,008 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 256 transitions. [2018-06-27 02:48:28,008 INFO ]: Start accepts. Automaton has 8 states and 256 transitions. Word has length 6 [2018-06-27 02:48:28,008 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:28,008 INFO ]: Abstraction has 8 states and 256 transitions. [2018-06-27 02:48:28,008 INFO ]: Interpolant automaton has 3 states. [2018-06-27 02:48:28,008 INFO ]: Start isEmpty. Operand 8 states and 256 transitions. [2018-06-27 02:48:28,008 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 02:48:28,008 INFO ]: Found error trace [2018-06-27 02:48:28,008 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 02:48:28,008 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:28,009 INFO ]: Analyzing trace with hash -1902403753, now seen corresponding path program 1 times [2018-06-27 02:48:28,009 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:28,009 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:28,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:28,009 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:28,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:28,025 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:28,067 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:28,067 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 02:48:28,067 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 02:48:28,067 INFO ]: Interpolant automaton has 3 states [2018-06-27 02:48:28,068 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 02:48:28,068 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:28,068 INFO ]: Start difference. First operand 8 states and 256 transitions. Second operand 3 states. [2018-06-27 02:48:28,362 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:28,362 INFO ]: Finished difference Result 10 states and 256 transitions. [2018-06-27 02:48:28,362 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 02:48:28,362 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 02:48:28,362 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:28,363 INFO ]: With dead ends: 10 [2018-06-27 02:48:28,363 INFO ]: Without dead ends: 8 [2018-06-27 02:48:28,363 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:28,363 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 02:48:28,364 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 02:48:28,364 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 02:48:28,365 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 248 transitions. [2018-06-27 02:48:28,365 INFO ]: Start accepts. Automaton has 8 states and 248 transitions. Word has length 6 [2018-06-27 02:48:28,365 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:28,365 INFO ]: Abstraction has 8 states and 248 transitions. [2018-06-27 02:48:28,365 INFO ]: Interpolant automaton has 3 states. [2018-06-27 02:48:28,365 INFO ]: Start isEmpty. Operand 8 states and 248 transitions. [2018-06-27 02:48:28,365 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 02:48:28,365 INFO ]: Found error trace [2018-06-27 02:48:28,365 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 02:48:28,365 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:28,366 INFO ]: Analyzing trace with hash -1663211814, now seen corresponding path program 1 times [2018-06-27 02:48:28,366 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:28,366 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:28,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:28,366 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:28,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:28,379 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:28,475 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:28,475 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 02:48:28,475 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 02:48:28,476 INFO ]: Interpolant automaton has 3 states [2018-06-27 02:48:28,476 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 02:48:28,476 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:28,476 INFO ]: Start difference. First operand 8 states and 248 transitions. Second operand 3 states. [2018-06-27 02:48:28,756 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:28,756 INFO ]: Finished difference Result 10 states and 248 transitions. [2018-06-27 02:48:28,756 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 02:48:28,756 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 02:48:28,756 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:28,756 INFO ]: With dead ends: 10 [2018-06-27 02:48:28,756 INFO ]: Without dead ends: 8 [2018-06-27 02:48:28,756 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:28,757 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 02:48:28,758 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 02:48:28,758 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 02:48:28,758 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2018-06-27 02:48:28,759 INFO ]: Start accepts. Automaton has 8 states and 208 transitions. Word has length 6 [2018-06-27 02:48:28,759 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:28,759 INFO ]: Abstraction has 8 states and 208 transitions. [2018-06-27 02:48:28,759 INFO ]: Interpolant automaton has 3 states. [2018-06-27 02:48:28,759 INFO ]: Start isEmpty. Operand 8 states and 208 transitions. [2018-06-27 02:48:28,759 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 02:48:28,759 INFO ]: Found error trace [2018-06-27 02:48:28,759 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 02:48:28,759 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:28,759 INFO ]: Analyzing trace with hash -1017670635, now seen corresponding path program 1 times [2018-06-27 02:48:28,759 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:28,759 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:28,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:28,760 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:28,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:28,774 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:28,826 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:28,826 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 02:48:28,826 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-27 02:48:28,832 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:28,883 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:28,885 INFO ]: Computing forward predicates... [2018-06-27 02:48:28,893 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:28,912 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-27 02:48:28,913 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-27 02:48:28,913 INFO ]: Interpolant automaton has 5 states [2018-06-27 02:48:28,913 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-27 02:48:28,913 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-27 02:48:28,913 INFO ]: Start difference. First operand 8 states and 208 transitions. Second operand 5 states. [2018-06-27 02:48:29,178 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:29,179 INFO ]: Finished difference Result 11 states and 210 transitions. [2018-06-27 02:48:29,179 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 02:48:29,179 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-27 02:48:29,179 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:29,179 INFO ]: With dead ends: 11 [2018-06-27 02:48:29,179 INFO ]: Without dead ends: 10 [2018-06-27 02:48:29,180 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-27 02:48:29,180 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-27 02:48:29,181 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-27 02:48:29,181 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 02:48:29,181 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2018-06-27 02:48:29,182 INFO ]: Start accepts. Automaton has 8 states and 198 transitions. Word has length 6 [2018-06-27 02:48:29,182 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:29,182 INFO ]: Abstraction has 8 states and 198 transitions. [2018-06-27 02:48:29,182 INFO ]: Interpolant automaton has 5 states. [2018-06-27 02:48:29,182 INFO ]: Start isEmpty. Operand 8 states and 198 transitions. [2018-06-27 02:48:29,182 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 02:48:29,182 INFO ]: Found error trace [2018-06-27 02:48:29,182 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 02:48:29,182 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:29,182 INFO ]: Analyzing trace with hash -1720470116, now seen corresponding path program 1 times [2018-06-27 02:48:29,182 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:29,182 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:29,183 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:29,183 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:29,183 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:29,194 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:29,379 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:29,379 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 02:48:29,379 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) [2018-06-27 02:48:29,394 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 02:48:29,464 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:29,468 INFO ]: Computing forward predicates... [2018-06-27 02:48:29,563 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:29,596 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 02:48:29,596 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-27 02:48:29,596 INFO ]: Interpolant automaton has 4 states [2018-06-27 02:48:29,597 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-27 02:48:29,597 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-27 02:48:29,597 INFO ]: Start difference. First operand 8 states and 198 transitions. Second operand 4 states. [2018-06-27 02:48:30,104 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:30,104 INFO ]: Finished difference Result 8 states and 90 transitions. [2018-06-27 02:48:30,105 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 02:48:30,105 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-27 02:48:30,105 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:30,105 INFO ]: With dead ends: 8 [2018-06-27 02:48:30,105 INFO ]: Without dead ends: 8 [2018-06-27 02:48:30,105 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-27 02:48:30,105 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 02:48:30,106 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 02:48:30,106 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 02:48:30,106 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2018-06-27 02:48:30,106 INFO ]: Start accepts. Automaton has 8 states and 90 transitions. Word has length 6 [2018-06-27 02:48:30,107 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:30,107 INFO ]: Abstraction has 8 states and 90 transitions. [2018-06-27 02:48:30,107 INFO ]: Interpolant automaton has 4 states. [2018-06-27 02:48:30,107 INFO ]: Start isEmpty. Operand 8 states and 90 transitions. [2018-06-27 02:48:30,107 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 02:48:30,107 INFO ]: Found error trace [2018-06-27 02:48:30,107 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 02:48:30,107 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:30,107 INFO ]: Analyzing trace with hash -1720594085, now seen corresponding path program 1 times [2018-06-27 02:48:30,107 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:30,107 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:30,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:30,108 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:30,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:30,122 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:30,173 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:30,173 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 02:48:30,173 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-27 02:48:30,178 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:30,220 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:30,222 INFO ]: Computing forward predicates... [2018-06-27 02:48:30,655 WARN ]: Spent 230.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 14 [2018-06-27 02:48:30,658 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:30,677 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 02:48:30,678 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-27 02:48:30,678 INFO ]: Interpolant automaton has 6 states [2018-06-27 02:48:30,678 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-27 02:48:30,678 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-27 02:48:30,678 INFO ]: Start difference. First operand 8 states and 90 transitions. Second operand 6 states. [2018-06-27 02:48:30,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:30,938 INFO ]: Finished difference Result 12 states and 94 transitions. [2018-06-27 02:48:30,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-27 02:48:30,938 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-27 02:48:30,938 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:30,938 INFO ]: With dead ends: 12 [2018-06-27 02:48:30,938 INFO ]: Without dead ends: 12 [2018-06-27 02:48:30,939 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-27 02:48:30,939 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-27 02:48:30,940 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 8. [2018-06-27 02:48:30,940 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 02:48:30,940 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2018-06-27 02:48:30,940 INFO ]: Start accepts. Automaton has 8 states and 90 transitions. Word has length 6 [2018-06-27 02:48:30,941 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:30,941 INFO ]: Abstraction has 8 states and 90 transitions. [2018-06-27 02:48:30,941 INFO ]: Interpolant automaton has 6 states. [2018-06-27 02:48:30,941 INFO ]: Start isEmpty. Operand 8 states and 90 transitions. [2018-06-27 02:48:30,941 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 02:48:30,941 INFO ]: Found error trace [2018-06-27 02:48:30,941 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 02:48:30,941 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:30,941 INFO ]: Analyzing trace with hash -1943162646, now seen corresponding path program 1 times [2018-06-27 02:48:30,941 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:30,941 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:30,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:30,942 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:30,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:30,957 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:31,046 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:31,046 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 02:48:31,046 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-27 02:48:31,052 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:31,095 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:31,097 INFO ]: Computing forward predicates... [2018-06-27 02:48:31,372 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:31,391 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 02:48:31,392 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-27 02:48:31,392 INFO ]: Interpolant automaton has 6 states [2018-06-27 02:48:31,392 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-27 02:48:31,392 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-27 02:48:31,392 INFO ]: Start difference. First operand 8 states and 90 transitions. Second operand 6 states. [2018-06-27 02:48:31,762 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:31,762 INFO ]: Finished difference Result 15 states and 97 transitions. [2018-06-27 02:48:31,762 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-27 02:48:31,762 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-27 02:48:31,762 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:31,763 INFO ]: With dead ends: 15 [2018-06-27 02:48:31,763 INFO ]: Without dead ends: 15 [2018-06-27 02:48:31,763 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 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-27 02:48:31,763 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-27 02:48:31,764 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 9. [2018-06-27 02:48:31,764 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-27 02:48:31,765 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2018-06-27 02:48:31,765 INFO ]: Start accepts. Automaton has 9 states and 91 transitions. Word has length 6 [2018-06-27 02:48:31,765 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:31,765 INFO ]: Abstraction has 9 states and 91 transitions. [2018-06-27 02:48:31,765 INFO ]: Interpolant automaton has 6 states. [2018-06-27 02:48:31,765 INFO ]: Start isEmpty. Operand 9 states and 91 transitions. [2018-06-27 02:48:31,765 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 02:48:31,765 INFO ]: Found error trace [2018-06-27 02:48:31,765 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 02:48:31,765 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:31,765 INFO ]: Analyzing trace with hash -1284692173, now seen corresponding path program 1 times [2018-06-27 02:48:31,765 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:31,765 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:31,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:31,766 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:31,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:31,782 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:31,960 WARN ]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-27 02:48:32,116 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-27 02:48:32,117 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:32,117 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 02:48:32,117 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) [2018-06-27 02:48:32,131 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 02:48:32,192 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:32,195 INFO ]: Computing forward predicates... [2018-06-27 02:48:32,386 WARN ]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-27 02:48:32,686 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:32,707 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 02:48:32,707 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-27 02:48:32,707 INFO ]: Interpolant automaton has 6 states [2018-06-27 02:48:32,707 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-27 02:48:32,707 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-27 02:48:32,707 INFO ]: Start difference. First operand 9 states and 91 transitions. Second operand 6 states. [2018-06-27 02:48:33,042 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:33,042 INFO ]: Finished difference Result 16 states and 98 transitions. [2018-06-27 02:48:33,042 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-27 02:48:33,042 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-27 02:48:33,042 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:33,043 INFO ]: With dead ends: 16 [2018-06-27 02:48:33,043 INFO ]: Without dead ends: 16 [2018-06-27 02:48:33,043 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-27 02:48:33,043 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-27 02:48:33,044 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 9. [2018-06-27 02:48:33,044 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-27 02:48:33,044 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2018-06-27 02:48:33,045 INFO ]: Start accepts. Automaton has 9 states and 91 transitions. Word has length 6 [2018-06-27 02:48:33,045 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:33,045 INFO ]: Abstraction has 9 states and 91 transitions. [2018-06-27 02:48:33,045 INFO ]: Interpolant automaton has 6 states. [2018-06-27 02:48:33,045 INFO ]: Start isEmpty. Operand 9 states and 91 transitions. [2018-06-27 02:48:33,045 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 02:48:33,045 INFO ]: Found error trace [2018-06-27 02:48:33,045 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 02:48:33,045 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:33,045 INFO ]: Analyzing trace with hash -1256986543, now seen corresponding path program 1 times [2018-06-27 02:48:33,045 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:33,045 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:33,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:33,046 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:33,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:33,062 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:33,145 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:33,145 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 02:48:33,145 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-27 02:48:33,152 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:33,193 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:33,195 INFO ]: Computing forward predicates... [2018-06-27 02:48:33,365 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:33,392 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 02:48:33,392 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-27 02:48:33,392 INFO ]: Interpolant automaton has 6 states [2018-06-27 02:48:33,392 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-27 02:48:33,392 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-27 02:48:33,392 INFO ]: Start difference. First operand 9 states and 91 transitions. Second operand 6 states. [2018-06-27 02:48:33,763 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:33,763 INFO ]: Finished difference Result 14 states and 96 transitions. [2018-06-27 02:48:33,764 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-27 02:48:33,764 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-27 02:48:33,764 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:33,764 INFO ]: With dead ends: 14 [2018-06-27 02:48:33,764 INFO ]: Without dead ends: 14 [2018-06-27 02:48:33,764 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 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-27 02:48:33,764 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-27 02:48:33,767 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 9. [2018-06-27 02:48:33,767 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-27 02:48:33,767 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2018-06-27 02:48:33,767 INFO ]: Start accepts. Automaton has 9 states and 91 transitions. Word has length 6 [2018-06-27 02:48:33,767 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:33,767 INFO ]: Abstraction has 9 states and 91 transitions. [2018-06-27 02:48:33,767 INFO ]: Interpolant automaton has 6 states. [2018-06-27 02:48:33,767 INFO ]: Start isEmpty. Operand 9 states and 91 transitions. [2018-06-27 02:48:33,768 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 02:48:33,768 INFO ]: Found error trace [2018-06-27 02:48:33,768 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 02:48:33,768 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:33,768 INFO ]: Analyzing trace with hash 422024384, now seen corresponding path program 1 times [2018-06-27 02:48:33,768 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:33,768 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:33,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:33,768 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:33,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:33,794 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:34,264 WARN ]: Spent 351.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-06-27 02:48:34,301 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:34,301 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 02:48:34,301 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-27 02:48:34,310 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:34,371 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:34,375 INFO ]: Computing forward predicates... [2018-06-27 02:48:34,538 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:34,647 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:34,667 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 02:48:34,667 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-27 02:48:34,667 INFO ]: Interpolant automaton has 8 states [2018-06-27 02:48:34,667 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-27 02:48:34,667 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-27 02:48:34,667 INFO ]: Start difference. First operand 9 states and 91 transitions. Second operand 8 states. [2018-06-27 02:48:35,180 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:35,180 INFO ]: Finished difference Result 15 states and 97 transitions. [2018-06-27 02:48:35,181 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-27 02:48:35,181 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-27 02:48:35,181 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:35,181 INFO ]: With dead ends: 15 [2018-06-27 02:48:35,181 INFO ]: Without dead ends: 15 [2018-06-27 02:48:35,181 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-06-27 02:48:35,181 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-27 02:48:35,183 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 9. [2018-06-27 02:48:35,183 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-27 02:48:35,183 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2018-06-27 02:48:35,183 INFO ]: Start accepts. Automaton has 9 states and 91 transitions. Word has length 7 [2018-06-27 02:48:35,183 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:35,183 INFO ]: Abstraction has 9 states and 91 transitions. [2018-06-27 02:48:35,183 INFO ]: Interpolant automaton has 8 states. [2018-06-27 02:48:35,183 INFO ]: Start isEmpty. Operand 9 states and 91 transitions. [2018-06-27 02:48:35,183 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 02:48:35,183 INFO ]: Found error trace [2018-06-27 02:48:35,183 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 02:48:35,183 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:35,183 INFO ]: Analyzing trace with hash -267453824, now seen corresponding path program 1 times [2018-06-27 02:48:35,183 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:35,183 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:35,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:35,184 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:35,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:35,198 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:35,314 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-27 02:48:35,314 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 02:48:35,314 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 02:48:35,314 INFO ]: Interpolant automaton has 3 states [2018-06-27 02:48:35,314 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 02:48:35,314 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:35,314 INFO ]: Start difference. First operand 9 states and 91 transitions. Second operand 3 states. [2018-06-27 02:48:35,459 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:35,459 INFO ]: Finished difference Result 11 states and 91 transitions. [2018-06-27 02:48:35,459 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 02:48:35,459 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-27 02:48:35,459 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:35,460 INFO ]: With dead ends: 11 [2018-06-27 02:48:35,460 INFO ]: Without dead ends: 9 [2018-06-27 02:48:35,460 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:35,460 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 02:48:35,461 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-27 02:48:35,461 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-27 02:48:35,461 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2018-06-27 02:48:35,461 INFO ]: Start accepts. Automaton has 9 states and 81 transitions. Word has length 7 [2018-06-27 02:48:35,461 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:35,461 INFO ]: Abstraction has 9 states and 81 transitions. [2018-06-27 02:48:35,461 INFO ]: Interpolant automaton has 3 states. [2018-06-27 02:48:35,461 INFO ]: Start isEmpty. Operand 9 states and 81 transitions. [2018-06-27 02:48:35,461 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 02:48:35,461 INFO ]: Found error trace [2018-06-27 02:48:35,462 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 02:48:35,462 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:35,462 INFO ]: Analyzing trace with hash 1939964033, now seen corresponding path program 1 times [2018-06-27 02:48:35,462 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:35,462 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:35,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:35,462 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:35,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:35,476 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:35,605 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-27 02:48:35,605 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 02:48:35,605 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 02:48:35,605 INFO ]: Interpolant automaton has 3 states [2018-06-27 02:48:35,605 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 02:48:35,605 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:35,605 INFO ]: Start difference. First operand 9 states and 81 transitions. Second operand 3 states. [2018-06-27 02:48:35,683 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:35,683 INFO ]: Finished difference Result 11 states and 81 transitions. [2018-06-27 02:48:35,683 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 02:48:35,683 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-27 02:48:35,683 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:35,683 INFO ]: With dead ends: 11 [2018-06-27 02:48:35,683 INFO ]: Without dead ends: 9 [2018-06-27 02:48:35,684 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 02:48:35,684 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 02:48:35,685 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-27 02:48:35,685 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-27 02:48:35,685 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2018-06-27 02:48:35,685 INFO ]: Start accepts. Automaton has 9 states and 77 transitions. Word has length 7 [2018-06-27 02:48:35,685 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:35,685 INFO ]: Abstraction has 9 states and 77 transitions. [2018-06-27 02:48:35,685 INFO ]: Interpolant automaton has 3 states. [2018-06-27 02:48:35,685 INFO ]: Start isEmpty. Operand 9 states and 77 transitions. [2018-06-27 02:48:35,685 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 02:48:35,685 INFO ]: Found error trace [2018-06-27 02:48:35,685 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 02:48:35,685 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:35,685 INFO ]: Analyzing trace with hash 1880921793, now seen corresponding path program 1 times [2018-06-27 02:48:35,685 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:35,685 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:35,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:35,686 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:35,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:35,702 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:35,898 WARN ]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-27 02:48:36,064 WARN ]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-06-27 02:48:36,077 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:36,077 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 02:48:36,077 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-27 02:48:36,083 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:36,140 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:36,143 INFO ]: Computing forward predicates... [2018-06-27 02:48:36,321 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:36,340 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 02:48:36,340 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-27 02:48:36,340 INFO ]: Interpolant automaton has 8 states [2018-06-27 02:48:36,341 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-27 02:48:36,341 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-27 02:48:36,341 INFO ]: Start difference. First operand 9 states and 77 transitions. Second operand 8 states. [2018-06-27 02:48:36,738 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:36,738 INFO ]: Finished difference Result 12 states and 80 transitions. [2018-06-27 02:48:36,738 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 02:48:36,738 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-27 02:48:36,738 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:36,738 INFO ]: With dead ends: 12 [2018-06-27 02:48:36,738 INFO ]: Without dead ends: 12 [2018-06-27 02:48:36,738 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-06-27 02:48:36,738 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-27 02:48:36,739 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-06-27 02:48:36,739 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-27 02:48:36,740 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2018-06-27 02:48:36,740 INFO ]: Start accepts. Automaton has 9 states and 77 transitions. Word has length 7 [2018-06-27 02:48:36,740 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:36,740 INFO ]: Abstraction has 9 states and 77 transitions. [2018-06-27 02:48:36,740 INFO ]: Interpolant automaton has 8 states. [2018-06-27 02:48:36,740 INFO ]: Start isEmpty. Operand 9 states and 77 transitions. [2018-06-27 02:48:36,740 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 02:48:36,740 INFO ]: Found error trace [2018-06-27 02:48:36,740 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 02:48:36,740 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:36,740 INFO ]: Analyzing trace with hash -1985202884, now seen corresponding path program 1 times [2018-06-27 02:48:36,740 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:36,740 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:36,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:36,741 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:36,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:37,333 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:37,660 WARN ]: Spent 255.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-06-27 02:48:37,697 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:37,697 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 02:48:37,697 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-27 02:48:37,703 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:37,761 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:37,765 INFO ]: Computing forward predicates... [2018-06-27 02:48:38,058 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:38,090 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 02:48:38,090 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-27 02:48:38,090 INFO ]: Interpolant automaton has 8 states [2018-06-27 02:48:38,090 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-27 02:48:38,090 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-27 02:48:38,091 INFO ]: Start difference. First operand 9 states and 77 transitions. Second operand 8 states. [2018-06-27 02:48:38,646 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:38,647 INFO ]: Finished difference Result 12 states and 80 transitions. [2018-06-27 02:48:38,647 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 02:48:38,647 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-27 02:48:38,647 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:38,647 INFO ]: With dead ends: 12 [2018-06-27 02:48:38,647 INFO ]: Without dead ends: 12 [2018-06-27 02:48:38,647 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-27 02:48:38,647 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-27 02:48:38,648 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-06-27 02:48:38,648 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-27 02:48:38,648 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2018-06-27 02:48:38,648 INFO ]: Start accepts. Automaton has 9 states and 77 transitions. Word has length 7 [2018-06-27 02:48:38,648 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:38,648 INFO ]: Abstraction has 9 states and 77 transitions. [2018-06-27 02:48:38,648 INFO ]: Interpolant automaton has 8 states. [2018-06-27 02:48:38,648 INFO ]: Start isEmpty. Operand 9 states and 77 transitions. [2018-06-27 02:48:38,648 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 02:48:38,648 INFO ]: Found error trace [2018-06-27 02:48:38,648 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 02:48:38,649 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:38,649 INFO ]: Analyzing trace with hash 508506483, now seen corresponding path program 1 times [2018-06-27 02:48:38,649 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:38,649 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:38,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:38,649 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:38,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:38,666 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:38,789 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:38,789 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 02:48:38,789 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-27 02:48:38,795 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:38,853 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:38,856 INFO ]: Computing forward predicates... [2018-06-27 02:48:39,175 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:39,195 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 02:48:39,195 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-27 02:48:39,195 INFO ]: Interpolant automaton has 8 states [2018-06-27 02:48:39,195 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-27 02:48:39,195 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-27 02:48:39,195 INFO ]: Start difference. First operand 9 states and 77 transitions. Second operand 8 states. [2018-06-27 02:48:39,712 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 02:48:39,712 INFO ]: Finished difference Result 17 states and 85 transitions. [2018-06-27 02:48:39,714 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-27 02:48:39,715 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-27 02:48:39,715 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 02:48:39,715 INFO ]: With dead ends: 17 [2018-06-27 02:48:39,715 INFO ]: Without dead ends: 17 [2018-06-27 02:48:39,715 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-06-27 02:48:39,715 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-27 02:48:39,716 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 9. [2018-06-27 02:48:39,716 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-27 02:48:39,716 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2018-06-27 02:48:39,716 INFO ]: Start accepts. Automaton has 9 states and 77 transitions. Word has length 7 [2018-06-27 02:48:39,716 INFO ]: Finished accepts. word is rejected. [2018-06-27 02:48:39,716 INFO ]: Abstraction has 9 states and 77 transitions. [2018-06-27 02:48:39,716 INFO ]: Interpolant automaton has 8 states. [2018-06-27 02:48:39,716 INFO ]: Start isEmpty. Operand 9 states and 77 transitions. [2018-06-27 02:48:39,717 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-27 02:48:39,717 INFO ]: Found error trace [2018-06-27 02:48:39,717 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-27 02:48:39,717 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 02:48:39,717 INFO ]: Analyzing trace with hash -1891059820, now seen corresponding path program 2 times [2018-06-27 02:48:39,717 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 02:48:39,717 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 02:48:39,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:39,717 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 02:48:39,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 02:48:39,752 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:40,111 WARN ]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-27 02:48:40,537 WARN ]: Spent 375.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2018-06-27 02:48:40,660 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 02:48:40,660 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 02:48:40,660 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) [2018-06-27 02:48:40,674 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 02:48:40,773 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-27 02:48:40,773 INFO ]: Conjunction of SSA is unsat [2018-06-27 02:48:40,778 INFO ]: Computing forward predicates... [2018-06-27 02:48:41,351 WARN ]: expecting exponential blowup for input size 7 [2018-06-27 02:48:41,353 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:41,355 WARN ]: expecting exponential blowup for input size 7 [2018-06-27 02:48:41,358 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:41,360 WARN ]: expecting exponential blowup for input size 7 [2018-06-27 02:48:41,363 WARN ]: expecting exponential blowup for input size 7 [2018-06-27 02:48:41,365 WARN ]: expecting exponential blowup for input size 7 [2018-06-27 02:48:41,367 WARN ]: expecting exponential blowup for input size 14 [2018-06-27 02:48:41,507 WARN ]: expecting exponential blowup for input size 17 [2018-06-27 02:48:41,777 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:41,778 WARN ]: expecting exponential blowup for input size 7 [2018-06-27 02:48:41,780 WARN ]: expecting exponential blowup for input size 7 [2018-06-27 02:48:41,781 WARN ]: expecting exponential blowup for input size 7 [2018-06-27 02:48:41,782 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:44,434 WARN ]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2018-06-27 02:48:45,994 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:45,994 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:45,995 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:45,996 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:45,997 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:45,997 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:45,998 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:45,999 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:46,001 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:46,003 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:46,004 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:46,004 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:46,012 WARN ]: expecting exponential blowup for input size 7 [2018-06-27 02:48:46,021 WARN ]: expecting exponential blowup for input size 7 [2018-06-27 02:48:46,029 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:46,032 WARN ]: expecting exponential blowup for input size 7 [2018-06-27 02:48:46,040 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:46,043 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:46,047 WARN ]: expecting exponential blowup for input size 7 [2018-06-27 02:48:46,054 WARN ]: expecting exponential blowup for input size 7 [2018-06-27 02:48:46,063 WARN ]: expecting exponential blowup for input size 7 [2018-06-27 02:48:46,073 WARN ]: expecting exponential blowup for input size 9 [2018-06-27 02:48:46,092 WARN ]: expecting exponential blowup for input size 11 [2018-06-27 02:48:46,140 WARN ]: expecting exponential blowup for input size 11 [2018-06-27 02:48:46,203 WARN ]: expecting exponential blowup for input size 9 [2018-06-27 02:48:46,219 WARN ]: expecting exponential blowup for input size 11 [2018-06-27 02:48:46,261 WARN ]: expecting exponential blowup for input size 9 [2018-06-27 02:48:46,291 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:46,291 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:46,308 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:46,308 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 02:48:46,319 WARN ]: expecting exponential blowup for input size 9 [2018-06-27 02:48:46,339 WARN ]: expecting exponential blowup for input size 11 [2018-06-27 02:48:46,393 WARN ]: expecting exponential blowup for input size 9 [2018-06-27 02:48:46,411 WARN ]: expecting exponential blowup for input size 11 [2018-06-27 02:48:46,467 WARN ]: expecting exponential blowup for input size 9 [2018-06-27 02:48:46,484 WARN ]: expecting exponential blowup for input size 11 Received shutdown request... [2018-06-27 02:48:52,705 INFO ]: Timeout while computing interpolants [2018-06-27 02:48:52,906 WARN ]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 02:48:52,906 WARN ]: Verification canceled [2018-06-27 02:48:52,908 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-27 02:48:52,909 WARN ]: Timeout [2018-06-27 02:48:52,909 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 02:48:52 BasicIcfg [2018-06-27 02:48:52,909 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-27 02:48:52,910 INFO ]: Toolchain (without parser) took 53260.09 ms. Allocated memory was 307.2 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 255.6 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 151.7 MB. Max. memory is 3.6 GB. [2018-06-27 02:48:52,911 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-27 02:48:52,911 INFO ]: ChcToBoogie took 74.31 ms. Allocated memory is still 307.2 MB. Free memory was 255.6 MB in the beginning and 252.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-27 02:48:52,911 INFO ]: Boogie Preprocessor took 46.50 ms. Allocated memory is still 307.2 MB. Free memory was 252.6 MB in the beginning and 251.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-27 02:48:52,911 INFO ]: RCFGBuilder took 433.11 ms. Allocated memory is still 307.2 MB. Free memory was 251.4 MB in the beginning and 231.4 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. [2018-06-27 02:48:52,912 INFO ]: BlockEncodingV2 took 13618.79 ms. Allocated memory was 307.2 MB in the beginning and 824.2 MB in the end (delta: 516.9 MB). Free memory was 231.4 MB in the beginning and 526.3 MB in the end (delta: -294.9 MB). Peak memory consumption was 460.5 MB. Max. memory is 3.6 GB. [2018-06-27 02:48:52,912 INFO ]: TraceAbstraction took 39076.50 ms. Allocated memory was 824.2 MB in the beginning and 1.7 GB in the end (delta: 853.5 MB). Free memory was 526.3 MB in the beginning and 1.5 GB in the end (delta: -948.0 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-27 02:48:52,914 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 1286 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.10 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 74.31 ms. Allocated memory is still 307.2 MB. Free memory was 255.6 MB in the beginning and 252.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 46.50 ms. Allocated memory is still 307.2 MB. Free memory was 252.6 MB in the beginning and 251.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 433.11 ms. Allocated memory is still 307.2 MB. Free memory was 251.4 MB in the beginning and 231.4 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 13618.79 ms. Allocated memory was 307.2 MB in the beginning and 824.2 MB in the end (delta: 516.9 MB). Free memory was 231.4 MB in the beginning and 526.3 MB in the end (delta: -294.9 MB). Peak memory consumption was 460.5 MB. Max. memory is 3.6 GB. * TraceAbstraction took 39076.50 ms. Allocated memory was 824.2 MB in the beginning and 1.7 GB in the end (delta: 853.5 MB). Free memory was 526.3 MB in the beginning and 1.5 GB in the end (delta: -948.0 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 9 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 39.0s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 17.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6775 SDtfs, 378 SDslu, 663 SDs, 0 SdLazy, 7806 SolverSat, 4009 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 47 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 4681 SizeOfPredicates, 51 NumberOfNonLiveVariables, 4767 ConjunctsInSsa, 321 ConjunctsInUnsatCore, 33 InterpolantComputations, 12 PerfectInterpolantSequences, 15/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/PRODUCER_CONSUMMER_luke_2_e7_1068_e8_1019.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-27_02-48-52-924.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/PRODUCER_CONSUMMER_luke_2_e7_1068_e8_1019.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-27_02-48-52-924.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/PRODUCER_CONSUMMER_luke_2_e7_1068_e8_1019.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-27_02-48-52-924.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/PRODUCER_CONSUMMER_luke_2_e7_1068_e8_1019.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-27_02-48-52-924.csv Completed graceful shutdown