java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 03:45:56,173 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 03:45:56,175 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 03:45:56,190 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 03:45:56,191 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 03:45:56,192 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 03:45:56,193 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 03:45:56,196 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 03:45:56,198 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 03:45:56,198 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 03:45:56,200 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 03:45:56,200 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 03:45:56,201 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 03:45:56,202 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 03:45:56,202 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 03:45:56,205 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 03:45:56,207 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 03:45:56,217 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 03:45:56,218 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 03:45:56,219 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 03:45:56,220 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 03:45:56,222 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 03:45:56,222 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 03:45:56,223 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 03:45:56,227 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 03:45:56,228 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 03:45:56,229 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 03:45:56,229 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 03:45:56,233 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 03:45:56,234 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 03:45:56,234 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 03:45:56,235 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 03:45:56,235 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 03:45:56,237 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 03:45:56,238 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 03:45:56,238 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 03:45:56,258 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 03:45:56,259 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 03:45:56,259 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 03:45:56,259 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 03:45:56,260 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 03:45:56,260 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 03:45:56,261 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 03:45:56,261 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 03:45:56,261 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 03:45:56,261 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 03:45:56,261 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 03:45:56,262 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 03:45:56,262 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 03:45:56,262 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 03:45:56,262 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 03:45:56,262 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 03:45:56,263 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 03:45:56,263 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 03:45:56,263 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 03:45:56,263 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 03:45:56,263 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 03:45:56,266 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 03:45:56,266 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 03:45:56,320 INFO ]: Repository-Root is: /tmp [2018-06-25 03:45:56,338 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 03:45:56,343 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 03:45:56,345 INFO ]: Initializing SmtParser... [2018-06-25 03:45:56,345 INFO ]: SmtParser initialized [2018-06-25 03:45:56,346 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3.smt2 [2018-06-25 03:45:56,347 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 03:45:56,436 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3.smt2 unknown [2018-06-25 03:45:56,694 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3.smt2 [2018-06-25 03:45:56,698 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 03:45:56,705 INFO ]: Walking toolchain with 5 elements. [2018-06-25 03:45:56,705 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 03:45:56,705 INFO ]: Initializing ChcToBoogie... [2018-06-25 03:45:56,705 INFO ]: ChcToBoogie initialized [2018-06-25 03:45:56,711 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:45:56" (1/1) ... [2018-06-25 03:45:56,773 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:56 Unit [2018-06-25 03:45:56,773 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 03:45:56,774 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 03:45:56,774 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 03:45:56,774 INFO ]: Boogie Preprocessor initialized [2018-06-25 03:45:56,795 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:56" (1/1) ... [2018-06-25 03:45:56,795 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:56" (1/1) ... [2018-06-25 03:45:56,803 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:56" (1/1) ... [2018-06-25 03:45:56,804 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:56" (1/1) ... [2018-06-25 03:45:56,818 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:56" (1/1) ... [2018-06-25 03:45:56,827 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:56" (1/1) ... [2018-06-25 03:45:56,829 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:56" (1/1) ... [2018-06-25 03:45:56,831 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 03:45:56,835 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 03:45:56,835 INFO ]: Initializing RCFGBuilder... [2018-06-25 03:45:56,835 INFO ]: RCFGBuilder initialized [2018-06-25 03:45:56,836 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:56" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 03:45:56,849 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 03:45:56,849 INFO ]: Found specification of procedure gotoProc [2018-06-25 03:45:56,849 INFO ]: Found implementation of procedure gotoProc [2018-06-25 03:45:56,849 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 03:45:56,849 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 03:45:56,849 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 03:45:57,150 INFO ]: Using library mode [2018-06-25 03:45:57,150 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:45:57 BoogieIcfgContainer [2018-06-25 03:45:57,150 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 03:45:57,151 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 03:45:57,151 INFO ]: Initializing BlockEncodingV2... [2018-06-25 03:45:57,152 INFO ]: BlockEncodingV2 initialized [2018-06-25 03:45:57,152 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:45:57" (1/1) ... [2018-06-25 03:45:57,167 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 03:45:57,168 INFO ]: Using Remove infeasible edges [2018-06-25 03:45:57,169 INFO ]: Using Maximize final states [2018-06-25 03:45:57,169 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 03:45:57,169 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 03:45:57,171 INFO ]: Using Remove sink states [2018-06-25 03:45:57,172 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 03:45:57,172 INFO ]: Using Use SBE [2018-06-25 03:45:57,177 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 03:45:59,275 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 03:45:59,903 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 03:46:00,140 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 03:46:00,142 INFO ]: SBE split 2 edges [2018-06-25 03:46:00,169 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 03:46:00,174 INFO ]: 0 new accepting states [2018-06-25 03:46:12,782 INFO ]: Removed 2067 edges and 2 locations by large block encoding [2018-06-25 03:46:12,784 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:46:12,799 INFO ]: Removed 12 edges and 0 locations because of local infeasibility [2018-06-25 03:46:12,800 INFO ]: 0 new accepting states [2018-06-25 03:46:12,802 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 03:46:12,803 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:46:12,809 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 03:46:12,810 INFO ]: 0 new accepting states [2018-06-25 03:46:12,811 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 03:46:12,812 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:46:12,827 INFO ]: Encoded RCFG 6 locations, 2057 edges [2018-06-25 03:46:12,828 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 03:46:12 BasicIcfg [2018-06-25 03:46:12,828 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 03:46:12,829 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 03:46:12,829 INFO ]: Initializing TraceAbstraction... [2018-06-25 03:46:12,832 INFO ]: TraceAbstraction initialized [2018-06-25 03:46:12,832 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:45:56" (1/4) ... [2018-06-25 03:46:12,833 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efb882d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 03:46:12, skipping insertion in model container [2018-06-25 03:46:12,833 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:56" (2/4) ... [2018-06-25 03:46:12,833 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efb882d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 03:46:12, skipping insertion in model container [2018-06-25 03:46:12,833 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:45:57" (3/4) ... [2018-06-25 03:46:12,834 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efb882d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 03:46:12, skipping insertion in model container [2018-06-25 03:46:12,834 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 03:46:12" (4/4) ... [2018-06-25 03:46:12,835 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 03:46:12,846 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 03:46:12,855 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 03:46:12,917 INFO ]: Using default assertion order modulation [2018-06-25 03:46:12,917 INFO ]: Interprodecural is true [2018-06-25 03:46:12,917 INFO ]: Hoare is false [2018-06-25 03:46:12,917 INFO ]: Compute interpolants for FPandBP [2018-06-25 03:46:12,917 INFO ]: Backedges is TWOTRACK [2018-06-25 03:46:12,917 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 03:46:12,917 INFO ]: Difference is false [2018-06-25 03:46:12,917 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 03:46:12,917 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 03:46:12,941 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 03:46:12,965 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 03:46:12,965 INFO ]: Found error trace [2018-06-25 03:46:12,967 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 03:46:12,967 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:12,972 INFO ]: Analyzing trace with hash 161085986, now seen corresponding path program 1 times [2018-06-25 03:46:12,974 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:12,975 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:13,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:13,022 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:13,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:13,079 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:13,207 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:13,209 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:13,209 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:13,211 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:13,226 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:13,226 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:13,229 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 03:46:16,389 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:16,389 INFO ]: Finished difference Result 8 states and 2061 transitions. [2018-06-25 03:46:16,390 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:16,390 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 03:46:16,391 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:16,406 INFO ]: With dead ends: 8 [2018-06-25 03:46:16,406 INFO ]: Without dead ends: 8 [2018-06-25 03:46:16,408 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:16,427 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:46:16,495 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-25 03:46:16,497 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:16,501 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2060 transitions. [2018-06-25 03:46:16,503 INFO ]: Start accepts. Automaton has 7 states and 2060 transitions. Word has length 5 [2018-06-25 03:46:16,504 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:16,504 INFO ]: Abstraction has 7 states and 2060 transitions. [2018-06-25 03:46:16,504 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:16,504 INFO ]: Start isEmpty. Operand 7 states and 2060 transitions. [2018-06-25 03:46:16,505 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 03:46:16,505 INFO ]: Found error trace [2018-06-25 03:46:16,505 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 03:46:16,505 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:16,506 INFO ]: Analyzing trace with hash 161087908, now seen corresponding path program 1 times [2018-06-25 03:46:16,506 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:16,506 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:16,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:16,508 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:16,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:16,518 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:16,549 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:16,549 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:16,549 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:16,550 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:16,550 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:16,550 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:16,550 INFO ]: Start difference. First operand 7 states and 2060 transitions. Second operand 3 states. [2018-06-25 03:46:18,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:18,990 INFO ]: Finished difference Result 8 states and 2059 transitions. [2018-06-25 03:46:18,991 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:18,991 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 03:46:18,991 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:18,993 INFO ]: With dead ends: 8 [2018-06-25 03:46:18,993 INFO ]: Without dead ends: 8 [2018-06-25 03:46:18,994 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:18,994 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:46:19,006 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-25 03:46:19,006 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:19,011 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 03:46:19,011 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 03:46:19,012 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:19,012 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 03:46:19,012 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:19,012 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 03:46:19,013 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:19,013 INFO ]: Found error trace [2018-06-25 03:46:19,013 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:19,013 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:19,013 INFO ]: Analyzing trace with hash 579710292, now seen corresponding path program 1 times [2018-06-25 03:46:19,013 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:19,013 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:19,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:19,014 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:19,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:19,056 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:19,155 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:19,155 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:19,155 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:19,156 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:19,156 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:19,156 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:19,156 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 03:46:21,715 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:21,715 INFO ]: Finished difference Result 8 states and 2058 transitions. [2018-06-25 03:46:21,715 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:21,715 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:21,715 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:21,717 INFO ]: With dead ends: 8 [2018-06-25 03:46:21,717 INFO ]: Without dead ends: 7 [2018-06-25 03:46:21,717 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:21,717 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:46:21,726 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:46:21,726 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:21,730 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1546 transitions. [2018-06-25 03:46:21,730 INFO ]: Start accepts. Automaton has 7 states and 1546 transitions. Word has length 6 [2018-06-25 03:46:21,730 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:21,730 INFO ]: Abstraction has 7 states and 1546 transitions. [2018-06-25 03:46:21,730 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:21,730 INFO ]: Start isEmpty. Operand 7 states and 1546 transitions. [2018-06-25 03:46:21,731 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:21,731 INFO ]: Found error trace [2018-06-25 03:46:21,731 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:21,731 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:21,731 INFO ]: Analyzing trace with hash 580633813, now seen corresponding path program 1 times [2018-06-25 03:46:21,731 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:21,731 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:21,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:21,732 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:21,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:21,763 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:21,803 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:21,804 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:21,804 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:21,804 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:21,804 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:21,804 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:21,804 INFO ]: Start difference. First operand 7 states and 1546 transitions. Second operand 3 states. [2018-06-25 03:46:23,113 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:23,113 INFO ]: Finished difference Result 8 states and 1546 transitions. [2018-06-25 03:46:23,113 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:23,113 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:23,113 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:23,115 INFO ]: With dead ends: 8 [2018-06-25 03:46:23,115 INFO ]: Without dead ends: 7 [2018-06-25 03:46:23,115 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:23,115 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:46:23,118 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:46:23,118 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:23,119 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 522 transitions. [2018-06-25 03:46:23,119 INFO ]: Start accepts. Automaton has 7 states and 522 transitions. Word has length 6 [2018-06-25 03:46:23,119 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:23,119 INFO ]: Abstraction has 7 states and 522 transitions. [2018-06-25 03:46:23,119 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:23,119 INFO ]: Start isEmpty. Operand 7 states and 522 transitions. [2018-06-25 03:46:23,120 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:23,120 INFO ]: Found error trace [2018-06-25 03:46:23,120 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:23,121 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:23,121 INFO ]: Analyzing trace with hash -365975212, now seen corresponding path program 1 times [2018-06-25 03:46:23,121 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:23,121 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:23,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:23,122 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:23,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:23,155 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:23,184 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:23,184 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:23,184 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:23,184 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:23,184 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:23,184 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:23,184 INFO ]: Start difference. First operand 7 states and 522 transitions. Second operand 3 states. [2018-06-25 03:46:23,606 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:23,606 INFO ]: Finished difference Result 8 states and 522 transitions. [2018-06-25 03:46:23,606 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:23,606 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:23,607 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:23,607 INFO ]: With dead ends: 8 [2018-06-25 03:46:23,607 INFO ]: Without dead ends: 7 [2018-06-25 03:46:23,607 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:23,607 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:46:23,609 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:46:23,609 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:23,610 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 394 transitions. [2018-06-25 03:46:23,610 INFO ]: Start accepts. Automaton has 7 states and 394 transitions. Word has length 6 [2018-06-25 03:46:23,610 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:23,610 INFO ]: Abstraction has 7 states and 394 transitions. [2018-06-25 03:46:23,610 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:23,610 INFO ]: Start isEmpty. Operand 7 states and 394 transitions. [2018-06-25 03:46:23,611 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:23,611 INFO ]: Found error trace [2018-06-25 03:46:23,611 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:23,611 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:23,611 INFO ]: Analyzing trace with hash -838817964, now seen corresponding path program 1 times [2018-06-25 03:46:23,611 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:23,611 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:23,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:23,612 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:23,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:23,637 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:23,694 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:23,694 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:23,694 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:23,694 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:23,694 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:23,694 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:23,695 INFO ]: Start difference. First operand 7 states and 394 transitions. Second operand 3 states. [2018-06-25 03:46:24,018 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:24,019 INFO ]: Finished difference Result 8 states and 394 transitions. [2018-06-25 03:46:24,047 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:24,048 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:24,048 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:24,048 INFO ]: With dead ends: 8 [2018-06-25 03:46:24,048 INFO ]: Without dead ends: 7 [2018-06-25 03:46:24,049 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:24,049 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:46:24,050 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:46:24,050 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:24,051 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 330 transitions. [2018-06-25 03:46:24,051 INFO ]: Start accepts. Automaton has 7 states and 330 transitions. Word has length 6 [2018-06-25 03:46:24,051 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:24,051 INFO ]: Abstraction has 7 states and 330 transitions. [2018-06-25 03:46:24,051 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:24,051 INFO ]: Start isEmpty. Operand 7 states and 330 transitions. [2018-06-25 03:46:24,063 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:24,063 INFO ]: Found error trace [2018-06-25 03:46:24,063 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:24,063 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:24,063 INFO ]: Analyzing trace with hash -837894443, now seen corresponding path program 1 times [2018-06-25 03:46:24,063 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:24,063 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:24,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:24,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:24,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:24,091 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:24,132 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:24,132 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:24,132 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:24,132 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:24,132 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:24,133 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:24,133 INFO ]: Start difference. First operand 7 states and 330 transitions. Second operand 3 states. [2018-06-25 03:46:24,401 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:24,401 INFO ]: Finished difference Result 8 states and 330 transitions. [2018-06-25 03:46:24,404 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:24,404 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:24,404 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:24,405 INFO ]: With dead ends: 8 [2018-06-25 03:46:24,405 INFO ]: Without dead ends: 7 [2018-06-25 03:46:24,405 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:24,405 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:46:24,406 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:46:24,406 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:24,407 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2018-06-25 03:46:24,407 INFO ]: Start accepts. Automaton has 7 states and 170 transitions. Word has length 6 [2018-06-25 03:46:24,407 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:24,407 INFO ]: Abstraction has 7 states and 170 transitions. [2018-06-25 03:46:24,407 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:24,407 INFO ]: Start isEmpty. Operand 7 states and 170 transitions. [2018-06-25 03:46:24,407 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:24,407 INFO ]: Found error trace [2018-06-25 03:46:24,407 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:24,407 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:24,407 INFO ]: Analyzing trace with hash 107791061, now seen corresponding path program 1 times [2018-06-25 03:46:24,407 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:24,407 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:24,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:24,410 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:24,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:24,431 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:24,473 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:24,473 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:24,473 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:24,473 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:24,473 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:24,473 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:24,474 INFO ]: Start difference. First operand 7 states and 170 transitions. Second operand 3 states. [2018-06-25 03:46:24,608 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:24,608 INFO ]: Finished difference Result 8 states and 170 transitions. [2018-06-25 03:46:24,608 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:24,608 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:24,608 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:24,609 INFO ]: With dead ends: 8 [2018-06-25 03:46:24,609 INFO ]: Without dead ends: 7 [2018-06-25 03:46:24,609 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:24,609 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:46:24,610 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:46:24,610 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:24,610 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2018-06-25 03:46:24,610 INFO ]: Start accepts. Automaton has 7 states and 106 transitions. Word has length 6 [2018-06-25 03:46:24,610 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:24,610 INFO ]: Abstraction has 7 states and 106 transitions. [2018-06-25 03:46:24,610 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:24,611 INFO ]: Start isEmpty. Operand 7 states and 106 transitions. [2018-06-25 03:46:24,611 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:24,611 INFO ]: Found error trace [2018-06-25 03:46:24,611 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:24,611 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:24,611 INFO ]: Analyzing trace with hash -484185900, now seen corresponding path program 1 times [2018-06-25 03:46:24,611 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:24,611 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:24,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:24,612 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:24,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:24,622 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:24,646 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:24,646 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:24,647 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:24,647 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:24,647 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:24,647 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:24,647 INFO ]: Start difference. First operand 7 states and 106 transitions. Second operand 3 states. [2018-06-25 03:46:24,730 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:24,730 INFO ]: Finished difference Result 8 states and 106 transitions. [2018-06-25 03:46:24,730 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:24,730 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:24,731 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:24,731 INFO ]: With dead ends: 8 [2018-06-25 03:46:24,731 INFO ]: Without dead ends: 7 [2018-06-25 03:46:24,731 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:24,731 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:46:24,732 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:46:24,732 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:24,732 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-06-25 03:46:24,732 INFO ]: Start accepts. Automaton has 7 states and 58 transitions. Word has length 6 [2018-06-25 03:46:24,732 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:24,732 INFO ]: Abstraction has 7 states and 58 transitions. [2018-06-25 03:46:24,732 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:24,732 INFO ]: Start isEmpty. Operand 7 states and 58 transitions. [2018-06-25 03:46:24,733 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:24,733 INFO ]: Found error trace [2018-06-25 03:46:24,733 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:24,733 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:24,733 INFO ]: Analyzing trace with hash -600549546, now seen corresponding path program 1 times [2018-06-25 03:46:24,733 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:24,733 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:24,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:24,733 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:24,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:24,744 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:24,788 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:24,789 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:46:24,789 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 03:46:24,796 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:24,843 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:24,852 INFO ]: Computing forward predicates... [2018-06-25 03:46:24,919 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:24,955 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:46:24,955 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 03:46:24,955 INFO ]: Interpolant automaton has 4 states [2018-06-25 03:46:24,955 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 03:46:24,955 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 03:46:24,955 INFO ]: Start difference. First operand 7 states and 58 transitions. Second operand 4 states. [2018-06-25 03:46:25,692 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:25,692 INFO ]: Finished difference Result 9 states and 59 transitions. [2018-06-25 03:46:25,692 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 03:46:25,692 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 03:46:25,692 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:25,692 INFO ]: With dead ends: 9 [2018-06-25 03:46:25,692 INFO ]: Without dead ends: 8 [2018-06-25 03:46:25,693 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 03:46:25,693 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:46:25,694 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:46:25,694 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:46:25,694 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2018-06-25 03:46:25,694 INFO ]: Start accepts. Automaton has 8 states and 43 transitions. Word has length 6 [2018-06-25 03:46:25,694 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:25,694 INFO ]: Abstraction has 8 states and 43 transitions. [2018-06-25 03:46:25,694 INFO ]: Interpolant automaton has 4 states. [2018-06-25 03:46:25,694 INFO ]: Start isEmpty. Operand 8 states and 43 transitions. [2018-06-25 03:46:25,694 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:46:25,694 INFO ]: Found error trace [2018-06-25 03:46:25,694 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:46:25,694 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:25,695 INFO ]: Analyzing trace with hash -1556154720, now seen corresponding path program 2 times [2018-06-25 03:46:25,695 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:25,695 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:25,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:25,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:25,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:25,715 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:25,983 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:25,983 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:46:25,983 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 03:46:25,997 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 03:46:26,067 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 03:46:26,067 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:26,070 INFO ]: Computing forward predicates... [2018-06-25 03:46:26,586 WARN ]: Spent 163.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-06-25 03:46:26,645 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:26,668 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:46:26,668 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 03:46:26,668 INFO ]: Interpolant automaton has 7 states [2018-06-25 03:46:26,668 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 03:46:26,668 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-25 03:46:26,668 INFO ]: Start difference. First operand 8 states and 43 transitions. Second operand 7 states. [2018-06-25 03:46:27,221 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:27,221 INFO ]: Finished difference Result 12 states and 44 transitions. [2018-06-25 03:46:27,221 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 03:46:27,221 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-25 03:46:27,221 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:27,221 INFO ]: With dead ends: 12 [2018-06-25 03:46:27,221 INFO ]: Without dead ends: 8 [2018-06-25 03:46:27,221 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-25 03:46:27,222 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:46:27,222 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:46:27,222 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:46:27,222 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2018-06-25 03:46:27,223 INFO ]: Start accepts. Automaton has 8 states and 18 transitions. Word has length 7 [2018-06-25 03:46:27,223 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:27,223 INFO ]: Abstraction has 8 states and 18 transitions. [2018-06-25 03:46:27,223 INFO ]: Interpolant automaton has 7 states. [2018-06-25 03:46:27,223 INFO ]: Start isEmpty. Operand 8 states and 18 transitions. [2018-06-25 03:46:27,223 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:46:27,223 INFO ]: Found error trace [2018-06-25 03:46:27,223 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:46:27,223 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:27,223 INFO ]: Analyzing trace with hash -1327716158, now seen corresponding path program 1 times [2018-06-25 03:46:27,223 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:27,223 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:27,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:27,224 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 03:46:27,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:27,241 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:27,852 WARN ]: Spent 535.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2018-06-25 03:46:28,034 WARN ]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 03:46:28,040 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:28,040 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:46:28,040 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 03:46:28,048 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:28,083 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:28,086 INFO ]: Computing forward predicates... [2018-06-25 03:46:28,200 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:28,220 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:46:28,220 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 03:46:28,220 INFO ]: Interpolant automaton has 7 states [2018-06-25 03:46:28,220 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 03:46:28,220 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-25 03:46:28,220 INFO ]: Start difference. First operand 8 states and 18 transitions. Second operand 7 states. [2018-06-25 03:46:28,266 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:28,266 INFO ]: Finished difference Result 10 states and 19 transitions. [2018-06-25 03:46:28,266 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 03:46:28,266 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-25 03:46:28,267 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:28,267 INFO ]: With dead ends: 10 [2018-06-25 03:46:28,267 INFO ]: Without dead ends: 8 [2018-06-25 03:46:28,267 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-25 03:46:28,267 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:46:28,268 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:46:28,268 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:46:28,268 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-06-25 03:46:28,268 INFO ]: Start accepts. Automaton has 8 states and 17 transitions. Word has length 7 [2018-06-25 03:46:28,268 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:28,268 INFO ]: Abstraction has 8 states and 17 transitions. [2018-06-25 03:46:28,268 INFO ]: Interpolant automaton has 7 states. [2018-06-25 03:46:28,268 INFO ]: Start isEmpty. Operand 8 states and 17 transitions. [2018-06-25 03:46:28,268 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:46:28,268 INFO ]: Found error trace [2018-06-25 03:46:28,269 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:46:28,269 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:28,269 INFO ]: Analyzing trace with hash 2133437883, now seen corresponding path program 1 times [2018-06-25 03:46:28,269 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:28,269 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:28,269 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:28,269 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:28,269 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:28,298 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:28,487 WARN ]: Spent 125.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2018-06-25 03:46:28,504 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:28,504 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:46:28,504 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 03:46:28,510 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:28,544 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:28,546 INFO ]: Computing forward predicates... [2018-06-25 03:46:28,713 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:28,733 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:46:28,733 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 03:46:28,733 INFO ]: Interpolant automaton has 8 states [2018-06-25 03:46:28,733 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 03:46:28,733 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-25 03:46:28,734 INFO ]: Start difference. First operand 8 states and 17 transitions. Second operand 8 states. [2018-06-25 03:46:28,873 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:28,873 INFO ]: Finished difference Result 11 states and 19 transitions. [2018-06-25 03:46:28,873 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 03:46:28,873 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 03:46:28,873 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:28,873 INFO ]: With dead ends: 11 [2018-06-25 03:46:28,873 INFO ]: Without dead ends: 8 [2018-06-25 03:46:28,874 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-25 03:46:28,874 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:46:28,874 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:46:28,874 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:46:28,875 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2018-06-25 03:46:28,875 INFO ]: Start accepts. Automaton has 8 states and 15 transitions. Word has length 7 [2018-06-25 03:46:28,875 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:28,875 INFO ]: Abstraction has 8 states and 15 transitions. [2018-06-25 03:46:28,875 INFO ]: Interpolant automaton has 8 states. [2018-06-25 03:46:28,875 INFO ]: Start isEmpty. Operand 8 states and 15 transitions. [2018-06-25 03:46:28,875 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:46:28,875 INFO ]: Found error trace [2018-06-25 03:46:28,875 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:46:28,875 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:28,875 INFO ]: Analyzing trace with hash 1675371467, now seen corresponding path program 1 times [2018-06-25 03:46:28,875 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:28,875 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:28,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:28,876 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:28,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:28,886 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:28,937 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 03:46:28,937 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:28,937 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:28,937 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:28,937 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:28,937 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:28,937 INFO ]: Start difference. First operand 8 states and 15 transitions. Second operand 3 states. [2018-06-25 03:46:28,947 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:28,947 INFO ]: Finished difference Result 9 states and 15 transitions. [2018-06-25 03:46:28,947 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:28,947 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 03:46:28,947 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:28,947 INFO ]: With dead ends: 9 [2018-06-25 03:46:28,947 INFO ]: Without dead ends: 8 [2018-06-25 03:46:28,947 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:28,947 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:46:28,948 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:46:28,948 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:46:28,948 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-06-25 03:46:28,948 INFO ]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 7 [2018-06-25 03:46:28,948 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:28,948 INFO ]: Abstraction has 8 states and 12 transitions. [2018-06-25 03:46:28,948 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:28,948 INFO ]: Start isEmpty. Operand 8 states and 12 transitions. [2018-06-25 03:46:28,948 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:46:28,948 INFO ]: Found error trace [2018-06-25 03:46:28,949 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:46:28,949 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:28,949 INFO ]: Analyzing trace with hash -869055096, now seen corresponding path program 1 times [2018-06-25 03:46:28,949 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:28,949 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:28,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:28,949 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:28,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:28,962 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:29,149 WARN ]: Spent 136.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2018-06-25 03:46:29,171 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:29,171 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:46:29,171 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 03:46:29,180 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:29,212 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:29,214 INFO ]: Computing forward predicates... [2018-06-25 03:46:29,298 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:29,317 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:46:29,317 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 03:46:29,317 INFO ]: Interpolant automaton has 8 states [2018-06-25 03:46:29,317 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 03:46:29,317 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-25 03:46:29,318 INFO ]: Start difference. First operand 8 states and 12 transitions. Second operand 8 states. [2018-06-25 03:46:29,374 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:29,374 INFO ]: Finished difference Result 4 states and 3 transitions. [2018-06-25 03:46:29,374 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 03:46:29,374 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 03:46:29,374 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:29,374 INFO ]: With dead ends: 4 [2018-06-25 03:46:29,374 INFO ]: Without dead ends: 0 [2018-06-25 03:46:29,374 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-25 03:46:29,375 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 03:46:29,375 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 03:46:29,375 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 03:46:29,375 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 03:46:29,375 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-25 03:46:29,375 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:29,375 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 03:46:29,375 INFO ]: Interpolant automaton has 8 states. [2018-06-25 03:46:29,375 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 03:46:29,375 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 03:46:29,377 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 03:46:29,378 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 03:46:29 BasicIcfg [2018-06-25 03:46:29,378 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 03:46:29,379 INFO ]: Toolchain (without parser) took 32680.95 ms. Allocated memory was 308.3 MB in the beginning and 1.1 GB in the end (delta: 741.9 MB). Free memory was 260.6 MB in the beginning and 252.3 MB in the end (delta: 8.3 MB). Peak memory consumption was 750.1 MB. Max. memory is 3.6 GB. [2018-06-25 03:46:29,380 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 03:46:29,380 INFO ]: ChcToBoogie took 68.32 ms. Allocated memory is still 308.3 MB. Free memory was 260.6 MB in the beginning and 257.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:46:29,381 INFO ]: Boogie Preprocessor took 56.27 ms. Allocated memory is still 308.3 MB. Free memory was 257.6 MB in the beginning and 256.6 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:46:29,381 INFO ]: RCFGBuilder took 315.16 ms. Allocated memory is still 308.3 MB. Free memory was 256.6 MB in the beginning and 242.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:46:29,382 INFO ]: BlockEncodingV2 took 15677.39 ms. Allocated memory was 308.3 MB in the beginning and 740.3 MB in the end (delta: 432.0 MB). Free memory was 242.6 MB in the beginning and 390.5 MB in the end (delta: -148.0 MB). Peak memory consumption was 404.9 MB. Max. memory is 3.6 GB. [2018-06-25 03:46:29,382 INFO ]: TraceAbstraction took 16549.58 ms. Allocated memory was 740.3 MB in the beginning and 1.1 GB in the end (delta: 309.9 MB). Free memory was 390.5 MB in the beginning and 252.3 MB in the end (delta: 138.2 MB). Peak memory consumption was 448.1 MB. Max. memory is 3.6 GB. [2018-06-25 03:46:29,386 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, 2057 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 68.32 ms. Allocated memory is still 308.3 MB. Free memory was 260.6 MB in the beginning and 257.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 56.27 ms. Allocated memory is still 308.3 MB. Free memory was 257.6 MB in the beginning and 256.6 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 315.16 ms. Allocated memory is still 308.3 MB. Free memory was 256.6 MB in the beginning and 242.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 15677.39 ms. Allocated memory was 308.3 MB in the beginning and 740.3 MB in the end (delta: 432.0 MB). Free memory was 242.6 MB in the beginning and 390.5 MB in the end (delta: -148.0 MB). Peak memory consumption was 404.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 16549.58 ms. Allocated memory was 740.3 MB in the beginning and 1.1 GB in the end (delta: 309.9 MB). Free memory was 390.5 MB in the beginning and 252.3 MB in the end (delta: 138.2 MB). Peak memory consumption was 448.1 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 16.4s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 12.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9369 SDtfs, 2 SDslu, 84 SDs, 0 SdLazy, 4398 SolverSat, 5228 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=10, 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, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 1857 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1279 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 10/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_03-46-29-399.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_03-46-29-399.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_03-46-29-399.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_03-46-29-399.csv Received shutdown request...