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_e8_120.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 03:44:44,089 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 03:44:44,090 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 03:44:44,112 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 03:44:44,112 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 03:44:44,113 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 03:44:44,117 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 03:44:44,119 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 03:44:44,120 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 03:44:44,122 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 03:44:44,123 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 03:44:44,123 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 03:44:44,124 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 03:44:44,125 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 03:44:44,125 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 03:44:44,129 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 03:44:44,131 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 03:44:44,133 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 03:44:44,135 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 03:44:44,135 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 03:44:44,136 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 03:44:44,139 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 03:44:44,139 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 03:44:44,139 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 03:44:44,140 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 03:44:44,141 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 03:44:44,141 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 03:44:44,142 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 03:44:44,143 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 03:44:44,143 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 03:44:44,144 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 03:44:44,145 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 03:44:44,145 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 03:44:44,146 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 03:44:44,146 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 03:44:44,146 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:44:44,160 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 03:44:44,160 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 03:44:44,160 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 03:44:44,160 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 03:44:44,161 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 03:44:44,162 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 03:44:44,162 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 03:44:44,162 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 03:44:44,162 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 03:44:44,162 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 03:44:44,163 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 03:44:44,163 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 03:44:44,163 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 03:44:44,163 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 03:44:44,163 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 03:44:44,164 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 03:44:44,164 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 03:44:44,164 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 03:44:44,164 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 03:44:44,164 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 03:44:44,164 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 03:44:44,166 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 03:44:44,166 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 03:44:44,221 INFO ]: Repository-Root is: /tmp [2018-06-25 03:44:44,239 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 03:44:44,247 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 03:44:44,249 INFO ]: Initializing SmtParser... [2018-06-25 03:44:44,249 INFO ]: SmtParser initialized [2018-06-25 03:44:44,250 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e8_120.smt2 [2018-06-25 03:44:44,251 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:44:44,340 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e8_120.smt2 unknown [2018-06-25 03:44:44,597 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e8_120.smt2 [2018-06-25 03:44:44,601 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 03:44:44,606 INFO ]: Walking toolchain with 5 elements. [2018-06-25 03:44:44,606 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 03:44:44,606 INFO ]: Initializing ChcToBoogie... [2018-06-25 03:44:44,607 INFO ]: ChcToBoogie initialized [2018-06-25 03:44:44,610 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:44:44" (1/1) ... [2018-06-25 03:44:44,669 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:44 Unit [2018-06-25 03:44:44,669 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 03:44:44,670 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 03:44:44,670 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 03:44:44,670 INFO ]: Boogie Preprocessor initialized [2018-06-25 03:44:44,691 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:44" (1/1) ... [2018-06-25 03:44:44,692 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:44" (1/1) ... [2018-06-25 03:44:44,699 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:44" (1/1) ... [2018-06-25 03:44:44,699 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:44" (1/1) ... [2018-06-25 03:44:44,706 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:44" (1/1) ... [2018-06-25 03:44:44,707 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:44" (1/1) ... [2018-06-25 03:44:44,708 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:44" (1/1) ... [2018-06-25 03:44:44,718 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 03:44:44,719 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 03:44:44,719 INFO ]: Initializing RCFGBuilder... [2018-06-25 03:44:44,719 INFO ]: RCFGBuilder initialized [2018-06-25 03:44:44,720 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:44" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 03:44:44,738 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 03:44:44,738 INFO ]: Found specification of procedure gotoProc [2018-06-25 03:44:44,738 INFO ]: Found implementation of procedure gotoProc [2018-06-25 03:44:44,738 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 03:44:44,738 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 03:44:44,738 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 03:44:45,035 INFO ]: Using library mode [2018-06-25 03:44:45,035 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:44:45 BoogieIcfgContainer [2018-06-25 03:44:45,035 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 03:44:45,039 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 03:44:45,039 INFO ]: Initializing BlockEncodingV2... [2018-06-25 03:44:45,040 INFO ]: BlockEncodingV2 initialized [2018-06-25 03:44:45,041 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:44:45" (1/1) ... [2018-06-25 03:44:45,067 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 03:44:45,074 INFO ]: Using Remove infeasible edges [2018-06-25 03:44:45,075 INFO ]: Using Maximize final states [2018-06-25 03:44:45,075 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 03:44:45,075 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 03:44:45,077 INFO ]: Using Remove sink states [2018-06-25 03:44:45,079 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 03:44:45,079 INFO ]: Using Use SBE [2018-06-25 03:44:45,085 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 03:44:47,118 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 03:44:47,736 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 03:44:47,981 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 03:44:47,982 INFO ]: SBE split 2 edges [2018-06-25 03:44:48,003 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 03:44:48,007 INFO ]: 0 new accepting states [2018-06-25 03:45:01,005 INFO ]: Removed 2067 edges and 2 locations by large block encoding [2018-06-25 03:45:01,007 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:45:01,021 INFO ]: Removed 12 edges and 0 locations because of local infeasibility [2018-06-25 03:45:01,022 INFO ]: 0 new accepting states [2018-06-25 03:45:01,023 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 03:45:01,024 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:45:01,030 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 03:45:01,031 INFO ]: 0 new accepting states [2018-06-25 03:45:01,033 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 03:45:01,033 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:45:01,045 INFO ]: Encoded RCFG 6 locations, 2057 edges [2018-06-25 03:45:01,045 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 03:45:01 BasicIcfg [2018-06-25 03:45:01,045 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 03:45:01,047 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 03:45:01,047 INFO ]: Initializing TraceAbstraction... [2018-06-25 03:45:01,049 INFO ]: TraceAbstraction initialized [2018-06-25 03:45:01,049 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:44:44" (1/4) ... [2018-06-25 03:45:01,052 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7551d6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 03:45:01, skipping insertion in model container [2018-06-25 03:45:01,052 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:44" (2/4) ... [2018-06-25 03:45:01,052 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7551d6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 03:45:01, skipping insertion in model container [2018-06-25 03:45:01,052 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:44:45" (3/4) ... [2018-06-25 03:45:01,053 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7551d6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 03:45:01, skipping insertion in model container [2018-06-25 03:45:01,053 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 03:45:01" (4/4) ... [2018-06-25 03:45:01,054 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 03:45:01,062 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 03:45:01,068 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 03:45:01,114 INFO ]: Using default assertion order modulation [2018-06-25 03:45:01,114 INFO ]: Interprodecural is true [2018-06-25 03:45:01,114 INFO ]: Hoare is false [2018-06-25 03:45:01,114 INFO ]: Compute interpolants for FPandBP [2018-06-25 03:45:01,114 INFO ]: Backedges is TWOTRACK [2018-06-25 03:45:01,114 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 03:45:01,114 INFO ]: Difference is false [2018-06-25 03:45:01,114 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 03:45:01,115 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 03:45:01,133 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 03:45:01,157 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 03:45:01,158 INFO ]: Found error trace [2018-06-25 03:45:01,158 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 03:45:01,159 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:01,165 INFO ]: Analyzing trace with hash 161085025, now seen corresponding path program 1 times [2018-06-25 03:45:01,167 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:01,167 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:01,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:01,216 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:01,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:01,260 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:01,376 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:45:01,379 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:01,379 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:01,381 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:01,396 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:01,396 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:01,399 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 03:45:04,830 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:04,831 INFO ]: Finished difference Result 7 states and 2058 transitions. [2018-06-25 03:45:04,831 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:04,832 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 03:45:04,832 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:04,849 INFO ]: With dead ends: 7 [2018-06-25 03:45:04,849 INFO ]: Without dead ends: 7 [2018-06-25 03:45:04,854 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:45:04,869 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:04,917 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:04,918 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:04,922 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 03:45:04,924 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 03:45:04,925 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:04,925 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 03:45:04,925 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:04,925 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 03:45:04,926 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 03:45:04,926 INFO ]: Found error trace [2018-06-25 03:45:04,926 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 03:45:04,926 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:04,927 INFO ]: Analyzing trace with hash 161114816, now seen corresponding path program 1 times [2018-06-25 03:45:04,927 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:04,927 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:04,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:04,928 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:04,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:04,936 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:05,004 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:45:05,004 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:05,004 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:05,006 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:05,006 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:05,006 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:05,006 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 03:45:07,732 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:07,733 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-25 03:45:07,734 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:07,734 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 03:45:07,734 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:07,737 INFO ]: With dead ends: 9 [2018-06-25 03:45:07,737 INFO ]: Without dead ends: 9 [2018-06-25 03:45:07,737 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:45:07,737 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 03:45:07,753 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 03:45:07,753 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:07,758 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 03:45:07,759 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 03:45:07,759 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:07,759 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 03:45:07,759 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:07,759 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 03:45:07,760 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 03:45:07,760 INFO ]: Found error trace [2018-06-25 03:45:07,760 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 03:45:07,760 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:07,760 INFO ]: Analyzing trace with hash 161233980, now seen corresponding path program 1 times [2018-06-25 03:45:07,760 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:07,760 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:07,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:07,761 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:07,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:07,776 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:07,805 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:45:07,805 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:07,805 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:07,805 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:07,806 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:07,806 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:07,806 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 03:45:10,989 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:10,989 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-25 03:45:10,989 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:10,989 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 03:45:10,989 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:10,992 INFO ]: With dead ends: 9 [2018-06-25 03:45:10,992 INFO ]: Without dead ends: 9 [2018-06-25 03:45:10,992 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:45:10,992 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 03:45:11,007 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 03:45:11,007 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:11,010 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 03:45:11,010 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 03:45:11,011 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:11,011 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 03:45:11,011 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:11,011 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 03:45:11,013 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 03:45:11,013 INFO ]: Found error trace [2018-06-25 03:45:11,013 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 03:45:11,013 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:11,013 INFO ]: Analyzing trace with hash 161382935, now seen corresponding path program 1 times [2018-06-25 03:45:11,013 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:11,013 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:11,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:11,014 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:11,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:11,028 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:11,074 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:45:11,074 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:11,074 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:11,074 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:11,074 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:11,074 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:11,075 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 03:45:12,887 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:12,887 INFO ]: Finished difference Result 10 states and 2064 transitions. [2018-06-25 03:45:12,887 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:12,887 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 03:45:12,887 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:12,891 INFO ]: With dead ends: 10 [2018-06-25 03:45:12,891 INFO ]: Without dead ends: 10 [2018-06-25 03:45:12,891 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:45:12,891 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 03:45:12,904 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-25 03:45:12,904 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:45:12,908 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2062 transitions. [2018-06-25 03:45:12,908 INFO ]: Start accepts. Automaton has 8 states and 2062 transitions. Word has length 5 [2018-06-25 03:45:12,908 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:12,908 INFO ]: Abstraction has 8 states and 2062 transitions. [2018-06-25 03:45:12,908 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:12,908 INFO ]: Start isEmpty. Operand 8 states and 2062 transitions. [2018-06-25 03:45:12,909 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 03:45:12,909 INFO ]: Found error trace [2018-06-25 03:45:12,909 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 03:45:12,909 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:12,909 INFO ]: Analyzing trace with hash 161385818, now seen corresponding path program 1 times [2018-06-25 03:45:12,910 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:12,910 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:12,910 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:12,910 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:12,910 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:12,930 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:12,995 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:45:12,995 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:12,995 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:12,995 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:12,995 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:12,995 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:12,995 INFO ]: Start difference. First operand 8 states and 2062 transitions. Second operand 3 states. [2018-06-25 03:45:14,638 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:14,638 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-25 03:45:14,638 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:14,638 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 03:45:14,638 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:14,640 INFO ]: With dead ends: 9 [2018-06-25 03:45:14,640 INFO ]: Without dead ends: 9 [2018-06-25 03:45:14,640 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:45:14,640 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 03:45:14,649 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 03:45:14,649 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:14,652 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 03:45:14,652 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 03:45:14,652 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:14,652 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 03:45:14,652 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:14,652 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 03:45:14,653 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:14,653 INFO ]: Found error trace [2018-06-25 03:45:14,653 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:14,654 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:14,654 INFO ]: Analyzing trace with hash 579709331, now seen corresponding path program 1 times [2018-06-25 03:45:14,654 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:14,654 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:14,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:14,654 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:14,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:14,688 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:14,773 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:45:14,773 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:14,773 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:14,774 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:14,774 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:14,774 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:14,774 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 03:45:16,633 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:16,634 INFO ]: Finished difference Result 8 states and 2058 transitions. [2018-06-25 03:45:16,634 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:16,634 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:16,634 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:16,635 INFO ]: With dead ends: 8 [2018-06-25 03:45:16,635 INFO ]: Without dead ends: 7 [2018-06-25 03:45:16,636 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:45:16,636 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:16,640 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:16,641 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:16,643 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1034 transitions. [2018-06-25 03:45:16,643 INFO ]: Start accepts. Automaton has 7 states and 1034 transitions. Word has length 6 [2018-06-25 03:45:16,643 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:16,643 INFO ]: Abstraction has 7 states and 1034 transitions. [2018-06-25 03:45:16,643 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:16,643 INFO ]: Start isEmpty. Operand 7 states and 1034 transitions. [2018-06-25 03:45:16,644 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:16,644 INFO ]: Found error trace [2018-06-25 03:45:16,644 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:16,644 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:16,644 INFO ]: Analyzing trace with hash 580632852, now seen corresponding path program 1 times [2018-06-25 03:45:16,644 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:16,644 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:16,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:16,645 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:16,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:16,669 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:16,782 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:45:16,782 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:16,782 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:16,782 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:16,782 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:16,782 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:16,782 INFO ]: Start difference. First operand 7 states and 1034 transitions. Second operand 3 states. [2018-06-25 03:45:17,819 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:17,819 INFO ]: Finished difference Result 8 states and 1034 transitions. [2018-06-25 03:45:17,823 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:17,823 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:17,823 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:17,824 INFO ]: With dead ends: 8 [2018-06-25 03:45:17,824 INFO ]: Without dead ends: 7 [2018-06-25 03:45:17,824 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:45:17,824 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:17,826 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:17,826 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:17,830 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 522 transitions. [2018-06-25 03:45:17,830 INFO ]: Start accepts. Automaton has 7 states and 522 transitions. Word has length 6 [2018-06-25 03:45:17,830 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:17,830 INFO ]: Abstraction has 7 states and 522 transitions. [2018-06-25 03:45:17,831 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:17,831 INFO ]: Start isEmpty. Operand 7 states and 522 transitions. [2018-06-25 03:45:17,831 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:17,831 INFO ]: Found error trace [2018-06-25 03:45:17,831 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:17,831 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:17,831 INFO ]: Analyzing trace with hash 582479894, now seen corresponding path program 1 times [2018-06-25 03:45:17,831 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:17,831 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:17,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:17,832 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:17,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:17,851 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:17,889 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:45:17,889 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:17,890 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:17,890 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:17,890 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:17,890 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:17,890 INFO ]: Start difference. First operand 7 states and 522 transitions. Second operand 3 states. [2018-06-25 03:45:18,331 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:18,331 INFO ]: Finished difference Result 8 states and 522 transitions. [2018-06-25 03:45:18,331 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:18,331 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:18,331 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:18,331 INFO ]: With dead ends: 8 [2018-06-25 03:45:18,331 INFO ]: Without dead ends: 7 [2018-06-25 03:45:18,332 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:45:18,332 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:18,333 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:18,333 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:18,333 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 394 transitions. [2018-06-25 03:45:18,333 INFO ]: Start accepts. Automaton has 7 states and 394 transitions. Word has length 6 [2018-06-25 03:45:18,333 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:18,333 INFO ]: Abstraction has 7 states and 394 transitions. [2018-06-25 03:45:18,333 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:18,333 INFO ]: Start isEmpty. Operand 7 states and 394 transitions. [2018-06-25 03:45:18,334 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:18,334 INFO ]: Found error trace [2018-06-25 03:45:18,334 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:18,334 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:18,334 INFO ]: Analyzing trace with hash -838818925, now seen corresponding path program 1 times [2018-06-25 03:45:18,334 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:18,334 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:18,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:18,335 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:18,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:18,344 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:18,383 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:45:18,383 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:18,383 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:18,383 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:18,383 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:18,383 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:18,383 INFO ]: Start difference. First operand 7 states and 394 transitions. Second operand 3 states. [2018-06-25 03:45:19,065 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:19,066 INFO ]: Finished difference Result 8 states and 394 transitions. [2018-06-25 03:45:19,066 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:19,066 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:19,066 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:19,066 INFO ]: With dead ends: 8 [2018-06-25 03:45:19,066 INFO ]: Without dead ends: 7 [2018-06-25 03:45:19,067 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:45:19,067 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:19,068 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:19,068 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:19,069 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 330 transitions. [2018-06-25 03:45:19,069 INFO ]: Start accepts. Automaton has 7 states and 330 transitions. Word has length 6 [2018-06-25 03:45:19,069 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:19,069 INFO ]: Abstraction has 7 states and 330 transitions. [2018-06-25 03:45:19,069 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:19,069 INFO ]: Start isEmpty. Operand 7 states and 330 transitions. [2018-06-25 03:45:19,069 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:19,069 INFO ]: Found error trace [2018-06-25 03:45:19,069 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:19,069 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:19,069 INFO ]: Analyzing trace with hash 108713621, now seen corresponding path program 1 times [2018-06-25 03:45:19,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:19,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:19,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:19,070 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:19,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:19,089 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:19,128 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:45:19,128 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:19,128 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:19,128 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:19,128 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:19,128 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:19,129 INFO ]: Start difference. First operand 7 states and 330 transitions. Second operand 3 states. [2018-06-25 03:45:19,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:19,448 INFO ]: Finished difference Result 8 states and 330 transitions. [2018-06-25 03:45:19,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:19,448 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:19,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:19,449 INFO ]: With dead ends: 8 [2018-06-25 03:45:19,449 INFO ]: Without dead ends: 7 [2018-06-25 03:45:19,449 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:45:19,449 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:19,450 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:19,450 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:19,450 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 202 transitions. [2018-06-25 03:45:19,450 INFO ]: Start accepts. Automaton has 7 states and 202 transitions. Word has length 6 [2018-06-25 03:45:19,450 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:19,450 INFO ]: Abstraction has 7 states and 202 transitions. [2018-06-25 03:45:19,450 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:19,450 INFO ]: Start isEmpty. Operand 7 states and 202 transitions. [2018-06-25 03:45:19,451 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:19,451 INFO ]: Found error trace [2018-06-25 03:45:19,451 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:19,451 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:19,451 INFO ]: Analyzing trace with hash 343287955, now seen corresponding path program 1 times [2018-06-25 03:45:19,451 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:19,451 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:19,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:19,452 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:19,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:19,467 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:19,523 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:45:19,524 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:19,524 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:19,524 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:19,524 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:19,524 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:19,524 INFO ]: Start difference. First operand 7 states and 202 transitions. Second operand 3 states. [2018-06-25 03:45:19,707 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:19,707 INFO ]: Finished difference Result 8 states and 202 transitions. [2018-06-25 03:45:19,707 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:19,707 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:19,707 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:19,708 INFO ]: With dead ends: 8 [2018-06-25 03:45:19,708 INFO ]: Without dead ends: 7 [2018-06-25 03:45:19,708 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:45:19,708 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:19,709 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:19,709 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:19,709 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2018-06-25 03:45:19,709 INFO ]: Start accepts. Automaton has 7 states and 154 transitions. Word has length 6 [2018-06-25 03:45:19,709 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:19,709 INFO ]: Abstraction has 7 states and 154 transitions. [2018-06-25 03:45:19,709 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:19,709 INFO ]: Start isEmpty. Operand 7 states and 154 transitions. [2018-06-25 03:45:19,709 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:19,709 INFO ]: Found error trace [2018-06-25 03:45:19,709 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:19,709 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:19,710 INFO ]: Analyzing trace with hash -601474028, now seen corresponding path program 1 times [2018-06-25 03:45:19,710 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:19,710 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:19,710 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:19,710 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:19,710 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:19,720 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:19,798 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:45:19,798 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:19,798 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:19,799 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:19,799 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:19,799 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:19,799 INFO ]: Start difference. First operand 7 states and 154 transitions. Second operand 3 states. [2018-06-25 03:45:19,929 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:19,929 INFO ]: Finished difference Result 8 states and 154 transitions. [2018-06-25 03:45:19,929 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:19,929 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:19,929 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:19,930 INFO ]: With dead ends: 8 [2018-06-25 03:45:19,930 INFO ]: Without dead ends: 7 [2018-06-25 03:45:19,930 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:45:19,930 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:19,930 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:19,930 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:19,931 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-06-25 03:45:19,931 INFO ]: Start accepts. Automaton has 7 states and 58 transitions. Word has length 6 [2018-06-25 03:45:19,931 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:19,931 INFO ]: Abstraction has 7 states and 58 transitions. [2018-06-25 03:45:19,931 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:19,931 INFO ]: Start isEmpty. Operand 7 states and 58 transitions. [2018-06-25 03:45:19,931 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:19,931 INFO ]: Found error trace [2018-06-25 03:45:19,931 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:19,931 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:19,931 INFO ]: Analyzing trace with hash -955182571, now seen corresponding path program 1 times [2018-06-25 03:45:19,931 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:19,931 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:19,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:19,932 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:19,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:19,943 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:19,980 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:45:19,980 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:19,981 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:19,981 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:19,981 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:19,981 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:19,981 INFO ]: Start difference. First operand 7 states and 58 transitions. Second operand 3 states. [2018-06-25 03:45:20,119 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:20,119 INFO ]: Finished difference Result 8 states and 58 transitions. [2018-06-25 03:45:20,119 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:20,119 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:20,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:20,119 INFO ]: With dead ends: 8 [2018-06-25 03:45:20,119 INFO ]: Without dead ends: 7 [2018-06-25 03:45:20,120 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:45:20,120 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:20,120 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:20,121 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:20,121 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2018-06-25 03:45:20,121 INFO ]: Start accepts. Automaton has 7 states and 42 transitions. Word has length 6 [2018-06-25 03:45:20,121 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:20,121 INFO ]: Abstraction has 7 states and 42 transitions. [2018-06-25 03:45:20,121 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:20,121 INFO ]: Start isEmpty. Operand 7 states and 42 transitions. [2018-06-25 03:45:20,121 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:20,121 INFO ]: Found error trace [2018-06-25 03:45:20,121 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:20,121 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:20,121 INFO ]: Analyzing trace with hash -4879462, now seen corresponding path program 1 times [2018-06-25 03:45:20,121 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:20,121 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:20,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:20,122 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:20,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:20,131 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:20,217 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:45:20,217 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:45:20,217 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:45:20,224 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:20,308 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:20,319 INFO ]: Computing forward predicates... [2018-06-25 03:45:20,393 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:45:20,426 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:45:20,426 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 03:45:20,427 INFO ]: Interpolant automaton has 4 states [2018-06-25 03:45:20,427 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 03:45:20,427 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 03:45:20,427 INFO ]: Start difference. First operand 7 states and 42 transitions. Second operand 4 states. [2018-06-25 03:45:20,685 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:20,685 INFO ]: Finished difference Result 9 states and 43 transitions. [2018-06-25 03:45:20,685 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 03:45:20,685 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 03:45:20,685 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:20,685 INFO ]: With dead ends: 9 [2018-06-25 03:45:20,685 INFO ]: Without dead ends: 8 [2018-06-25 03:45:20,685 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:45:20,685 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:45:20,686 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:45:20,686 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:45:20,686 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2018-06-25 03:45:20,686 INFO ]: Start accepts. Automaton has 8 states and 27 transitions. Word has length 6 [2018-06-25 03:45:20,686 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:20,686 INFO ]: Abstraction has 8 states and 27 transitions. [2018-06-25 03:45:20,686 INFO ]: Interpolant automaton has 4 states. [2018-06-25 03:45:20,686 INFO ]: Start isEmpty. Operand 8 states and 27 transitions. [2018-06-25 03:45:20,687 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:45:20,687 INFO ]: Found error trace [2018-06-25 03:45:20,687 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:45:20,687 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:20,687 INFO ]: Analyzing trace with hash 563590785, now seen corresponding path program 1 times [2018-06-25 03:45:20,687 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:20,687 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:20,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:20,688 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:20,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:20,702 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:20,763 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:45:20,763 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:20,763 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:20,763 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:20,763 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:20,764 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:20,764 INFO ]: Start difference. First operand 8 states and 27 transitions. Second operand 3 states. [2018-06-25 03:45:20,796 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:20,796 INFO ]: Finished difference Result 9 states and 27 transitions. [2018-06-25 03:45:20,798 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:20,798 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 03:45:20,798 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:20,798 INFO ]: With dead ends: 9 [2018-06-25 03:45:20,798 INFO ]: Without dead ends: 8 [2018-06-25 03:45:20,799 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:45:20,799 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:45:20,800 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:45:20,800 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:45:20,800 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2018-06-25 03:45:20,800 INFO ]: Start accepts. Automaton has 8 states and 19 transitions. Word has length 7 [2018-06-25 03:45:20,800 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:20,800 INFO ]: Abstraction has 8 states and 19 transitions. [2018-06-25 03:45:20,800 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:20,800 INFO ]: Start isEmpty. Operand 8 states and 19 transitions. [2018-06-25 03:45:20,800 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:45:20,800 INFO ]: Found error trace [2018-06-25 03:45:20,800 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:45:20,800 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:20,800 INFO ]: Analyzing trace with hash -2018979265, now seen corresponding path program 1 times [2018-06-25 03:45:20,800 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:20,800 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:20,801 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:20,801 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:20,801 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:20,817 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:21,080 WARN ]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-25 03:45:21,352 WARN ]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 03:45:21,501 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:45:21,501 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:45:21,501 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:45:21,520 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-25 03:45:21,585 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:21,588 INFO ]: Computing forward predicates... [2018-06-25 03:45:21,791 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-06-25 03:45:22,335 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:45:22,365 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:45:22,365 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 03:45:22,365 INFO ]: Interpolant automaton has 8 states [2018-06-25 03:45:22,365 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 03:45:22,365 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 03:45:22,365 INFO ]: Start difference. First operand 8 states and 19 transitions. Second operand 8 states. [2018-06-25 03:45:22,764 WARN ]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-25 03:45:23,093 WARN ]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 03:45:23,374 WARN ]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-25 03:45:24,015 WARN ]: Spent 323.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2018-06-25 03:45:24,037 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:24,037 INFO ]: Finished difference Result 14 states and 22 transitions. [2018-06-25 03:45:24,037 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 03:45:24,037 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 03:45:24,037 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:24,038 INFO ]: With dead ends: 14 [2018-06-25 03:45:24,038 INFO ]: Without dead ends: 8 [2018-06-25 03:45:24,038 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-06-25 03:45:24,038 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:45:24,039 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:45:24,039 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:45:24,039 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-06-25 03:45:24,039 INFO ]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 7 [2018-06-25 03:45:24,039 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:24,039 INFO ]: Abstraction has 8 states and 12 transitions. [2018-06-25 03:45:24,039 INFO ]: Interpolant automaton has 8 states. [2018-06-25 03:45:24,039 INFO ]: Start isEmpty. Operand 8 states and 12 transitions. [2018-06-25 03:45:24,039 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:45:24,039 INFO ]: Found error trace [2018-06-25 03:45:24,039 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:45:24,039 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:24,040 INFO ]: Analyzing trace with hash 1192837461, now seen corresponding path program 1 times [2018-06-25 03:45:24,040 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:24,040 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:24,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:24,040 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:24,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:24,054 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:24,633 WARN ]: Spent 517.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-06-25 03:45:24,845 WARN ]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 03:45:24,851 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:45:24,851 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:45:24,851 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:45:24,858 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:24,915 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:24,921 INFO ]: Computing forward predicates... [2018-06-25 03:45:25,090 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:45:25,109 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:45:25,109 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 03:45:25,110 INFO ]: Interpolant automaton has 7 states [2018-06-25 03:45:25,110 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 03:45:25,110 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-25 03:45:25,110 INFO ]: Start difference. First operand 8 states and 12 transitions. Second operand 7 states. [2018-06-25 03:45:25,138 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:25,138 INFO ]: Finished difference Result 4 states and 3 transitions. [2018-06-25 03:45:25,138 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 03:45:25,138 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-25 03:45:25,138 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:25,138 INFO ]: With dead ends: 4 [2018-06-25 03:45:25,138 INFO ]: Without dead ends: 0 [2018-06-25 03:45:25,139 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-25 03:45:25,139 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 03:45:25,139 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 03:45:25,139 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 03:45:25,139 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 03:45:25,139 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-25 03:45:25,139 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:25,139 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 03:45:25,139 INFO ]: Interpolant automaton has 7 states. [2018-06-25 03:45:25,139 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 03:45:25,139 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 03:45:25,141 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 03:45:25,142 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 03:45:25 BasicIcfg [2018-06-25 03:45:25,142 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 03:45:25,143 INFO ]: Toolchain (without parser) took 40541.51 ms. Allocated memory was 302.5 MB in the beginning and 1.1 GB in the end (delta: 771.2 MB). Free memory was 255.0 MB in the beginning and 780.4 MB in the end (delta: -525.4 MB). Peak memory consumption was 245.8 MB. Max. memory is 3.6 GB. [2018-06-25 03:45:25,144 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 302.5 MB. Free memory is still 268.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 03:45:25,144 INFO ]: ChcToBoogie took 63.26 ms. Allocated memory is still 302.5 MB. Free memory was 255.0 MB in the beginning and 252.0 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:45:25,144 INFO ]: Boogie Preprocessor took 48.52 ms. Allocated memory is still 302.5 MB. Free memory was 252.0 MB in the beginning and 251.0 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:45:25,149 INFO ]: RCFGBuilder took 316.29 ms. Allocated memory is still 302.5 MB. Free memory was 251.0 MB in the beginning and 237.0 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:45:25,150 INFO ]: BlockEncodingV2 took 16006.32 ms. Allocated memory was 302.5 MB in the beginning and 667.9 MB in the end (delta: 365.4 MB). Free memory was 237.0 MB in the beginning and 243.2 MB in the end (delta: -6.2 MB). Peak memory consumption was 370.6 MB. Max. memory is 3.6 GB. [2018-06-25 03:45:25,150 INFO ]: TraceAbstraction took 24095.58 ms. Allocated memory was 667.9 MB in the beginning and 1.1 GB in the end (delta: 405.8 MB). Free memory was 234.6 MB in the beginning and 780.4 MB in the end (delta: -545.8 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 03:45:25,156 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 302.5 MB. Free memory is still 268.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.26 ms. Allocated memory is still 302.5 MB. Free memory was 255.0 MB in the beginning and 252.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 48.52 ms. Allocated memory is still 302.5 MB. Free memory was 252.0 MB in the beginning and 251.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 316.29 ms. Allocated memory is still 302.5 MB. Free memory was 251.0 MB in the beginning and 237.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 16006.32 ms. Allocated memory was 302.5 MB in the beginning and 667.9 MB in the end (delta: 365.4 MB). Free memory was 237.0 MB in the beginning and 243.2 MB in the end (delta: -6.2 MB). Peak memory consumption was 370.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 24095.58 ms. Allocated memory was 667.9 MB in the beginning and 1.1 GB in the end (delta: 405.8 MB). Free memory was 234.6 MB in the beginning and 780.4 MB in the end (delta: -545.8 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 24.0s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 19.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15107 SDtfs, 3 SDslu, 69 SDs, 0 SdLazy, 6953 SolverSat, 8252 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=4, 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, 17 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 1147 SizeOfPredicates, 2 NumberOfNonLiveVariables, 735 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 11/25 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_e8_120.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_03-45-25-168.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e8_120.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_03-45-25-168.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e8_120.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_03-45-25-168.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e8_120.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_03-45-25-168.csv Received shutdown request...