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_e7_207_e8_507.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-27 03:01:43,003 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-27 03:01:43,005 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-27 03:01:43,019 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-27 03:01:43,019 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-27 03:01:43,023 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-27 03:01:43,024 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-27 03:01:43,026 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-27 03:01:43,027 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-27 03:01:43,029 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-27 03:01:43,030 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-27 03:01:43,030 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-27 03:01:43,031 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-27 03:01:43,032 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-27 03:01:43,037 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-27 03:01:43,038 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-27 03:01:43,038 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-27 03:01:43,040 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-27 03:01:43,042 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-27 03:01:43,043 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-27 03:01:43,044 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-27 03:01:43,045 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-27 03:01:43,048 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-27 03:01:43,048 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-27 03:01:43,048 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-27 03:01:43,049 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-27 03:01:43,050 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-27 03:01:43,051 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-27 03:01:43,051 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-27 03:01:43,052 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-27 03:01:43,052 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-27 03:01:43,053 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-27 03:01:43,053 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-27 03:01:43,053 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-27 03:01:43,054 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-27 03:01:43,055 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-27 03:01:43,055 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-27 03:01:43,072 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-27 03:01:43,072 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-27 03:01:43,073 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-27 03:01:43,073 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-27 03:01:43,074 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-27 03:01:43,074 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-27 03:01:43,074 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-27 03:01:43,074 INFO L133 SettingsManager]: * Use SBE=true [2018-06-27 03:01:43,074 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-27 03:01:43,078 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-27 03:01:43,078 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-27 03:01:43,079 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-27 03:01:43,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-27 03:01:43,079 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-27 03:01:43,079 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-27 03:01:43,079 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-27 03:01:43,080 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-27 03:01:43,080 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-27 03:01:43,080 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-27 03:01:43,080 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-27 03:01:43,080 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-27 03:01:43,083 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-27 03:01:43,084 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-27 03:01:43,132 INFO ]: Repository-Root is: /tmp [2018-06-27 03:01:43,144 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-27 03:01:43,149 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-27 03:01:43,152 INFO ]: Initializing SmtParser... [2018-06-27 03:01:43,152 INFO ]: SmtParser initialized [2018-06-27 03:01:43,153 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/speed_e7_207_e8_507.smt2 [2018-06-27 03:01:43,154 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-27 03:01:43,241 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/speed_e7_207_e8_507.smt2 unknown [2018-06-27 03:01:43,479 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/speed_e7_207_e8_507.smt2 [2018-06-27 03:01:43,483 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-27 03:01:43,491 INFO ]: Walking toolchain with 5 elements. [2018-06-27 03:01:43,491 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-27 03:01:43,491 INFO ]: Initializing ChcToBoogie... [2018-06-27 03:01:43,491 INFO ]: ChcToBoogie initialized [2018-06-27 03:01:43,497 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 03:01:43" (1/1) ... [2018-06-27 03:01:43,559 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:01:43 Unit [2018-06-27 03:01:43,559 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-27 03:01:43,559 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-27 03:01:43,559 INFO ]: Initializing Boogie Preprocessor... [2018-06-27 03:01:43,559 INFO ]: Boogie Preprocessor initialized [2018-06-27 03:01:43,582 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:01:43" (1/1) ... [2018-06-27 03:01:43,582 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:01:43" (1/1) ... [2018-06-27 03:01:43,590 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:01:43" (1/1) ... [2018-06-27 03:01:43,590 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:01:43" (1/1) ... [2018-06-27 03:01:43,594 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:01:43" (1/1) ... [2018-06-27 03:01:43,595 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:01:43" (1/1) ... [2018-06-27 03:01:43,597 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:01:43" (1/1) ... [2018-06-27 03:01:43,598 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-27 03:01:43,599 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-27 03:01:43,599 INFO ]: Initializing RCFGBuilder... [2018-06-27 03:01:43,599 INFO ]: RCFGBuilder initialized [2018-06-27 03:01:43,600 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:01:43" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-27 03:01:43,633 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-27 03:01:43,633 INFO ]: Found specification of procedure gotoProc [2018-06-27 03:01:43,633 INFO ]: Found implementation of procedure gotoProc [2018-06-27 03:01:43,633 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-27 03:01:43,633 INFO ]: Found specification of procedure Ultimate.START [2018-06-27 03:01:43,633 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-27 03:01:44,009 INFO ]: Using library mode [2018-06-27 03:01:44,010 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 03:01:44 BoogieIcfgContainer [2018-06-27 03:01:44,010 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-27 03:01:44,010 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-27 03:01:44,010 INFO ]: Initializing BlockEncodingV2... [2018-06-27 03:01:44,011 INFO ]: BlockEncodingV2 initialized [2018-06-27 03:01:44,012 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 03:01:44" (1/1) ... [2018-06-27 03:01:44,026 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-27 03:01:44,027 INFO ]: Using Remove infeasible edges [2018-06-27 03:01:44,027 INFO ]: Using Maximize final states [2018-06-27 03:01:44,028 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-27 03:01:44,028 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-27 03:01:44,030 INFO ]: Using Remove sink states [2018-06-27 03:01:44,030 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-27 03:01:44,030 INFO ]: Using Use SBE [2018-06-27 03:01:44,037 WARN ]: expecting exponential blowup for input size 11 [2018-06-27 03:01:44,432 WARN ]: aborting because of expected exponential blowup for input size 39 [2018-06-27 03:01:44,432 WARN ]: expecting exponential blowup for input size 11 [2018-06-27 03:01:44,706 WARN ]: aborting because of expected exponential blowup for input size 39 [2018-06-27 03:01:44,709 INFO ]: SBE split 2 edges [2018-06-27 03:01:44,725 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-27 03:01:44,728 INFO ]: 0 new accepting states [2018-06-27 03:01:54,093 INFO ]: Removed 1055 edges and 2 locations by large block encoding [2018-06-27 03:01:54,095 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 03:01:54,110 INFO ]: Removed 22 edges and 0 locations because of local infeasibility [2018-06-27 03:01:54,113 INFO ]: 0 new accepting states [2018-06-27 03:01:54,114 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 03:01:54,114 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 03:01:54,119 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-27 03:01:54,120 INFO ]: 0 new accepting states [2018-06-27 03:01:54,121 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 03:01:54,121 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 03:01:54,131 INFO ]: Encoded RCFG 6 locations, 1035 edges [2018-06-27 03:01:54,131 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 03:01:54 BasicIcfg [2018-06-27 03:01:54,131 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-27 03:01:54,132 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-27 03:01:54,132 INFO ]: Initializing TraceAbstraction... [2018-06-27 03:01:54,136 INFO ]: TraceAbstraction initialized [2018-06-27 03:01:54,136 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 03:01:43" (1/4) ... [2018-06-27 03:01:54,137 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de758a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 27.06 03:01:54, skipping insertion in model container [2018-06-27 03:01:54,137 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 03:01:43" (2/4) ... [2018-06-27 03:01:54,137 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de758a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 03:01:54, skipping insertion in model container [2018-06-27 03:01:54,137 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 03:01:44" (3/4) ... [2018-06-27 03:01:54,137 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de758a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 03:01:54, skipping insertion in model container [2018-06-27 03:01:54,137 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 03:01:54" (4/4) ... [2018-06-27 03:01:54,139 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-27 03:01:54,147 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-27 03:01:54,155 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-27 03:01:54,201 INFO ]: Using default assertion order modulation [2018-06-27 03:01:54,202 INFO ]: Interprodecural is true [2018-06-27 03:01:54,202 INFO ]: Hoare is false [2018-06-27 03:01:54,202 INFO ]: Compute interpolants for FPandBP [2018-06-27 03:01:54,202 INFO ]: Backedges is TWOTRACK [2018-06-27 03:01:54,202 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-27 03:01:54,202 INFO ]: Difference is false [2018-06-27 03:01:54,202 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-27 03:01:54,202 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-27 03:01:54,221 INFO ]: Start isEmpty. Operand 6 states. [2018-06-27 03:01:54,241 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 03:01:54,242 INFO ]: Found error trace [2018-06-27 03:01:54,242 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 03:01:54,243 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:01:54,247 INFO ]: Analyzing trace with hash 98135681, now seen corresponding path program 1 times [2018-06-27 03:01:54,249 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:01:54,249 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:01:54,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:54,294 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:01:54,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:54,349 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:01:54,401 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:01:54,403 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:01:54,403 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:01:54,404 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:01:54,415 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:01:54,415 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:01:54,418 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-27 03:01:56,274 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:01:56,274 INFO ]: Finished difference Result 7 states and 1036 transitions. [2018-06-27 03:01:56,274 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:01:56,275 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 03:01:56,275 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:01:56,291 INFO ]: With dead ends: 7 [2018-06-27 03:01:56,291 INFO ]: Without dead ends: 7 [2018-06-27 03:01:56,293 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:01:56,311 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 03:01:56,343 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 03:01:56,345 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:01:56,348 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1036 transitions. [2018-06-27 03:01:56,349 INFO ]: Start accepts. Automaton has 7 states and 1036 transitions. Word has length 5 [2018-06-27 03:01:56,350 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:01:56,350 INFO ]: Abstraction has 7 states and 1036 transitions. [2018-06-27 03:01:56,350 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:01:56,350 INFO ]: Start isEmpty. Operand 7 states and 1036 transitions. [2018-06-27 03:01:56,351 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 03:01:56,351 INFO ]: Found error trace [2018-06-27 03:01:56,351 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 03:01:56,351 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:01:56,351 INFO ]: Analyzing trace with hash 98195263, now seen corresponding path program 1 times [2018-06-27 03:01:56,351 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:01:56,351 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:01:56,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:56,352 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:01:56,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:56,360 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:01:56,398 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:01:56,398 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:01:56,398 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:01:56,399 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:01:56,400 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:01:56,400 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:01:56,400 INFO ]: Start difference. First operand 7 states and 1036 transitions. Second operand 3 states. [2018-06-27 03:01:57,906 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:01:57,906 INFO ]: Finished difference Result 9 states and 1038 transitions. [2018-06-27 03:01:57,906 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:01:57,907 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 03:01:57,907 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:01:57,908 INFO ]: With dead ends: 9 [2018-06-27 03:01:57,908 INFO ]: Without dead ends: 9 [2018-06-27 03:01:57,909 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:01:57,909 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 03:01:57,920 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-27 03:01:57,920 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:01:57,923 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1036 transitions. [2018-06-27 03:01:57,923 INFO ]: Start accepts. Automaton has 7 states and 1036 transitions. Word has length 5 [2018-06-27 03:01:57,923 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:01:57,923 INFO ]: Abstraction has 7 states and 1036 transitions. [2018-06-27 03:01:57,923 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:01:57,923 INFO ]: Start isEmpty. Operand 7 states and 1036 transitions. [2018-06-27 03:01:57,924 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 03:01:57,924 INFO ]: Found error trace [2018-06-27 03:01:57,924 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 03:01:57,924 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:01:57,924 INFO ]: Analyzing trace with hash 98374009, now seen corresponding path program 1 times [2018-06-27 03:01:57,924 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:01:57,924 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:01:57,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:57,925 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:01:57,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:57,940 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:01:57,955 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:01:57,955 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:01:57,955 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:01:57,955 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:01:57,955 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:01:57,955 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:01:57,955 INFO ]: Start difference. First operand 7 states and 1036 transitions. Second operand 3 states. [2018-06-27 03:01:59,539 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:01:59,539 INFO ]: Finished difference Result 9 states and 1038 transitions. [2018-06-27 03:01:59,539 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:01:59,539 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 03:01:59,539 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:01:59,541 INFO ]: With dead ends: 9 [2018-06-27 03:01:59,541 INFO ]: Without dead ends: 9 [2018-06-27 03:01:59,543 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:01:59,543 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 03:01:59,550 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-27 03:01:59,550 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:01:59,551 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1036 transitions. [2018-06-27 03:01:59,552 INFO ]: Start accepts. Automaton has 7 states and 1036 transitions. Word has length 5 [2018-06-27 03:01:59,552 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:01:59,552 INFO ]: Abstraction has 7 states and 1036 transitions. [2018-06-27 03:01:59,552 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:01:59,552 INFO ]: Start isEmpty. Operand 7 states and 1036 transitions. [2018-06-27 03:01:59,552 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 03:01:59,552 INFO ]: Found error trace [2018-06-27 03:01:59,552 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 03:01:59,552 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:01:59,553 INFO ]: Analyzing trace with hash 98582546, now seen corresponding path program 1 times [2018-06-27 03:01:59,553 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:01:59,553 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:01:59,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:59,553 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:01:59,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:01:59,560 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:01:59,596 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:01:59,597 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:01:59,597 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:01:59,597 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:01:59,597 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:01:59,597 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:01:59,597 INFO ]: Start difference. First operand 7 states and 1036 transitions. Second operand 3 states. [2018-06-27 03:02:00,518 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:02:00,518 INFO ]: Finished difference Result 9 states and 1038 transitions. [2018-06-27 03:02:00,518 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:02:00,518 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 03:02:00,518 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:02:00,520 INFO ]: With dead ends: 9 [2018-06-27 03:02:00,520 INFO ]: Without dead ends: 9 [2018-06-27 03:02:00,520 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:02:00,520 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 03:02:00,526 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-27 03:02:00,526 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 03:02:00,528 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1036 transitions. [2018-06-27 03:02:00,528 INFO ]: Start accepts. Automaton has 7 states and 1036 transitions. Word has length 5 [2018-06-27 03:02:00,528 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:02:00,528 INFO ]: Abstraction has 7 states and 1036 transitions. [2018-06-27 03:02:00,528 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:02:00,528 INFO ]: Start isEmpty. Operand 7 states and 1036 transitions. [2018-06-27 03:02:00,529 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 03:02:00,529 INFO ]: Found error trace [2018-06-27 03:02:00,529 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 03:02:00,529 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:02:00,529 INFO ]: Analyzing trace with hash 68821337, now seen corresponding path program 1 times [2018-06-27 03:02:00,529 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:02:00,529 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:02:00,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:02:00,530 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:02:00,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:02:00,544 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:02:00,579 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:02:00,579 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:02:00,580 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:02:00,580 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:02:00,580 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:02:00,580 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:02:00,580 INFO ]: Start difference. First operand 7 states and 1036 transitions. Second operand 3 states. [2018-06-27 03:02:01,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:02:01,463 INFO ]: Finished difference Result 10 states and 1042 transitions. [2018-06-27 03:02:01,463 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:02:01,463 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 03:02:01,463 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:02:01,465 INFO ]: With dead ends: 10 [2018-06-27 03:02:01,465 INFO ]: Without dead ends: 10 [2018-06-27 03:02:01,466 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:02:01,466 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-27 03:02:01,473 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-27 03:02:01,473 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 03:02:01,475 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1040 transitions. [2018-06-27 03:02:01,475 INFO ]: Start accepts. Automaton has 8 states and 1040 transitions. Word has length 5 [2018-06-27 03:02:01,475 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:02:01,475 INFO ]: Abstraction has 8 states and 1040 transitions. [2018-06-27 03:02:01,475 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:02:01,475 INFO ]: Start isEmpty. Operand 8 states and 1040 transitions. [2018-06-27 03:02:01,476 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 03:02:01,476 INFO ]: Found error trace [2018-06-27 03:02:01,476 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 03:02:01,476 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:02:01,476 INFO ]: Analyzing trace with hash 68808844, now seen corresponding path program 1 times [2018-06-27 03:02:01,476 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:02:01,476 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:02:01,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:02:01,477 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:02:01,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:02:01,493 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:02:01,518 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:02:01,519 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:02:01,519 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:02:01,519 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:02:01,519 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:02:01,519 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:02:01,519 INFO ]: Start difference. First operand 8 states and 1040 transitions. Second operand 3 states. [2018-06-27 03:02:03,172 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:02:03,172 INFO ]: Finished difference Result 12 states and 1048 transitions. [2018-06-27 03:02:03,172 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:02:03,172 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 03:02:03,172 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:02:03,174 INFO ]: With dead ends: 12 [2018-06-27 03:02:03,174 INFO ]: Without dead ends: 12 [2018-06-27 03:02:03,174 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:02:03,174 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-27 03:02:03,179 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-27 03:02:03,179 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-27 03:02:03,181 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1046 transitions. [2018-06-27 03:02:03,181 INFO ]: Start accepts. Automaton has 10 states and 1046 transitions. Word has length 5 [2018-06-27 03:02:03,181 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:02:03,181 INFO ]: Abstraction has 10 states and 1046 transitions. [2018-06-27 03:02:03,181 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:02:03,181 INFO ]: Start isEmpty. Operand 10 states and 1046 transitions. [2018-06-27 03:02:03,182 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 03:02:03,182 INFO ]: Found error trace [2018-06-27 03:02:03,182 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 03:02:03,182 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 03:02:03,182 INFO ]: Analyzing trace with hash 68805000, now seen corresponding path program 1 times [2018-06-27 03:02:03,182 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 03:02:03,182 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 03:02:03,183 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:02:03,183 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 03:02:03,183 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 03:02:03,196 INFO ]: Conjunction of SSA is unsat [2018-06-27 03:02:03,226 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 03:02:03,227 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 03:02:03,227 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 03:02:03,227 INFO ]: Interpolant automaton has 3 states [2018-06-27 03:02:03,227 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 03:02:03,227 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:02:03,227 INFO ]: Start difference. First operand 10 states and 1046 transitions. Second operand 3 states. [2018-06-27 03:02:04,086 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 03:02:04,086 INFO ]: Finished difference Result 7 states and 1025 transitions. [2018-06-27 03:02:04,087 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 03:02:04,087 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 03:02:04,087 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 03:02:04,087 INFO ]: With dead ends: 7 [2018-06-27 03:02:04,087 INFO ]: Without dead ends: 0 [2018-06-27 03:02:04,087 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 03:02:04,087 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-27 03:02:04,087 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-27 03:02:04,087 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-27 03:02:04,087 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-27 03:02:04,088 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2018-06-27 03:02:04,088 INFO ]: Finished accepts. word is rejected. [2018-06-27 03:02:04,088 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-27 03:02:04,088 INFO ]: Interpolant automaton has 3 states. [2018-06-27 03:02:04,088 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-27 03:02:04,088 INFO ]: Finished isEmpty. No accepting run. [2018-06-27 03:02:04,090 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-27 03:02:04,091 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 03:02:04 BasicIcfg [2018-06-27 03:02:04,091 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-27 03:02:04,092 INFO ]: Toolchain (without parser) took 20608.70 ms. Allocated memory was 309.9 MB in the beginning and 818.4 MB in the end (delta: 508.6 MB). Free memory was 262.2 MB in the beginning and 712.9 MB in the end (delta: -450.7 MB). Peak memory consumption was 57.8 MB. Max. memory is 3.6 GB. [2018-06-27 03:02:04,094 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.9 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-27 03:02:04,095 INFO ]: ChcToBoogie took 67.94 ms. Allocated memory is still 309.9 MB. Free memory was 262.2 MB in the beginning and 259.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-27 03:02:04,096 INFO ]: Boogie Preprocessor took 39.11 ms. Allocated memory is still 309.9 MB. Free memory was 259.2 MB in the beginning and 258.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-27 03:02:04,096 INFO ]: RCFGBuilder took 410.63 ms. Allocated memory is still 309.9 MB. Free memory was 258.2 MB in the beginning and 245.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. [2018-06-27 03:02:04,096 INFO ]: BlockEncodingV2 took 10121.31 ms. Allocated memory was 309.9 MB in the beginning and 480.2 MB in the end (delta: 170.4 MB). Free memory was 245.2 MB in the beginning and 286.7 MB in the end (delta: -41.5 MB). Peak memory consumption was 250.1 MB. Max. memory is 3.6 GB. [2018-06-27 03:02:04,097 INFO ]: TraceAbstraction took 9959.02 ms. Allocated memory was 480.2 MB in the beginning and 818.4 MB in the end (delta: 338.2 MB). Free memory was 286.7 MB in the beginning and 712.9 MB in the end (delta: -426.2 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-27 03:02:04,100 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, 1035 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 309.9 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 67.94 ms. Allocated memory is still 309.9 MB. Free memory was 262.2 MB in the beginning and 259.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 39.11 ms. Allocated memory is still 309.9 MB. Free memory was 259.2 MB in the beginning and 258.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 410.63 ms. Allocated memory is still 309.9 MB. Free memory was 258.2 MB in the beginning and 245.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 10121.31 ms. Allocated memory was 309.9 MB in the beginning and 480.2 MB in the end (delta: 170.4 MB). Free memory was 245.2 MB in the beginning and 286.7 MB in the end (delta: -41.5 MB). Peak memory consumption was 250.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 9959.02 ms. Allocated memory was 480.2 MB in the beginning and 818.4 MB in the end (delta: 338.2 MB). Free memory was 286.7 MB in the beginning and 712.9 MB in the end (delta: -426.2 MB). There was no memory consumed. 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, 9.8s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 9.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7228 SDtfs, 6 SDslu, 19 SDs, 0 SdLazy, 3131 SolverSat, 4132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=6, 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.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 10 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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_e7_207_e8_507.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-27_03-02-04-112.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed_e7_207_e8_507.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-27_03-02-04-112.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed_e7_207_e8_507.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-27_03-02-04-112.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed_e7_207_e8_507.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-27_03-02-04-112.csv Received shutdown request...