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/speed_e8_136.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 06:59:31,923 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 06:59:31,926 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 06:59:31,941 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 06:59:31,942 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 06:59:31,943 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 06:59:31,944 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 06:59:31,951 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 06:59:31,953 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 06:59:31,954 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 06:59:31,955 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 06:59:31,956 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 06:59:31,956 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 06:59:31,959 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 06:59:31,960 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 06:59:31,961 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 06:59:31,974 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 06:59:31,975 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 06:59:31,977 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 06:59:31,978 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 06:59:31,979 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 06:59:31,984 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 06:59:31,985 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 06:59:31,985 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 06:59:31,986 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 06:59:31,987 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 06:59:31,990 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 06:59:31,990 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 06:59:31,991 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 06:59:31,991 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 06:59:31,992 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 06:59:31,993 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 06:59:31,998 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 06:59:31,999 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 06:59:31,999 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 06:59:32,000 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:59:32,026 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 06:59:32,026 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 06:59:32,029 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 06:59:32,029 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 06:59:32,030 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 06:59:32,030 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 06:59:32,031 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 06:59:32,031 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 06:59:32,031 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 06:59:32,031 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 06:59:32,031 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 06:59:32,032 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 06:59:32,032 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 06:59:32,032 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 06:59:32,032 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 06:59:32,032 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 06:59:32,035 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 06:59:32,036 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 06:59:32,036 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 06:59:32,036 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 06:59:32,036 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 06:59:32,038 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 06:59:32,038 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 06:59:32,085 INFO ]: Repository-Root is: /tmp [2018-06-25 06:59:32,103 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 06:59:32,110 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 06:59:32,111 INFO ]: Initializing SmtParser... [2018-06-25 06:59:32,112 INFO ]: SmtParser initialized [2018-06-25 06:59:32,112 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/speed_e8_136.smt2 [2018-06-25 06:59:32,114 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:59:32,209 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/speed_e8_136.smt2 unknown [2018-06-25 06:59:32,488 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/speed_e8_136.smt2 [2018-06-25 06:59:32,493 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 06:59:32,499 INFO ]: Walking toolchain with 5 elements. [2018-06-25 06:59:32,499 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 06:59:32,499 INFO ]: Initializing ChcToBoogie... [2018-06-25 06:59:32,499 INFO ]: ChcToBoogie initialized [2018-06-25 06:59:32,502 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:59:32" (1/1) ... [2018-06-25 06:59:32,566 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:59:32 Unit [2018-06-25 06:59:32,566 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 06:59:32,567 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 06:59:32,567 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 06:59:32,567 INFO ]: Boogie Preprocessor initialized [2018-06-25 06:59:32,587 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:59:32" (1/1) ... [2018-06-25 06:59:32,587 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:59:32" (1/1) ... [2018-06-25 06:59:32,596 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:59:32" (1/1) ... [2018-06-25 06:59:32,596 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:59:32" (1/1) ... [2018-06-25 06:59:32,601 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:59:32" (1/1) ... [2018-06-25 06:59:32,603 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:59:32" (1/1) ... [2018-06-25 06:59:32,605 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:59:32" (1/1) ... [2018-06-25 06:59:32,607 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 06:59:32,607 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 06:59:32,607 INFO ]: Initializing RCFGBuilder... [2018-06-25 06:59:32,607 INFO ]: RCFGBuilder initialized [2018-06-25 06:59:32,620 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:59:32" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 06:59:32,637 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 06:59:32,637 INFO ]: Found specification of procedure gotoProc [2018-06-25 06:59:32,637 INFO ]: Found implementation of procedure gotoProc [2018-06-25 06:59:32,637 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 06:59:32,637 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 06:59:32,637 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 06:59:32,918 INFO ]: Using library mode [2018-06-25 06:59:32,919 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:59:32 BoogieIcfgContainer [2018-06-25 06:59:32,919 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 06:59:32,919 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 06:59:32,919 INFO ]: Initializing BlockEncodingV2... [2018-06-25 06:59:32,920 INFO ]: BlockEncodingV2 initialized [2018-06-25 06:59:32,921 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:59:32" (1/1) ... [2018-06-25 06:59:32,938 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 06:59:32,939 INFO ]: Using Remove infeasible edges [2018-06-25 06:59:32,940 INFO ]: Using Maximize final states [2018-06-25 06:59:32,940 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 06:59:32,941 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 06:59:32,942 INFO ]: Using Remove sink states [2018-06-25 06:59:32,945 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 06:59:32,945 INFO ]: Using Use SBE [2018-06-25 06:59:32,952 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 06:59:33,916 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 06:59:35,466 WARN ]: aborting because of expected exponential blowup for input size 39 [2018-06-25 06:59:35,605 WARN ]: aborting because of expected exponential blowup for input size 39 [2018-06-25 06:59:35,606 INFO ]: SBE split 2 edges [2018-06-25 06:59:35,624 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 06:59:35,630 INFO ]: 0 new accepting states [2018-06-25 06:59:44,484 INFO ]: Removed 1052 edges and 2 locations by large block encoding [2018-06-25 06:59:44,486 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:59:44,543 INFO ]: Removed 18 edges and 0 locations because of local infeasibility [2018-06-25 06:59:44,544 INFO ]: 0 new accepting states [2018-06-25 06:59:44,545 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:59:44,545 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:59:44,554 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 06:59:44,555 INFO ]: 0 new accepting states [2018-06-25 06:59:44,556 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:59:44,556 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:59:44,568 INFO ]: Encoded RCFG 6 locations, 1036 edges [2018-06-25 06:59:44,568 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:59:44 BasicIcfg [2018-06-25 06:59:44,568 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 06:59:44,570 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 06:59:44,570 INFO ]: Initializing TraceAbstraction... [2018-06-25 06:59:44,573 INFO ]: TraceAbstraction initialized [2018-06-25 06:59:44,574 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:59:32" (1/4) ... [2018-06-25 06:59:44,574 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6392d7f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 06:59:44, skipping insertion in model container [2018-06-25 06:59:44,575 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:59:32" (2/4) ... [2018-06-25 06:59:44,575 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6392d7f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 06:59:44, skipping insertion in model container [2018-06-25 06:59:44,575 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:59:32" (3/4) ... [2018-06-25 06:59:44,575 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6392d7f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:59:44, skipping insertion in model container [2018-06-25 06:59:44,575 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:59:44" (4/4) ... [2018-06-25 06:59:44,577 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 06:59:44,588 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 06:59:44,595 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 06:59:44,653 INFO ]: Using default assertion order modulation [2018-06-25 06:59:44,654 INFO ]: Interprodecural is true [2018-06-25 06:59:44,654 INFO ]: Hoare is false [2018-06-25 06:59:44,654 INFO ]: Compute interpolants for FPandBP [2018-06-25 06:59:44,654 INFO ]: Backedges is TWOTRACK [2018-06-25 06:59:44,654 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 06:59:44,654 INFO ]: Difference is false [2018-06-25 06:59:44,654 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 06:59:44,654 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 06:59:44,674 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 06:59:44,695 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:59:44,696 INFO ]: Found error trace [2018-06-25 06:59:44,698 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:59:44,698 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:59:44,703 INFO ]: Analyzing trace with hash 98122227, now seen corresponding path program 1 times [2018-06-25 06:59:44,705 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:59:44,705 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:59:44,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:44,751 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:44,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:44,805 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:44,927 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:59:44,930 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:59:44,930 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:59:44,932 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:59:44,948 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:59:44,948 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:59:44,951 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 06:59:47,160 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:59:47,160 INFO ]: Finished difference Result 7 states and 1037 transitions. [2018-06-25 06:59:47,160 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:59:47,161 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:59:47,162 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:59:47,174 INFO ]: With dead ends: 7 [2018-06-25 06:59:47,174 INFO ]: Without dead ends: 7 [2018-06-25 06:59:47,176 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:59:47,194 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:59:47,237 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:59:47,241 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:59:47,244 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1037 transitions. [2018-06-25 06:59:47,245 INFO ]: Start accepts. Automaton has 7 states and 1037 transitions. Word has length 5 [2018-06-25 06:59:47,246 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:59:47,246 INFO ]: Abstraction has 7 states and 1037 transitions. [2018-06-25 06:59:47,246 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:59:47,246 INFO ]: Start isEmpty. Operand 7 states and 1037 transitions. [2018-06-25 06:59:47,247 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:59:47,247 INFO ]: Found error trace [2018-06-25 06:59:47,247 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:59:47,247 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:59:47,248 INFO ]: Analyzing trace with hash 98152018, now seen corresponding path program 1 times [2018-06-25 06:59:47,248 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:59:47,248 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:59:47,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:47,249 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:47,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:47,257 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:47,275 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:59:47,275 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:59:47,275 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:59:47,277 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:59:47,277 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:59:47,277 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:59:47,277 INFO ]: Start difference. First operand 7 states and 1037 transitions. Second operand 3 states. [2018-06-25 06:59:48,747 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:59:48,748 INFO ]: Finished difference Result 9 states and 1039 transitions. [2018-06-25 06:59:48,748 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:59:48,748 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:59:48,748 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:59:48,750 INFO ]: With dead ends: 9 [2018-06-25 06:59:48,750 INFO ]: Without dead ends: 9 [2018-06-25 06:59:48,750 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:59:48,751 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:59:48,761 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 06:59:48,761 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:59:48,763 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1037 transitions. [2018-06-25 06:59:48,763 INFO ]: Start accepts. Automaton has 7 states and 1037 transitions. Word has length 5 [2018-06-25 06:59:48,763 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:59:48,763 INFO ]: Abstraction has 7 states and 1037 transitions. [2018-06-25 06:59:48,763 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:59:48,764 INFO ]: Start isEmpty. Operand 7 states and 1037 transitions. [2018-06-25 06:59:48,764 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:59:48,764 INFO ]: Found error trace [2018-06-25 06:59:48,764 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:59:48,764 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:59:48,765 INFO ]: Analyzing trace with hash 98300973, now seen corresponding path program 1 times [2018-06-25 06:59:48,765 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:59:48,765 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:59:48,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:48,765 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:48,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:48,776 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:48,811 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:59:48,811 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:59:48,811 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:59:48,811 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:59:48,811 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:59:48,811 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:59:48,811 INFO ]: Start difference. First operand 7 states and 1037 transitions. Second operand 3 states. [2018-06-25 06:59:50,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:59:50,486 INFO ]: Finished difference Result 9 states and 1039 transitions. [2018-06-25 06:59:50,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:59:50,486 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:59:50,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:59:50,487 INFO ]: With dead ends: 9 [2018-06-25 06:59:50,487 INFO ]: Without dead ends: 9 [2018-06-25 06:59:50,488 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:59:50,488 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:59:50,495 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 06:59:50,495 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:59:50,498 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1037 transitions. [2018-06-25 06:59:50,498 INFO ]: Start accepts. Automaton has 7 states and 1037 transitions. Word has length 5 [2018-06-25 06:59:50,498 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:59:50,498 INFO ]: Abstraction has 7 states and 1037 transitions. [2018-06-25 06:59:50,498 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:59:50,498 INFO ]: Start isEmpty. Operand 7 states and 1037 transitions. [2018-06-25 06:59:50,499 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:59:50,499 INFO ]: Found error trace [2018-06-25 06:59:50,499 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:59:50,499 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:59:50,499 INFO ]: Analyzing trace with hash 98718047, now seen corresponding path program 1 times [2018-06-25 06:59:50,499 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:59:50,499 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:59:50,500 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:50,500 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:50,500 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:50,516 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:50,556 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:59:50,556 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:59:50,556 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:59:50,557 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:59:50,557 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:59:50,557 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:59:50,557 INFO ]: Start difference. First operand 7 states and 1037 transitions. Second operand 3 states. [2018-06-25 06:59:51,432 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:59:51,432 INFO ]: Finished difference Result 10 states and 1045 transitions. [2018-06-25 06:59:51,432 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:59:51,432 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:59:51,432 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:59:51,435 INFO ]: With dead ends: 10 [2018-06-25 06:59:51,435 INFO ]: Without dead ends: 10 [2018-06-25 06:59:51,435 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:59:51,435 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 06:59:51,442 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-25 06:59:51,442 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:59:51,444 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1043 transitions. [2018-06-25 06:59:51,444 INFO ]: Start accepts. Automaton has 8 states and 1043 transitions. Word has length 5 [2018-06-25 06:59:51,444 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:59:51,444 INFO ]: Abstraction has 8 states and 1043 transitions. [2018-06-25 06:59:51,444 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:59:51,444 INFO ]: Start isEmpty. Operand 8 states and 1043 transitions. [2018-06-25 06:59:51,445 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:59:51,445 INFO ]: Found error trace [2018-06-25 06:59:51,445 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:59:51,445 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:59:51,445 INFO ]: Analyzing trace with hash 98719008, now seen corresponding path program 1 times [2018-06-25 06:59:51,445 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:59:51,445 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:59:51,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:51,446 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:51,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:51,454 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:51,483 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:59:51,483 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:59:51,484 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:59:51,484 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:59:51,484 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:59:51,484 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:59:51,484 INFO ]: Start difference. First operand 8 states and 1043 transitions. Second operand 3 states. [2018-06-25 06:59:52,426 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:59:52,426 INFO ]: Finished difference Result 11 states and 1046 transitions. [2018-06-25 06:59:52,432 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:59:52,432 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:59:52,432 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:59:52,434 INFO ]: With dead ends: 11 [2018-06-25 06:59:52,434 INFO ]: Without dead ends: 11 [2018-06-25 06:59:52,434 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:59:52,434 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 06:59:52,439 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-06-25 06:59:52,439 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:59:52,441 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1043 transitions. [2018-06-25 06:59:52,441 INFO ]: Start accepts. Automaton has 8 states and 1043 transitions. Word has length 5 [2018-06-25 06:59:52,441 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:59:52,441 INFO ]: Abstraction has 8 states and 1043 transitions. [2018-06-25 06:59:52,441 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:59:52,441 INFO ]: Start isEmpty. Operand 8 states and 1043 transitions. [2018-06-25 06:59:52,442 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:59:52,442 INFO ]: Found error trace [2018-06-25 06:59:52,442 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:59:52,442 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:59:52,442 INFO ]: Analyzing trace with hash 98807420, now seen corresponding path program 1 times [2018-06-25 06:59:52,442 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:59:52,442 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:59:52,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:52,442 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:52,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:52,449 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:52,466 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:59:52,466 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:59:52,466 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:59:52,466 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:59:52,466 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:59:52,466 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:59:52,466 INFO ]: Start difference. First operand 8 states and 1043 transitions. Second operand 3 states. [2018-06-25 06:59:54,450 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:59:54,450 INFO ]: Finished difference Result 11 states and 1046 transitions. [2018-06-25 06:59:54,451 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:59:54,451 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:59:54,451 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:59:54,453 INFO ]: With dead ends: 11 [2018-06-25 06:59:54,453 INFO ]: Without dead ends: 11 [2018-06-25 06:59:54,453 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:59:54,453 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 06:59:54,458 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-06-25 06:59:54,458 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:59:54,460 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1043 transitions. [2018-06-25 06:59:54,460 INFO ]: Start accepts. Automaton has 8 states and 1043 transitions. Word has length 5 [2018-06-25 06:59:54,460 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:59:54,460 INFO ]: Abstraction has 8 states and 1043 transitions. [2018-06-25 06:59:54,460 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:59:54,460 INFO ]: Start isEmpty. Operand 8 states and 1043 transitions. [2018-06-25 06:59:54,461 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:59:54,461 INFO ]: Found error trace [2018-06-25 06:59:54,461 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:59:54,461 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:59:54,461 INFO ]: Analyzing trace with hash 70179230, now seen corresponding path program 1 times [2018-06-25 06:59:54,461 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:59:54,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:59:54,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:54,462 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:54,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:54,471 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:54,532 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:59:54,532 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:59:54,532 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:59:54,532 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:59:54,532 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:59:54,532 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:59:54,533 INFO ]: Start difference. First operand 8 states and 1043 transitions. Second operand 3 states. [2018-06-25 06:59:55,517 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:59:55,517 INFO ]: Finished difference Result 12 states and 1057 transitions. [2018-06-25 06:59:55,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:59:55,522 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:59:55,522 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:59:55,523 INFO ]: With dead ends: 12 [2018-06-25 06:59:55,524 INFO ]: Without dead ends: 12 [2018-06-25 06:59:55,524 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:59:55,524 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 06:59:55,528 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-25 06:59:55,528 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 06:59:55,529 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1055 transitions. [2018-06-25 06:59:55,530 INFO ]: Start accepts. Automaton has 10 states and 1055 transitions. Word has length 5 [2018-06-25 06:59:55,530 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:59:55,530 INFO ]: Abstraction has 10 states and 1055 transitions. [2018-06-25 06:59:55,530 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:59:55,530 INFO ]: Start isEmpty. Operand 10 states and 1055 transitions. [2018-06-25 06:59:55,531 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:59:55,531 INFO ]: Found error trace [2018-06-25 06:59:55,531 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:59:55,531 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:59:55,531 INFO ]: Analyzing trace with hash 70167698, now seen corresponding path program 1 times [2018-06-25 06:59:55,531 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:59:55,531 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:59:55,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:55,532 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:59:55,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:59:55,539 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:59:55,598 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:59:55,598 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:59:55,598 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:59:55,598 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:59:55,599 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:59:55,599 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:59:55,599 INFO ]: Start difference. First operand 10 states and 1055 transitions. Second operand 3 states. [2018-06-25 06:59:56,385 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:59:56,385 INFO ]: Finished difference Result 7 states and 1025 transitions. [2018-06-25 06:59:56,386 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:59:56,386 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:59:56,386 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:59:56,386 INFO ]: With dead ends: 7 [2018-06-25 06:59:56,386 INFO ]: Without dead ends: 0 [2018-06-25 06:59:56,386 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:59:56,386 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 06:59:56,386 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 06:59:56,386 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 06:59:56,386 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 06:59:56,386 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2018-06-25 06:59:56,386 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:59:56,386 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 06:59:56,386 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:59:56,386 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 06:59:56,386 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 06:59:56,388 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 06:59:56,389 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:59:56 BasicIcfg [2018-06-25 06:59:56,389 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 06:59:56,391 INFO ]: Toolchain (without parser) took 23896.10 ms. Allocated memory was 307.8 MB in the beginning and 793.8 MB in the end (delta: 486.0 MB). Free memory was 260.1 MB in the beginning and 249.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 496.8 MB. Max. memory is 3.6 GB. [2018-06-25 06:59:56,393 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 06:59:56,393 INFO ]: ChcToBoogie took 67.12 ms. Allocated memory is still 307.8 MB. Free memory was 260.1 MB in the beginning and 257.1 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:59:56,394 INFO ]: Boogie Preprocessor took 40.31 ms. Allocated memory is still 307.8 MB. Free memory was 257.1 MB in the beginning and 256.1 MB in the end (delta: 996.9 kB). Peak memory consumption was 996.9 kB. Max. memory is 3.6 GB. [2018-06-25 06:59:56,394 INFO ]: RCFGBuilder took 311.81 ms. Allocated memory is still 307.8 MB. Free memory was 256.1 MB in the beginning and 243.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:59:56,394 INFO ]: BlockEncodingV2 took 11649.01 ms. Allocated memory was 307.8 MB in the beginning and 467.1 MB in the end (delta: 159.4 MB). Free memory was 243.1 MB in the beginning and 198.7 MB in the end (delta: 44.4 MB). Peak memory consumption was 235.6 MB. Max. memory is 3.6 GB. [2018-06-25 06:59:56,395 INFO ]: TraceAbstraction took 11819.33 ms. Allocated memory was 467.1 MB in the beginning and 793.8 MB in the end (delta: 326.6 MB). Free memory was 198.7 MB in the beginning and 249.3 MB in the end (delta: -50.6 MB). Peak memory consumption was 276.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:59:56,400 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, 1036 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 67.12 ms. Allocated memory is still 307.8 MB. Free memory was 260.1 MB in the beginning and 257.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 40.31 ms. Allocated memory is still 307.8 MB. Free memory was 257.1 MB in the beginning and 256.1 MB in the end (delta: 996.9 kB). Peak memory consumption was 996.9 kB. Max. memory is 3.6 GB. * RCFGBuilder took 311.81 ms. Allocated memory is still 307.8 MB. Free memory was 256.1 MB in the beginning and 243.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 11649.01 ms. Allocated memory was 307.8 MB in the beginning and 467.1 MB in the end (delta: 159.4 MB). Free memory was 243.1 MB in the beginning and 198.7 MB in the end (delta: 44.4 MB). Peak memory consumption was 235.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 11819.33 ms. Allocated memory was 467.1 MB in the beginning and 793.8 MB in the end (delta: 326.6 MB). Free memory was 198.7 MB in the beginning and 249.3 MB in the end (delta: -50.6 MB). Peak memory consumption was 276.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 11.7s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 10.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8263 SDtfs, 11 SDslu, 22 SDs, 0 SdLazy, 3658 SolverSat, 4657 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=7, 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, 8 MinimizatonAttempts, 14 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed_e8_136.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_06-59-56-418.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed_e8_136.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_06-59-56-418.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed_e8_136.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_06-59-56-418.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed_e8_136.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_06-59-56-418.csv Received shutdown request...