java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/lustre/PRODUCER_CONSUMMER_luke_2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 06:44:48,689 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 06:44:48,691 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 06:44:48,708 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 06:44:48,709 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 06:44:48,710 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 06:44:48,711 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 06:44:48,716 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 06:44:48,719 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 06:44:48,720 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 06:44:48,721 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 06:44:48,722 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 06:44:48,723 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 06:44:48,725 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 06:44:48,727 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 06:44:48,736 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 06:44:48,738 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 06:44:48,741 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 06:44:48,742 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 06:44:48,744 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 06:44:48,745 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 06:44:48,750 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 06:44:48,750 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 06:44:48,751 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 06:44:48,752 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 06:44:48,753 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 06:44:48,754 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 06:44:48,755 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 06:44:48,759 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 06:44:48,759 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 06:44:48,760 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 06:44:48,767 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 06:44:48,767 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 06:44:48,768 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 06:44:48,769 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 06:44:48,769 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 06:44:48,795 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 06:44:48,796 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 06:44:48,796 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 06:44:48,796 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 06:44:48,798 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 06:44:48,798 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 06:44:48,799 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 06:44:48,799 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 06:44:48,799 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 06:44:48,799 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 06:44:48,800 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 06:44:48,800 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 06:44:48,800 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 06:44:48,800 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 06:44:48,800 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 06:44:48,801 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 06:44:48,801 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 06:44:48,801 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 06:44:48,801 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 06:44:48,801 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 06:44:48,801 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 06:44:48,805 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 06:44:48,805 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 06:44:48,862 INFO ]: Repository-Root is: /tmp [2018-06-25 06:44:48,884 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 06:44:48,892 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 06:44:48,894 INFO ]: Initializing SmtParser... [2018-06-25 06:44:48,894 INFO ]: SmtParser initialized [2018-06-25 06:44:48,895 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/PRODUCER_CONSUMMER_luke_2.smt2 [2018-06-25 06:44:48,896 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 06:44:48,996 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/PRODUCER_CONSUMMER_luke_2.smt2 unknown [2018-06-25 06:44:49,427 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/PRODUCER_CONSUMMER_luke_2.smt2 [2018-06-25 06:44:49,432 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 06:44:49,437 INFO ]: Walking toolchain with 5 elements. [2018-06-25 06:44:49,438 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 06:44:49,438 INFO ]: Initializing ChcToBoogie... [2018-06-25 06:44:49,438 INFO ]: ChcToBoogie initialized [2018-06-25 06:44:49,442 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:44:49" (1/1) ... [2018-06-25 06:44:49,511 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:44:49 Unit [2018-06-25 06:44:49,511 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 06:44:49,512 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 06:44:49,512 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 06:44:49,512 INFO ]: Boogie Preprocessor initialized [2018-06-25 06:44:49,535 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:44:49" (1/1) ... [2018-06-25 06:44:49,535 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:44:49" (1/1) ... [2018-06-25 06:44:49,555 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:44:49" (1/1) ... [2018-06-25 06:44:49,555 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:44:49" (1/1) ... [2018-06-25 06:44:49,560 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:44:49" (1/1) ... [2018-06-25 06:44:49,562 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:44:49" (1/1) ... [2018-06-25 06:44:49,572 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:44:49" (1/1) ... [2018-06-25 06:44:49,575 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 06:44:49,576 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 06:44:49,576 INFO ]: Initializing RCFGBuilder... [2018-06-25 06:44:49,576 INFO ]: RCFGBuilder initialized [2018-06-25 06:44:49,577 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:44:49" (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-25 06:44:49,588 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 06:44:49,588 INFO ]: Found specification of procedure gotoProc [2018-06-25 06:44:49,588 INFO ]: Found implementation of procedure gotoProc [2018-06-25 06:44:49,589 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 06:44:49,589 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 06:44:49,589 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-25 06:44:49,905 INFO ]: Using library mode [2018-06-25 06:44:49,906 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:44:49 BoogieIcfgContainer [2018-06-25 06:44:49,906 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 06:44:49,906 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 06:44:49,906 INFO ]: Initializing BlockEncodingV2... [2018-06-25 06:44:49,908 INFO ]: BlockEncodingV2 initialized [2018-06-25 06:44:49,908 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:44:49" (1/1) ... [2018-06-25 06:44:49,932 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 06:44:49,934 INFO ]: Using Remove infeasible edges [2018-06-25 06:44:49,934 INFO ]: Using Maximize final states [2018-06-25 06:44:49,935 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 06:44:49,935 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 06:44:49,937 INFO ]: Using Remove sink states [2018-06-25 06:44:49,938 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 06:44:49,938 INFO ]: Using Use SBE [2018-06-25 06:44:49,943 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 06:44:51,199 WARN ]: aborting because of expected exponential blowup for input size 49 [2018-06-25 06:44:51,200 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 06:44:51,366 WARN ]: Simplifying disjunction of 6912 conjuctions. This might take some time... [2018-06-25 06:44:54,572 INFO ]: Simplified to disjunction of 3888 conjuctions. [2018-06-25 06:44:54,776 WARN ]: aborting because of expected exponential blowup for input size 49 [2018-06-25 06:44:54,790 INFO ]: SBE split 2 edges [2018-06-25 06:44:54,833 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 06:44:54,837 INFO ]: 0 new accepting states [2018-06-25 06:45:07,011 INFO ]: Removed 1218 edges and 2 locations by large block encoding [2018-06-25 06:45:07,014 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:45:07,067 INFO ]: Removed 28 edges and 0 locations because of local infeasibility [2018-06-25 06:45:07,068 INFO ]: 0 new accepting states [2018-06-25 06:45:07,069 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:45:07,069 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:45:07,101 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 06:45:07,102 INFO ]: 0 new accepting states [2018-06-25 06:45:07,104 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:45:07,104 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:45:07,154 INFO ]: Encoded RCFG 6 locations, 1192 edges [2018-06-25 06:45:07,155 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:45:07 BasicIcfg [2018-06-25 06:45:07,155 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 06:45:07,156 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 06:45:07,156 INFO ]: Initializing TraceAbstraction... [2018-06-25 06:45:07,160 INFO ]: TraceAbstraction initialized [2018-06-25 06:45:07,160 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:44:49" (1/4) ... [2018-06-25 06:45:07,161 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2d4a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 06:45:07, skipping insertion in model container [2018-06-25 06:45:07,161 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:44:49" (2/4) ... [2018-06-25 06:45:07,162 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2d4a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 06:45:07, skipping insertion in model container [2018-06-25 06:45:07,165 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:44:49" (3/4) ... [2018-06-25 06:45:07,166 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2d4a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:45:07, skipping insertion in model container [2018-06-25 06:45:07,166 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:45:07" (4/4) ... [2018-06-25 06:45:07,167 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 06:45:07,178 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 06:45:07,188 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 06:45:07,247 INFO ]: Using default assertion order modulation [2018-06-25 06:45:07,248 INFO ]: Interprodecural is true [2018-06-25 06:45:07,248 INFO ]: Hoare is false [2018-06-25 06:45:07,248 INFO ]: Compute interpolants for FPandBP [2018-06-25 06:45:07,248 INFO ]: Backedges is TWOTRACK [2018-06-25 06:45:07,248 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 06:45:07,248 INFO ]: Difference is false [2018-06-25 06:45:07,248 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 06:45:07,248 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 06:45:07,271 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 06:45:07,298 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:45:07,299 INFO ]: Found error trace [2018-06-25 06:45:07,300 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:45:07,301 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:07,306 INFO ]: Analyzing trace with hash 98321154, now seen corresponding path program 1 times [2018-06-25 06:45:07,308 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:07,309 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:07,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:07,361 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:07,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:07,426 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:07,576 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:07,579 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:45:07,579 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:45:07,581 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:45:07,598 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:45:07,598 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:45:07,606 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 06:45:14,992 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:14,992 INFO ]: Finished difference Result 8 states and 1274 transitions. [2018-06-25 06:45:14,992 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:45:14,993 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:45:14,993 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:15,012 INFO ]: With dead ends: 8 [2018-06-25 06:45:15,012 INFO ]: Without dead ends: 8 [2018-06-25 06:45:15,017 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 06:45:15,034 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:45:15,108 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-25 06:45:15,109 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:45:15,114 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1273 transitions. [2018-06-25 06:45:15,116 INFO ]: Start accepts. Automaton has 7 states and 1273 transitions. Word has length 5 [2018-06-25 06:45:15,117 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:15,117 INFO ]: Abstraction has 7 states and 1273 transitions. [2018-06-25 06:45:15,117 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:45:15,117 INFO ]: Start isEmpty. Operand 7 states and 1273 transitions. [2018-06-25 06:45:15,118 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:45:15,118 INFO ]: Found error trace [2018-06-25 06:45:15,118 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:45:15,119 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:15,119 INFO ]: Analyzing trace with hash 98443201, now seen corresponding path program 1 times [2018-06-25 06:45:15,119 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:15,119 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:15,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:15,120 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:15,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:15,152 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:15,336 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:15,336 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:45:15,336 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:45:15,338 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:45:15,338 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:45:15,338 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:45:15,338 INFO ]: Start difference. First operand 7 states and 1273 transitions. Second operand 3 states. [2018-06-25 06:45:17,716 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:17,716 INFO ]: Finished difference Result 8 states and 1194 transitions. [2018-06-25 06:45:17,716 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:45:17,716 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:45:17,716 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:17,718 INFO ]: With dead ends: 8 [2018-06-25 06:45:17,718 INFO ]: Without dead ends: 8 [2018-06-25 06:45:17,718 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 06:45:17,719 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:45:17,726 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-25 06:45:17,727 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:45:17,729 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1193 transitions. [2018-06-25 06:45:17,729 INFO ]: Start accepts. Automaton has 7 states and 1193 transitions. Word has length 5 [2018-06-25 06:45:17,729 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:17,729 INFO ]: Abstraction has 7 states and 1193 transitions. [2018-06-25 06:45:17,729 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:45:17,729 INFO ]: Start isEmpty. Operand 7 states and 1193 transitions. [2018-06-25 06:45:17,731 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:45:17,731 INFO ]: Found error trace [2018-06-25 06:45:17,731 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:45:17,731 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:17,732 INFO ]: Analyzing trace with hash -1313443371, now seen corresponding path program 1 times [2018-06-25 06:45:17,732 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:17,732 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:17,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:17,733 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:17,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:17,785 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:17,871 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:17,871 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:45:17,871 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:45:17,871 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:45:17,872 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:45:17,872 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:45:17,872 INFO ]: Start difference. First operand 7 states and 1193 transitions. Second operand 3 states. [2018-06-25 06:45:20,066 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:20,066 INFO ]: Finished difference Result 8 states and 1193 transitions. [2018-06-25 06:45:20,067 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:45:20,067 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:45:20,067 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:20,069 INFO ]: With dead ends: 8 [2018-06-25 06:45:20,069 INFO ]: Without dead ends: 7 [2018-06-25 06:45:20,069 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 06:45:20,069 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:45:20,076 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:45:20,076 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:45:20,078 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 937 transitions. [2018-06-25 06:45:20,079 INFO ]: Start accepts. Automaton has 7 states and 937 transitions. Word has length 6 [2018-06-25 06:45:20,079 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:20,079 INFO ]: Abstraction has 7 states and 937 transitions. [2018-06-25 06:45:20,079 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:45:20,079 INFO ]: Start isEmpty. Operand 7 states and 937 transitions. [2018-06-25 06:45:20,079 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:45:20,079 INFO ]: Found error trace [2018-06-25 06:45:20,079 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:45:20,080 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:20,080 INFO ]: Analyzing trace with hash -1311596329, now seen corresponding path program 1 times [2018-06-25 06:45:20,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:20,080 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:20,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:20,081 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:20,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:20,122 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:20,208 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:20,208 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:45:20,208 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 06:45:20,215 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:20,275 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:20,284 INFO ]: Computing forward predicates... [2018-06-25 06:45:20,337 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:20,371 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 06:45:20,372 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-25 06:45:20,372 INFO ]: Interpolant automaton has 5 states [2018-06-25 06:45:20,372 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 06:45:20,372 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 06:45:20,372 INFO ]: Start difference. First operand 7 states and 937 transitions. Second operand 5 states. [2018-06-25 06:45:23,762 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:23,763 INFO ]: Finished difference Result 11 states and 939 transitions. [2018-06-25 06:45:23,765 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 06:45:23,765 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 06:45:23,765 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:23,766 INFO ]: With dead ends: 11 [2018-06-25 06:45:23,766 INFO ]: Without dead ends: 9 [2018-06-25 06:45:23,766 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 06:45:23,766 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:45:23,771 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-25 06:45:23,771 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:45:23,773 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 426 transitions. [2018-06-25 06:45:23,773 INFO ]: Start accepts. Automaton has 8 states and 426 transitions. Word has length 6 [2018-06-25 06:45:23,773 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:23,773 INFO ]: Abstraction has 8 states and 426 transitions. [2018-06-25 06:45:23,773 INFO ]: Interpolant automaton has 5 states. [2018-06-25 06:45:23,773 INFO ]: Start isEmpty. Operand 8 states and 426 transitions. [2018-06-25 06:45:23,773 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:45:23,773 INFO ]: Found error trace [2018-06-25 06:45:23,773 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:45:23,773 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:23,775 INFO ]: Analyzing trace with hash -1310672808, now seen corresponding path program 1 times [2018-06-25 06:45:23,775 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:23,775 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:23,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:23,776 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:23,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:23,824 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:23,928 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:23,929 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:45:23,929 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:45:23,929 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:45:23,929 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:45:23,929 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:45:23,929 INFO ]: Start difference. First operand 8 states and 426 transitions. Second operand 3 states. [2018-06-25 06:45:24,462 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:24,462 INFO ]: Finished difference Result 10 states and 426 transitions. [2018-06-25 06:45:24,466 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:45:24,466 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:45:24,466 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:24,467 INFO ]: With dead ends: 10 [2018-06-25 06:45:24,467 INFO ]: Without dead ends: 8 [2018-06-25 06:45:24,467 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 06:45:24,467 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:45:24,471 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:45:24,471 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:45:24,472 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 394 transitions. [2018-06-25 06:45:24,472 INFO ]: Start accepts. Automaton has 8 states and 394 transitions. Word has length 6 [2018-06-25 06:45:24,472 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:24,472 INFO ]: Abstraction has 8 states and 394 transitions. [2018-06-25 06:45:24,472 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:45:24,472 INFO ]: Start isEmpty. Operand 8 states and 394 transitions. [2018-06-25 06:45:24,472 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:45:24,472 INFO ]: Found error trace [2018-06-25 06:45:24,472 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:45:24,472 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:24,473 INFO ]: Analyzing trace with hash -1309749287, now seen corresponding path program 1 times [2018-06-25 06:45:24,473 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:24,473 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:24,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:24,473 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:24,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:24,519 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:24,591 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:24,591 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:45:24,591 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:45:24,591 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:45:24,591 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:45:24,591 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:45:24,591 INFO ]: Start difference. First operand 8 states and 394 transitions. Second operand 3 states. [2018-06-25 06:45:25,264 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:25,264 INFO ]: Finished difference Result 10 states and 394 transitions. [2018-06-25 06:45:25,264 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:45:25,265 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:45:25,265 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:25,265 INFO ]: With dead ends: 10 [2018-06-25 06:45:25,265 INFO ]: Without dead ends: 8 [2018-06-25 06:45:25,265 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 06:45:25,265 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:45:25,267 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:45:25,267 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:45:25,268 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 362 transitions. [2018-06-25 06:45:25,268 INFO ]: Start accepts. Automaton has 8 states and 362 transitions. Word has length 6 [2018-06-25 06:45:25,268 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:25,268 INFO ]: Abstraction has 8 states and 362 transitions. [2018-06-25 06:45:25,268 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:45:25,268 INFO ]: Start isEmpty. Operand 8 states and 362 transitions. [2018-06-25 06:45:25,269 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:45:25,269 INFO ]: Found error trace [2018-06-25 06:45:25,269 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:45:25,269 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:25,269 INFO ]: Analyzing trace with hash -2014395810, now seen corresponding path program 1 times [2018-06-25 06:45:25,269 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:25,269 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:25,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:25,270 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:25,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:25,288 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:25,336 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:25,336 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:45:25,336 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:45:25,336 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:45:25,336 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:45:25,336 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:45:25,336 INFO ]: Start difference. First operand 8 states and 362 transitions. Second operand 3 states. [2018-06-25 06:45:25,771 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:25,771 INFO ]: Finished difference Result 10 states and 362 transitions. [2018-06-25 06:45:25,772 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:45:25,772 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:45:25,772 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:25,773 INFO ]: With dead ends: 10 [2018-06-25 06:45:25,773 INFO ]: Without dead ends: 8 [2018-06-25 06:45:25,773 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 06:45:25,773 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:45:25,775 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:45:25,776 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:45:25,776 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 346 transitions. [2018-06-25 06:45:25,776 INFO ]: Start accepts. Automaton has 8 states and 346 transitions. Word has length 6 [2018-06-25 06:45:25,776 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:25,776 INFO ]: Abstraction has 8 states and 346 transitions. [2018-06-25 06:45:25,776 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:45:25,777 INFO ]: Start isEmpty. Operand 8 states and 346 transitions. [2018-06-25 06:45:25,777 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:45:25,777 INFO ]: Found error trace [2018-06-25 06:45:25,777 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:45:25,777 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:25,777 INFO ]: Analyzing trace with hash -1539706016, now seen corresponding path program 1 times [2018-06-25 06:45:25,777 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:25,777 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:25,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:25,778 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:25,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:25,805 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:25,921 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:25,921 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:45:25,921 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:45:25,921 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:45:25,921 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:45:25,921 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:45:25,921 INFO ]: Start difference. First operand 8 states and 346 transitions. Second operand 3 states. [2018-06-25 06:45:26,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:26,690 INFO ]: Finished difference Result 10 states and 346 transitions. [2018-06-25 06:45:26,690 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:45:26,690 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:45:26,690 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:26,690 INFO ]: With dead ends: 10 [2018-06-25 06:45:26,690 INFO ]: Without dead ends: 8 [2018-06-25 06:45:26,691 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 06:45:26,691 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:45:26,693 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:45:26,693 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:45:26,693 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 306 transitions. [2018-06-25 06:45:26,693 INFO ]: Start accepts. Automaton has 8 states and 306 transitions. Word has length 6 [2018-06-25 06:45:26,693 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:26,694 INFO ]: Abstraction has 8 states and 306 transitions. [2018-06-25 06:45:26,694 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:45:26,694 INFO ]: Start isEmpty. Operand 8 states and 306 transitions. [2018-06-25 06:45:26,695 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:45:26,695 INFO ]: Found error trace [2018-06-25 06:45:26,695 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:45:26,695 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:26,695 INFO ]: Analyzing trace with hash -1775203871, now seen corresponding path program 1 times [2018-06-25 06:45:26,695 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:26,695 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:26,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:26,696 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:26,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:26,718 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:26,874 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:26,874 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:45:26,874 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:45:26,874 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:45:26,874 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:45:26,874 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:45:26,874 INFO ]: Start difference. First operand 8 states and 306 transitions. Second operand 3 states. [2018-06-25 06:45:27,268 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:27,268 INFO ]: Finished difference Result 10 states and 306 transitions. [2018-06-25 06:45:27,269 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:45:27,269 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:45:27,269 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:27,269 INFO ]: With dead ends: 10 [2018-06-25 06:45:27,269 INFO ]: Without dead ends: 8 [2018-06-25 06:45:27,269 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:45:27,269 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:45:27,271 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:45:27,271 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:45:27,271 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 290 transitions. [2018-06-25 06:45:27,271 INFO ]: Start accepts. Automaton has 8 states and 290 transitions. Word has length 6 [2018-06-25 06:45:27,271 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:27,271 INFO ]: Abstraction has 8 states and 290 transitions. [2018-06-25 06:45:27,271 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:45:27,271 INFO ]: Start isEmpty. Operand 8 states and 290 transitions. [2018-06-25 06:45:27,271 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:45:27,271 INFO ]: Found error trace [2018-06-25 06:45:27,271 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:45:27,271 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:27,271 INFO ]: Analyzing trace with hash -1296819993, now seen corresponding path program 1 times [2018-06-25 06:45:27,271 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:27,271 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:27,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:27,272 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:27,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:27,290 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:27,409 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:27,409 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:45:27,409 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:45:27,409 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:45:27,409 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:45:27,409 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:45:27,410 INFO ]: Start difference. First operand 8 states and 290 transitions. Second operand 3 states. [2018-06-25 06:45:27,825 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:27,825 INFO ]: Finished difference Result 10 states and 290 transitions. [2018-06-25 06:45:27,825 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:45:27,825 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:45:27,825 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:27,826 INFO ]: With dead ends: 10 [2018-06-25 06:45:27,826 INFO ]: Without dead ends: 8 [2018-06-25 06:45:27,826 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 06:45:27,826 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:45:27,828 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:45:27,828 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:45:27,828 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2018-06-25 06:45:27,828 INFO ]: Start accepts. Automaton has 8 states and 210 transitions. Word has length 6 [2018-06-25 06:45:27,828 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:27,828 INFO ]: Abstraction has 8 states and 210 transitions. [2018-06-25 06:45:27,828 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:45:27,828 INFO ]: Start isEmpty. Operand 8 states and 210 transitions. [2018-06-25 06:45:27,835 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:45:27,835 INFO ]: Found error trace [2018-06-25 06:45:27,835 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:45:27,835 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:27,835 INFO ]: Analyzing trace with hash -1490759403, now seen corresponding path program 1 times [2018-06-25 06:45:27,835 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:27,835 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:27,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:27,836 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:27,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:27,857 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:27,953 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:27,953 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:45:27,953 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-25 06:45:27,960 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:28,031 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:28,034 INFO ]: Computing forward predicates... [2018-06-25 06:45:28,189 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:28,223 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 06:45:28,223 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-25 06:45:28,223 INFO ]: Interpolant automaton has 5 states [2018-06-25 06:45:28,223 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 06:45:28,223 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 06:45:28,223 INFO ]: Start difference. First operand 8 states and 210 transitions. Second operand 5 states. [2018-06-25 06:45:28,972 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:28,972 INFO ]: Finished difference Result 11 states and 212 transitions. [2018-06-25 06:45:28,972 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:45:28,972 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 06:45:28,972 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:28,974 INFO ]: With dead ends: 11 [2018-06-25 06:45:28,974 INFO ]: Without dead ends: 10 [2018-06-25 06:45:28,974 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 06:45:28,974 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 06:45:28,976 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-25 06:45:28,976 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:45:28,976 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2018-06-25 06:45:28,977 INFO ]: Start accepts. Automaton has 8 states and 200 transitions. Word has length 6 [2018-06-25 06:45:28,977 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:28,977 INFO ]: Abstraction has 8 states and 200 transitions. [2018-06-25 06:45:28,977 INFO ]: Interpolant automaton has 5 states. [2018-06-25 06:45:28,977 INFO ]: Start isEmpty. Operand 8 states and 200 transitions. [2018-06-25 06:45:28,977 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:45:28,977 INFO ]: Found error trace [2018-06-25 06:45:28,977 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:45:28,977 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:28,977 INFO ]: Analyzing trace with hash -1717945569, now seen corresponding path program 1 times [2018-06-25 06:45:28,977 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:28,977 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:28,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:28,978 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:28,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:28,995 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:29,129 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:29,129 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:45:29,129 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-25 06:45:29,136 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:29,187 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:29,189 INFO ]: Computing forward predicates... [2018-06-25 06:45:29,352 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:29,387 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:45:29,387 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 06:45:29,387 INFO ]: Interpolant automaton has 6 states [2018-06-25 06:45:29,387 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 06:45:29,387 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 06:45:29,387 INFO ]: Start difference. First operand 8 states and 200 transitions. Second operand 6 states. [2018-06-25 06:45:29,603 WARN ]: Spent 110.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-06-25 06:45:30,189 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:30,189 INFO ]: Finished difference Result 13 states and 205 transitions. [2018-06-25 06:45:30,189 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:45:30,189 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 06:45:30,189 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:30,189 INFO ]: With dead ends: 13 [2018-06-25 06:45:30,189 INFO ]: Without dead ends: 13 [2018-06-25 06:45:30,189 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:45:30,189 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 06:45:30,191 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 8. [2018-06-25 06:45:30,191 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:45:30,191 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2018-06-25 06:45:30,192 INFO ]: Start accepts. Automaton has 8 states and 200 transitions. Word has length 6 [2018-06-25 06:45:30,192 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:30,192 INFO ]: Abstraction has 8 states and 200 transitions. [2018-06-25 06:45:30,192 INFO ]: Interpolant automaton has 6 states. [2018-06-25 06:45:30,192 INFO ]: Start isEmpty. Operand 8 states and 200 transitions. [2018-06-25 06:45:30,192 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:45:30,192 INFO ]: Found error trace [2018-06-25 06:45:30,192 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:45:30,192 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:30,192 INFO ]: Analyzing trace with hash -1758580493, now seen corresponding path program 1 times [2018-06-25 06:45:30,192 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:30,192 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:30,193 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:30,193 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:30,193 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:30,207 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:30,290 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:30,290 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:45:30,290 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 06:45:30,297 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:30,349 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:30,352 INFO ]: Computing forward predicates... [2018-06-25 06:45:30,617 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:30,650 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:45:30,650 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 06:45:30,650 INFO ]: Interpolant automaton has 6 states [2018-06-25 06:45:30,650 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 06:45:30,651 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 06:45:30,651 INFO ]: Start difference. First operand 8 states and 200 transitions. Second operand 6 states. [2018-06-25 06:45:31,662 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:31,662 INFO ]: Finished difference Result 13 states and 205 transitions. [2018-06-25 06:45:31,662 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 06:45:31,663 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 06:45:31,663 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:31,663 INFO ]: With dead ends: 13 [2018-06-25 06:45:31,663 INFO ]: Without dead ends: 13 [2018-06-25 06:45:31,663 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-25 06:45:31,663 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 06:45:31,665 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-06-25 06:45:31,665 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 06:45:31,665 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2018-06-25 06:45:31,665 INFO ]: Start accepts. Automaton has 9 states and 201 transitions. Word has length 6 [2018-06-25 06:45:31,665 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:31,665 INFO ]: Abstraction has 9 states and 201 transitions. [2018-06-25 06:45:31,665 INFO ]: Interpolant automaton has 6 states. [2018-06-25 06:45:31,665 INFO ]: Start isEmpty. Operand 9 states and 201 transitions. [2018-06-25 06:45:31,666 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:45:31,666 INFO ]: Found error trace [2018-06-25 06:45:31,666 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:45:31,666 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:31,666 INFO ]: Analyzing trace with hash -1268190842, now seen corresponding path program 1 times [2018-06-25 06:45:31,666 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:31,666 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:31,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:31,667 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:31,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:31,680 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:31,801 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:31,801 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:45:31,801 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-25 06:45:31,807 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:31,850 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:31,853 INFO ]: Computing forward predicates... [2018-06-25 06:45:31,939 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:31,963 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:45:31,963 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 06:45:31,963 INFO ]: Interpolant automaton has 6 states [2018-06-25 06:45:31,964 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 06:45:31,964 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 06:45:31,964 INFO ]: Start difference. First operand 9 states and 201 transitions. Second operand 6 states. [2018-06-25 06:45:32,755 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:32,755 INFO ]: Finished difference Result 14 states and 206 transitions. [2018-06-25 06:45:32,755 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 06:45:32,755 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 06:45:32,755 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:32,756 INFO ]: With dead ends: 14 [2018-06-25 06:45:32,756 INFO ]: Without dead ends: 14 [2018-06-25 06:45:32,756 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-25 06:45:32,756 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 06:45:32,758 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 9. [2018-06-25 06:45:32,758 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 06:45:32,758 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2018-06-25 06:45:32,758 INFO ]: Start accepts. Automaton has 9 states and 201 transitions. Word has length 6 [2018-06-25 06:45:32,758 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:32,758 INFO ]: Abstraction has 9 states and 201 transitions. [2018-06-25 06:45:32,758 INFO ]: Interpolant automaton has 6 states. [2018-06-25 06:45:32,758 INFO ]: Start isEmpty. Operand 9 states and 201 transitions. [2018-06-25 06:45:32,759 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:45:32,759 INFO ]: Found error trace [2018-06-25 06:45:32,759 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:45:32,759 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:32,759 INFO ]: Analyzing trace with hash -1142591986, now seen corresponding path program 1 times [2018-06-25 06:45:32,759 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:32,759 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:32,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:32,760 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:32,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:32,774 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:32,847 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:32,847 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:45:32,847 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:45:32,847 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:45:32,847 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:45:32,847 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:45:32,847 INFO ]: Start difference. First operand 9 states and 201 transitions. Second operand 3 states. [2018-06-25 06:45:33,054 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:33,055 INFO ]: Finished difference Result 11 states and 201 transitions. [2018-06-25 06:45:33,055 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:45:33,055 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:45:33,055 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:33,055 INFO ]: With dead ends: 11 [2018-06-25 06:45:33,055 INFO ]: Without dead ends: 9 [2018-06-25 06:45:33,055 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 06:45:33,055 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:45:33,057 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 06:45:33,057 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 06:45:33,057 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2018-06-25 06:45:33,057 INFO ]: Start accepts. Automaton has 9 states and 195 transitions. Word has length 6 [2018-06-25 06:45:33,057 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:33,057 INFO ]: Abstraction has 9 states and 195 transitions. [2018-06-25 06:45:33,057 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:45:33,057 INFO ]: Start isEmpty. Operand 9 states and 195 transitions. [2018-06-25 06:45:33,058 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:45:33,058 INFO ]: Found error trace [2018-06-25 06:45:33,058 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:45:33,058 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:33,058 INFO ]: Analyzing trace with hash -1609893612, now seen corresponding path program 1 times [2018-06-25 06:45:33,058 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:33,058 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:33,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:33,059 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:33,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:33,072 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:33,269 WARN ]: Spent 134.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-06-25 06:45:33,284 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:33,284 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:45:33,284 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-25 06:45:33,290 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:33,334 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:33,337 INFO ]: Computing forward predicates... [2018-06-25 06:45:33,356 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 06:45:33,427 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:33,447 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:45:33,447 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 06:45:33,447 INFO ]: Interpolant automaton has 6 states [2018-06-25 06:45:33,448 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 06:45:33,448 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 06:45:33,448 INFO ]: Start difference. First operand 9 states and 195 transitions. Second operand 6 states. [2018-06-25 06:45:34,227 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:34,227 INFO ]: Finished difference Result 15 states and 201 transitions. [2018-06-25 06:45:34,273 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 06:45:34,273 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 06:45:34,273 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:34,274 INFO ]: With dead ends: 15 [2018-06-25 06:45:34,274 INFO ]: Without dead ends: 15 [2018-06-25 06:45:34,274 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-25 06:45:34,274 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 06:45:34,276 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 9. [2018-06-25 06:45:34,277 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 06:45:34,288 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2018-06-25 06:45:34,288 INFO ]: Start accepts. Automaton has 9 states and 195 transitions. Word has length 6 [2018-06-25 06:45:34,288 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:34,288 INFO ]: Abstraction has 9 states and 195 transitions. [2018-06-25 06:45:34,288 INFO ]: Interpolant automaton has 6 states. [2018-06-25 06:45:34,288 INFO ]: Start isEmpty. Operand 9 states and 195 transitions. [2018-06-25 06:45:34,289 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:45:34,289 INFO ]: Found error trace [2018-06-25 06:45:34,289 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:45:34,289 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:34,289 INFO ]: Analyzing trace with hash 1939841986, now seen corresponding path program 1 times [2018-06-25 06:45:34,289 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:34,289 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:34,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:34,290 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:34,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:34,327 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:35,148 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:35,148 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:45:35,148 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-25 06:45:35,155 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:35,239 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:35,244 INFO ]: Computing forward predicates... [2018-06-25 06:45:35,955 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:35,975 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:45:35,975 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 06:45:35,976 INFO ]: Interpolant automaton has 8 states [2018-06-25 06:45:35,976 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 06:45:35,976 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:45:35,976 INFO ]: Start difference. First operand 9 states and 195 transitions. Second operand 8 states. [2018-06-25 06:45:36,932 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:36,932 INFO ]: Finished difference Result 13 states and 199 transitions. [2018-06-25 06:45:36,932 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 06:45:36,932 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 06:45:36,932 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:36,932 INFO ]: With dead ends: 13 [2018-06-25 06:45:36,932 INFO ]: Without dead ends: 13 [2018-06-25 06:45:36,933 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-06-25 06:45:36,933 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 06:45:36,935 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-06-25 06:45:36,935 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 06:45:36,935 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2018-06-25 06:45:36,935 INFO ]: Start accepts. Automaton has 9 states and 195 transitions. Word has length 7 [2018-06-25 06:45:36,935 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:36,935 INFO ]: Abstraction has 9 states and 195 transitions. [2018-06-25 06:45:36,935 INFO ]: Interpolant automaton has 8 states. [2018-06-25 06:45:36,935 INFO ]: Start isEmpty. Operand 9 states and 195 transitions. [2018-06-25 06:45:36,936 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:45:36,936 INFO ]: Found error trace [2018-06-25 06:45:36,936 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:45:36,936 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:36,936 INFO ]: Analyzing trace with hash -238946720, now seen corresponding path program 1 times [2018-06-25 06:45:36,936 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:36,936 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:36,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:36,937 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:36,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:36,955 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:37,067 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 06:45:37,067 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:45:37,067 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:45:37,067 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:45:37,067 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:45:37,067 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:45:37,067 INFO ]: Start difference. First operand 9 states and 195 transitions. Second operand 3 states. [2018-06-25 06:45:37,376 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:37,376 INFO ]: Finished difference Result 11 states and 195 transitions. [2018-06-25 06:45:37,377 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:45:37,377 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 06:45:37,377 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:37,377 INFO ]: With dead ends: 11 [2018-06-25 06:45:37,377 INFO ]: Without dead ends: 9 [2018-06-25 06:45:37,377 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 06:45:37,378 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:45:37,379 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 06:45:37,379 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 06:45:37,379 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2018-06-25 06:45:37,379 INFO ]: Start accepts. Automaton has 9 states and 187 transitions. Word has length 7 [2018-06-25 06:45:37,379 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:37,379 INFO ]: Abstraction has 9 states and 187 transitions. [2018-06-25 06:45:37,379 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:45:37,379 INFO ]: Start isEmpty. Operand 9 states and 187 transitions. [2018-06-25 06:45:37,379 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:45:37,379 INFO ]: Found error trace [2018-06-25 06:45:37,379 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:45:37,380 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:37,382 INFO ]: Analyzing trace with hash -1326259812, now seen corresponding path program 1 times [2018-06-25 06:45:37,382 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:37,383 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:37,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:37,383 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:37,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:37,408 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:38,291 WARN ]: Spent 803.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-06-25 06:45:38,798 WARN ]: Spent 457.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-06-25 06:45:38,810 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:38,810 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:45:38,810 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-25 06:45:38,817 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:38,881 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:38,885 INFO ]: Computing forward predicates... [2018-06-25 06:45:38,959 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 06:45:39,266 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:39,288 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:45:39,291 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 06:45:39,291 INFO ]: Interpolant automaton has 8 states [2018-06-25 06:45:39,291 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 06:45:39,291 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:45:39,291 INFO ]: Start difference. First operand 9 states and 187 transitions. Second operand 8 states. [2018-06-25 06:45:40,757 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:40,757 INFO ]: Finished difference Result 16 states and 330 transitions. [2018-06-25 06:45:40,757 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 06:45:40,757 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 06:45:40,757 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:40,758 INFO ]: With dead ends: 16 [2018-06-25 06:45:40,758 INFO ]: Without dead ends: 16 [2018-06-25 06:45:40,758 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-06-25 06:45:40,758 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 06:45:40,760 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-25 06:45:40,760 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 06:45:40,760 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 326 transitions. [2018-06-25 06:45:40,760 INFO ]: Start accepts. Automaton has 12 states and 326 transitions. Word has length 7 [2018-06-25 06:45:40,760 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:40,760 INFO ]: Abstraction has 12 states and 326 transitions. [2018-06-25 06:45:40,760 INFO ]: Interpolant automaton has 8 states. [2018-06-25 06:45:40,760 INFO ]: Start isEmpty. Operand 12 states and 326 transitions. [2018-06-25 06:45:40,761 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:45:40,761 INFO ]: Found error trace [2018-06-25 06:45:40,761 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:45:40,761 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:40,761 INFO ]: Analyzing trace with hash -1783136936, now seen corresponding path program 2 times [2018-06-25 06:45:40,761 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:40,761 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:40,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:40,762 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:40,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:40,785 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:40,999 WARN ]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-25 06:45:41,110 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:41,110 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:45:41,110 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:45:41,117 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 06:45:41,181 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 06:45:41,181 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:41,184 INFO ]: Computing forward predicates... [2018-06-25 06:45:41,342 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:41,375 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:45:41,375 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 06:45:41,375 INFO ]: Interpolant automaton has 8 states [2018-06-25 06:45:41,375 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 06:45:41,375 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:45:41,375 INFO ]: Start difference. First operand 12 states and 326 transitions. Second operand 8 states. [2018-06-25 06:45:42,214 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:42,214 INFO ]: Finished difference Result 16 states and 330 transitions. [2018-06-25 06:45:42,215 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 06:45:42,215 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 06:45:42,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:42,216 INFO ]: With dead ends: 16 [2018-06-25 06:45:42,216 INFO ]: Without dead ends: 16 [2018-06-25 06:45:42,216 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-25 06:45:42,216 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 06:45:42,218 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-25 06:45:42,218 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 06:45:42,218 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 326 transitions. [2018-06-25 06:45:42,218 INFO ]: Start accepts. Automaton has 12 states and 326 transitions. Word has length 7 [2018-06-25 06:45:42,218 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:42,218 INFO ]: Abstraction has 12 states and 326 transitions. [2018-06-25 06:45:42,218 INFO ]: Interpolant automaton has 8 states. [2018-06-25 06:45:42,218 INFO ]: Start isEmpty. Operand 12 states and 326 transitions. [2018-06-25 06:45:42,219 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:45:42,219 INFO ]: Found error trace [2018-06-25 06:45:42,219 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:45:42,219 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:42,219 INFO ]: Analyzing trace with hash 135017142, now seen corresponding path program 1 times [2018-06-25 06:45:42,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:42,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:42,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:42,220 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 06:45:42,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:42,235 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:42,359 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 06:45:42,360 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:45:42,360 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-25 06:45:42,365 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:42,430 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:42,432 INFO ]: Computing forward predicates... [2018-06-25 06:45:42,528 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 06:45:42,563 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:45:42,563 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 06:45:42,564 INFO ]: Interpolant automaton has 4 states [2018-06-25 06:45:42,564 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 06:45:42,564 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 06:45:42,564 INFO ]: Start difference. First operand 12 states and 326 transitions. Second operand 4 states. Received shutdown request... [2018-06-25 06:45:42,669 WARN ]: Removed 2 from assertion stack [2018-06-25 06:45:42,669 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-25 06:45:42,669 WARN ]: Verification canceled [2018-06-25 06:45:42,672 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 06:45:42,673 WARN ]: Timeout [2018-06-25 06:45:42,673 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:45:42 BasicIcfg [2018-06-25 06:45:42,673 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 06:45:42,675 INFO ]: Toolchain (without parser) took 53242.75 ms. Allocated memory was 308.3 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 256.8 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 190.3 MB. Max. memory is 3.6 GB. [2018-06-25 06:45:42,676 INFO ]: SmtParser took 0.09 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-25 06:45:42,676 INFO ]: ChcToBoogie took 73.62 ms. Allocated memory is still 308.3 MB. Free memory was 256.8 MB in the beginning and 253.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:45:42,677 INFO ]: Boogie Preprocessor took 63.18 ms. Allocated memory is still 308.3 MB. Free memory was 253.8 MB in the beginning and 252.8 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. [2018-06-25 06:45:42,677 INFO ]: RCFGBuilder took 330.50 ms. Allocated memory is still 308.3 MB. Free memory was 252.8 MB in the beginning and 232.8 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:45:42,677 INFO ]: BlockEncodingV2 took 17248.26 ms. Allocated memory was 308.3 MB in the beginning and 811.6 MB in the end (delta: 503.3 MB). Free memory was 232.8 MB in the beginning and 580.2 MB in the end (delta: -347.4 MB). Peak memory consumption was 437.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:45:42,678 INFO ]: TraceAbstraction took 35517.79 ms. Allocated memory was 811.6 MB in the beginning and 1.6 GB in the end (delta: 795.3 MB). Free memory was 569.0 MB in the beginning and 1.4 GB in the end (delta: -796.1 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 06:45:42,686 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, 1192 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 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 73.62 ms. Allocated memory is still 308.3 MB. Free memory was 256.8 MB in the beginning and 253.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 63.18 ms. Allocated memory is still 308.3 MB. Free memory was 253.8 MB in the beginning and 252.8 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. * RCFGBuilder took 330.50 ms. Allocated memory is still 308.3 MB. Free memory was 252.8 MB in the beginning and 232.8 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 17248.26 ms. Allocated memory was 308.3 MB in the beginning and 811.6 MB in the end (delta: 503.3 MB). Free memory was 232.8 MB in the beginning and 580.2 MB in the end (delta: -347.4 MB). Peak memory consumption was 437.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 35517.79 ms. Allocated memory was 811.6 MB in the beginning and 1.6 GB in the end (delta: 795.3 MB). Free memory was 569.0 MB in the beginning and 1.4 GB in the end (delta: -796.1 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (12states) and interpolant automaton (currently 2 states, 4 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 35.4s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 26.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8490 SDtfs, 120 SDslu, 1161 SDs, 0 SdLazy, 11712 SolverSat, 5841 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred 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, 20 MinimizatonAttempts, 37 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 193 NumberOfCodeBlocks, 193 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 3713 SizeOfPredicates, 38 NumberOfNonLiveVariables, 4366 ConjunctsInSsa, 246 ConjunctsInUnsatCore, 31 InterpolantComputations, 13 PerfectInterpolantSequences, 15/47 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/PRODUCER_CONSUMMER_luke_2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_06-45-42-701.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/PRODUCER_CONSUMMER_luke_2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_06-45-42-701.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/PRODUCER_CONSUMMER_luke_2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_06-45-42-701.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/PRODUCER_CONSUMMER_luke_2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_06-45-42-701.csv Completed graceful shutdown