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/ex3_e7_590_e7_590.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 03:44:01,189 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 03:44:01,190 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 03:44:01,202 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 03:44:01,202 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 03:44:01,203 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 03:44:01,204 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 03:44:01,206 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 03:44:01,208 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 03:44:01,209 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 03:44:01,210 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 03:44:01,210 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 03:44:01,220 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 03:44:01,221 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 03:44:01,222 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 03:44:01,223 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 03:44:01,224 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 03:44:01,226 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 03:44:01,228 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 03:44:01,229 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 03:44:01,233 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 03:44:01,236 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 03:44:01,239 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 03:44:01,239 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 03:44:01,241 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 03:44:01,242 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 03:44:01,243 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 03:44:01,243 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 03:44:01,244 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 03:44:01,245 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 03:44:01,250 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 03:44:01,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 03:44:01,251 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 03:44:01,251 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 03:44:01,252 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 03:44:01,252 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 03:44:01,268 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 03:44:01,269 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 03:44:01,269 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 03:44:01,269 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 03:44:01,270 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 03:44:01,270 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 03:44:01,270 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 03:44:01,271 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 03:44:01,271 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 03:44:01,271 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 03:44:01,271 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 03:44:01,271 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 03:44:01,272 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 03:44:01,272 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 03:44:01,272 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 03:44:01,272 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 03:44:01,272 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 03:44:01,273 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 03:44:01,273 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 03:44:01,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 03:44:01,273 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 03:44:01,274 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 03:44:01,275 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 03:44:01,315 INFO ]: Repository-Root is: /tmp [2018-06-25 03:44:01,326 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 03:44:01,330 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 03:44:01,333 INFO ]: Initializing SmtParser... [2018-06-25 03:44:01,333 INFO ]: SmtParser initialized [2018-06-25 03:44:01,334 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e7_590_e7_590.smt2 [2018-06-25 03:44:01,335 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-25 03:44:01,430 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e7_590_e7_590.smt2 unknown [2018-06-25 03:44:01,736 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e7_590_e7_590.smt2 [2018-06-25 03:44:01,741 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 03:44:01,746 INFO ]: Walking toolchain with 5 elements. [2018-06-25 03:44:01,747 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 03:44:01,747 INFO ]: Initializing ChcToBoogie... [2018-06-25 03:44:01,747 INFO ]: ChcToBoogie initialized [2018-06-25 03:44:01,750 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:44:01" (1/1) ... [2018-06-25 03:44:01,815 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:01 Unit [2018-06-25 03:44:01,815 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 03:44:01,816 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 03:44:01,816 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 03:44:01,816 INFO ]: Boogie Preprocessor initialized [2018-06-25 03:44:01,838 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:01" (1/1) ... [2018-06-25 03:44:01,838 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:01" (1/1) ... [2018-06-25 03:44:01,847 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:01" (1/1) ... [2018-06-25 03:44:01,847 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:01" (1/1) ... [2018-06-25 03:44:01,852 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:01" (1/1) ... [2018-06-25 03:44:01,853 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:01" (1/1) ... [2018-06-25 03:44:01,855 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:01" (1/1) ... [2018-06-25 03:44:01,857 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 03:44:01,857 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 03:44:01,857 INFO ]: Initializing RCFGBuilder... [2018-06-25 03:44:01,857 INFO ]: RCFGBuilder initialized [2018-06-25 03:44:01,858 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:01" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 03:44:01,876 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 03:44:01,876 INFO ]: Found specification of procedure gotoProc [2018-06-25 03:44:01,876 INFO ]: Found implementation of procedure gotoProc [2018-06-25 03:44:01,876 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 03:44:01,876 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 03:44:01,877 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 03:44:02,161 INFO ]: Using library mode [2018-06-25 03:44:02,161 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:44:02 BoogieIcfgContainer [2018-06-25 03:44:02,161 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 03:44:02,162 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 03:44:02,162 INFO ]: Initializing BlockEncodingV2... [2018-06-25 03:44:02,163 INFO ]: BlockEncodingV2 initialized [2018-06-25 03:44:02,163 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:44:02" (1/1) ... [2018-06-25 03:44:02,180 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 03:44:02,181 INFO ]: Using Remove infeasible edges [2018-06-25 03:44:02,181 INFO ]: Using Maximize final states [2018-06-25 03:44:02,182 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 03:44:02,182 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 03:44:02,186 INFO ]: Using Remove sink states [2018-06-25 03:44:02,187 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 03:44:02,187 INFO ]: Using Use SBE [2018-06-25 03:44:02,192 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 03:44:04,277 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 03:44:04,278 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 03:44:06,114 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 03:44:06,117 INFO ]: SBE split 2 edges [2018-06-25 03:44:06,135 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 03:44:06,139 INFO ]: 0 new accepting states [2018-06-25 03:44:17,774 INFO ]: Removed 2067 edges and 2 locations by large block encoding [2018-06-25 03:44:17,776 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:44:17,790 INFO ]: Removed 13 edges and 0 locations because of local infeasibility [2018-06-25 03:44:17,791 INFO ]: 0 new accepting states [2018-06-25 03:44:17,793 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 03:44:17,793 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:44:17,799 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 03:44:17,801 INFO ]: 0 new accepting states [2018-06-25 03:44:17,802 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 03:44:17,803 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:44:17,815 INFO ]: Encoded RCFG 6 locations, 2056 edges [2018-06-25 03:44:17,816 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 03:44:17 BasicIcfg [2018-06-25 03:44:17,816 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 03:44:17,817 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 03:44:17,817 INFO ]: Initializing TraceAbstraction... [2018-06-25 03:44:17,864 INFO ]: TraceAbstraction initialized [2018-06-25 03:44:17,865 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:44:01" (1/4) ... [2018-06-25 03:44:17,865 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772064c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 03:44:17, skipping insertion in model container [2018-06-25 03:44:17,865 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:01" (2/4) ... [2018-06-25 03:44:17,865 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772064c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 03:44:17, skipping insertion in model container [2018-06-25 03:44:17,866 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:44:02" (3/4) ... [2018-06-25 03:44:17,866 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772064c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 03:44:17, skipping insertion in model container [2018-06-25 03:44:17,866 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 03:44:17" (4/4) ... [2018-06-25 03:44:17,867 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 03:44:17,900 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 03:44:17,933 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 03:44:18,173 INFO ]: Using default assertion order modulation [2018-06-25 03:44:18,173 INFO ]: Interprodecural is true [2018-06-25 03:44:18,173 INFO ]: Hoare is false [2018-06-25 03:44:18,173 INFO ]: Compute interpolants for FPandBP [2018-06-25 03:44:18,173 INFO ]: Backedges is TWOTRACK [2018-06-25 03:44:18,173 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 03:44:18,173 INFO ]: Difference is false [2018-06-25 03:44:18,173 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 03:44:18,173 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 03:44:18,317 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 03:44:18,608 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 03:44:18,609 INFO ]: Found error trace [2018-06-25 03:44:18,623 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 03:44:18,624 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:44:18,627 INFO ]: Analyzing trace with hash 161089830, now seen corresponding path program 1 times [2018-06-25 03:44:18,629 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:44:18,629 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:44:18,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:18,876 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:18,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:19,027 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:19,130 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:19,138 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:44:19,138 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:44:19,140 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:44:19,151 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:44:19,151 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:44:19,248 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 03:44:22,455 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:44:22,455 INFO ]: Finished difference Result 7 states and 2057 transitions. [2018-06-25 03:44:22,495 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:44:22,496 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 03:44:22,496 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:44:22,554 INFO ]: With dead ends: 7 [2018-06-25 03:44:22,554 INFO ]: Without dead ends: 7 [2018-06-25 03:44:22,555 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-25 03:44:22,604 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:44:22,692 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:44:22,693 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:44:22,697 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2057 transitions. [2018-06-25 03:44:22,699 INFO ]: Start accepts. Automaton has 7 states and 2057 transitions. Word has length 5 [2018-06-25 03:44:22,700 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:44:22,700 INFO ]: Abstraction has 7 states and 2057 transitions. [2018-06-25 03:44:22,700 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:44:22,700 INFO ]: Start isEmpty. Operand 7 states and 2057 transitions. [2018-06-25 03:44:22,701 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:44:22,701 INFO ]: Found error trace [2018-06-25 03:44:22,701 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:44:22,701 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:44:22,701 INFO ]: Analyzing trace with hash 579684345, now seen corresponding path program 1 times [2018-06-25 03:44:22,701 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:44:22,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:44:22,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:22,704 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:22,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:22,765 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:22,923 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:22,923 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:44:22,923 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:44:22,925 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:44:22,925 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:44:22,925 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:44:22,925 INFO ]: Start difference. First operand 7 states and 2057 transitions. Second operand 3 states. [2018-06-25 03:44:25,744 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:44:25,744 INFO ]: Finished difference Result 8 states and 2057 transitions. [2018-06-25 03:44:25,744 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:44:25,744 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:44:25,744 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:44:25,746 INFO ]: With dead ends: 8 [2018-06-25 03:44:25,746 INFO ]: Without dead ends: 7 [2018-06-25 03:44:25,747 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-25 03:44:25,747 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:44:25,755 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:44:25,755 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:44:25,758 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1545 transitions. [2018-06-25 03:44:25,759 INFO ]: Start accepts. Automaton has 7 states and 1545 transitions. Word has length 6 [2018-06-25 03:44:25,759 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:44:25,759 INFO ]: Abstraction has 7 states and 1545 transitions. [2018-06-25 03:44:25,759 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:44:25,759 INFO ]: Start isEmpty. Operand 7 states and 1545 transitions. [2018-06-25 03:44:25,760 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:44:25,760 INFO ]: Found error trace [2018-06-25 03:44:25,760 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:44:25,760 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:44:25,760 INFO ]: Analyzing trace with hash 580607866, now seen corresponding path program 1 times [2018-06-25 03:44:25,760 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:44:25,760 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:44:25,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:25,761 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:25,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:25,803 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:25,841 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:25,841 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:44:25,841 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:44:25,841 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:44:25,841 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:44:25,841 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:44:25,841 INFO ]: Start difference. First operand 7 states and 1545 transitions. Second operand 3 states. [2018-06-25 03:44:28,208 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:44:28,208 INFO ]: Finished difference Result 8 states and 1545 transitions. [2018-06-25 03:44:28,233 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:44:28,233 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:44:28,233 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:44:28,234 INFO ]: With dead ends: 8 [2018-06-25 03:44:28,234 INFO ]: Without dead ends: 7 [2018-06-25 03:44:28,235 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-25 03:44:28,235 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:44:28,240 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:44:28,240 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:44:28,241 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1033 transitions. [2018-06-25 03:44:28,241 INFO ]: Start accepts. Automaton has 7 states and 1033 transitions. Word has length 6 [2018-06-25 03:44:28,241 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:44:28,241 INFO ]: Abstraction has 7 states and 1033 transitions. [2018-06-25 03:44:28,241 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:44:28,242 INFO ]: Start isEmpty. Operand 7 states and 1033 transitions. [2018-06-25 03:44:28,242 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:44:28,242 INFO ]: Found error trace [2018-06-25 03:44:28,242 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:44:28,242 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:44:28,242 INFO ]: Analyzing trace with hash 582454908, now seen corresponding path program 1 times [2018-06-25 03:44:28,242 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:44:28,243 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:44:28,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:28,243 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:28,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:28,264 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:28,298 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:28,298 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:44:28,298 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:44:28,298 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:44:28,298 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:44:28,298 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:44:28,298 INFO ]: Start difference. First operand 7 states and 1033 transitions. Second operand 3 states. [2018-06-25 03:44:29,288 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:44:29,288 INFO ]: Finished difference Result 8 states and 1033 transitions. [2018-06-25 03:44:29,289 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:44:29,289 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:44:29,289 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:44:29,290 INFO ]: With dead ends: 8 [2018-06-25 03:44:29,290 INFO ]: Without dead ends: 7 [2018-06-25 03:44:29,290 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-25 03:44:29,290 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:44:29,294 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:44:29,294 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:44:29,296 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 777 transitions. [2018-06-25 03:44:29,296 INFO ]: Start accepts. Automaton has 7 states and 777 transitions. Word has length 6 [2018-06-25 03:44:29,296 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:44:29,296 INFO ]: Abstraction has 7 states and 777 transitions. [2018-06-25 03:44:29,296 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:44:29,296 INFO ]: Start isEmpty. Operand 7 states and 777 transitions. [2018-06-25 03:44:29,296 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:44:29,296 INFO ]: Found error trace [2018-06-25 03:44:29,296 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:44:29,297 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:44:29,297 INFO ]: Analyzing trace with hash -365077638, now seen corresponding path program 1 times [2018-06-25 03:44:29,297 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:44:29,297 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:44:29,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:29,297 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:29,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:29,327 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:29,374 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:29,375 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:44:29,375 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:44:29,375 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:44:29,375 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:44:29,375 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:44:29,375 INFO ]: Start difference. First operand 7 states and 777 transitions. Second operand 3 states. [2018-06-25 03:44:30,004 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:44:30,004 INFO ]: Finished difference Result 8 states and 777 transitions. [2018-06-25 03:44:30,004 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:44:30,004 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:44:30,004 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:44:30,005 INFO ]: With dead ends: 8 [2018-06-25 03:44:30,005 INFO ]: Without dead ends: 7 [2018-06-25 03:44:30,006 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:44:30,006 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:44:30,009 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:44:30,009 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:44:30,010 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 585 transitions. [2018-06-25 03:44:30,010 INFO ]: Start accepts. Automaton has 7 states and 585 transitions. Word has length 6 [2018-06-25 03:44:30,010 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:44:30,010 INFO ]: Abstraction has 7 states and 585 transitions. [2018-06-25 03:44:30,010 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:44:30,010 INFO ]: Start isEmpty. Operand 7 states and 585 transitions. [2018-06-25 03:44:30,011 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:44:30,011 INFO ]: Found error trace [2018-06-25 03:44:30,011 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:44:30,011 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:44:30,011 INFO ]: Analyzing trace with hash 583378429, now seen corresponding path program 1 times [2018-06-25 03:44:30,011 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:44:30,011 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:44:30,012 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:30,012 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:30,012 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:30,044 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:30,115 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:30,115 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:44:30,115 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:44:30,115 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:44:30,115 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:44:30,115 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:44:30,115 INFO ]: Start difference. First operand 7 states and 585 transitions. Second operand 3 states. [2018-06-25 03:44:30,614 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:44:30,614 INFO ]: Finished difference Result 8 states and 585 transitions. [2018-06-25 03:44:30,615 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:44:30,615 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:44:30,615 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:44:30,615 INFO ]: With dead ends: 8 [2018-06-25 03:44:30,616 INFO ]: Without dead ends: 7 [2018-06-25 03:44:30,616 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-25 03:44:30,616 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:44:30,618 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:44:30,618 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:44:30,619 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 441 transitions. [2018-06-25 03:44:30,619 INFO ]: Start accepts. Automaton has 7 states and 441 transitions. Word has length 6 [2018-06-25 03:44:30,619 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:44:30,619 INFO ]: Abstraction has 7 states and 441 transitions. [2018-06-25 03:44:30,619 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:44:30,619 INFO ]: Start isEmpty. Operand 7 states and 441 transitions. [2018-06-25 03:44:30,620 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:44:30,620 INFO ]: Found error trace [2018-06-25 03:44:30,620 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:44:30,620 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:44:30,620 INFO ]: Analyzing trace with hash -362307075, now seen corresponding path program 1 times [2018-06-25 03:44:30,620 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:44:30,620 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:44:30,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:30,621 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:30,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:30,636 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:30,730 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:30,730 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:44:30,730 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:44:30,730 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:44:30,730 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:44:30,730 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:44:30,730 INFO ]: Start difference. First operand 7 states and 441 transitions. Second operand 3 states. [2018-06-25 03:44:31,662 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:44:31,662 INFO ]: Finished difference Result 8 states and 441 transitions. [2018-06-25 03:44:31,665 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:44:31,665 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:44:31,665 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:44:31,666 INFO ]: With dead ends: 8 [2018-06-25 03:44:31,666 INFO ]: Without dead ends: 7 [2018-06-25 03:44:31,666 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-25 03:44:31,666 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:44:31,668 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:44:31,668 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:44:31,669 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 297 transitions. [2018-06-25 03:44:31,669 INFO ]: Start accepts. Automaton has 7 states and 297 transitions. Word has length 6 [2018-06-25 03:44:31,669 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:44:31,669 INFO ]: Abstraction has 7 states and 297 transitions. [2018-06-25 03:44:31,669 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:44:31,669 INFO ]: Start isEmpty. Operand 7 states and 297 transitions. [2018-06-25 03:44:31,669 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:44:31,669 INFO ]: Found error trace [2018-06-25 03:44:31,669 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:44:31,669 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:44:31,670 INFO ]: Analyzing trace with hash -834226306, now seen corresponding path program 1 times [2018-06-25 03:44:31,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:44:31,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:44:31,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:31,670 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:31,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:31,680 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:31,799 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:31,800 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:44:31,800 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:44:31,800 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:44:31,800 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:44:31,800 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:44:31,800 INFO ]: Start difference. First operand 7 states and 297 transitions. Second operand 3 states. [2018-06-25 03:44:32,099 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:44:32,099 INFO ]: Finished difference Result 8 states and 297 transitions. [2018-06-25 03:44:32,099 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:44:32,099 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:44:32,099 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:44:32,099 INFO ]: With dead ends: 8 [2018-06-25 03:44:32,099 INFO ]: Without dead ends: 7 [2018-06-25 03:44:32,099 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-25 03:44:32,100 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:44:32,101 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:44:32,101 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:44:32,102 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 249 transitions. [2018-06-25 03:44:32,102 INFO ]: Start accepts. Automaton has 7 states and 249 transitions. Word has length 6 [2018-06-25 03:44:32,102 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:44:32,102 INFO ]: Abstraction has 7 states and 249 transitions. [2018-06-25 03:44:32,102 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:44:32,102 INFO ]: Start isEmpty. Operand 7 states and 249 transitions. [2018-06-25 03:44:32,103 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:44:32,103 INFO ]: Found error trace [2018-06-25 03:44:32,103 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:44:32,103 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:44:32,103 INFO ]: Analyzing trace with hash 586148992, now seen corresponding path program 1 times [2018-06-25 03:44:32,103 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:44:32,103 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:44:32,104 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:32,104 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:32,104 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:32,114 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:32,229 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:32,229 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:44:32,229 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:44:32,229 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:44:32,229 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:44:32,229 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:44:32,229 INFO ]: Start difference. First operand 7 states and 249 transitions. Second operand 3 states. [2018-06-25 03:44:32,948 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:44:32,948 INFO ]: Finished difference Result 8 states and 249 transitions. [2018-06-25 03:44:32,948 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:44:32,948 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:44:32,948 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:44:32,949 INFO ]: With dead ends: 8 [2018-06-25 03:44:32,949 INFO ]: Without dead ends: 7 [2018-06-25 03:44:32,949 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-25 03:44:32,949 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:44:32,950 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:44:32,950 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:44:32,950 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-06-25 03:44:32,951 INFO ]: Start accepts. Automaton has 7 states and 105 transitions. Word has length 6 [2018-06-25 03:44:32,951 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:44:32,951 INFO ]: Abstraction has 7 states and 105 transitions. [2018-06-25 03:44:32,951 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:44:32,951 INFO ]: Start isEmpty. Operand 7 states and 105 transitions. [2018-06-25 03:44:32,951 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:44:32,951 INFO ]: Found error trace [2018-06-25 03:44:32,951 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:44:32,951 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:44:32,951 INFO ]: Analyzing trace with hash -484211847, now seen corresponding path program 1 times [2018-06-25 03:44:32,951 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:44:32,951 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:44:32,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:32,952 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:32,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:32,968 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:32,990 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:32,990 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:44:32,990 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:44:32,990 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:44:32,990 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:44:32,990 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:44:32,991 INFO ]: Start difference. First operand 7 states and 105 transitions. Second operand 3 states. [2018-06-25 03:44:33,079 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:44:33,079 INFO ]: Finished difference Result 8 states and 105 transitions. [2018-06-25 03:44:33,079 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:44:33,080 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:44:33,080 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:44:33,080 INFO ]: With dead ends: 8 [2018-06-25 03:44:33,080 INFO ]: Without dead ends: 7 [2018-06-25 03:44:33,080 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-25 03:44:33,080 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:44:33,081 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:44:33,081 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:44:33,081 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2018-06-25 03:44:33,081 INFO ]: Start accepts. Automaton has 7 states and 73 transitions. Word has length 6 [2018-06-25 03:44:33,081 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:44:33,081 INFO ]: Abstraction has 7 states and 73 transitions. [2018-06-25 03:44:33,081 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:44:33,082 INFO ]: Start isEmpty. Operand 7 states and 73 transitions. [2018-06-25 03:44:33,082 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:44:33,082 INFO ]: Found error trace [2018-06-25 03:44:33,082 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:44:33,082 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:44:33,082 INFO ]: Analyzing trace with hash -10445574, now seen corresponding path program 1 times [2018-06-25 03:44:33,082 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:44:33,082 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:44:33,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:33,083 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:33,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:33,094 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:33,142 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:33,142 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:44:33,142 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:44:33,142 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:44:33,142 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:44:33,142 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:44:33,143 INFO ]: Start difference. First operand 7 states and 73 transitions. Second operand 3 states. [2018-06-25 03:44:33,202 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:44:33,202 INFO ]: Finished difference Result 8 states and 73 transitions. [2018-06-25 03:44:33,202 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:44:33,202 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:44:33,202 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:44:33,203 INFO ]: With dead ends: 8 [2018-06-25 03:44:33,203 INFO ]: Without dead ends: 7 [2018-06-25 03:44:33,203 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-25 03:44:33,203 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:44:33,204 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:44:33,204 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:44:33,204 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2018-06-25 03:44:33,204 INFO ]: Start accepts. Automaton has 7 states and 57 transitions. Word has length 6 [2018-06-25 03:44:33,204 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:44:33,204 INFO ]: Abstraction has 7 states and 57 transitions. [2018-06-25 03:44:33,204 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:44:33,204 INFO ]: Start isEmpty. Operand 7 states and 57 transitions. [2018-06-25 03:44:33,204 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:44:33,204 INFO ]: Found error trace [2018-06-25 03:44:33,204 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:44:33,204 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:44:33,204 INFO ]: Analyzing trace with hash -897025734, now seen corresponding path program 1 times [2018-06-25 03:44:33,204 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:44:33,204 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:44:33,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:33,205 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:33,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:33,216 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:33,298 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:33,298 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:44:33,299 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:44:33,299 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:44:33,299 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:44:33,299 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:44:33,299 INFO ]: Start difference. First operand 7 states and 57 transitions. Second operand 3 states. [2018-06-25 03:44:33,344 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:44:33,344 INFO ]: Finished difference Result 8 states and 57 transitions. [2018-06-25 03:44:33,344 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:44:33,344 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:44:33,344 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:44:33,344 INFO ]: With dead ends: 8 [2018-06-25 03:44:33,344 INFO ]: Without dead ends: 7 [2018-06-25 03:44:33,345 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-25 03:44:33,345 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:44:33,345 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:44:33,345 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:44:33,346 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2018-06-25 03:44:33,346 INFO ]: Start accepts. Automaton has 7 states and 41 transitions. Word has length 6 [2018-06-25 03:44:33,346 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:44:33,346 INFO ]: Abstraction has 7 states and 41 transitions. [2018-06-25 03:44:33,346 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:44:33,346 INFO ]: Start isEmpty. Operand 7 states and 41 transitions. [2018-06-25 03:44:33,346 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:44:33,346 INFO ]: Found error trace [2018-06-25 03:44:33,346 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:44:33,346 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:44:33,346 INFO ]: Analyzing trace with hash -1191628933, now seen corresponding path program 1 times [2018-06-25 03:44:33,346 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:44:33,346 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:44:33,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:33,347 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:33,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:33,354 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:33,395 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:33,395 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:44:33,395 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:44:33,395 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:44:33,395 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:44:33,395 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:44:33,396 INFO ]: Start difference. First operand 7 states and 41 transitions. Second operand 3 states. [2018-06-25 03:44:33,428 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:44:33,428 INFO ]: Finished difference Result 8 states and 41 transitions. [2018-06-25 03:44:33,428 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:44:33,428 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:44:33,428 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:44:33,429 INFO ]: With dead ends: 8 [2018-06-25 03:44:33,429 INFO ]: Without dead ends: 7 [2018-06-25 03:44:33,429 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-25 03:44:33,429 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:44:33,430 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:44:33,430 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:44:33,430 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-06-25 03:44:33,430 INFO ]: Start accepts. Automaton has 7 states and 25 transitions. Word has length 6 [2018-06-25 03:44:33,430 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:44:33,430 INFO ]: Abstraction has 7 states and 25 transitions. [2018-06-25 03:44:33,430 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:44:33,430 INFO ]: Start isEmpty. Operand 7 states and 25 transitions. [2018-06-25 03:44:33,430 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:44:33,430 INFO ]: Found error trace [2018-06-25 03:44:33,431 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:44:33,431 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:44:33,431 INFO ]: Analyzing trace with hash 375586204, now seen corresponding path program 1 times [2018-06-25 03:44:33,431 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:44:33,431 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:44:33,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:33,431 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:33,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:33,439 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:33,512 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:33,512 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:44:33,512 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:44:33,513 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:44:33,513 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:44:33,513 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:44:33,513 INFO ]: Start difference. First operand 7 states and 25 transitions. Second operand 3 states. [2018-06-25 03:44:33,607 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:44:33,607 INFO ]: Finished difference Result 8 states and 25 transitions. [2018-06-25 03:44:33,607 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:44:33,607 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:44:33,607 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:44:33,608 INFO ]: With dead ends: 8 [2018-06-25 03:44:33,608 INFO ]: Without dead ends: 7 [2018-06-25 03:44:33,608 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-25 03:44:33,608 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:44:33,609 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:44:33,609 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:44:33,609 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2018-06-25 03:44:33,609 INFO ]: Start accepts. Automaton has 7 states and 17 transitions. Word has length 6 [2018-06-25 03:44:33,609 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:44:33,609 INFO ]: Abstraction has 7 states and 17 transitions. [2018-06-25 03:44:33,609 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:44:33,609 INFO ]: Start isEmpty. Operand 7 states and 17 transitions. [2018-06-25 03:44:33,609 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:44:33,609 INFO ]: Found error trace [2018-06-25 03:44:33,609 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:44:33,609 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:44:33,609 INFO ]: Analyzing trace with hash -380777495, now seen corresponding path program 1 times [2018-06-25 03:44:33,609 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:44:33,609 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:44:33,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:33,610 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:33,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:33,617 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:33,656 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:33,656 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:44:33,656 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-25 03:44:33,662 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:33,724 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:33,732 INFO ]: Computing forward predicates... [2018-06-25 03:44:33,805 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:33,840 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:44:33,840 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 03:44:33,840 INFO ]: Interpolant automaton has 4 states [2018-06-25 03:44:33,840 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 03:44:33,840 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 03:44:33,841 INFO ]: Start difference. First operand 7 states and 17 transitions. Second operand 4 states. [2018-06-25 03:44:34,017 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:44:34,017 INFO ]: Finished difference Result 9 states and 18 transitions. [2018-06-25 03:44:34,017 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 03:44:34,017 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 03:44:34,017 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:44:34,017 INFO ]: With dead ends: 9 [2018-06-25 03:44:34,017 INFO ]: Without dead ends: 8 [2018-06-25 03:44:34,018 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 03:44:34,018 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:44:34,019 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:44:34,019 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:44:34,019 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-06-25 03:44:34,019 INFO ]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 6 [2018-06-25 03:44:34,019 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:44:34,019 INFO ]: Abstraction has 8 states and 14 transitions. [2018-06-25 03:44:34,019 INFO ]: Interpolant automaton has 4 states. [2018-06-25 03:44:34,019 INFO ]: Start isEmpty. Operand 8 states and 14 transitions. [2018-06-25 03:44:34,019 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:44:34,019 INFO ]: Found error trace [2018-06-25 03:44:34,019 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:44:34,019 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:44:34,019 INFO ]: Analyzing trace with hash 75352065, now seen corresponding path program 1 times [2018-06-25 03:44:34,019 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:44:34,019 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:44:34,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:34,021 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:34,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:34,043 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:34,610 WARN ]: Spent 471.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2018-06-25 03:44:34,871 WARN ]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 03:44:35,016 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:35,016 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:44:35,016 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) [2018-06-25 03:44:35,034 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 03:44:35,096 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:35,099 INFO ]: Computing forward predicates... [2018-06-25 03:44:35,653 WARN ]: Spent 138.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-06-25 03:44:35,941 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:35,971 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:44:35,972 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 03:44:35,972 INFO ]: Interpolant automaton has 7 states [2018-06-25 03:44:35,972 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 03:44:35,972 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-25 03:44:35,972 INFO ]: Start difference. First operand 8 states and 14 transitions. Second operand 7 states. [2018-06-25 03:44:36,467 WARN ]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-25 03:44:36,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:44:36,636 INFO ]: Finished difference Result 11 states and 16 transitions. [2018-06-25 03:44:36,637 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 03:44:36,637 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-25 03:44:36,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:44:36,637 INFO ]: With dead ends: 11 [2018-06-25 03:44:36,638 INFO ]: Without dead ends: 8 [2018-06-25 03:44:36,638 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-25 03:44:36,638 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:44:36,639 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:44:36,639 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:44:36,639 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-06-25 03:44:36,639 INFO ]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 7 [2018-06-25 03:44:36,639 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:44:36,639 INFO ]: Abstraction has 8 states and 12 transitions. [2018-06-25 03:44:36,639 INFO ]: Interpolant automaton has 7 states. [2018-06-25 03:44:36,639 INFO ]: Start isEmpty. Operand 8 states and 12 transitions. [2018-06-25 03:44:36,639 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:44:36,639 INFO ]: Found error trace [2018-06-25 03:44:36,639 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:44:36,640 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:44:36,640 INFO ]: Analyzing trace with hash 2136650937, now seen corresponding path program 1 times [2018-06-25 03:44:36,640 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:44:36,640 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:44:36,640 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:36,640 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:36,640 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:36,655 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:37,106 WARN ]: Spent 384.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2018-06-25 03:44:37,361 WARN ]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 03:44:37,382 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:37,382 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:44:37,382 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 03:44:37,398 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 03:44:37,452 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:37,455 INFO ]: Computing forward predicates... [2018-06-25 03:44:37,720 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:37,740 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:44:37,740 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 03:44:37,741 INFO ]: Interpolant automaton has 7 states [2018-06-25 03:44:37,741 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 03:44:37,741 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-25 03:44:37,741 INFO ]: Start difference. First operand 8 states and 12 transitions. Second operand 7 states. [2018-06-25 03:44:37,803 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:44:37,803 INFO ]: Finished difference Result 10 states and 13 transitions. [2018-06-25 03:44:37,803 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 03:44:37,803 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-25 03:44:37,803 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:44:37,803 INFO ]: With dead ends: 10 [2018-06-25 03:44:37,803 INFO ]: Without dead ends: 8 [2018-06-25 03:44:37,803 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-25 03:44:37,803 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:44:37,804 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:44:37,804 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:44:37,804 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-06-25 03:44:37,804 INFO ]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 7 [2018-06-25 03:44:37,804 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:44:37,804 INFO ]: Abstraction has 8 states and 11 transitions. [2018-06-25 03:44:37,804 INFO ]: Interpolant automaton has 7 states. [2018-06-25 03:44:37,805 INFO ]: Start isEmpty. Operand 8 states and 11 transitions. [2018-06-25 03:44:37,805 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:44:37,805 INFO ]: Found error trace [2018-06-25 03:44:37,805 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:44:37,805 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:44:37,805 INFO ]: Analyzing trace with hash -2044989047, now seen corresponding path program 1 times [2018-06-25 03:44:37,805 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:44:37,805 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:44:37,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:37,806 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:37,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:37,817 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:37,910 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:37,910 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:44:37,910 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-25 03:44:37,918 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:37,959 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:37,961 INFO ]: Computing forward predicates... [2018-06-25 03:44:38,155 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:38,176 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:44:38,176 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 03:44:38,176 INFO ]: Interpolant automaton has 6 states [2018-06-25 03:44:38,177 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 03:44:38,177 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 03:44:38,177 INFO ]: Start difference. First operand 8 states and 11 transitions. Second operand 6 states. [2018-06-25 03:44:38,191 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:44:38,191 INFO ]: Finished difference Result 4 states and 3 transitions. [2018-06-25 03:44:38,191 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 03:44:38,191 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 03:44:38,191 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:44:38,191 INFO ]: With dead ends: 4 [2018-06-25 03:44:38,191 INFO ]: Without dead ends: 0 [2018-06-25 03:44:38,192 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 03:44:38,192 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 03:44:38,192 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 03:44:38,192 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 03:44:38,192 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 03:44:38,192 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-25 03:44:38,192 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:44:38,192 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 03:44:38,192 INFO ]: Interpolant automaton has 6 states. [2018-06-25 03:44:38,192 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 03:44:38,192 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 03:44:38,194 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 03:44:38,197 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 03:44:38 BasicIcfg [2018-06-25 03:44:38,197 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 03:44:38,198 INFO ]: Toolchain (without parser) took 36456.41 ms. Allocated memory was 309.9 MB in the beginning and 1.1 GB in the end (delta: 826.8 MB). Free memory was 262.3 MB in the beginning and 623.5 MB in the end (delta: -361.2 MB). Peak memory consumption was 465.6 MB. Max. memory is 3.6 GB. [2018-06-25 03:44:38,199 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.9 MB. Free memory is still 275.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 03:44:38,199 INFO ]: ChcToBoogie took 69.16 ms. Allocated memory is still 309.9 MB. Free memory was 262.3 MB in the beginning and 259.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:44:38,199 INFO ]: Boogie Preprocessor took 40.81 ms. Allocated memory is still 309.9 MB. Free memory was 259.3 MB in the beginning and 258.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-25 03:44:38,205 INFO ]: RCFGBuilder took 304.07 ms. Allocated memory is still 309.9 MB. Free memory was 258.3 MB in the beginning and 244.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:44:38,206 INFO ]: BlockEncodingV2 took 15654.15 ms. Allocated memory was 309.9 MB in the beginning and 780.1 MB in the end (delta: 470.3 MB). Free memory was 244.4 MB in the beginning and 458.5 MB in the end (delta: -214.2 MB). Peak memory consumption was 436.2 MB. Max. memory is 3.6 GB. [2018-06-25 03:44:38,206 INFO ]: TraceAbstraction took 20379.80 ms. Allocated memory was 780.1 MB in the beginning and 1.1 GB in the end (delta: 356.5 MB). Free memory was 458.5 MB in the beginning and 623.5 MB in the end (delta: -165.0 MB). Peak memory consumption was 191.5 MB. Max. memory is 3.6 GB. [2018-06-25 03:44:38,215 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, 2056 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.9 MB. Free memory is still 275.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 69.16 ms. Allocated memory is still 309.9 MB. Free memory was 262.3 MB in the beginning and 259.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 40.81 ms. Allocated memory is still 309.9 MB. Free memory was 259.3 MB in the beginning and 258.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 304.07 ms. Allocated memory is still 309.9 MB. Free memory was 258.3 MB in the beginning and 244.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 15654.15 ms. Allocated memory was 309.9 MB in the beginning and 780.1 MB in the end (delta: 470.3 MB). Free memory was 244.4 MB in the beginning and 458.5 MB in the end (delta: -214.2 MB). Peak memory consumption was 436.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 20379.80 ms. Allocated memory was 780.1 MB in the beginning and 1.1 GB in the end (delta: 356.5 MB). Free memory was 458.5 MB in the beginning and 623.5 MB in the end (delta: -165.0 MB). Peak memory consumption was 191.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 20.0s OverallTime, 18 OverallIterations, 2 TraceHistogramMax, 13.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9364 SDtfs, 0 SDslu, 82 SDs, 0 SdLazy, 5292 SolverSat, 4106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=15, 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, 18 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 1535 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1007 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 22 InterpolantComputations, 14 PerfectInterpolantSequences, 13/33 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e7_590_e7_590.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_03-44-38-232.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e7_590_e7_590.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_03-44-38-232.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e7_590_e7_590.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_03-44-38-232.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e7_590_e7_590.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_03-44-38-232.csv Received shutdown request...