java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8_e8_220.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-27 00:08:18,053 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-27 00:08:18,055 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-27 00:08:18,069 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-27 00:08:18,069 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-27 00:08:18,070 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-27 00:08:18,071 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-27 00:08:18,079 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-27 00:08:18,080 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-27 00:08:18,083 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-27 00:08:18,083 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-27 00:08:18,084 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-27 00:08:18,084 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-27 00:08:18,085 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-27 00:08:18,086 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-27 00:08:18,087 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-27 00:08:18,088 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-27 00:08:18,092 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-27 00:08:18,094 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-27 00:08:18,105 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-27 00:08:18,106 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-27 00:08:18,107 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-27 00:08:18,109 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-27 00:08:18,110 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-27 00:08:18,110 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-27 00:08:18,111 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-27 00:08:18,111 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-27 00:08:18,114 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-27 00:08:18,115 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-27 00:08:18,116 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-27 00:08:18,116 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-27 00:08:18,117 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-27 00:08:18,117 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-27 00:08:18,117 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-27 00:08:18,118 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-27 00:08:18,119 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-27 00:08:18,119 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-27 00:08:18,132 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-27 00:08:18,133 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-27 00:08:18,133 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-27 00:08:18,133 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-27 00:08:18,134 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-27 00:08:18,134 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-27 00:08:18,134 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-27 00:08:18,135 INFO L133 SettingsManager]: * Use SBE=true [2018-06-27 00:08:18,135 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-27 00:08:18,135 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-27 00:08:18,135 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-27 00:08:18,135 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-27 00:08:18,136 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-27 00:08:18,136 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-27 00:08:18,136 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-27 00:08:18,136 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-27 00:08:18,136 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-27 00:08:18,136 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-27 00:08:18,137 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-27 00:08:18,137 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-27 00:08:18,137 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-27 00:08:18,139 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-27 00:08:18,139 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-27 00:08:18,191 INFO ]: Repository-Root is: /tmp [2018-06-27 00:08:18,207 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-27 00:08:18,214 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-27 00:08:18,216 INFO ]: Initializing SmtParser... [2018-06-27 00:08:18,216 INFO ]: SmtParser initialized [2018-06-27 00:08:18,217 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8_e8_220.smt2 [2018-06-27 00:08:18,218 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-27 00:08:18,299 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8_e8_220.smt2 unknown [2018-06-27 00:08:18,580 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8_e8_220.smt2 [2018-06-27 00:08:18,591 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-27 00:08:18,601 INFO ]: Walking toolchain with 5 elements. [2018-06-27 00:08:18,602 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-27 00:08:18,602 INFO ]: Initializing ChcToBoogie... [2018-06-27 00:08:18,602 INFO ]: ChcToBoogie initialized [2018-06-27 00:08:18,610 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 12:08:18" (1/1) ... [2018-06-27 00:08:18,670 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:08:18 Unit [2018-06-27 00:08:18,670 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-27 00:08:18,671 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-27 00:08:18,671 INFO ]: Initializing Boogie Preprocessor... [2018-06-27 00:08:18,671 INFO ]: Boogie Preprocessor initialized [2018-06-27 00:08:18,692 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:08:18" (1/1) ... [2018-06-27 00:08:18,692 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:08:18" (1/1) ... [2018-06-27 00:08:18,702 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:08:18" (1/1) ... [2018-06-27 00:08:18,702 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:08:18" (1/1) ... [2018-06-27 00:08:18,706 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:08:18" (1/1) ... [2018-06-27 00:08:18,708 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:08:18" (1/1) ... [2018-06-27 00:08:18,725 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:08:18" (1/1) ... [2018-06-27 00:08:18,727 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-27 00:08:18,728 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-27 00:08:18,728 INFO ]: Initializing RCFGBuilder... [2018-06-27 00:08:18,728 INFO ]: RCFGBuilder initialized [2018-06-27 00:08:18,729 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:08:18" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-27 00:08:18,743 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-27 00:08:18,743 INFO ]: Found specification of procedure gotoProc [2018-06-27 00:08:18,743 INFO ]: Found implementation of procedure gotoProc [2018-06-27 00:08:18,744 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-27 00:08:18,744 INFO ]: Found specification of procedure Ultimate.START [2018-06-27 00:08:18,744 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-27 00:08:19,063 INFO ]: Using library mode [2018-06-27 00:08:19,068 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 12:08:19 BoogieIcfgContainer [2018-06-27 00:08:19,068 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-27 00:08:19,069 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-27 00:08:19,069 INFO ]: Initializing BlockEncodingV2... [2018-06-27 00:08:19,070 INFO ]: BlockEncodingV2 initialized [2018-06-27 00:08:19,070 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 12:08:19" (1/1) ... [2018-06-27 00:08:19,089 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-27 00:08:19,091 INFO ]: Using Remove infeasible edges [2018-06-27 00:08:19,092 INFO ]: Using Maximize final states [2018-06-27 00:08:19,093 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-27 00:08:19,094 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-27 00:08:19,096 INFO ]: Using Remove sink states [2018-06-27 00:08:19,097 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-27 00:08:19,097 INFO ]: Using Use SBE [2018-06-27 00:08:19,110 WARN ]: expecting exponential blowup for input size 12 [2018-06-27 00:08:19,729 WARN ]: expecting exponential blowup for input size 11 [2018-06-27 00:08:19,809 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-27 00:08:20,097 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-27 00:08:20,099 INFO ]: SBE split 2 edges [2018-06-27 00:08:20,118 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-27 00:08:20,121 INFO ]: 0 new accepting states [2018-06-27 00:08:32,290 INFO ]: Removed 2070 edges and 2 locations by large block encoding [2018-06-27 00:08:32,293 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 00:08:32,307 INFO ]: Removed 14 edges and 0 locations because of local infeasibility [2018-06-27 00:08:32,308 INFO ]: 0 new accepting states [2018-06-27 00:08:32,310 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 00:08:32,311 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 00:08:32,319 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-27 00:08:32,320 INFO ]: 0 new accepting states [2018-06-27 00:08:32,322 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 00:08:32,323 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 00:08:32,333 INFO ]: Encoded RCFG 6 locations, 2058 edges [2018-06-27 00:08:32,334 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 12:08:32 BasicIcfg [2018-06-27 00:08:32,334 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-27 00:08:32,335 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-27 00:08:32,335 INFO ]: Initializing TraceAbstraction... [2018-06-27 00:08:32,338 INFO ]: TraceAbstraction initialized [2018-06-27 00:08:32,338 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 12:08:18" (1/4) ... [2018-06-27 00:08:32,339 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fe8eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 27.06 12:08:32, skipping insertion in model container [2018-06-27 00:08:32,339 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:08:18" (2/4) ... [2018-06-27 00:08:32,339 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fe8eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 12:08:32, skipping insertion in model container [2018-06-27 00:08:32,339 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 12:08:19" (3/4) ... [2018-06-27 00:08:32,340 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fe8eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 12:08:32, skipping insertion in model container [2018-06-27 00:08:32,340 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 12:08:32" (4/4) ... [2018-06-27 00:08:32,341 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-27 00:08:32,350 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-27 00:08:32,358 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-27 00:08:32,402 INFO ]: Using default assertion order modulation [2018-06-27 00:08:32,402 INFO ]: Interprodecural is true [2018-06-27 00:08:32,402 INFO ]: Hoare is false [2018-06-27 00:08:32,402 INFO ]: Compute interpolants for FPandBP [2018-06-27 00:08:32,402 INFO ]: Backedges is TWOTRACK [2018-06-27 00:08:32,402 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-27 00:08:32,402 INFO ]: Difference is false [2018-06-27 00:08:32,402 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-27 00:08:32,402 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-27 00:08:32,421 INFO ]: Start isEmpty. Operand 6 states. [2018-06-27 00:08:32,448 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:08:32,448 INFO ]: Found error trace [2018-06-27 00:08:32,449 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:08:32,449 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:32,454 INFO ]: Analyzing trace with hash 161085025, now seen corresponding path program 1 times [2018-06-27 00:08:32,456 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:32,456 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:32,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:32,488 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:32,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:32,534 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:32,647 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:32,649 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:32,649 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:32,651 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:32,667 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:32,667 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:32,670 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-27 00:08:35,867 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:35,867 INFO ]: Finished difference Result 8 states and 2063 transitions. [2018-06-27 00:08:35,868 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:35,869 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:08:35,869 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:35,884 INFO ]: With dead ends: 8 [2018-06-27 00:08:35,884 INFO ]: Without dead ends: 8 [2018-06-27 00:08:35,885 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:35,902 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 00:08:35,957 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-27 00:08:35,958 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:35,962 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2062 transitions. [2018-06-27 00:08:35,963 INFO ]: Start accepts. Automaton has 7 states and 2062 transitions. Word has length 5 [2018-06-27 00:08:35,964 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:35,964 INFO ]: Abstraction has 7 states and 2062 transitions. [2018-06-27 00:08:35,964 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:35,964 INFO ]: Start isEmpty. Operand 7 states and 2062 transitions. [2018-06-27 00:08:35,965 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:08:35,965 INFO ]: Found error trace [2018-06-27 00:08:35,965 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:08:35,965 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:35,966 INFO ]: Analyzing trace with hash 161096557, now seen corresponding path program 1 times [2018-06-27 00:08:35,966 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:35,966 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:35,966 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:35,966 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:35,966 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:35,978 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:36,044 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:36,044 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:36,044 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:36,046 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:36,046 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:36,046 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:36,046 INFO ]: Start difference. First operand 7 states and 2062 transitions. Second operand 3 states. [2018-06-27 00:08:38,767 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:38,767 INFO ]: Finished difference Result 9 states and 2064 transitions. [2018-06-27 00:08:38,767 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:38,767 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:08:38,767 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:38,770 INFO ]: With dead ends: 9 [2018-06-27 00:08:38,770 INFO ]: Without dead ends: 9 [2018-06-27 00:08:38,771 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:38,771 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 00:08:38,783 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-27 00:08:38,783 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:08:38,789 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2063 transitions. [2018-06-27 00:08:38,789 INFO ]: Start accepts. Automaton has 8 states and 2063 transitions. Word has length 5 [2018-06-27 00:08:38,790 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:38,790 INFO ]: Abstraction has 8 states and 2063 transitions. [2018-06-27 00:08:38,790 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:38,790 INFO ]: Start isEmpty. Operand 8 states and 2063 transitions. [2018-06-27 00:08:38,791 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:08:38,791 INFO ]: Found error trace [2018-06-27 00:08:38,791 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:08:38,791 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:38,791 INFO ]: Analyzing trace with hash 161144607, now seen corresponding path program 1 times [2018-06-27 00:08:38,791 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:38,791 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:38,792 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:38,792 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:38,792 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:38,813 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:38,832 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:38,833 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:38,833 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:38,833 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:38,833 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:38,833 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:38,833 INFO ]: Start difference. First operand 8 states and 2063 transitions. Second operand 3 states. [2018-06-27 00:08:41,641 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:41,641 INFO ]: Finished difference Result 9 states and 2061 transitions. [2018-06-27 00:08:41,641 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:41,641 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:08:41,641 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:41,644 INFO ]: With dead ends: 9 [2018-06-27 00:08:41,644 INFO ]: Without dead ends: 9 [2018-06-27 00:08:41,644 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:41,644 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 00:08:41,659 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-27 00:08:41,659 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:41,662 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2059 transitions. [2018-06-27 00:08:41,662 INFO ]: Start accepts. Automaton has 7 states and 2059 transitions. Word has length 5 [2018-06-27 00:08:41,662 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:41,662 INFO ]: Abstraction has 7 states and 2059 transitions. [2018-06-27 00:08:41,662 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:41,662 INFO ]: Start isEmpty. Operand 7 states and 2059 transitions. [2018-06-27 00:08:41,665 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:08:41,665 INFO ]: Found error trace [2018-06-27 00:08:41,665 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:08:41,665 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:41,665 INFO ]: Analyzing trace with hash 579709331, now seen corresponding path program 1 times [2018-06-27 00:08:41,665 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:41,665 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:41,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:41,666 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:41,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:41,696 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:41,756 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:41,756 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:41,756 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:41,756 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:41,756 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:41,756 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:41,757 INFO ]: Start difference. First operand 7 states and 2059 transitions. Second operand 3 states. [2018-06-27 00:08:43,697 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:43,697 INFO ]: Finished difference Result 8 states and 2059 transitions. [2018-06-27 00:08:43,698 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:43,698 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:08:43,698 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:43,701 INFO ]: With dead ends: 8 [2018-06-27 00:08:43,701 INFO ]: Without dead ends: 7 [2018-06-27 00:08:43,701 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:43,701 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:08:43,710 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:08:43,710 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:43,713 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1035 transitions. [2018-06-27 00:08:43,713 INFO ]: Start accepts. Automaton has 7 states and 1035 transitions. Word has length 6 [2018-06-27 00:08:43,713 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:43,713 INFO ]: Abstraction has 7 states and 1035 transitions. [2018-06-27 00:08:43,713 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:43,713 INFO ]: Start isEmpty. Operand 7 states and 1035 transitions. [2018-06-27 00:08:43,714 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:08:43,714 INFO ]: Found error trace [2018-06-27 00:08:43,714 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:08:43,714 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:43,714 INFO ]: Analyzing trace with hash 580632852, now seen corresponding path program 1 times [2018-06-27 00:08:43,714 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:43,714 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:43,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:43,715 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:43,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:43,752 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:43,843 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:43,843 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:43,872 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:43,872 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:43,872 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:43,873 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:43,873 INFO ]: Start difference. First operand 7 states and 1035 transitions. Second operand 3 states. [2018-06-27 00:08:44,749 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:44,749 INFO ]: Finished difference Result 8 states and 1035 transitions. [2018-06-27 00:08:44,751 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:44,751 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:08:44,751 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:44,752 INFO ]: With dead ends: 8 [2018-06-27 00:08:44,752 INFO ]: Without dead ends: 7 [2018-06-27 00:08:44,752 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:44,752 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:08:44,756 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:08:44,756 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:44,757 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 779 transitions. [2018-06-27 00:08:44,757 INFO ]: Start accepts. Automaton has 7 states and 779 transitions. Word has length 6 [2018-06-27 00:08:44,757 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:44,757 INFO ]: Abstraction has 7 states and 779 transitions. [2018-06-27 00:08:44,757 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:44,757 INFO ]: Start isEmpty. Operand 7 states and 779 transitions. [2018-06-27 00:08:44,759 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:08:44,759 INFO ]: Found error trace [2018-06-27 00:08:44,759 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:08:44,759 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:44,759 INFO ]: Analyzing trace with hash -365976173, now seen corresponding path program 1 times [2018-06-27 00:08:44,759 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:44,759 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:44,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:44,760 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:44,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:44,784 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:44,915 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:44,915 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:44,915 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:44,915 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:44,915 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:44,915 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:44,915 INFO ]: Start difference. First operand 7 states and 779 transitions. Second operand 3 states. [2018-06-27 00:08:45,592 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:45,592 INFO ]: Finished difference Result 8 states and 779 transitions. [2018-06-27 00:08:45,594 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:45,594 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:08:45,594 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:45,595 INFO ]: With dead ends: 8 [2018-06-27 00:08:45,595 INFO ]: Without dead ends: 7 [2018-06-27 00:08:45,595 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:45,595 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:08:45,597 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:08:45,597 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:45,598 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 587 transitions. [2018-06-27 00:08:45,598 INFO ]: Start accepts. Automaton has 7 states and 587 transitions. Word has length 6 [2018-06-27 00:08:45,598 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:45,598 INFO ]: Abstraction has 7 states and 587 transitions. [2018-06-27 00:08:45,598 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:45,598 INFO ]: Start isEmpty. Operand 7 states and 587 transitions. [2018-06-27 00:08:45,599 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:08:45,599 INFO ]: Found error trace [2018-06-27 00:08:45,599 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:08:45,599 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:45,599 INFO ]: Analyzing trace with hash -363205610, now seen corresponding path program 1 times [2018-06-27 00:08:45,599 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:45,599 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:45,599 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:45,599 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:45,599 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:45,622 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:45,658 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:45,658 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:45,658 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:45,658 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:45,658 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:45,658 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:45,659 INFO ]: Start difference. First operand 7 states and 587 transitions. Second operand 3 states. [2018-06-27 00:08:46,154 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:46,154 INFO ]: Finished difference Result 8 states and 587 transitions. [2018-06-27 00:08:46,159 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:46,159 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:08:46,159 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:46,159 INFO ]: With dead ends: 8 [2018-06-27 00:08:46,160 INFO ]: Without dead ends: 7 [2018-06-27 00:08:46,160 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:46,160 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:08:46,161 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:08:46,162 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:46,162 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 395 transitions. [2018-06-27 00:08:46,162 INFO ]: Start accepts. Automaton has 7 states and 395 transitions. Word has length 6 [2018-06-27 00:08:46,162 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:46,162 INFO ]: Abstraction has 7 states and 395 transitions. [2018-06-27 00:08:46,162 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:46,162 INFO ]: Start isEmpty. Operand 7 states and 395 transitions. [2018-06-27 00:08:46,163 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:08:46,163 INFO ]: Found error trace [2018-06-27 00:08:46,163 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:08:46,163 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:46,163 INFO ]: Analyzing trace with hash 584326936, now seen corresponding path program 1 times [2018-06-27 00:08:46,163 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:46,163 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:46,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:46,164 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:46,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:46,174 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:46,259 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:46,259 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:46,259 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:46,260 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:46,260 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:46,260 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:46,260 INFO ]: Start difference. First operand 7 states and 395 transitions. Second operand 3 states. [2018-06-27 00:08:46,617 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:46,617 INFO ]: Finished difference Result 8 states and 395 transitions. [2018-06-27 00:08:46,617 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:46,617 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:08:46,617 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:46,618 INFO ]: With dead ends: 8 [2018-06-27 00:08:46,618 INFO ]: Without dead ends: 7 [2018-06-27 00:08:46,618 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:46,618 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:08:46,619 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:08:46,619 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:46,620 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 299 transitions. [2018-06-27 00:08:46,620 INFO ]: Start accepts. Automaton has 7 states and 299 transitions. Word has length 6 [2018-06-27 00:08:46,620 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:46,620 INFO ]: Abstraction has 7 states and 299 transitions. [2018-06-27 00:08:46,620 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:46,620 INFO ]: Start isEmpty. Operand 7 states and 299 transitions. [2018-06-27 00:08:46,620 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:08:46,620 INFO ]: Found error trace [2018-06-27 00:08:46,621 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:08:46,621 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:46,621 INFO ]: Analyzing trace with hash 111484184, now seen corresponding path program 1 times [2018-06-27 00:08:46,621 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:46,621 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:46,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:46,621 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:46,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:46,631 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:46,661 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:46,661 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:46,661 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:46,661 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:46,661 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:46,661 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:46,662 INFO ]: Start difference. First operand 7 states and 299 transitions. Second operand 3 states. [2018-06-27 00:08:46,913 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:46,913 INFO ]: Finished difference Result 8 states and 299 transitions. [2018-06-27 00:08:46,913 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:46,913 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:08:46,913 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:46,914 INFO ]: With dead ends: 8 [2018-06-27 00:08:46,914 INFO ]: Without dead ends: 7 [2018-06-27 00:08:46,914 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:46,914 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:08:46,915 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:08:46,915 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:46,916 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 227 transitions. [2018-06-27 00:08:46,916 INFO ]: Start accepts. Automaton has 7 states and 227 transitions. Word has length 6 [2018-06-27 00:08:46,916 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:46,916 INFO ]: Abstraction has 7 states and 227 transitions. [2018-06-27 00:08:46,916 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:46,916 INFO ]: Start isEmpty. Operand 7 states and 227 transitions. [2018-06-27 00:08:46,916 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:08:46,916 INFO ]: Found error trace [2018-06-27 00:08:46,916 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:08:46,916 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:46,916 INFO ]: Analyzing trace with hash -360435047, now seen corresponding path program 1 times [2018-06-27 00:08:46,916 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:46,916 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:46,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:46,917 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:46,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:46,935 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:47,068 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:47,069 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:47,069 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:47,069 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:47,069 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:47,069 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:47,069 INFO ]: Start difference. First operand 7 states and 227 transitions. Second operand 3 states. [2018-06-27 00:08:47,316 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:47,316 INFO ]: Finished difference Result 8 states and 227 transitions. [2018-06-27 00:08:47,316 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:47,316 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:08:47,316 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:47,316 INFO ]: With dead ends: 8 [2018-06-27 00:08:47,316 INFO ]: Without dead ends: 7 [2018-06-27 00:08:47,317 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:47,317 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:08:47,318 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:08:47,318 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:47,318 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2018-06-27 00:08:47,318 INFO ]: Start accepts. Automaton has 7 states and 155 transitions. Word has length 6 [2018-06-27 00:08:47,318 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:47,318 INFO ]: Abstraction has 7 states and 155 transitions. [2018-06-27 00:08:47,318 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:47,318 INFO ]: Start isEmpty. Operand 7 states and 155 transitions. [2018-06-27 00:08:47,318 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:08:47,318 INFO ]: Found error trace [2018-06-27 00:08:47,319 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:08:47,319 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:47,319 INFO ]: Analyzing trace with hash -129554797, now seen corresponding path program 1 times [2018-06-27 00:08:47,319 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:47,319 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:47,319 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:47,319 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:47,319 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:47,344 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:47,395 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:47,395 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:47,395 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:47,395 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:47,395 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:47,395 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:47,395 INFO ]: Start difference. First operand 7 states and 155 transitions. Second operand 3 states. [2018-06-27 00:08:47,526 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:47,526 INFO ]: Finished difference Result 8 states and 155 transitions. [2018-06-27 00:08:47,526 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:47,527 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:08:47,527 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:47,527 INFO ]: With dead ends: 8 [2018-06-27 00:08:47,527 INFO ]: Without dead ends: 7 [2018-06-27 00:08:47,527 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:47,527 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:08:47,528 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:08:47,528 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:47,528 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2018-06-27 00:08:47,528 INFO ]: Start accepts. Automaton has 7 states and 131 transitions. Word has length 6 [2018-06-27 00:08:47,529 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:47,529 INFO ]: Abstraction has 7 states and 131 transitions. [2018-06-27 00:08:47,529 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:47,529 INFO ]: Start isEmpty. Operand 7 states and 131 transitions. [2018-06-27 00:08:47,529 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:08:47,529 INFO ]: Found error trace [2018-06-27 00:08:47,529 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:08:47,529 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:47,529 INFO ]: Analyzing trace with hash 349752602, now seen corresponding path program 1 times [2018-06-27 00:08:47,529 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:47,529 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:47,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:47,530 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:47,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:47,559 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:47,637 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:47,637 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:08:47,637 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 00:08:47,645 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:47,682 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:47,690 INFO ]: Computing forward predicates... [2018-06-27 00:08:48,207 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:48,226 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:08:48,226 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-27 00:08:48,227 INFO ]: Interpolant automaton has 5 states [2018-06-27 00:08:48,227 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-27 00:08:48,227 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-27 00:08:48,227 INFO ]: Start difference. First operand 7 states and 131 transitions. Second operand 5 states. [2018-06-27 00:08:50,302 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:50,302 INFO ]: Finished difference Result 13 states and 137 transitions. [2018-06-27 00:08:50,302 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-27 00:08:50,302 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-27 00:08:50,302 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:50,302 INFO ]: With dead ends: 13 [2018-06-27 00:08:50,302 INFO ]: Without dead ends: 9 [2018-06-27 00:08:50,303 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-27 00:08:50,303 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 00:08:50,304 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-27 00:08:50,304 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:50,304 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2018-06-27 00:08:50,304 INFO ]: Start accepts. Automaton has 7 states and 81 transitions. Word has length 6 [2018-06-27 00:08:50,304 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:50,304 INFO ]: Abstraction has 7 states and 81 transitions. [2018-06-27 00:08:50,304 INFO ]: Interpolant automaton has 5 states. [2018-06-27 00:08:50,304 INFO ]: Start isEmpty. Operand 7 states and 81 transitions. [2018-06-27 00:08:50,305 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:08:50,305 INFO ]: Found error trace [2018-06-27 00:08:50,305 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:08:50,305 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:50,305 INFO ]: Analyzing trace with hash -10420588, now seen corresponding path program 1 times [2018-06-27 00:08:50,305 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:50,305 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:50,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:50,306 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:50,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:50,327 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:50,365 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:50,365 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:50,365 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:50,365 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:50,365 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:50,366 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:50,366 INFO ]: Start difference. First operand 7 states and 81 transitions. Second operand 3 states. [2018-06-27 00:08:50,476 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:50,477 INFO ]: Finished difference Result 8 states and 81 transitions. [2018-06-27 00:08:50,477 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:50,477 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:08:50,477 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:50,477 INFO ]: With dead ends: 8 [2018-06-27 00:08:50,477 INFO ]: Without dead ends: 7 [2018-06-27 00:08:50,477 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:50,477 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:08:50,478 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:08:50,478 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:50,478 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2018-06-27 00:08:50,478 INFO ]: Start accepts. Automaton has 7 states and 46 transitions. Word has length 6 [2018-06-27 00:08:50,478 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:50,478 INFO ]: Abstraction has 7 states and 46 transitions. [2018-06-27 00:08:50,478 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:50,478 INFO ]: Start isEmpty. Operand 7 states and 46 transitions. [2018-06-27 00:08:50,479 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:08:50,479 INFO ]: Found error trace [2018-06-27 00:08:50,479 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:08:50,479 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:50,479 INFO ]: Analyzing trace with hash 403316820, now seen corresponding path program 1 times [2018-06-27 00:08:50,479 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:50,479 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:50,479 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:50,479 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:50,479 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:50,488 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:50,592 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:50,592 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:08:50,592 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:08:50,592 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:08:50,592 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:08:50,592 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:50,592 INFO ]: Start difference. First operand 7 states and 46 transitions. Second operand 3 states. [2018-06-27 00:08:50,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:50,630 INFO ]: Finished difference Result 8 states and 46 transitions. [2018-06-27 00:08:50,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:08:50,630 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:08:50,630 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:50,631 INFO ]: With dead ends: 8 [2018-06-27 00:08:50,631 INFO ]: Without dead ends: 7 [2018-06-27 00:08:50,631 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:08:50,631 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:08:50,631 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:08:50,631 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:50,631 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2018-06-27 00:08:50,631 INFO ]: Start accepts. Automaton has 7 states and 32 transitions. Word has length 6 [2018-06-27 00:08:50,631 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:50,631 INFO ]: Abstraction has 7 states and 32 transitions. [2018-06-27 00:08:50,631 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:08:50,631 INFO ]: Start isEmpty. Operand 7 states and 32 transitions. [2018-06-27 00:08:50,632 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:08:50,632 INFO ]: Found error trace [2018-06-27 00:08:50,632 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:08:50,632 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:50,632 INFO ]: Analyzing trace with hash -748313867, now seen corresponding path program 1 times [2018-06-27 00:08:50,632 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:50,632 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:50,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:50,632 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:50,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:50,643 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:50,781 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:50,782 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:08:50,782 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-27 00:08:50,796 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 00:08:50,838 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:08:50,840 INFO ]: Computing forward predicates... [2018-06-27 00:08:51,196 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:08:51,215 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:08:51,215 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-27 00:08:51,216 INFO ]: Interpolant automaton has 6 states [2018-06-27 00:08:51,216 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-27 00:08:51,216 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-27 00:08:51,216 INFO ]: Start difference. First operand 7 states and 32 transitions. Second operand 6 states. [2018-06-27 00:08:51,355 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:08:51,355 INFO ]: Finished difference Result 12 states and 37 transitions. [2018-06-27 00:08:51,356 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 00:08:51,356 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-27 00:08:51,356 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:08:51,356 INFO ]: With dead ends: 12 [2018-06-27 00:08:51,356 INFO ]: Without dead ends: 9 [2018-06-27 00:08:51,357 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-27 00:08:51,357 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 00:08:51,358 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-27 00:08:51,358 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:08:51,358 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2018-06-27 00:08:51,358 INFO ]: Start accepts. Automaton has 7 states and 18 transitions. Word has length 6 [2018-06-27 00:08:51,358 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:08:51,358 INFO ]: Abstraction has 7 states and 18 transitions. [2018-06-27 00:08:51,358 INFO ]: Interpolant automaton has 6 states. [2018-06-27 00:08:51,358 INFO ]: Start isEmpty. Operand 7 states and 18 transitions. [2018-06-27 00:08:51,358 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:08:51,358 INFO ]: Found error trace [2018-06-27 00:08:51,358 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:08:51,358 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:08:51,358 INFO ]: Analyzing trace with hash -1149121981, now seen corresponding path program 1 times [2018-06-27 00:08:51,358 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:08:51,358 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:08:51,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:51,359 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:08:51,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:08:51,375 INFO ]: Conjunction of SSA is sat [2018-06-27 00:08:51,377 INFO ]: Counterexample might be feasible [2018-06-27 00:08:51,388 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-27 00:08:51,389 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 12:08:51 BasicIcfg [2018-06-27 00:08:51,389 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-27 00:08:51,390 INFO ]: Toolchain (without parser) took 32798.00 ms. Allocated memory was 309.3 MB in the beginning and 1.1 GB in the end (delta: 840.4 MB). Free memory was 261.8 MB in the beginning and 284.1 MB in the end (delta: -22.3 MB). Peak memory consumption was 818.1 MB. Max. memory is 3.6 GB. [2018-06-27 00:08:51,398 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-27 00:08:51,398 INFO ]: ChcToBoogie took 69.34 ms. Allocated memory is still 309.3 MB. Free memory was 261.8 MB in the beginning and 258.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-27 00:08:51,399 INFO ]: Boogie Preprocessor took 55.84 ms. Allocated memory is still 309.3 MB. Free memory was 258.8 MB in the beginning and 257.8 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-27 00:08:51,399 INFO ]: RCFGBuilder took 340.50 ms. Allocated memory is still 309.3 MB. Free memory was 257.8 MB in the beginning and 243.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-27 00:08:51,400 INFO ]: BlockEncodingV2 took 13265.28 ms. Allocated memory was 309.3 MB in the beginning and 815.8 MB in the end (delta: 506.5 MB). Free memory was 243.8 MB in the beginning and 591.6 MB in the end (delta: -347.8 MB). Peak memory consumption was 452.7 MB. Max. memory is 3.6 GB. [2018-06-27 00:08:51,400 INFO ]: TraceAbstraction took 19054.09 ms. Allocated memory was 815.8 MB in the beginning and 1.1 GB in the end (delta: 334.0 MB). Free memory was 591.6 MB in the beginning and 284.1 MB in the end (delta: 307.4 MB). Peak memory consumption was 641.4 MB. Max. memory is 3.6 GB. [2018-06-27 00:08:51,404 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, 2058 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 69.34 ms. Allocated memory is still 309.3 MB. Free memory was 261.8 MB in the beginning and 258.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 55.84 ms. Allocated memory is still 309.3 MB. Free memory was 258.8 MB in the beginning and 257.8 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 340.50 ms. Allocated memory is still 309.3 MB. Free memory was 257.8 MB in the beginning and 243.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 13265.28 ms. Allocated memory was 309.3 MB in the beginning and 815.8 MB in the end (delta: 506.5 MB). Free memory was 243.8 MB in the beginning and 591.6 MB in the end (delta: -347.8 MB). Peak memory consumption was 452.7 MB. Max. memory is 3.6 GB. * TraceAbstraction took 19054.09 ms. Allocated memory was 815.8 MB in the beginning and 1.1 GB in the end (delta: 334.0 MB). Free memory was 591.6 MB in the beginning and 284.1 MB in the end (delta: 307.4 MB). Peak memory consumption was 641.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, false, false, false, 0, 0, 0, 0, 0, 0, 0, false, false, 0, false, false, false, false, false, false, false); [L0] assume !hbv_False_1_Bool; [L0] hhv_state_0_Int, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Bool, hhv_state_4_Int, hhv_state_5_Int, hhv_state_6_Int, hhv_state_7_Int, hhv_state_8_Int, hhv_state_9_Int, hhv_state_10_Int, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Int, hhv_state_14_Bool, hhv_state_15_Bool, hhv_state_16_Bool, hhv_state_17_Bool, hhv_state_18_Bool, hhv_state_19_Bool, hhv_state_20_Bool := hbv_False_2_Int, hbv_False_3_Bool, hbv_False_4_Bool, hbv_False_5_Bool, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int, hbv_False_13_Bool, hbv_False_14_Bool, hbv_False_15_Int, hbv_False_16_Bool, hbv_False_17_Bool, hbv_False_18_Bool, hbv_False_19_Bool, hbv_False_1_Bool, hbv_False_20_Bool, hbv_False_21_Bool; [L0] havoc hbv_False_2_Int, hbv_False_11_Int, hbv_False_12_Int, hbv_False_4_Bool, hbv_False_8_Int, hbv_False_5_Bool, hbv_False_21_Bool, hbv_False_10_Int, hbv_False_13_Bool, hbv_False_18_Bool, hbv_False_7_Int, hbv_False_9_Int, hbv_False_14_Bool, hbv_False_1_Bool, hbv_False_20_Bool, hbv_False_19_Bool, hbv_False_16_Bool, hbv_False_17_Bool, hbv_False_15_Int, hbv_False_6_Int, hbv_False_3_Bool; [L0] assume ((((((((((((((((((((((((((((((((((((((!(((hbv_state_2_Bool && !hhv_state_17_Bool) || hhv_state_3_Bool) && ((!hhv_state_3_Bool || !hbv_state_2_Bool) || hhv_state_17_Bool)) && hhv_state_7_Int == hhv_state_10_Int) && hbv_state_8_Int == hhv_state_0_Int) && hbv_state_15_Int == hbv_state_13_Int) && hbv_state_19_Int == hbv_state_14_Int) && !(!(hbv_state_13_Int == hbv_state_14_Int) && (!hbv_state_5_Bool || !hbv_state_4_Bool))) && hbv_state_15_Int == hbv_state_8_Int) && !(!(hhv_state_8_Int == hhv_state_13_Int) && (!hhv_state_15_Bool || hhv_state_14_Bool))) && !((!hhv_state_15_Bool || !hhv_state_14_Bool) && !(hhv_state_5_Int == hhv_state_6_Int))) && hhv_state_4_Int == hhv_state_7_Int) && !((hbv_state_4_Bool || !hbv_state_5_Bool) && !(hbv_state_6_Int == hbv_state_7_Int))) && hhv_state_6_Int == hhv_state_0_Int) && !((!hhv_state_16_Bool || !hhv_state_11_Bool) && (hhv_state_16_Bool || hhv_state_11_Bool))) && hhv_state_5_Int == hhv_state_4_Int) && !((!(hhv_state_8_Int == 1) && !hhv_state_14_Bool) && hhv_state_15_Bool)) && !((!hhv_state_18_Bool || !hhv_state_3_Bool) && (hhv_state_3_Bool || hhv_state_18_Bool))) && !(!(hhv_state_13_Int == 0) && (!hhv_state_14_Bool || hhv_state_15_Bool))) && !((hhv_state_1_Bool || hhv_state_12_Bool) && (!hhv_state_1_Bool || !hhv_state_12_Bool))) && hhv_state_9_Int == hhv_state_8_Int) && !((!hbv_state_10_Bool || !hbv_state_11_Bool) && (hbv_state_10_Bool || hbv_state_11_Bool))) && !(((hhv_state_19_Bool || 10 <= hhv_state_10_Int) && !hbv_state_3_Bool) && (!hhv_state_19_Bool || !(10 <= hhv_state_10_Int)))) && !(((!(hhv_state_10_Int <= -10) || !hhv_state_20_Bool) && (hhv_state_20_Bool || hhv_state_10_Int <= -10)) && !hbv_state_1_Bool)) && hbv_state_6_Int == hbv_state_18_Int) && !(!(hbv_state_7_Int == 0) && (hbv_state_5_Bool || !hbv_state_4_Bool))) && !((!hhv_state_12_Bool || !hhv_state_17_Bool) && (hhv_state_17_Bool || hhv_state_12_Bool))) && !((hbv_state_5_Bool && !hbv_state_4_Bool) && !(hbv_state_6_Int == 1))) && hbv_state_8_Int == hbv_state_9_Int) && !(((!(hhv_state_10_Int <= 0) || hhv_state_19_Bool) && hbv_state_3_Bool) && (hhv_state_10_Int <= 0 || !hhv_state_19_Bool))) && !((hbv_state_4_Bool && !hbv_state_5_Bool) && !(hbv_state_7_Int == 2))) && !(((hhv_state_20_Bool || !(0 <= hhv_state_10_Int)) && hbv_state_1_Bool) && (0 <= hhv_state_10_Int || !hhv_state_20_Bool))) && !((hbv_state_3_Bool || hbv_state_12_Bool) && (!hbv_state_3_Bool || !hbv_state_12_Bool))) && !((!hbv_state_17_Bool || !hbv_state_1_Bool) && (hbv_state_1_Bool || hbv_state_17_Bool))) && !((!hhv_state_2_Bool || !hhv_state_11_Bool) && (hhv_state_11_Bool || hhv_state_2_Bool))) && !((!(hhv_state_13_Int == 2) && !hhv_state_15_Bool) && hhv_state_14_Bool)) && !((!(hhv_state_5_Int + (-1 * hhv_state_6_Int + -1 * hhv_state_9_Int) == 0) && hhv_state_14_Bool) && hhv_state_15_Bool)) && !((!hhv_state_19_Bool || !hhv_state_2_Bool) && (hhv_state_2_Bool || hhv_state_19_Bool))) && !((hbv_state_1_Bool || hbv_state_16_Bool) && (!hbv_state_16_Bool || !hbv_state_1_Bool))) && !((hbv_state_4_Bool && hbv_state_5_Bool) && !(hbv_state_13_Int + (-1 * hbv_state_14_Int + -1 * hbv_state_18_Int) == 0))) && !((hhv_state_20_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_20_Bool))) && !((hbv_state_2_Bool || hbv_state_3_Bool) && (!hbv_state_3_Bool || !hbv_state_2_Bool)); [L0] hhv_state_0_Int, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Bool, hhv_state_4_Int, hhv_state_5_Int, hhv_state_6_Int, hhv_state_7_Int, hhv_state_8_Int, hhv_state_9_Int, hhv_state_10_Int, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Int, hhv_state_14_Bool, hhv_state_15_Bool, hhv_state_16_Bool, hhv_state_17_Bool, hhv_state_18_Bool, hhv_state_19_Bool, hhv_state_20_Bool := hbv_state_19_Int, hbv_state_17_Bool, hbv_state_12_Bool, hbv_state_10_Bool, hbv_state_15_Int, hbv_state_13_Int, hbv_state_14_Int, hbv_state_8_Int, hbv_state_6_Int, hbv_state_18_Int, hbv_state_9_Int, hbv_state_3_Bool, hbv_state_1_Bool, hbv_state_7_Int, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_2_Bool, hbv_state_16_Bool, hbv_state_11_Bool, hbv_state_20_Bool, hbv_state_21_Bool; [L0] havoc hbv_state_8_Int, hbv_state_3_Bool, hbv_state_18_Int, hbv_state_10_Bool, hbv_state_15_Int, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_12_Bool, hbv_state_6_Int, hbv_state_21_Bool, hbv_state_16_Bool, hbv_state_13_Int, hbv_state_9_Int, hbv_state_17_Bool, hbv_state_11_Bool, hbv_state_14_Int, hbv_state_20_Bool, hbv_state_2_Bool, hbv_state_19_Int, hbv_state_7_Int, hbv_state_1_Bool; [L0] RET call gotoProc(0, 0, false, false, false, 0, 0, 0, 0, 0, 0, 0, false, false, 0, false, false, false, false, false, false, false); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. UNSAFE Result, 18.9s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 16.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11982 SDtfs, 3 SDslu, 63 SDs, 0 SdLazy, 6009 SolverSat, 6252 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=2, 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, 15 MinimizatonAttempts, 8 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 787 SizeOfPredicates, 6 NumberOfNonLiveVariables, 382 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 10/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8_e8_220.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-27_00-08-51-415.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8_e8_220.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-27_00-08-51-415.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8_e8_220.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-27_00-08-51-415.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8_e8_220.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-27_00-08-51-415.csv Received shutdown request...