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/ex8.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-27 00:08:27,064 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-27 00:08:27,066 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-27 00:08:27,081 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-27 00:08:27,082 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-27 00:08:27,083 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-27 00:08:27,086 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-27 00:08:27,093 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-27 00:08:27,095 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-27 00:08:27,096 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-27 00:08:27,097 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-27 00:08:27,097 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-27 00:08:27,100 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-27 00:08:27,101 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-27 00:08:27,102 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-27 00:08:27,102 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-27 00:08:27,105 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-27 00:08:27,107 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-27 00:08:27,121 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-27 00:08:27,123 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-27 00:08:27,124 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-27 00:08:27,125 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-27 00:08:27,127 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-27 00:08:27,127 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-27 00:08:27,128 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-27 00:08:27,128 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-27 00:08:27,129 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-27 00:08:27,130 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-27 00:08:27,130 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-27 00:08:27,135 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-27 00:08:27,135 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-27 00:08:27,136 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-27 00:08:27,136 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-27 00:08:27,136 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-27 00:08:27,137 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-27 00:08:27,138 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-27 00:08:27,139 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-27 00:08:27,159 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-27 00:08:27,159 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-27 00:08:27,161 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-27 00:08:27,161 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-27 00:08:27,162 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-27 00:08:27,162 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-27 00:08:27,162 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-27 00:08:27,162 INFO L133 SettingsManager]: * Use SBE=true [2018-06-27 00:08:27,163 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-27 00:08:27,163 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-27 00:08:27,163 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-27 00:08:27,163 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-27 00:08:27,163 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-27 00:08:27,166 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-27 00:08:27,166 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-27 00:08:27,166 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-27 00:08:27,167 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-27 00:08:27,167 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-27 00:08:27,167 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-27 00:08:27,167 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-27 00:08:27,167 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-27 00:08:27,169 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-27 00:08:27,169 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-27 00:08:27,225 INFO ]: Repository-Root is: /tmp [2018-06-27 00:08:27,239 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-27 00:08:27,245 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-27 00:08:27,246 INFO ]: Initializing SmtParser... [2018-06-27 00:08:27,247 INFO ]: SmtParser initialized [2018-06-27 00:08:27,247 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8.smt2 [2018-06-27 00:08:27,249 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 00:08:27,323 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8.smt2 unknown [2018-06-27 00:08:27,581 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8.smt2 [2018-06-27 00:08:27,587 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-27 00:08:27,595 INFO ]: Walking toolchain with 5 elements. [2018-06-27 00:08:27,595 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-27 00:08:27,595 INFO ]: Initializing ChcToBoogie... [2018-06-27 00:08:27,595 INFO ]: ChcToBoogie initialized [2018-06-27 00:08:27,598 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 12:08:27" (1/1) ... [2018-06-27 00:08:27,660 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:08:27 Unit [2018-06-27 00:08:27,660 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-27 00:08:27,661 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-27 00:08:27,661 INFO ]: Initializing Boogie Preprocessor... [2018-06-27 00:08:27,661 INFO ]: Boogie Preprocessor initialized [2018-06-27 00:08:27,683 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:08:27" (1/1) ... [2018-06-27 00:08:27,683 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:08:27" (1/1) ... [2018-06-27 00:08:27,692 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:08:27" (1/1) ... [2018-06-27 00:08:27,692 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:08:27" (1/1) ... [2018-06-27 00:08:27,706 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:08:27" (1/1) ... [2018-06-27 00:08:27,708 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:08:27" (1/1) ... [2018-06-27 00:08:27,709 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:08:27" (1/1) ... [2018-06-27 00:08:27,711 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-27 00:08:27,711 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-27 00:08:27,711 INFO ]: Initializing RCFGBuilder... [2018-06-27 00:08:27,711 INFO ]: RCFGBuilder initialized [2018-06-27 00:08:27,721 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:08:27" (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 00:08:27,737 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-27 00:08:27,738 INFO ]: Found specification of procedure gotoProc [2018-06-27 00:08:27,738 INFO ]: Found implementation of procedure gotoProc [2018-06-27 00:08:27,738 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-27 00:08:27,738 INFO ]: Found specification of procedure Ultimate.START [2018-06-27 00:08:27,738 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 00:08:28,029 INFO ]: Using library mode [2018-06-27 00:08:28,029 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 12:08:28 BoogieIcfgContainer [2018-06-27 00:08:28,029 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-27 00:08:28,030 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-27 00:08:28,030 INFO ]: Initializing BlockEncodingV2... [2018-06-27 00:08:28,031 INFO ]: BlockEncodingV2 initialized [2018-06-27 00:08:28,031 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 12:08:28" (1/1) ... [2018-06-27 00:08:28,048 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-27 00:08:28,050 INFO ]: Using Remove infeasible edges [2018-06-27 00:08:28,050 INFO ]: Using Maximize final states [2018-06-27 00:08:28,051 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-27 00:08:28,052 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-27 00:08:28,054 INFO ]: Using Remove sink states [2018-06-27 00:08:28,055 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-27 00:08:28,055 INFO ]: Using Use SBE [2018-06-27 00:08:28,063 WARN ]: expecting exponential blowup for input size 12 [2018-06-27 00:08:28,696 WARN ]: expecting exponential blowup for input size 11 [2018-06-27 00:08:28,801 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-27 00:08:29,053 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-27 00:08:29,054 INFO ]: SBE split 2 edges [2018-06-27 00:08:29,075 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-27 00:08:29,079 INFO ]: 0 new accepting states [2018-06-27 00:08:41,598 INFO ]: Removed 2073 edges and 2 locations by large block encoding [2018-06-27 00:08:41,600 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 00:08:41,617 INFO ]: Removed 18 edges and 0 locations because of local infeasibility [2018-06-27 00:08:41,618 INFO ]: 0 new accepting states [2018-06-27 00:08:41,620 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 00:08:41,621 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 00:08:41,631 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-27 00:08:41,632 INFO ]: 0 new accepting states [2018-06-27 00:08:41,634 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 00:08:41,634 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 00:08:41,646 INFO ]: Encoded RCFG 6 locations, 2057 edges [2018-06-27 00:08:41,646 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 12:08:41 BasicIcfg [2018-06-27 00:08:41,646 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-27 00:08:41,648 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-27 00:08:41,648 INFO ]: Initializing TraceAbstraction... [2018-06-27 00:08:41,652 INFO ]: TraceAbstraction initialized [2018-06-27 00:08:41,652 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 12:08:27" (1/4) ... [2018-06-27 00:08:41,653 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e60e970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 27.06 12:08:41, skipping insertion in model container [2018-06-27 00:08:41,653 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:08:27" (2/4) ... [2018-06-27 00:08:41,653 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e60e970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 12:08:41, skipping insertion in model container [2018-06-27 00:08:41,653 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 12:08:28" (3/4) ... [2018-06-27 00:08:41,654 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e60e970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 12:08:41, skipping insertion in model container [2018-06-27 00:08:41,654 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 12:08:41" (4/4) ... [2018-06-27 00:08:41,655 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-27 00:08:41,667 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-27 00:08:41,675 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-27 00:08:41,728 INFO ]: Using default assertion order modulation [2018-06-27 00:08:41,729 INFO ]: Interprodecural is true [2018-06-27 00:08:41,729 INFO ]: Hoare is false [2018-06-27 00:08:41,729 INFO ]: Compute interpolants for FPandBP [2018-06-27 00:08:41,729 INFO ]: Backedges is TWOTRACK [2018-06-27 00:08:41,729 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-27 00:08:41,729 INFO ]: Difference is false [2018-06-27 00:08:41,729 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-27 00:08:41,729 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-27 00:08:41,753 INFO ]: Start isEmpty. Operand 6 states. [2018-06-27 00:08:41,778 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:08:41,778 INFO ]: Found error trace [2018-06-27 00:08:41,779 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:08:41,779 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:41,784 INFO ]: Analyzing trace with hash 161101362, now seen corresponding path program 1 times [2018-06-27 00:08:41,785 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:41,785 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:41,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:41,819 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:41,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:41,858 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:41,957 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:41,959 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:41,960 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:41,961 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:41,972 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:41,972 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:41,974 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-27 00:08:45,229 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:45,229 INFO ]: Finished difference Result 7 states and 2058 transitions. [2018-06-27 00:08:45,230 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:45,231 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:08:45,231 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:45,248 INFO ]: With dead ends: 7 [2018-06-27 00:08:45,248 INFO ]: Without dead ends: 7 [2018-06-27 00:08:45,250 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 00:08:45,267 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:08:45,329 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:08:45,330 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:45,335 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-27 00:08:45,336 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-27 00:08:45,337 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:45,337 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-27 00:08:45,337 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:45,337 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-27 00:08:45,339 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:08:45,339 INFO ]: Found error trace [2018-06-27 00:08:45,339 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:08:45,339 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:45,339 INFO ]: Analyzing trace with hash 161131153, now seen corresponding path program 1 times [2018-06-27 00:08:45,339 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:45,339 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:45,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:45,340 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:45,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:45,367 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:45,428 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:45,428 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:45,428 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:45,430 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:45,430 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:45,430 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:45,430 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-27 00:08:48,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:48,247 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-27 00:08:48,248 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:48,248 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:08:48,248 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:48,251 INFO ]: With dead ends: 9 [2018-06-27 00:08:48,251 INFO ]: Without dead ends: 9 [2018-06-27 00:08:48,251 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 00:08:48,251 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 00:08:48,265 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-27 00:08:48,265 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:48,270 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-27 00:08:48,270 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-27 00:08:48,270 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:48,270 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-27 00:08:48,270 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:48,270 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-27 00:08:48,272 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:08:48,272 INFO ]: Found error trace [2018-06-27 00:08:48,272 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:08:48,272 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:48,272 INFO ]: Analyzing trace with hash 161160944, now seen corresponding path program 1 times [2018-06-27 00:08:48,272 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:48,272 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:48,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:48,273 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:48,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:48,288 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:48,334 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:48,334 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:48,334 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:48,335 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:48,335 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:48,335 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:48,335 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-27 00:08:51,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:51,119 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-27 00:08:51,119 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:51,119 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:08:51,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:51,122 INFO ]: With dead ends: 9 [2018-06-27 00:08:51,122 INFO ]: Without dead ends: 9 [2018-06-27 00:08:51,122 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 00:08:51,122 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 00:08:51,135 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-27 00:08:51,135 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:51,139 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-27 00:08:51,140 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-27 00:08:51,140 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:51,140 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-27 00:08:51,140 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:51,140 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-27 00:08:51,142 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:08:51,142 INFO ]: Found error trace [2018-06-27 00:08:51,142 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:08:51,142 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:51,142 INFO ]: Analyzing trace with hash 161816346, now seen corresponding path program 1 times [2018-06-27 00:08:51,142 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:51,142 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:51,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:51,143 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:51,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:51,153 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:51,233 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:51,233 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:51,233 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:51,234 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:51,234 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:51,234 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:51,234 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-27 00:08:53,162 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:53,162 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-27 00:08:53,162 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:53,162 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:08:53,162 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:53,164 INFO ]: With dead ends: 9 [2018-06-27 00:08:53,164 INFO ]: Without dead ends: 9 [2018-06-27 00:08:53,165 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 00:08:53,165 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 00:08:53,176 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-27 00:08:53,176 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:53,179 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-27 00:08:53,179 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-27 00:08:53,180 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:53,180 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-27 00:08:53,180 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:53,180 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-27 00:08:53,181 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:08:53,181 INFO ]: Found error trace [2018-06-27 00:08:53,181 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:08:53,181 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:53,181 INFO ]: Analyzing trace with hash 101191661, now seen corresponding path program 1 times [2018-06-27 00:08:53,181 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:53,181 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:53,182 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:53,182 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:53,182 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:53,192 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:53,251 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:53,251 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:53,251 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:53,251 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:53,251 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:53,251 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:53,251 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-27 00:08:54,841 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:54,842 INFO ]: Finished difference Result 8 states and 2059 transitions. [2018-06-27 00:08:54,844 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:54,844 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:08:54,844 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:54,845 INFO ]: With dead ends: 8 [2018-06-27 00:08:54,845 INFO ]: Without dead ends: 8 [2018-06-27 00:08:54,845 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 00:08:54,845 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 00:08:54,855 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-27 00:08:54,855 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:54,858 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-27 00:08:54,858 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-27 00:08:54,858 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:54,858 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-27 00:08:54,858 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:54,858 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-27 00:08:54,859 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:08:54,859 INFO ]: Found error trace [2018-06-27 00:08:54,859 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:08:54,859 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:54,860 INFO ]: Analyzing trace with hash 579725668, now seen corresponding path program 1 times [2018-06-27 00:08:54,860 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:54,860 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:54,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:54,860 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:54,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:54,902 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:54,966 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:54,966 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:54,966 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:54,966 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:54,966 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:54,966 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:54,966 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-27 00:08:56,764 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:56,764 INFO ]: Finished difference Result 8 states and 2058 transitions. [2018-06-27 00:08:56,765 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:56,765 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:08:56,765 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:56,766 INFO ]: With dead ends: 8 [2018-06-27 00:08:56,767 INFO ]: Without dead ends: 7 [2018-06-27 00:08:56,767 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 00:08:56,767 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:08:56,773 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:08:56,773 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:56,776 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1546 transitions. [2018-06-27 00:08:56,776 INFO ]: Start accepts. Automaton has 7 states and 1546 transitions. Word has length 6 [2018-06-27 00:08:56,776 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:56,776 INFO ]: Abstraction has 7 states and 1546 transitions. [2018-06-27 00:08:56,776 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:56,776 INFO ]: Start isEmpty. Operand 7 states and 1546 transitions. [2018-06-27 00:08:56,777 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:08:56,777 INFO ]: Found error trace [2018-06-27 00:08:56,777 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:08:56,777 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:56,777 INFO ]: Analyzing trace with hash 580649189, now seen corresponding path program 1 times [2018-06-27 00:08:56,777 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:56,777 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:56,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:56,779 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:56,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:56,795 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:56,853 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:56,853 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:56,853 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:56,853 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:56,854 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:56,854 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:56,854 INFO ]: Start difference. First operand 7 states and 1546 transitions. Second operand 3 states. [2018-06-27 00:08:58,122 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:58,122 INFO ]: Finished difference Result 8 states and 1546 transitions. [2018-06-27 00:08:58,127 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:58,127 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:08:58,127 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:58,128 INFO ]: With dead ends: 8 [2018-06-27 00:08:58,128 INFO ]: Without dead ends: 7 [2018-06-27 00:08:58,128 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 00:08:58,128 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:08:58,131 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:08:58,131 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:58,132 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 778 transitions. [2018-06-27 00:08:58,132 INFO ]: Start accepts. Automaton has 7 states and 778 transitions. Word has length 6 [2018-06-27 00:08:58,132 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:58,132 INFO ]: Abstraction has 7 states and 778 transitions. [2018-06-27 00:08:58,132 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:58,132 INFO ]: Start isEmpty. Operand 7 states and 778 transitions. [2018-06-27 00:08:58,133 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:08:58,133 INFO ]: Found error trace [2018-06-27 00:08:58,133 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:08:58,133 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:58,133 INFO ]: Analyzing trace with hash -365036315, now seen corresponding path program 1 times [2018-06-27 00:08:58,133 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:58,133 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:58,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:58,134 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:58,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:58,145 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:58,170 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:58,170 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:58,170 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:58,170 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:58,170 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:58,170 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:58,170 INFO ]: Start difference. First operand 7 states and 778 transitions. Second operand 3 states. [2018-06-27 00:08:58,825 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:58,825 INFO ]: Finished difference Result 8 states and 778 transitions. [2018-06-27 00:08:58,825 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:58,825 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:08:58,825 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:58,826 INFO ]: With dead ends: 8 [2018-06-27 00:08:58,826 INFO ]: Without dead ends: 7 [2018-06-27 00:08:58,827 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 00:08:58,827 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:08:58,828 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:08:58,828 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:58,829 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 522 transitions. [2018-06-27 00:08:58,829 INFO ]: Start accepts. Automaton has 7 states and 522 transitions. Word has length 6 [2018-06-27 00:08:58,829 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:58,829 INFO ]: Abstraction has 7 states and 522 transitions. [2018-06-27 00:08:58,829 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:58,829 INFO ]: Start isEmpty. Operand 7 states and 522 transitions. [2018-06-27 00:08:58,829 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:08:58,829 INFO ]: Found error trace [2018-06-27 00:08:58,829 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:08:58,830 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:58,830 INFO ]: Analyzing trace with hash 583419752, now seen corresponding path program 1 times [2018-06-27 00:08:58,830 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:58,830 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:58,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:58,830 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:58,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:58,842 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:58,897 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:58,897 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:58,897 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:58,897 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:58,897 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:58,897 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:58,897 INFO ]: Start difference. First operand 7 states and 522 transitions. Second operand 3 states. [2018-06-27 00:08:59,353 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:59,353 INFO ]: Finished difference Result 8 states and 522 transitions. [2018-06-27 00:08:59,353 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:59,353 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:08:59,353 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:59,354 INFO ]: With dead ends: 8 [2018-06-27 00:08:59,354 INFO ]: Without dead ends: 7 [2018-06-27 00:08:59,354 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 00:08:59,354 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:08:59,356 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:08:59,356 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:59,356 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 394 transitions. [2018-06-27 00:08:59,356 INFO ]: Start accepts. Automaton has 7 states and 394 transitions. Word has length 6 [2018-06-27 00:08:59,356 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:59,356 INFO ]: Abstraction has 7 states and 394 transitions. [2018-06-27 00:08:59,356 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:59,356 INFO ]: Start isEmpty. Operand 7 states and 394 transitions. [2018-06-27 00:08:59,357 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:08:59,357 INFO ]: Found error trace [2018-06-27 00:08:59,357 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:08:59,357 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:59,357 INFO ]: Analyzing trace with hash 584343273, now seen corresponding path program 1 times [2018-06-27 00:08:59,357 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:59,357 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:59,357 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:59,357 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:59,357 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:59,375 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:59,461 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:59,461 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:59,461 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:59,461 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:59,461 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:59,461 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:59,461 INFO ]: Start difference. First operand 7 states and 394 transitions. Second operand 3 states. [2018-06-27 00:08:59,806 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:59,806 INFO ]: Finished difference Result 8 states and 394 transitions. [2018-06-27 00:08:59,807 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:59,807 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:08:59,807 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:59,807 INFO ]: With dead ends: 8 [2018-06-27 00:08:59,807 INFO ]: Without dead ends: 7 [2018-06-27 00:08:59,807 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 00:08:59,807 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:08:59,809 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:08:59,809 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:59,809 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 298 transitions. [2018-06-27 00:08:59,809 INFO ]: Start accepts. Automaton has 7 states and 298 transitions. Word has length 6 [2018-06-27 00:08:59,809 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:59,809 INFO ]: Abstraction has 7 states and 298 transitions. [2018-06-27 00:08:59,809 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:59,809 INFO ]: Start isEmpty. Operand 7 states and 298 transitions. [2018-06-27 00:08:59,809 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:08:59,810 INFO ]: Found error trace [2018-06-27 00:08:59,810 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:08:59,810 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:59,810 INFO ]: Analyzing trace with hash -361342231, now seen corresponding path program 1 times [2018-06-27 00:08:59,810 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:59,810 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:59,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:59,810 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:59,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:59,821 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:59,889 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:59,889 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:59,889 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:59,889 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:59,890 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:59,890 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:59,890 INFO ]: Start difference. First operand 7 states and 298 transitions. Second operand 3 states. [2018-06-27 00:09:00,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:09:00,140 INFO ]: Finished difference Result 8 states and 298 transitions. [2018-06-27 00:09:00,140 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:09:00,140 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:09:00,140 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:09:00,141 INFO ]: With dead ends: 8 [2018-06-27 00:09:00,141 INFO ]: Without dead ends: 7 [2018-06-27 00:09:00,141 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 00:09:00,141 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:09:00,142 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:09:00,142 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:09:00,143 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions. [2018-06-27 00:09:00,143 INFO ]: Start accepts. Automaton has 7 states and 226 transitions. Word has length 6 [2018-06-27 00:09:00,143 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:09:00,143 INFO ]: Abstraction has 7 states and 226 transitions. [2018-06-27 00:09:00,143 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:09:00,143 INFO ]: Start isEmpty. Operand 7 states and 226 transitions. [2018-06-27 00:09:00,143 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:09:00,143 INFO ]: Found error trace [2018-06-27 00:09:00,143 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:09:00,143 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:09:00,143 INFO ]: Analyzing trace with hash 112424042, now seen corresponding path program 1 times [2018-06-27 00:09:00,143 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:09:00,143 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:09:00,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:00,144 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:00,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:00,152 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:00,173 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:00,173 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:09:00,173 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:09:00,173 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:09:00,173 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:09:00,173 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:09:00,173 INFO ]: Start difference. First operand 7 states and 226 transitions. Second operand 3 states. [2018-06-27 00:09:00,359 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:09:00,359 INFO ]: Finished difference Result 8 states and 226 transitions. [2018-06-27 00:09:00,359 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:09:00,359 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:09:00,359 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:09:00,359 INFO ]: With dead ends: 8 [2018-06-27 00:09:00,359 INFO ]: Without dead ends: 7 [2018-06-27 00:09:00,359 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 00:09:00,359 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:09:00,360 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:09:00,360 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:09:00,360 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2018-06-27 00:09:00,360 INFO ]: Start accepts. Automaton has 7 states and 154 transitions. Word has length 6 [2018-06-27 00:09:00,360 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:09:00,360 INFO ]: Abstraction has 7 states and 154 transitions. [2018-06-27 00:09:00,360 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:09:00,360 INFO ]: Start isEmpty. Operand 7 states and 154 transitions. [2018-06-27 00:09:00,361 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:09:00,361 INFO ]: Found error trace [2018-06-27 00:09:00,361 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:09:00,361 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:09:00,361 INFO ]: Analyzing trace with hash -599610649, now seen corresponding path program 1 times [2018-06-27 00:09:00,361 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:09:00,361 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:09:00,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:00,361 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:00,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:00,376 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:00,460 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:00,460 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:09:00,460 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:09:00,460 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:09:00,460 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:09:00,460 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:09:00,461 INFO ]: Start difference. First operand 7 states and 154 transitions. Second operand 3 states. [2018-06-27 00:09:00,591 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:09:00,591 INFO ]: Finished difference Result 8 states and 154 transitions. [2018-06-27 00:09:00,591 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:09:00,591 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:09:00,591 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:09:00,591 INFO ]: With dead ends: 8 [2018-06-27 00:09:00,591 INFO ]: Without dead ends: 7 [2018-06-27 00:09:00,592 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 00:09:00,592 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:09:00,593 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:09:00,593 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:09:00,593 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2018-06-27 00:09:00,593 INFO ]: Start accepts. Automaton has 7 states and 130 transitions. Word has length 6 [2018-06-27 00:09:00,593 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:09:00,593 INFO ]: Abstraction has 7 states and 130 transitions. [2018-06-27 00:09:00,593 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:09:00,593 INFO ]: Start isEmpty. Operand 7 states and 130 transitions. [2018-06-27 00:09:00,593 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:09:00,593 INFO ]: Found error trace [2018-06-27 00:09:00,593 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:09:00,593 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:09:00,593 INFO ]: Analyzing trace with hash 346998376, now seen corresponding path program 1 times [2018-06-27 00:09:00,593 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:09:00,593 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:09:00,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:00,594 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:00,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:00,600 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:00,617 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:00,617 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:09:00,617 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:09:00,617 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:09:00,617 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:09:00,617 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:09:00,617 INFO ]: Start difference. First operand 7 states and 130 transitions. Second operand 3 states. [2018-06-27 00:09:00,724 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:09:00,724 INFO ]: Finished difference Result 8 states and 130 transitions. [2018-06-27 00:09:00,724 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:09:00,724 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:09:00,724 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:09:00,724 INFO ]: With dead ends: 8 [2018-06-27 00:09:00,724 INFO ]: Without dead ends: 7 [2018-06-27 00:09:00,725 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 00:09:00,725 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:09:00,726 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:09:00,726 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:09:00,726 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2018-06-27 00:09:00,726 INFO ]: Start accepts. Automaton has 7 states and 82 transitions. Word has length 6 [2018-06-27 00:09:00,726 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:09:00,726 INFO ]: Abstraction has 7 states and 82 transitions. [2018-06-27 00:09:00,726 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:09:00,726 INFO ]: Start isEmpty. Operand 7 states and 82 transitions. [2018-06-27 00:09:00,727 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:09:00,727 INFO ]: Found error trace [2018-06-27 00:09:00,727 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:09:00,727 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:09:00,727 INFO ]: Analyzing trace with hash -482323482, now seen corresponding path program 1 times [2018-06-27 00:09:00,727 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:09:00,727 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:09:00,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:00,727 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:00,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:00,735 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:00,773 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:00,773 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:09:00,773 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:09:00,773 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:09:00,773 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:09:00,773 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:09:00,773 INFO ]: Start difference. First operand 7 states and 82 transitions. Second operand 3 states. [2018-06-27 00:09:00,839 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:09:00,839 INFO ]: Finished difference Result 8 states and 82 transitions. [2018-06-27 00:09:00,839 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:09:00,839 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:09:00,839 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:09:00,840 INFO ]: With dead ends: 8 [2018-06-27 00:09:00,840 INFO ]: Without dead ends: 7 [2018-06-27 00:09:00,840 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 00:09:00,840 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:09:00,841 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:09:00,841 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:09:00,841 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-06-27 00:09:00,841 INFO ]: Start accepts. Automaton has 7 states and 58 transitions. Word has length 6 [2018-06-27 00:09:00,841 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:09:00,841 INFO ]: Abstraction has 7 states and 58 transitions. [2018-06-27 00:09:00,841 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:09:00,841 INFO ]: Start isEmpty. Operand 7 states and 58 transitions. [2018-06-27 00:09:00,841 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:09:00,841 INFO ]: Found error trace [2018-06-27 00:09:00,841 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:09:00,841 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:09:00,841 INFO ]: Analyzing trace with hash -481399961, now seen corresponding path program 1 times [2018-06-27 00:09:00,841 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:09:00,841 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:09:00,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:00,842 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:00,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:00,851 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:00,962 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:00,962 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:09:00,962 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 00:09:00,971 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:01,028 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:01,042 INFO ]: Computing forward predicates... [2018-06-27 00:09:01,094 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 00:09:01,692 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:01,711 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:09:01,711 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-27 00:09:01,711 INFO ]: Interpolant automaton has 6 states [2018-06-27 00:09:01,712 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-27 00:09:01,712 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-27 00:09:01,712 INFO ]: Start difference. First operand 7 states and 58 transitions. Second operand 6 states. [2018-06-27 00:09:02,096 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:09:02,096 INFO ]: Finished difference Result 13 states and 66 transitions. [2018-06-27 00:09:02,097 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 00:09:02,097 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-27 00:09:02,097 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:09:02,098 INFO ]: With dead ends: 13 [2018-06-27 00:09:02,098 INFO ]: Without dead ends: 13 [2018-06-27 00:09:02,099 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-06-27 00:09:02,099 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-27 00:09:02,101 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-06-27 00:09:02,101 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-27 00:09:02,101 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2018-06-27 00:09:02,101 INFO ]: Start accepts. Automaton has 9 states and 62 transitions. Word has length 6 [2018-06-27 00:09:02,101 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:09:02,101 INFO ]: Abstraction has 9 states and 62 transitions. [2018-06-27 00:09:02,101 INFO ]: Interpolant automaton has 6 states. [2018-06-27 00:09:02,101 INFO ]: Start isEmpty. Operand 9 states and 62 transitions. [2018-06-27 00:09:02,102 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:09:02,102 INFO ]: Found error trace [2018-06-27 00:09:02,102 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:09:02,102 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:09:02,102 INFO ]: Analyzing trace with hash -481413415, now seen corresponding path program 1 times [2018-06-27 00:09:02,102 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:09:02,102 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:09:02,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:02,103 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:02,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:02,115 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:02,227 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:02,228 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:09:02,228 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 00:09:02,234 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:02,275 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:02,278 INFO ]: Computing forward predicates... [2018-06-27 00:09:02,355 WARN ]: expecting exponential blowup for input size 7 [2018-06-27 00:09:02,721 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:02,746 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:09:02,746 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-27 00:09:02,746 INFO ]: Interpolant automaton has 5 states [2018-06-27 00:09:02,747 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-27 00:09:02,747 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-27 00:09:02,747 INFO ]: Start difference. First operand 9 states and 62 transitions. Second operand 5 states. [2018-06-27 00:09:03,408 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:09:03,408 INFO ]: Finished difference Result 12 states and 64 transitions. [2018-06-27 00:09:03,408 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 00:09:03,408 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-27 00:09:03,408 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:09:03,409 INFO ]: With dead ends: 12 [2018-06-27 00:09:03,409 INFO ]: Without dead ends: 12 [2018-06-27 00:09:03,409 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-27 00:09:03,409 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-27 00:09:03,410 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-06-27 00:09:03,410 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-27 00:09:03,410 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2018-06-27 00:09:03,411 INFO ]: Start accepts. Automaton has 9 states and 61 transitions. Word has length 6 [2018-06-27 00:09:03,411 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:09:03,411 INFO ]: Abstraction has 9 states and 61 transitions. [2018-06-27 00:09:03,411 INFO ]: Interpolant automaton has 5 states. [2018-06-27 00:09:03,411 INFO ]: Start isEmpty. Operand 9 states and 61 transitions. [2018-06-27 00:09:03,411 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:09:03,411 INFO ]: Found error trace [2018-06-27 00:09:03,411 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:09:03,411 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:09:03,411 INFO ]: Analyzing trace with hash -481406688, now seen corresponding path program 1 times [2018-06-27 00:09:03,411 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:09:03,411 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:09:03,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:03,412 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:03,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:03,425 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:03,651 WARN ]: Spent 188.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 4 [2018-06-27 00:09:04,137 WARN ]: Spent 437.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-06-27 00:09:04,138 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:04,138 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:09:04,138 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 00:09:04,143 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:04,171 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:04,173 INFO ]: Computing forward predicates... [2018-06-27 00:09:04,302 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:04,322 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:09:04,322 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-27 00:09:04,322 INFO ]: Interpolant automaton has 5 states [2018-06-27 00:09:04,322 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-27 00:09:04,322 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-27 00:09:04,322 INFO ]: Start difference. First operand 9 states and 61 transitions. Second operand 5 states. [2018-06-27 00:09:04,496 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:09:04,496 INFO ]: Finished difference Result 12 states and 63 transitions. [2018-06-27 00:09:04,496 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-27 00:09:04,496 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-27 00:09:04,496 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:09:04,497 INFO ]: With dead ends: 12 [2018-06-27 00:09:04,497 INFO ]: Without dead ends: 12 [2018-06-27 00:09:04,497 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-27 00:09:04,497 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-27 00:09:04,498 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 8. [2018-06-27 00:09:04,498 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:09:04,498 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2018-06-27 00:09:04,498 INFO ]: Start accepts. Automaton has 8 states and 59 transitions. Word has length 6 [2018-06-27 00:09:04,498 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:09:04,498 INFO ]: Abstraction has 8 states and 59 transitions. [2018-06-27 00:09:04,498 INFO ]: Interpolant automaton has 5 states. [2018-06-27 00:09:04,498 INFO ]: Start isEmpty. Operand 8 states and 59 transitions. [2018-06-27 00:09:04,499 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:09:04,499 INFO ]: Found error trace [2018-06-27 00:09:04,499 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:09:04,499 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:09:04,499 INFO ]: Analyzing trace with hash 288816553, now seen corresponding path program 1 times [2018-06-27 00:09:04,499 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:09:04,499 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:09:04,500 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:04,500 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:04,500 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:04,509 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:05,025 WARN ]: Spent 466.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 17 [2018-06-27 00:09:05,034 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:05,035 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:09:05,035 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 00:09:05,040 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:05,071 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:05,074 INFO ]: Computing forward predicates... [2018-06-27 00:09:05,300 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:05,320 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:09:05,320 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-27 00:09:05,320 INFO ]: Interpolant automaton has 6 states [2018-06-27 00:09:05,320 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-27 00:09:05,320 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-27 00:09:05,321 INFO ]: Start difference. First operand 8 states and 59 transitions. Second operand 6 states. [2018-06-27 00:09:05,459 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:09:05,459 INFO ]: Finished difference Result 14 states and 67 transitions. [2018-06-27 00:09:05,459 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 00:09:05,459 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-27 00:09:05,459 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:09:05,459 INFO ]: With dead ends: 14 [2018-06-27 00:09:05,459 INFO ]: Without dead ends: 14 [2018-06-27 00:09:05,459 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-06-27 00:09:05,459 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-27 00:09:05,460 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-06-27 00:09:05,460 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-27 00:09:05,461 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2018-06-27 00:09:05,461 INFO ]: Start accepts. Automaton has 10 states and 63 transitions. Word has length 6 [2018-06-27 00:09:05,461 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:09:05,461 INFO ]: Abstraction has 10 states and 63 transitions. [2018-06-27 00:09:05,461 INFO ]: Interpolant automaton has 6 states. [2018-06-27 00:09:05,461 INFO ]: Start isEmpty. Operand 10 states and 63 transitions. [2018-06-27 00:09:05,461 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:09:05,461 INFO ]: Found error trace [2018-06-27 00:09:05,461 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:09:05,461 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:09:05,461 INFO ]: Analyzing trace with hash 288803099, now seen corresponding path program 1 times [2018-06-27 00:09:05,461 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:09:05,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:09:05,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:05,462 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:05,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:05,472 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:05,643 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:05,643 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:09:05,643 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 00:09:05,649 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:05,672 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:05,674 INFO ]: Computing forward predicates... [2018-06-27 00:09:05,687 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 00:09:05,886 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:05,906 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:09:05,918 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-27 00:09:05,918 INFO ]: Interpolant automaton has 5 states [2018-06-27 00:09:05,918 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-27 00:09:05,918 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-27 00:09:05,918 INFO ]: Start difference. First operand 10 states and 63 transitions. Second operand 5 states. [2018-06-27 00:09:06,035 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:09:06,035 INFO ]: Finished difference Result 13 states and 65 transitions. [2018-06-27 00:09:06,035 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 00:09:06,035 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-27 00:09:06,035 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:09:06,035 INFO ]: With dead ends: 13 [2018-06-27 00:09:06,035 INFO ]: Without dead ends: 13 [2018-06-27 00:09:06,037 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-27 00:09:06,037 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-27 00:09:06,038 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-27 00:09:06,038 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-27 00:09:06,038 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2018-06-27 00:09:06,038 INFO ]: Start accepts. Automaton has 10 states and 62 transitions. Word has length 6 [2018-06-27 00:09:06,038 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:09:06,038 INFO ]: Abstraction has 10 states and 62 transitions. [2018-06-27 00:09:06,038 INFO ]: Interpolant automaton has 5 states. [2018-06-27 00:09:06,038 INFO ]: Start isEmpty. Operand 10 states and 62 transitions. [2018-06-27 00:09:06,038 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:09:06,038 INFO ]: Found error trace [2018-06-27 00:09:06,038 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:09:06,039 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:09:06,039 INFO ]: Analyzing trace with hash 288809826, now seen corresponding path program 1 times [2018-06-27 00:09:06,039 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:09:06,039 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:09:06,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:06,043 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:06,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:06,057 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:06,161 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:06,161 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:09:06,161 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 00:09:06,167 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:06,190 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:06,192 INFO ]: Computing forward predicates... [2018-06-27 00:09:06,264 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:06,284 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:09:06,284 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-27 00:09:06,284 INFO ]: Interpolant automaton has 6 states [2018-06-27 00:09:06,284 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-27 00:09:06,284 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-27 00:09:06,284 INFO ]: Start difference. First operand 10 states and 62 transitions. Second operand 6 states. [2018-06-27 00:09:06,399 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:09:06,399 INFO ]: Finished difference Result 13 states and 64 transitions. [2018-06-27 00:09:06,399 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-27 00:09:06,399 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-27 00:09:06,399 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:09:06,399 INFO ]: With dead ends: 13 [2018-06-27 00:09:06,399 INFO ]: Without dead ends: 13 [2018-06-27 00:09:06,400 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-27 00:09:06,400 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-27 00:09:06,401 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 8. [2018-06-27 00:09:06,401 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:09:06,401 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2018-06-27 00:09:06,401 INFO ]: Start accepts. Automaton has 8 states and 59 transitions. Word has length 6 [2018-06-27 00:09:06,401 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:09:06,401 INFO ]: Abstraction has 8 states and 59 transitions. [2018-06-27 00:09:06,401 INFO ]: Interpolant automaton has 6 states. [2018-06-27 00:09:06,401 INFO ]: Start isEmpty. Operand 8 states and 59 transitions. [2018-06-27 00:09:06,401 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:09:06,401 INFO ]: Found error trace [2018-06-27 00:09:06,401 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:09:06,401 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:09:06,401 INFO ]: Analyzing trace with hash 113347563, now seen corresponding path program 1 times [2018-06-27 00:09:06,401 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:09:06,401 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:09:06,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:06,402 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:06,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:06,409 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:06,466 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:06,466 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:09:06,466 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 00:09:06,472 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:06,496 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:06,497 INFO ]: Computing forward predicates... [2018-06-27 00:09:06,547 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:06,566 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:09:06,566 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-27 00:09:06,566 INFO ]: Interpolant automaton has 6 states [2018-06-27 00:09:06,566 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-27 00:09:06,567 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-27 00:09:06,567 INFO ]: Start difference. First operand 8 states and 59 transitions. Second operand 6 states. [2018-06-27 00:09:06,758 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:09:06,758 INFO ]: Finished difference Result 14 states and 67 transitions. [2018-06-27 00:09:06,758 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 00:09:06,758 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-27 00:09:06,758 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:09:06,758 INFO ]: With dead ends: 14 [2018-06-27 00:09:06,758 INFO ]: Without dead ends: 14 [2018-06-27 00:09:06,759 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-06-27 00:09:06,759 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-27 00:09:06,759 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-06-27 00:09:06,759 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-27 00:09:06,760 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2018-06-27 00:09:06,760 INFO ]: Start accepts. Automaton has 10 states and 63 transitions. Word has length 6 [2018-06-27 00:09:06,760 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:09:06,760 INFO ]: Abstraction has 10 states and 63 transitions. [2018-06-27 00:09:06,760 INFO ]: Interpolant automaton has 6 states. [2018-06-27 00:09:06,760 INFO ]: Start isEmpty. Operand 10 states and 63 transitions. [2018-06-27 00:09:06,760 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:09:06,760 INFO ]: Found error trace [2018-06-27 00:09:06,760 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:09:06,760 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:09:06,760 INFO ]: Analyzing trace with hash 113334109, now seen corresponding path program 1 times [2018-06-27 00:09:06,760 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:09:06,760 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:09:06,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:06,761 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:06,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:07,370 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:07,505 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:07,505 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:09:07,505 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 00:09:07,511 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:07,534 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:07,535 INFO ]: Computing forward predicates... [2018-06-27 00:09:07,566 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 00:09:07,566 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 00:09:07,566 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 00:09:07,682 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:07,701 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:09:07,701 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-27 00:09:07,701 INFO ]: Interpolant automaton has 6 states [2018-06-27 00:09:07,702 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-27 00:09:07,702 INFO ]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-27 00:09:07,702 INFO ]: Start difference. First operand 10 states and 63 transitions. Second operand 6 states. [2018-06-27 00:09:07,820 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:09:07,820 INFO ]: Finished difference Result 13 states and 65 transitions. [2018-06-27 00:09:07,822 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 00:09:07,822 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-27 00:09:07,822 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:09:07,822 INFO ]: With dead ends: 13 [2018-06-27 00:09:07,822 INFO ]: Without dead ends: 13 [2018-06-27 00:09:07,822 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-06-27 00:09:07,822 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-27 00:09:07,823 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-27 00:09:07,823 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-27 00:09:07,824 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2018-06-27 00:09:07,824 INFO ]: Start accepts. Automaton has 10 states and 62 transitions. Word has length 6 [2018-06-27 00:09:07,824 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:09:07,824 INFO ]: Abstraction has 10 states and 62 transitions. [2018-06-27 00:09:07,824 INFO ]: Interpolant automaton has 6 states. [2018-06-27 00:09:07,824 INFO ]: Start isEmpty. Operand 10 states and 62 transitions. [2018-06-27 00:09:07,825 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:09:07,825 INFO ]: Found error trace [2018-06-27 00:09:07,825 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:09:07,825 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:09:07,825 INFO ]: Analyzing trace with hash 113340836, now seen corresponding path program 1 times [2018-06-27 00:09:07,825 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:09:07,825 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:09:07,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:07,825 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:07,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:07,832 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:08,082 WARN ]: Spent 201.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2018-06-27 00:09:08,287 WARN ]: Spent 160.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2018-06-27 00:09:08,288 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:08,288 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:09:08,288 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) [2018-06-27 00:09:08,300 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 00:09:08,324 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:08,326 INFO ]: Computing forward predicates... [2018-06-27 00:09:08,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 00:09:08,392 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:09:08,392 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-27 00:09:08,392 INFO ]: Interpolant automaton has 5 states [2018-06-27 00:09:08,392 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-27 00:09:08,392 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-27 00:09:08,392 INFO ]: Start difference. First operand 10 states and 62 transitions. Second operand 5 states. [2018-06-27 00:09:08,549 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:09:08,549 INFO ]: Finished difference Result 13 states and 64 transitions. [2018-06-27 00:09:08,549 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-27 00:09:08,549 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-27 00:09:08,549 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:09:08,549 INFO ]: With dead ends: 13 [2018-06-27 00:09:08,549 INFO ]: Without dead ends: 13 [2018-06-27 00:09:08,550 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-27 00:09:08,550 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-27 00:09:08,551 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 8. [2018-06-27 00:09:08,551 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:09:08,551 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2018-06-27 00:09:08,551 INFO ]: Start accepts. Automaton has 8 states and 59 transitions. Word has length 6 [2018-06-27 00:09:08,551 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:09:08,551 INFO ]: Abstraction has 8 states and 59 transitions. [2018-06-27 00:09:08,551 INFO ]: Interpolant automaton has 5 states. [2018-06-27 00:09:08,551 INFO ]: Start isEmpty. Operand 8 states and 59 transitions. [2018-06-27 00:09:08,551 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:09:08,551 INFO ]: Found error trace [2018-06-27 00:09:08,551 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:09:08,551 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:09:08,552 INFO ]: Analyzing trace with hash -358571668, now seen corresponding path program 1 times [2018-06-27 00:09:08,552 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:09:08,552 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:09:08,552 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:08,552 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:08,552 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:08,559 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:08,653 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:08,653 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:09:08,653 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:09:08,653 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:09:08,653 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:09:08,653 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:09:08,653 INFO ]: Start difference. First operand 8 states and 59 transitions. Second operand 3 states. [2018-06-27 00:09:08,700 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:09:08,700 INFO ]: Finished difference Result 9 states and 59 transitions. [2018-06-27 00:09:08,700 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:09:08,700 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:09:08,700 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:09:08,700 INFO ]: With dead ends: 9 [2018-06-27 00:09:08,700 INFO ]: Without dead ends: 8 [2018-06-27 00:09:08,700 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 00:09:08,701 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 00:09:08,701 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 00:09:08,701 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:09:08,701 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2018-06-27 00:09:08,702 INFO ]: Start accepts. Automaton has 8 states and 43 transitions. Word has length 6 [2018-06-27 00:09:08,702 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:09:08,702 INFO ]: Abstraction has 8 states and 43 transitions. [2018-06-27 00:09:08,702 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:09:08,702 INFO ]: Start isEmpty. Operand 8 states and 43 transitions. [2018-06-27 00:09:08,702 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:09:08,702 INFO ]: Found error trace [2018-06-27 00:09:08,702 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:09:08,702 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:09:08,702 INFO ]: Analyzing trace with hash 357157107, now seen corresponding path program 1 times [2018-06-27 00:09:08,702 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:09:08,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:09:08,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:08,703 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:08,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:08,709 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:08,809 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:08,809 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:09:08,809 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 00:09:08,815 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:08,837 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:08,838 INFO ]: Computing forward predicates... [2018-06-27 00:09:08,865 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 00:09:09,373 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:09,393 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:09:09,393 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-27 00:09:09,393 INFO ]: Interpolant automaton has 6 states [2018-06-27 00:09:09,393 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-27 00:09:09,393 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-27 00:09:09,394 INFO ]: Start difference. First operand 8 states and 43 transitions. Second operand 6 states. [2018-06-27 00:09:09,527 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:09:09,527 INFO ]: Finished difference Result 18 states and 55 transitions. [2018-06-27 00:09:09,527 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-27 00:09:09,527 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-27 00:09:09,527 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:09:09,528 INFO ]: With dead ends: 18 [2018-06-27 00:09:09,528 INFO ]: Without dead ends: 18 [2018-06-27 00:09:09,528 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-06-27 00:09:09,528 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-27 00:09:09,529 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 10. [2018-06-27 00:09:09,529 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-27 00:09:09,529 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2018-06-27 00:09:09,529 INFO ]: Start accepts. Automaton has 10 states and 47 transitions. Word has length 6 [2018-06-27 00:09:09,529 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:09:09,529 INFO ]: Abstraction has 10 states and 47 transitions. [2018-06-27 00:09:09,529 INFO ]: Interpolant automaton has 6 states. [2018-06-27 00:09:09,529 INFO ]: Start isEmpty. Operand 10 states and 47 transitions. [2018-06-27 00:09:09,529 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:09:09,529 INFO ]: Found error trace [2018-06-27 00:09:09,529 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:09:09,529 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:09:09,530 INFO ]: Analyzing trace with hash 357143653, now seen corresponding path program 1 times [2018-06-27 00:09:09,530 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:09:09,530 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:09:09,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:09,530 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:09,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:09,536 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:09,596 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:09,596 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:09:09,596 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 00:09:09,604 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:09,641 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:09,643 INFO ]: Computing forward predicates... [2018-06-27 00:09:09,755 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:09,776 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:09:09,776 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-27 00:09:09,776 INFO ]: Interpolant automaton has 5 states [2018-06-27 00:09:09,776 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-27 00:09:09,776 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-27 00:09:09,776 INFO ]: Start difference. First operand 10 states and 47 transitions. Second operand 5 states. [2018-06-27 00:09:09,872 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:09:09,872 INFO ]: Finished difference Result 18 states and 54 transitions. [2018-06-27 00:09:09,873 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-27 00:09:09,873 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-27 00:09:09,873 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:09:09,873 INFO ]: With dead ends: 18 [2018-06-27 00:09:09,873 INFO ]: Without dead ends: 18 [2018-06-27 00:09:09,873 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-27 00:09:09,873 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-27 00:09:09,875 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 10. [2018-06-27 00:09:09,875 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-27 00:09:09,875 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2018-06-27 00:09:09,875 INFO ]: Start accepts. Automaton has 10 states and 46 transitions. Word has length 6 [2018-06-27 00:09:09,875 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:09:09,875 INFO ]: Abstraction has 10 states and 46 transitions. [2018-06-27 00:09:09,875 INFO ]: Interpolant automaton has 5 states. [2018-06-27 00:09:09,875 INFO ]: Start isEmpty. Operand 10 states and 46 transitions. [2018-06-27 00:09:09,875 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:09:09,875 INFO ]: Found error trace [2018-06-27 00:09:09,875 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:09:09,875 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:09:09,875 INFO ]: Analyzing trace with hash 357150380, now seen corresponding path program 1 times [2018-06-27 00:09:09,875 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:09:09,875 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:09:09,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:09,876 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:09,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:09,882 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:10,070 WARN ]: Spent 142.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 9 [2018-06-27 00:09:10,092 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:10,092 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:09:10,092 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 00:09:10,098 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:10,138 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:09:10,140 INFO ]: Computing forward predicates... [2018-06-27 00:09:10,315 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:09:10,334 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:09:10,334 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-27 00:09:10,334 INFO ]: Interpolant automaton has 6 states [2018-06-27 00:09:10,335 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-27 00:09:10,335 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-27 00:09:10,335 INFO ]: Start difference. First operand 10 states and 46 transitions. Second operand 6 states. [2018-06-27 00:09:10,443 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:09:10,443 INFO ]: Finished difference Result 16 states and 51 transitions. [2018-06-27 00:09:10,443 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-27 00:09:10,443 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-27 00:09:10,443 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:09:10,443 INFO ]: With dead ends: 16 [2018-06-27 00:09:10,443 INFO ]: Without dead ends: 16 [2018-06-27 00:09:10,444 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-27 00:09:10,444 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-27 00:09:10,445 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 8. [2018-06-27 00:09:10,445 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:09:10,445 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2018-06-27 00:09:10,445 INFO ]: Start accepts. Automaton has 8 states and 43 transitions. Word has length 6 [2018-06-27 00:09:10,445 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:09:10,445 INFO ]: Abstraction has 8 states and 43 transitions. [2018-06-27 00:09:10,445 INFO ]: Interpolant automaton has 6 states. [2018-06-27 00:09:10,445 INFO ]: Start isEmpty. Operand 8 states and 43 transitions. [2018-06-27 00:09:10,445 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:09:10,445 INFO ]: Found error trace [2018-06-27 00:09:10,445 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:09:10,445 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:09:10,445 INFO ]: Analyzing trace with hash -824026252, now seen corresponding path program 1 times [2018-06-27 00:09:10,445 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:09:10,445 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:09:10,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:10,446 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:09:10,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:09:10,456 INFO ]: Conjunction of SSA is sat [2018-06-27 00:09:10,458 INFO ]: Counterexample might be feasible [2018-06-27 00:09:10,472 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-27 00:09:10,474 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 12:09:10 BasicIcfg [2018-06-27 00:09:10,474 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-27 00:09:10,475 INFO ]: Toolchain (without parser) took 42887.55 ms. Allocated memory was 308.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 260.8 MB in the beginning and 889.8 MB in the end (delta: -629.1 MB). Peak memory consumption was 555.3 MB. Max. memory is 3.6 GB. [2018-06-27 00:09:10,475 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-27 00:09:10,475 INFO ]: ChcToBoogie took 65.02 ms. Allocated memory is still 308.3 MB. Free memory was 260.8 MB in the beginning and 257.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-27 00:09:10,476 INFO ]: Boogie Preprocessor took 50.07 ms. Allocated memory is still 308.3 MB. Free memory was 257.8 MB in the beginning and 256.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-27 00:09:10,476 INFO ]: RCFGBuilder took 318.02 ms. Allocated memory is still 308.3 MB. Free memory was 256.7 MB in the beginning and 242.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-27 00:09:10,476 INFO ]: BlockEncodingV2 took 13616.66 ms. Allocated memory was 308.3 MB in the beginning and 739.8 MB in the end (delta: 431.5 MB). Free memory was 242.7 MB in the beginning and 435.2 MB in the end (delta: -192.5 MB). Peak memory consumption was 414.0 MB. Max. memory is 3.6 GB. [2018-06-27 00:09:10,477 INFO ]: TraceAbstraction took 28826.00 ms. Allocated memory was 739.8 MB in the beginning and 1.5 GB in the end (delta: 752.9 MB). Free memory was 435.2 MB in the beginning and 889.8 MB in the end (delta: -454.6 MB). Peak memory consumption was 298.3 MB. Max. memory is 3.6 GB. [2018-06-27 00:09:10,484 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, 2057 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 65.02 ms. Allocated memory is still 308.3 MB. Free memory was 260.8 MB in the beginning and 257.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 50.07 ms. Allocated memory is still 308.3 MB. Free memory was 257.8 MB in the beginning and 256.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 318.02 ms. Allocated memory is still 308.3 MB. Free memory was 256.7 MB in the beginning and 242.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 13616.66 ms. Allocated memory was 308.3 MB in the beginning and 739.8 MB in the end (delta: 431.5 MB). Free memory was 242.7 MB in the beginning and 435.2 MB in the end (delta: -192.5 MB). Peak memory consumption was 414.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 28826.00 ms. Allocated memory was 739.8 MB in the beginning and 1.5 GB in the end (delta: 752.9 MB). Free memory was 435.2 MB in the beginning and 889.8 MB in the end (delta: -454.6 MB). Peak memory consumption was 298.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, false, false, false, 0, 0, 0, 0, 0, 0, 0, false, false, 0, false, false, false, false, false, false, false); [L0] assume !hbv_False_1_Bool; [L0] hhv_state_0_Int, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Bool, hhv_state_4_Int, hhv_state_5_Int, hhv_state_6_Int, hhv_state_7_Int, hhv_state_8_Int, hhv_state_9_Int, hhv_state_10_Int, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Int, hhv_state_14_Bool, hhv_state_15_Bool, hhv_state_16_Bool, hhv_state_17_Bool, hhv_state_18_Bool, hhv_state_19_Bool, hhv_state_20_Bool := hbv_False_2_Int, hbv_False_3_Bool, hbv_False_4_Bool, hbv_False_5_Bool, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int, hbv_False_13_Bool, hbv_False_14_Bool, hbv_False_15_Int, hbv_False_16_Bool, hbv_False_17_Bool, hbv_False_18_Bool, hbv_False_19_Bool, hbv_False_1_Bool, hbv_False_20_Bool, hbv_False_21_Bool; [L0] havoc hbv_False_2_Int, hbv_False_11_Int, hbv_False_12_Int, hbv_False_4_Bool, hbv_False_8_Int, hbv_False_5_Bool, hbv_False_21_Bool, hbv_False_10_Int, hbv_False_13_Bool, hbv_False_18_Bool, hbv_False_7_Int, hbv_False_9_Int, hbv_False_14_Bool, hbv_False_1_Bool, hbv_False_20_Bool, hbv_False_19_Bool, hbv_False_16_Bool, hbv_False_17_Bool, hbv_False_15_Int, hbv_False_6_Int, hbv_False_3_Bool; [L0] assume ((((((((((((((((((((((((((((((((((((((!(((hbv_state_2_Bool && !hhv_state_17_Bool) || hhv_state_3_Bool) && ((!hhv_state_3_Bool || !hbv_state_2_Bool) || hhv_state_17_Bool)) && !((!hbv_state_13_Bool || !hbv_state_14_Bool) && (hbv_state_13_Bool || hbv_state_14_Bool))) && !((hbv_state_3_Bool || hbv_state_15_Bool) && (!hbv_state_3_Bool || !hbv_state_15_Bool))) && !((!hbv_state_18_Bool || !hbv_state_1_Bool) && (hbv_state_1_Bool || hbv_state_18_Bool))) && hhv_state_7_Int == hhv_state_10_Int) && hbv_state_8_Int == hhv_state_0_Int) && hbv_state_16_Int == hbv_state_8_Int) && !(!(hhv_state_8_Int == hhv_state_13_Int) && (!hhv_state_15_Bool || hhv_state_14_Bool))) && hbv_state_16_Int == hbv_state_12_Int) && hbv_state_6_Int == hbv_state_11_Int) && hhv_state_4_Int == hhv_state_7_Int) && !((hbv_state_4_Bool || !hbv_state_5_Bool) && !(hbv_state_6_Int == hbv_state_7_Int))) && hhv_state_6_Int == hhv_state_0_Int) && !((!hhv_state_16_Bool || !hhv_state_11_Bool) && (hhv_state_16_Bool || hhv_state_11_Bool))) && hhv_state_5_Int == hhv_state_4_Int) && !((!(hhv_state_8_Int == 1) && !hhv_state_14_Bool) && hhv_state_15_Bool)) && !((!hhv_state_18_Bool || !hhv_state_3_Bool) && (hhv_state_3_Bool || hhv_state_18_Bool))) && !(!(hhv_state_13_Int == 0) && (!hhv_state_14_Bool || hhv_state_15_Bool))) && !((hhv_state_1_Bool || hhv_state_12_Bool) && (!hhv_state_1_Bool || !hhv_state_12_Bool))) && hhv_state_9_Int == hhv_state_8_Int) && !((hbv_state_1_Bool || hbv_state_17_Bool) && (!hbv_state_17_Bool || !hbv_state_1_Bool))) && !(((hhv_state_19_Bool || 10 <= hhv_state_10_Int) && !hbv_state_3_Bool) && (!hhv_state_19_Bool || !(10 <= hhv_state_10_Int)))) && !(((!(hhv_state_10_Int <= -10) || !hhv_state_20_Bool) && (hhv_state_20_Bool || hhv_state_10_Int <= -10)) && !hbv_state_1_Bool)) && !(!(hbv_state_7_Int == 0) && (hbv_state_5_Bool || !hbv_state_4_Bool))) && !((!hhv_state_12_Bool || !hhv_state_17_Bool) && (hhv_state_17_Bool || hhv_state_12_Bool))) && !((hbv_state_5_Bool && !hbv_state_4_Bool) && !(hbv_state_6_Int == 1))) && hbv_state_8_Int == hbv_state_9_Int) && !(((!(hhv_state_10_Int <= 0) || hhv_state_19_Bool) && hbv_state_3_Bool) && (hhv_state_10_Int <= 0 || !hhv_state_19_Bool))) && !((!(hbv_state_12_Int == hbv_state_10_Int) && !hbv_state_5_Bool) && !hbv_state_4_Bool)) && !((hbv_state_4_Bool && !hbv_state_5_Bool) && !(hbv_state_7_Int == 2))) && !(((hhv_state_20_Bool || !(0 <= hhv_state_10_Int)) && hbv_state_1_Bool) && (0 <= hhv_state_10_Int || !hhv_state_20_Bool))) && !(!(hbv_state_12_Int + (-1 * hbv_state_10_Int + -1 * hbv_state_11_Int) == 0) && (hbv_state_4_Bool || hbv_state_5_Bool))) && !((!hhv_state_2_Bool || !hhv_state_11_Bool) && (hhv_state_11_Bool || hhv_state_2_Bool))) && !((!(hhv_state_13_Int == 2) && !hhv_state_15_Bool) && hhv_state_14_Bool)) && !((!hhv_state_15_Bool && !(hhv_state_5_Int == hhv_state_6_Int)) && !hhv_state_14_Bool)) && !((!hhv_state_19_Bool || !hhv_state_2_Bool) && (hhv_state_2_Bool || hhv_state_19_Bool))) && hbv_state_19_Int == hbv_state_10_Int) && !((hhv_state_14_Bool || hhv_state_15_Bool) && !(hhv_state_5_Int + (-1 * hhv_state_6_Int + -1 * hhv_state_9_Int) == 0))) && !((hhv_state_20_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_20_Bool))) && !((hbv_state_2_Bool || hbv_state_3_Bool) && (!hbv_state_3_Bool || !hbv_state_2_Bool)); [L0] hhv_state_0_Int, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Bool, hhv_state_4_Int, hhv_state_5_Int, hhv_state_6_Int, hhv_state_7_Int, hhv_state_8_Int, hhv_state_9_Int, hhv_state_10_Int, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Int, hhv_state_14_Bool, hhv_state_15_Bool, hhv_state_16_Bool, hhv_state_17_Bool, hhv_state_18_Bool, hhv_state_19_Bool, hhv_state_20_Bool := hbv_state_19_Int, hbv_state_18_Bool, hbv_state_15_Bool, hbv_state_13_Bool, hbv_state_16_Int, hbv_state_12_Int, hbv_state_10_Int, hbv_state_8_Int, hbv_state_6_Int, hbv_state_11_Int, hbv_state_9_Int, hbv_state_3_Bool, hbv_state_1_Bool, hbv_state_7_Int, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_2_Bool, hbv_state_17_Bool, hbv_state_14_Bool, hbv_state_20_Bool, hbv_state_21_Bool; [L0] havoc hbv_state_8_Int, hbv_state_3_Bool, hbv_state_18_Bool, hbv_state_10_Int, hbv_state_15_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_12_Int, hbv_state_6_Int, hbv_state_21_Bool, hbv_state_16_Int, hbv_state_13_Bool, hbv_state_9_Int, hbv_state_17_Bool, hbv_state_11_Int, hbv_state_14_Bool, hbv_state_20_Bool, hbv_state_2_Bool, hbv_state_19_Int, hbv_state_7_Int, hbv_state_1_Bool; [L0] RET call gotoProc(0, 0, false, false, false, 0, 0, 0, 0, 0, 0, 0, false, false, 0, false, false, false, false, false, false, false); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. UNSAFE Result, 28.7s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 20.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17129 SDtfs, 24 SDslu, 156 SDs, 0 SdLazy, 9503 SolverSat, 8977 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=19, 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, 28 MinimizatonAttempts, 66 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 3604 SizeOfPredicates, 52 NumberOfNonLiveVariables, 2292 ConjunctsInSsa, 310 ConjunctsInUnsatCore, 40 InterpolantComputations, 16 PerfectInterpolantSequences, 11/35 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-27_00-09-10-497.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-27_00-09-10-497.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-27_00-09-10-497.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-27_00-09-10-497.csv Received shutdown request...