java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/HOLA/20.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:51:04,925 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:51:04,929 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:51:04,945 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:51:04,945 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:51:04,946 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:51:04,947 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:51:04,950 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:51:04,951 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:51:04,953 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:51:04,954 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:51:04,954 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:51:04,955 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:51:04,958 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:51:04,959 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:51:04,960 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:51:04,973 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:51:04,974 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:51:04,976 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:51:04,977 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:51:04,978 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:51:04,980 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:51:04,980 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:51:04,984 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:51:04,986 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:51:04,986 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:51:04,987 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:51:04,990 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:51:04,991 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:51:04,991 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:51:04,992 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:51:04,993 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:51:04,993 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:51:04,999 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:51:05,000 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:51:05,000 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 10:51:05,020 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:51:05,021 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:51:05,021 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:51:05,021 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:51:05,022 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:51:05,022 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:51:05,023 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:51:05,023 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:51:05,023 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:51:05,023 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:51:05,023 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:51:05,024 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:51:05,024 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:51:05,024 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:51:05,024 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:51:05,024 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:51:05,025 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:51:05,026 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:51:05,026 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:51:05,027 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:51:05,028 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:51:05,080 INFO ]: Repository-Root is: /tmp [2018-06-22 10:51:05,096 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:51:05,102 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:51:05,103 INFO ]: Initializing SmtParser... [2018-06-22 10:51:05,103 INFO ]: SmtParser initialized [2018-06-22 10:51:05,104 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/20.c.smt2 [2018-06-22 10:51:05,106 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-22 10:51:05,190 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/20.c.smt2 unknown [2018-06-22 10:51:05,761 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/20.c.smt2 [2018-06-22 10:51:05,765 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:51:05,774 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:51:05,775 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:51:05,775 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:51:05,775 INFO ]: ChcToBoogie initialized [2018-06-22 10:51:05,778 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:51:05" (1/1) ... [2018-06-22 10:51:05,847 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:51:05 Unit [2018-06-22 10:51:05,847 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:51:05,848 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:51:05,848 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:51:05,848 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:51:05,868 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:51:05" (1/1) ... [2018-06-22 10:51:05,869 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:51:05" (1/1) ... [2018-06-22 10:51:05,888 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:51:05" (1/1) ... [2018-06-22 10:51:05,889 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:51:05" (1/1) ... [2018-06-22 10:51:05,914 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:51:05" (1/1) ... [2018-06-22 10:51:05,916 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:51:05" (1/1) ... [2018-06-22 10:51:05,918 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:51:05" (1/1) ... [2018-06-22 10:51:05,924 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:51:05,925 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:51:05,925 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:51:05,925 INFO ]: RCFGBuilder initialized [2018-06-22 10:51:05,925 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:51:05" (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-22 10:51:05,962 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:51:05,962 INFO ]: Found specification of procedure False [2018-06-22 10:51:05,962 INFO ]: Found implementation of procedure False [2018-06-22 10:51:05,962 INFO ]: Specification and implementation of procedure h28 given in one single declaration [2018-06-22 10:51:05,962 INFO ]: Found specification of procedure h28 [2018-06-22 10:51:05,962 INFO ]: Found implementation of procedure h28 [2018-06-22 10:51:05,962 INFO ]: Specification and implementation of procedure h27 given in one single declaration [2018-06-22 10:51:05,962 INFO ]: Found specification of procedure h27 [2018-06-22 10:51:05,962 INFO ]: Found implementation of procedure h27 [2018-06-22 10:51:05,962 INFO ]: Specification and implementation of procedure h13 given in one single declaration [2018-06-22 10:51:05,962 INFO ]: Found specification of procedure h13 [2018-06-22 10:51:05,962 INFO ]: Found implementation of procedure h13 [2018-06-22 10:51:05,962 INFO ]: Specification and implementation of procedure h12 given in one single declaration [2018-06-22 10:51:05,962 INFO ]: Found specification of procedure h12 [2018-06-22 10:51:05,962 INFO ]: Found implementation of procedure h12 [2018-06-22 10:51:05,962 INFO ]: Specification and implementation of procedure h11 given in one single declaration [2018-06-22 10:51:05,962 INFO ]: Found specification of procedure h11 [2018-06-22 10:51:05,962 INFO ]: Found implementation of procedure h11 [2018-06-22 10:51:05,962 INFO ]: Specification and implementation of procedure h8 given in one single declaration [2018-06-22 10:51:05,962 INFO ]: Found specification of procedure h8 [2018-06-22 10:51:05,962 INFO ]: Found implementation of procedure h8 [2018-06-22 10:51:05,962 INFO ]: Specification and implementation of procedure h7 given in one single declaration [2018-06-22 10:51:05,962 INFO ]: Found specification of procedure h7 [2018-06-22 10:51:05,962 INFO ]: Found implementation of procedure h7 [2018-06-22 10:51:05,962 INFO ]: Specification and implementation of procedure h6 given in one single declaration [2018-06-22 10:51:05,962 INFO ]: Found specification of procedure h6 [2018-06-22 10:51:05,962 INFO ]: Found implementation of procedure h6 [2018-06-22 10:51:05,962 INFO ]: Specification and implementation of procedure h5 given in one single declaration [2018-06-22 10:51:05,963 INFO ]: Found specification of procedure h5 [2018-06-22 10:51:05,963 INFO ]: Found implementation of procedure h5 [2018-06-22 10:51:05,963 INFO ]: Specification and implementation of procedure h4 given in one single declaration [2018-06-22 10:51:05,963 INFO ]: Found specification of procedure h4 [2018-06-22 10:51:05,963 INFO ]: Found implementation of procedure h4 [2018-06-22 10:51:05,963 INFO ]: Specification and implementation of procedure h3 given in one single declaration [2018-06-22 10:51:05,963 INFO ]: Found specification of procedure h3 [2018-06-22 10:51:05,963 INFO ]: Found implementation of procedure h3 [2018-06-22 10:51:05,963 INFO ]: Specification and implementation of procedure h2 given in one single declaration [2018-06-22 10:51:05,963 INFO ]: Found specification of procedure h2 [2018-06-22 10:51:05,963 INFO ]: Found implementation of procedure h2 [2018-06-22 10:51:05,963 INFO ]: Specification and implementation of procedure h1 given in one single declaration [2018-06-22 10:51:05,963 INFO ]: Found specification of procedure h1 [2018-06-22 10:51:05,963 INFO ]: Found implementation of procedure h1 [2018-06-22 10:51:05,963 INFO ]: Specification and implementation of procedure h26 given in one single declaration [2018-06-22 10:51:05,963 INFO ]: Found specification of procedure h26 [2018-06-22 10:51:05,963 INFO ]: Found implementation of procedure h26 [2018-06-22 10:51:05,963 INFO ]: Specification and implementation of procedure h23 given in one single declaration [2018-06-22 10:51:05,963 INFO ]: Found specification of procedure h23 [2018-06-22 10:51:05,963 INFO ]: Found implementation of procedure h23 [2018-06-22 10:51:05,963 INFO ]: Specification and implementation of procedure h24 given in one single declaration [2018-06-22 10:51:05,963 INFO ]: Found specification of procedure h24 [2018-06-22 10:51:05,963 INFO ]: Found implementation of procedure h24 [2018-06-22 10:51:05,963 INFO ]: Specification and implementation of procedure h21 given in one single declaration [2018-06-22 10:51:05,963 INFO ]: Found specification of procedure h21 [2018-06-22 10:51:05,963 INFO ]: Found implementation of procedure h21 [2018-06-22 10:51:05,963 INFO ]: Specification and implementation of procedure h20 given in one single declaration [2018-06-22 10:51:05,963 INFO ]: Found specification of procedure h20 [2018-06-22 10:51:05,963 INFO ]: Found implementation of procedure h20 [2018-06-22 10:51:05,963 INFO ]: Specification and implementation of procedure h19 given in one single declaration [2018-06-22 10:51:05,963 INFO ]: Found specification of procedure h19 [2018-06-22 10:51:05,963 INFO ]: Found implementation of procedure h19 [2018-06-22 10:51:05,963 INFO ]: Specification and implementation of procedure h15 given in one single declaration [2018-06-22 10:51:05,963 INFO ]: Found specification of procedure h15 [2018-06-22 10:51:05,963 INFO ]: Found implementation of procedure h15 [2018-06-22 10:51:05,963 INFO ]: Specification and implementation of procedure h14 given in one single declaration [2018-06-22 10:51:05,964 INFO ]: Found specification of procedure h14 [2018-06-22 10:51:05,964 INFO ]: Found implementation of procedure h14 [2018-06-22 10:51:05,964 INFO ]: Specification and implementation of procedure h10 given in one single declaration [2018-06-22 10:51:05,964 INFO ]: Found specification of procedure h10 [2018-06-22 10:51:05,964 INFO ]: Found implementation of procedure h10 [2018-06-22 10:51:05,964 INFO ]: Specification and implementation of procedure h9 given in one single declaration [2018-06-22 10:51:05,964 INFO ]: Found specification of procedure h9 [2018-06-22 10:51:05,964 INFO ]: Found implementation of procedure h9 [2018-06-22 10:51:05,964 INFO ]: Specification and implementation of procedure h17 given in one single declaration [2018-06-22 10:51:05,964 INFO ]: Found specification of procedure h17 [2018-06-22 10:51:05,964 INFO ]: Found implementation of procedure h17 [2018-06-22 10:51:05,964 INFO ]: Specification and implementation of procedure h18 given in one single declaration [2018-06-22 10:51:05,964 INFO ]: Found specification of procedure h18 [2018-06-22 10:51:05,964 INFO ]: Found implementation of procedure h18 [2018-06-22 10:51:05,964 INFO ]: Specification and implementation of procedure h16 given in one single declaration [2018-06-22 10:51:05,964 INFO ]: Found specification of procedure h16 [2018-06-22 10:51:05,964 INFO ]: Found implementation of procedure h16 [2018-06-22 10:51:05,964 INFO ]: Specification and implementation of procedure h22 given in one single declaration [2018-06-22 10:51:05,964 INFO ]: Found specification of procedure h22 [2018-06-22 10:51:05,964 INFO ]: Found implementation of procedure h22 [2018-06-22 10:51:05,964 INFO ]: Specification and implementation of procedure h25 given in one single declaration [2018-06-22 10:51:05,964 INFO ]: Found specification of procedure h25 [2018-06-22 10:51:05,964 INFO ]: Found implementation of procedure h25 [2018-06-22 10:51:05,964 INFO ]: Specification and implementation of procedure h29 given in one single declaration [2018-06-22 10:51:05,964 INFO ]: Found specification of procedure h29 [2018-06-22 10:51:05,964 INFO ]: Found implementation of procedure h29 [2018-06-22 10:51:05,964 INFO ]: Specification and implementation of procedure h39 given in one single declaration [2018-06-22 10:51:05,964 INFO ]: Found specification of procedure h39 [2018-06-22 10:51:05,964 INFO ]: Found implementation of procedure h39 [2018-06-22 10:51:05,964 INFO ]: Specification and implementation of procedure h38 given in one single declaration [2018-06-22 10:51:05,964 INFO ]: Found specification of procedure h38 [2018-06-22 10:51:05,964 INFO ]: Found implementation of procedure h38 [2018-06-22 10:51:05,964 INFO ]: Specification and implementation of procedure h37 given in one single declaration [2018-06-22 10:51:05,964 INFO ]: Found specification of procedure h37 [2018-06-22 10:51:05,964 INFO ]: Found implementation of procedure h37 [2018-06-22 10:51:05,964 INFO ]: Specification and implementation of procedure h33 given in one single declaration [2018-06-22 10:51:05,964 INFO ]: Found specification of procedure h33 [2018-06-22 10:51:05,965 INFO ]: Found implementation of procedure h33 [2018-06-22 10:51:05,965 INFO ]: Specification and implementation of procedure h32 given in one single declaration [2018-06-22 10:51:05,965 INFO ]: Found specification of procedure h32 [2018-06-22 10:51:05,965 INFO ]: Found implementation of procedure h32 [2018-06-22 10:51:05,965 INFO ]: Specification and implementation of procedure h31 given in one single declaration [2018-06-22 10:51:05,965 INFO ]: Found specification of procedure h31 [2018-06-22 10:51:05,965 INFO ]: Found implementation of procedure h31 [2018-06-22 10:51:05,965 INFO ]: Specification and implementation of procedure h30 given in one single declaration [2018-06-22 10:51:05,965 INFO ]: Found specification of procedure h30 [2018-06-22 10:51:05,965 INFO ]: Found implementation of procedure h30 [2018-06-22 10:51:05,965 INFO ]: Specification and implementation of procedure h36 given in one single declaration [2018-06-22 10:51:05,965 INFO ]: Found specification of procedure h36 [2018-06-22 10:51:05,965 INFO ]: Found implementation of procedure h36 [2018-06-22 10:51:05,965 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:51:05,965 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:51:05,965 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-22 10:51:06,881 INFO ]: Using library mode [2018-06-22 10:51:06,881 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:51:06 BoogieIcfgContainer [2018-06-22 10:51:06,881 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:51:06,883 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:51:06,883 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:51:06,886 INFO ]: TraceAbstraction initialized [2018-06-22 10:51:06,886 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:51:05" (1/3) ... [2018-06-22 10:51:06,887 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf51bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:51:06, skipping insertion in model container [2018-06-22 10:51:06,887 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:51:05" (2/3) ... [2018-06-22 10:51:06,887 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf51bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:51:06, skipping insertion in model container [2018-06-22 10:51:06,887 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:51:06" (3/3) ... [2018-06-22 10:51:06,889 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:51:06,897 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:51:06,905 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:51:06,946 INFO ]: Using default assertion order modulation [2018-06-22 10:51:06,947 INFO ]: Interprodecural is true [2018-06-22 10:51:06,947 INFO ]: Hoare is false [2018-06-22 10:51:06,947 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:51:06,947 INFO ]: Backedges is TWOTRACK [2018-06-22 10:51:06,947 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:51:06,947 INFO ]: Difference is false [2018-06-22 10:51:06,947 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:51:06,947 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:51:06,968 INFO ]: Start isEmpty. Operand 164 states. [2018-06-22 10:51:06,985 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:51:06,985 INFO ]: Found error trace [2018-06-22 10:51:06,986 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:06,987 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:06,992 INFO ]: Analyzing trace with hash 1749904121, now seen corresponding path program 1 times [2018-06-22 10:51:06,993 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:06,993 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:07,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:07,025 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:07,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:07,140 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:08,019 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:51:08,023 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:08,023 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:51:08,025 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:51:08,038 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:51:08,038 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:51:08,041 INFO ]: Start difference. First operand 164 states. Second operand 13 states. [2018-06-22 10:51:08,786 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:08,787 INFO ]: Finished difference Result 174 states and 191 transitions. [2018-06-22 10:51:08,788 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:51:08,789 INFO ]: Start accepts. Automaton has 13 states. Word has length 57 [2018-06-22 10:51:08,789 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:08,801 INFO ]: With dead ends: 174 [2018-06-22 10:51:08,801 INFO ]: Without dead ends: 174 [2018-06-22 10:51:08,803 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:51:08,816 INFO ]: Start minimizeSevpa. Operand 174 states. [2018-06-22 10:51:08,869 INFO ]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-06-22 10:51:08,870 INFO ]: Start removeUnreachable. Operand 174 states. [2018-06-22 10:51:08,874 INFO ]: Finished removeUnreachable. Reduced from 174 states to 174 states and 191 transitions. [2018-06-22 10:51:08,876 INFO ]: Start accepts. Automaton has 174 states and 191 transitions. Word has length 57 [2018-06-22 10:51:08,877 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:08,877 INFO ]: Abstraction has 174 states and 191 transitions. [2018-06-22 10:51:08,877 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:51:08,877 INFO ]: Start isEmpty. Operand 174 states and 191 transitions. [2018-06-22 10:51:08,881 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:51:08,881 INFO ]: Found error trace [2018-06-22 10:51:08,881 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:08,881 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:08,882 INFO ]: Analyzing trace with hash 2079330302, now seen corresponding path program 1 times [2018-06-22 10:51:08,882 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:08,882 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:08,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:08,883 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:08,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:08,915 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:09,582 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:51:09,582 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:09,583 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 10:51:09,584 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:51:09,584 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:51:09,584 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:51:09,585 INFO ]: Start difference. First operand 174 states and 191 transitions. Second operand 13 states. [2018-06-22 10:51:10,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:10,118 INFO ]: Finished difference Result 174 states and 190 transitions. [2018-06-22 10:51:10,118 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:51:10,118 INFO ]: Start accepts. Automaton has 13 states. Word has length 57 [2018-06-22 10:51:10,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:10,121 INFO ]: With dead ends: 174 [2018-06-22 10:51:10,121 INFO ]: Without dead ends: 174 [2018-06-22 10:51:10,122 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:51:10,122 INFO ]: Start minimizeSevpa. Operand 174 states. [2018-06-22 10:51:10,140 INFO ]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-06-22 10:51:10,140 INFO ]: Start removeUnreachable. Operand 174 states. [2018-06-22 10:51:10,141 INFO ]: Finished removeUnreachable. Reduced from 174 states to 174 states and 190 transitions. [2018-06-22 10:51:10,141 INFO ]: Start accepts. Automaton has 174 states and 190 transitions. Word has length 57 [2018-06-22 10:51:10,142 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:10,142 INFO ]: Abstraction has 174 states and 190 transitions. [2018-06-22 10:51:10,142 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:51:10,142 INFO ]: Start isEmpty. Operand 174 states and 190 transitions. [2018-06-22 10:51:10,148 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 10:51:10,148 INFO ]: Found error trace [2018-06-22 10:51:10,148 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:10,149 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:10,149 INFO ]: Analyzing trace with hash 2089342357, now seen corresponding path program 1 times [2018-06-22 10:51:10,149 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:10,149 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:10,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:10,150 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:10,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:10,178 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:10,445 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:51:10,445 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:10,445 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-06-22 10:51:10,446 INFO ]: Interpolant automaton has 16 states [2018-06-22 10:51:10,446 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 10:51:10,446 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:51:10,446 INFO ]: Start difference. First operand 174 states and 190 transitions. Second operand 16 states. [2018-06-22 10:51:10,771 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:10,772 INFO ]: Finished difference Result 182 states and 198 transitions. [2018-06-22 10:51:10,774 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:51:10,774 INFO ]: Start accepts. Automaton has 16 states. Word has length 73 [2018-06-22 10:51:10,775 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:10,777 INFO ]: With dead ends: 182 [2018-06-22 10:51:10,777 INFO ]: Without dead ends: 182 [2018-06-22 10:51:10,778 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:51:10,778 INFO ]: Start minimizeSevpa. Operand 182 states. [2018-06-22 10:51:10,794 INFO ]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-06-22 10:51:10,794 INFO ]: Start removeUnreachable. Operand 182 states. [2018-06-22 10:51:10,796 INFO ]: Finished removeUnreachable. Reduced from 182 states to 182 states and 198 transitions. [2018-06-22 10:51:10,797 INFO ]: Start accepts. Automaton has 182 states and 198 transitions. Word has length 73 [2018-06-22 10:51:10,797 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:10,797 INFO ]: Abstraction has 182 states and 198 transitions. [2018-06-22 10:51:10,797 INFO ]: Interpolant automaton has 16 states. [2018-06-22 10:51:10,797 INFO ]: Start isEmpty. Operand 182 states and 198 transitions. [2018-06-22 10:51:10,800 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 10:51:10,800 INFO ]: Found error trace [2018-06-22 10:51:10,800 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:10,800 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:10,800 INFO ]: Analyzing trace with hash -1832828390, now seen corresponding path program 1 times [2018-06-22 10:51:10,800 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:10,800 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:10,801 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:10,801 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:10,801 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:10,822 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:11,179 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:51:11,180 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:11,202 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-22 10:51:11,203 INFO ]: Interpolant automaton has 19 states [2018-06-22 10:51:11,203 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 10:51:11,203 INFO ]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-22 10:51:11,204 INFO ]: Start difference. First operand 182 states and 198 transitions. Second operand 19 states. [2018-06-22 10:51:11,648 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:11,648 INFO ]: Finished difference Result 186 states and 201 transitions. [2018-06-22 10:51:11,649 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 10:51:11,649 INFO ]: Start accepts. Automaton has 19 states. Word has length 81 [2018-06-22 10:51:11,649 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:11,651 INFO ]: With dead ends: 186 [2018-06-22 10:51:11,651 INFO ]: Without dead ends: 166 [2018-06-22 10:51:11,651 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-22 10:51:11,651 INFO ]: Start minimizeSevpa. Operand 166 states. [2018-06-22 10:51:11,663 INFO ]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-06-22 10:51:11,664 INFO ]: Start removeUnreachable. Operand 166 states. [2018-06-22 10:51:11,665 INFO ]: Finished removeUnreachable. Reduced from 166 states to 166 states and 181 transitions. [2018-06-22 10:51:11,665 INFO ]: Start accepts. Automaton has 166 states and 181 transitions. Word has length 81 [2018-06-22 10:51:11,666 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:11,666 INFO ]: Abstraction has 166 states and 181 transitions. [2018-06-22 10:51:11,666 INFO ]: Interpolant automaton has 19 states. [2018-06-22 10:51:11,666 INFO ]: Start isEmpty. Operand 166 states and 181 transitions. [2018-06-22 10:51:11,668 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 10:51:11,668 INFO ]: Found error trace [2018-06-22 10:51:11,668 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:11,668 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:11,668 INFO ]: Analyzing trace with hash 1265166927, now seen corresponding path program 1 times [2018-06-22 10:51:11,668 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:11,668 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:11,669 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:11,669 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:11,669 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:11,704 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:12,209 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:12,210 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:12,210 INFO ]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-06-22 10:51:12,210 INFO ]: Interpolant automaton has 23 states [2018-06-22 10:51:12,210 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 10:51:12,211 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:51:12,211 INFO ]: Start difference. First operand 166 states and 181 transitions. Second operand 23 states. [2018-06-22 10:51:12,829 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:12,829 INFO ]: Finished difference Result 196 states and 217 transitions. [2018-06-22 10:51:12,830 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 10:51:12,830 INFO ]: Start accepts. Automaton has 23 states. Word has length 101 [2018-06-22 10:51:12,830 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:12,832 INFO ]: With dead ends: 196 [2018-06-22 10:51:12,832 INFO ]: Without dead ends: 196 [2018-06-22 10:51:12,833 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:51:12,833 INFO ]: Start minimizeSevpa. Operand 196 states. [2018-06-22 10:51:12,852 INFO ]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-06-22 10:51:12,852 INFO ]: Start removeUnreachable. Operand 196 states. [2018-06-22 10:51:12,854 INFO ]: Finished removeUnreachable. Reduced from 196 states to 196 states and 217 transitions. [2018-06-22 10:51:12,854 INFO ]: Start accepts. Automaton has 196 states and 217 transitions. Word has length 101 [2018-06-22 10:51:12,854 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:12,854 INFO ]: Abstraction has 196 states and 217 transitions. [2018-06-22 10:51:12,854 INFO ]: Interpolant automaton has 23 states. [2018-06-22 10:51:12,854 INFO ]: Start isEmpty. Operand 196 states and 217 transitions. [2018-06-22 10:51:12,856 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 10:51:12,856 INFO ]: Found error trace [2018-06-22 10:51:12,856 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:12,856 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:12,856 INFO ]: Analyzing trace with hash -218564435, now seen corresponding path program 1 times [2018-06-22 10:51:12,856 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:12,856 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:12,857 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:12,857 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:12,857 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:12,882 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:13,996 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:13,996 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:13,996 INFO ]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-06-22 10:51:13,996 INFO ]: Interpolant automaton has 23 states [2018-06-22 10:51:13,996 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 10:51:13,996 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:51:13,996 INFO ]: Start difference. First operand 196 states and 217 transitions. Second operand 23 states. [2018-06-22 10:51:14,992 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:14,992 INFO ]: Finished difference Result 230 states and 259 transitions. [2018-06-22 10:51:14,992 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 10:51:14,992 INFO ]: Start accepts. Automaton has 23 states. Word has length 101 [2018-06-22 10:51:14,993 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:14,995 INFO ]: With dead ends: 230 [2018-06-22 10:51:14,995 INFO ]: Without dead ends: 230 [2018-06-22 10:51:14,995 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:51:14,995 INFO ]: Start minimizeSevpa. Operand 230 states. [2018-06-22 10:51:15,008 INFO ]: Finished minimizeSevpa. Reduced states from 230 to 222. [2018-06-22 10:51:15,008 INFO ]: Start removeUnreachable. Operand 222 states. [2018-06-22 10:51:15,010 INFO ]: Finished removeUnreachable. Reduced from 222 states to 222 states and 250 transitions. [2018-06-22 10:51:15,011 INFO ]: Start accepts. Automaton has 222 states and 250 transitions. Word has length 101 [2018-06-22 10:51:15,014 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:15,014 INFO ]: Abstraction has 222 states and 250 transitions. [2018-06-22 10:51:15,014 INFO ]: Interpolant automaton has 23 states. [2018-06-22 10:51:15,014 INFO ]: Start isEmpty. Operand 222 states and 250 transitions. [2018-06-22 10:51:15,016 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 10:51:15,016 INFO ]: Found error trace [2018-06-22 10:51:15,017 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:15,017 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:15,017 INFO ]: Analyzing trace with hash 1796063306, now seen corresponding path program 1 times [2018-06-22 10:51:15,017 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:15,017 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:15,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:15,018 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:15,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:15,042 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:15,625 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:15,626 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:15,626 INFO ]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-06-22 10:51:15,626 INFO ]: Interpolant automaton has 23 states [2018-06-22 10:51:15,626 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 10:51:15,626 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:51:15,627 INFO ]: Start difference. First operand 222 states and 250 transitions. Second operand 23 states. [2018-06-22 10:51:16,330 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:16,347 INFO ]: Finished difference Result 230 states and 258 transitions. [2018-06-22 10:51:16,347 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 10:51:16,347 INFO ]: Start accepts. Automaton has 23 states. Word has length 101 [2018-06-22 10:51:16,348 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:16,349 INFO ]: With dead ends: 230 [2018-06-22 10:51:16,349 INFO ]: Without dead ends: 230 [2018-06-22 10:51:16,349 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:51:16,350 INFO ]: Start minimizeSevpa. Operand 230 states. [2018-06-22 10:51:16,366 INFO ]: Finished minimizeSevpa. Reduced states from 230 to 230. [2018-06-22 10:51:16,366 INFO ]: Start removeUnreachable. Operand 230 states. [2018-06-22 10:51:16,372 INFO ]: Finished removeUnreachable. Reduced from 230 states to 230 states and 258 transitions. [2018-06-22 10:51:16,372 INFO ]: Start accepts. Automaton has 230 states and 258 transitions. Word has length 101 [2018-06-22 10:51:16,372 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:16,372 INFO ]: Abstraction has 230 states and 258 transitions. [2018-06-22 10:51:16,372 INFO ]: Interpolant automaton has 23 states. [2018-06-22 10:51:16,372 INFO ]: Start isEmpty. Operand 230 states and 258 transitions. [2018-06-22 10:51:16,377 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 10:51:16,377 INFO ]: Found error trace [2018-06-22 10:51:16,377 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:16,377 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:16,378 INFO ]: Analyzing trace with hash -1104995888, now seen corresponding path program 1 times [2018-06-22 10:51:16,378 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:16,378 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:16,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:16,378 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:16,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:16,406 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:17,054 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:17,054 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:17,054 INFO ]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-06-22 10:51:17,055 INFO ]: Interpolant automaton has 23 states [2018-06-22 10:51:17,055 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 10:51:17,055 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:51:17,055 INFO ]: Start difference. First operand 230 states and 258 transitions. Second operand 23 states. [2018-06-22 10:51:17,620 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:17,620 INFO ]: Finished difference Result 260 states and 294 transitions. [2018-06-22 10:51:17,621 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 10:51:17,621 INFO ]: Start accepts. Automaton has 23 states. Word has length 101 [2018-06-22 10:51:17,621 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:17,623 INFO ]: With dead ends: 260 [2018-06-22 10:51:17,623 INFO ]: Without dead ends: 260 [2018-06-22 10:51:17,623 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:51:17,623 INFO ]: Start minimizeSevpa. Operand 260 states. [2018-06-22 10:51:17,644 INFO ]: Finished minimizeSevpa. Reduced states from 260 to 252. [2018-06-22 10:51:17,644 INFO ]: Start removeUnreachable. Operand 252 states. [2018-06-22 10:51:17,646 INFO ]: Finished removeUnreachable. Reduced from 252 states to 252 states and 285 transitions. [2018-06-22 10:51:17,646 INFO ]: Start accepts. Automaton has 252 states and 285 transitions. Word has length 101 [2018-06-22 10:51:17,646 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:17,646 INFO ]: Abstraction has 252 states and 285 transitions. [2018-06-22 10:51:17,646 INFO ]: Interpolant automaton has 23 states. [2018-06-22 10:51:17,646 INFO ]: Start isEmpty. Operand 252 states and 285 transitions. [2018-06-22 10:51:17,654 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 10:51:17,654 INFO ]: Found error trace [2018-06-22 10:51:17,654 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:17,654 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:17,655 INFO ]: Analyzing trace with hash -574099509, now seen corresponding path program 1 times [2018-06-22 10:51:17,655 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:17,655 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:17,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:17,655 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:17,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:17,675 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:18,060 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:18,060 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:18,060 INFO ]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-06-22 10:51:18,060 INFO ]: Interpolant automaton has 23 states [2018-06-22 10:51:18,061 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 10:51:18,061 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:51:18,061 INFO ]: Start difference. First operand 252 states and 285 transitions. Second operand 23 states. [2018-06-22 10:51:18,434 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:18,434 INFO ]: Finished difference Result 260 states and 293 transitions. [2018-06-22 10:51:18,435 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 10:51:18,435 INFO ]: Start accepts. Automaton has 23 states. Word has length 101 [2018-06-22 10:51:18,435 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:18,436 INFO ]: With dead ends: 260 [2018-06-22 10:51:18,436 INFO ]: Without dead ends: 260 [2018-06-22 10:51:18,437 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:51:18,437 INFO ]: Start minimizeSevpa. Operand 260 states. [2018-06-22 10:51:18,449 INFO ]: Finished minimizeSevpa. Reduced states from 260 to 252. [2018-06-22 10:51:18,449 INFO ]: Start removeUnreachable. Operand 252 states. [2018-06-22 10:51:18,452 INFO ]: Finished removeUnreachable. Reduced from 252 states to 252 states and 285 transitions. [2018-06-22 10:51:18,452 INFO ]: Start accepts. Automaton has 252 states and 285 transitions. Word has length 101 [2018-06-22 10:51:18,452 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:18,452 INFO ]: Abstraction has 252 states and 285 transitions. [2018-06-22 10:51:18,452 INFO ]: Interpolant automaton has 23 states. [2018-06-22 10:51:18,452 INFO ]: Start isEmpty. Operand 252 states and 285 transitions. [2018-06-22 10:51:18,454 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 10:51:18,454 INFO ]: Found error trace [2018-06-22 10:51:18,454 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:18,454 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:18,454 INFO ]: Analyzing trace with hash 312331944, now seen corresponding path program 1 times [2018-06-22 10:51:18,454 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:18,455 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:18,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:18,456 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:18,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:18,474 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:19,053 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:19,053 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:19,053 INFO ]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-06-22 10:51:19,053 INFO ]: Interpolant automaton has 23 states [2018-06-22 10:51:19,054 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 10:51:19,054 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:51:19,054 INFO ]: Start difference. First operand 252 states and 285 transitions. Second operand 23 states. [2018-06-22 10:51:19,458 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:19,458 INFO ]: Finished difference Result 252 states and 284 transitions. [2018-06-22 10:51:19,459 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 10:51:19,459 INFO ]: Start accepts. Automaton has 23 states. Word has length 101 [2018-06-22 10:51:19,459 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:19,461 INFO ]: With dead ends: 252 [2018-06-22 10:51:19,461 INFO ]: Without dead ends: 252 [2018-06-22 10:51:19,461 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:51:19,461 INFO ]: Start minimizeSevpa. Operand 252 states. [2018-06-22 10:51:19,474 INFO ]: Finished minimizeSevpa. Reduced states from 252 to 244. [2018-06-22 10:51:19,474 INFO ]: Start removeUnreachable. Operand 244 states. [2018-06-22 10:51:19,476 INFO ]: Finished removeUnreachable. Reduced from 244 states to 244 states and 276 transitions. [2018-06-22 10:51:19,476 INFO ]: Start accepts. Automaton has 244 states and 276 transitions. Word has length 101 [2018-06-22 10:51:19,476 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:19,476 INFO ]: Abstraction has 244 states and 276 transitions. [2018-06-22 10:51:19,476 INFO ]: Interpolant automaton has 23 states. [2018-06-22 10:51:19,476 INFO ]: Start isEmpty. Operand 244 states and 276 transitions. [2018-06-22 10:51:19,480 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:51:19,480 INFO ]: Found error trace [2018-06-22 10:51:19,480 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:19,480 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:19,480 INFO ]: Analyzing trace with hash -356864684, now seen corresponding path program 1 times [2018-06-22 10:51:19,480 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:19,480 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:19,481 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:19,481 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:19,481 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:19,503 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:19,921 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:19,921 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:19,922 INFO ]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-06-22 10:51:19,922 INFO ]: Interpolant automaton has 24 states [2018-06-22 10:51:19,922 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 10:51:19,922 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:51:19,922 INFO ]: Start difference. First operand 244 states and 276 transitions. Second operand 24 states. [2018-06-22 10:51:20,432 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:20,432 INFO ]: Finished difference Result 286 states and 326 transitions. [2018-06-22 10:51:20,436 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 10:51:20,436 INFO ]: Start accepts. Automaton has 24 states. Word has length 105 [2018-06-22 10:51:20,436 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:20,438 INFO ]: With dead ends: 286 [2018-06-22 10:51:20,438 INFO ]: Without dead ends: 286 [2018-06-22 10:51:20,438 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:51:20,439 INFO ]: Start minimizeSevpa. Operand 286 states. [2018-06-22 10:51:20,453 INFO ]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-06-22 10:51:20,453 INFO ]: Start removeUnreachable. Operand 286 states. [2018-06-22 10:51:20,455 INFO ]: Finished removeUnreachable. Reduced from 286 states to 286 states and 326 transitions. [2018-06-22 10:51:20,455 INFO ]: Start accepts. Automaton has 286 states and 326 transitions. Word has length 105 [2018-06-22 10:51:20,456 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:20,456 INFO ]: Abstraction has 286 states and 326 transitions. [2018-06-22 10:51:20,456 INFO ]: Interpolant automaton has 24 states. [2018-06-22 10:51:20,456 INFO ]: Start isEmpty. Operand 286 states and 326 transitions. [2018-06-22 10:51:20,458 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:51:20,458 INFO ]: Found error trace [2018-06-22 10:51:20,458 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:20,458 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:20,458 INFO ]: Analyzing trace with hash -293561294, now seen corresponding path program 1 times [2018-06-22 10:51:20,458 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:20,458 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:20,459 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:20,459 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:20,459 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:20,479 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:21,189 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:21,190 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:21,190 INFO ]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-06-22 10:51:21,190 INFO ]: Interpolant automaton has 24 states [2018-06-22 10:51:21,190 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 10:51:21,190 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:51:21,190 INFO ]: Start difference. First operand 286 states and 326 transitions. Second operand 24 states. [2018-06-22 10:51:21,657 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:21,658 INFO ]: Finished difference Result 328 states and 376 transitions. [2018-06-22 10:51:21,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 10:51:21,658 INFO ]: Start accepts. Automaton has 24 states. Word has length 105 [2018-06-22 10:51:21,658 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:21,659 INFO ]: With dead ends: 328 [2018-06-22 10:51:21,659 INFO ]: Without dead ends: 328 [2018-06-22 10:51:21,660 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:51:21,660 INFO ]: Start minimizeSevpa. Operand 328 states. [2018-06-22 10:51:21,673 INFO ]: Finished minimizeSevpa. Reduced states from 328 to 320. [2018-06-22 10:51:21,673 INFO ]: Start removeUnreachable. Operand 320 states. [2018-06-22 10:51:21,675 INFO ]: Finished removeUnreachable. Reduced from 320 states to 320 states and 367 transitions. [2018-06-22 10:51:21,675 INFO ]: Start accepts. Automaton has 320 states and 367 transitions. Word has length 105 [2018-06-22 10:51:21,675 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:21,675 INFO ]: Abstraction has 320 states and 367 transitions. [2018-06-22 10:51:21,675 INFO ]: Interpolant automaton has 24 states. [2018-06-22 10:51:21,675 INFO ]: Start isEmpty. Operand 320 states and 367 transitions. [2018-06-22 10:51:21,677 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:51:21,677 INFO ]: Found error trace [2018-06-22 10:51:21,677 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:21,677 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:21,677 INFO ]: Analyzing trace with hash 835245135, now seen corresponding path program 1 times [2018-06-22 10:51:21,677 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:21,677 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:21,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:21,678 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:21,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:21,698 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:22,487 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:22,487 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:22,487 INFO ]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-06-22 10:51:22,487 INFO ]: Interpolant automaton has 24 states [2018-06-22 10:51:22,488 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 10:51:22,488 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:51:22,488 INFO ]: Start difference. First operand 320 states and 367 transitions. Second operand 24 states. [2018-06-22 10:51:23,869 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:23,870 INFO ]: Finished difference Result 328 states and 375 transitions. [2018-06-22 10:51:23,870 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 10:51:23,870 INFO ]: Start accepts. Automaton has 24 states. Word has length 105 [2018-06-22 10:51:23,870 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:23,872 INFO ]: With dead ends: 328 [2018-06-22 10:51:23,872 INFO ]: Without dead ends: 328 [2018-06-22 10:51:23,873 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:51:23,873 INFO ]: Start minimizeSevpa. Operand 328 states. [2018-06-22 10:51:23,887 INFO ]: Finished minimizeSevpa. Reduced states from 328 to 320. [2018-06-22 10:51:23,887 INFO ]: Start removeUnreachable. Operand 320 states. [2018-06-22 10:51:23,889 INFO ]: Finished removeUnreachable. Reduced from 320 states to 320 states and 367 transitions. [2018-06-22 10:51:23,889 INFO ]: Start accepts. Automaton has 320 states and 367 transitions. Word has length 105 [2018-06-22 10:51:23,889 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:23,889 INFO ]: Abstraction has 320 states and 367 transitions. [2018-06-22 10:51:23,889 INFO ]: Interpolant automaton has 24 states. [2018-06-22 10:51:23,889 INFO ]: Start isEmpty. Operand 320 states and 367 transitions. [2018-06-22 10:51:23,891 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:51:23,891 INFO ]: Found error trace [2018-06-22 10:51:23,891 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:23,891 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:23,891 INFO ]: Analyzing trace with hash -1743911561, now seen corresponding path program 1 times [2018-06-22 10:51:23,891 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:23,891 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:23,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:23,892 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:23,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:23,911 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:24,511 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:24,512 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:24,512 INFO ]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-06-22 10:51:24,512 INFO ]: Interpolant automaton has 24 states [2018-06-22 10:51:24,512 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 10:51:24,512 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:51:24,512 INFO ]: Start difference. First operand 320 states and 367 transitions. Second operand 24 states. [2018-06-22 10:51:24,936 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:24,936 INFO ]: Finished difference Result 352 states and 405 transitions. [2018-06-22 10:51:24,936 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 10:51:24,936 INFO ]: Start accepts. Automaton has 24 states. Word has length 105 [2018-06-22 10:51:24,936 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:24,938 INFO ]: With dead ends: 352 [2018-06-22 10:51:24,938 INFO ]: Without dead ends: 352 [2018-06-22 10:51:24,938 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:51:24,938 INFO ]: Start minimizeSevpa. Operand 352 states. [2018-06-22 10:51:24,957 INFO ]: Finished minimizeSevpa. Reduced states from 352 to 344. [2018-06-22 10:51:24,957 INFO ]: Start removeUnreachable. Operand 344 states. [2018-06-22 10:51:24,959 INFO ]: Finished removeUnreachable. Reduced from 344 states to 344 states and 396 transitions. [2018-06-22 10:51:24,959 INFO ]: Start accepts. Automaton has 344 states and 396 transitions. Word has length 105 [2018-06-22 10:51:24,959 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:24,959 INFO ]: Abstraction has 344 states and 396 transitions. [2018-06-22 10:51:24,959 INFO ]: Interpolant automaton has 24 states. [2018-06-22 10:51:24,959 INFO ]: Start isEmpty. Operand 344 states and 396 transitions. [2018-06-22 10:51:24,961 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:51:24,961 INFO ]: Found error trace [2018-06-22 10:51:24,961 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:24,961 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:24,961 INFO ]: Analyzing trace with hash -551801742, now seen corresponding path program 1 times [2018-06-22 10:51:24,961 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:24,961 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:24,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:24,962 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:24,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:24,980 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:25,344 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:25,344 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:25,344 INFO ]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-06-22 10:51:25,345 INFO ]: Interpolant automaton has 24 states [2018-06-22 10:51:25,345 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 10:51:25,345 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:51:25,345 INFO ]: Start difference. First operand 344 states and 396 transitions. Second operand 24 states. [2018-06-22 10:51:25,759 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:25,759 INFO ]: Finished difference Result 352 states and 404 transitions. [2018-06-22 10:51:25,759 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 10:51:25,759 INFO ]: Start accepts. Automaton has 24 states. Word has length 105 [2018-06-22 10:51:25,759 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:25,761 INFO ]: With dead ends: 352 [2018-06-22 10:51:25,761 INFO ]: Without dead ends: 352 [2018-06-22 10:51:25,761 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:51:25,762 INFO ]: Start minimizeSevpa. Operand 352 states. [2018-06-22 10:51:25,775 INFO ]: Finished minimizeSevpa. Reduced states from 352 to 344. [2018-06-22 10:51:25,775 INFO ]: Start removeUnreachable. Operand 344 states. [2018-06-22 10:51:25,777 INFO ]: Finished removeUnreachable. Reduced from 344 states to 344 states and 396 transitions. [2018-06-22 10:51:25,777 INFO ]: Start accepts. Automaton has 344 states and 396 transitions. Word has length 105 [2018-06-22 10:51:25,777 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:25,777 INFO ]: Abstraction has 344 states and 396 transitions. [2018-06-22 10:51:25,777 INFO ]: Interpolant automaton has 24 states. [2018-06-22 10:51:25,777 INFO ]: Start isEmpty. Operand 344 states and 396 transitions. [2018-06-22 10:51:25,779 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:51:25,779 INFO ]: Found error trace [2018-06-22 10:51:25,779 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:25,779 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:25,779 INFO ]: Analyzing trace with hash -1750663019, now seen corresponding path program 1 times [2018-06-22 10:51:25,779 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:25,779 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:25,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:25,780 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:25,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:25,797 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:26,228 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:26,228 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:26,228 INFO ]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-06-22 10:51:26,228 INFO ]: Interpolant automaton has 24 states [2018-06-22 10:51:26,228 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 10:51:26,229 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:51:26,229 INFO ]: Start difference. First operand 344 states and 396 transitions. Second operand 24 states. [2018-06-22 10:51:27,276 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:27,276 INFO ]: Finished difference Result 386 states and 446 transitions. [2018-06-22 10:51:27,277 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 10:51:27,277 INFO ]: Start accepts. Automaton has 24 states. Word has length 105 [2018-06-22 10:51:27,277 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:27,279 INFO ]: With dead ends: 386 [2018-06-22 10:51:27,279 INFO ]: Without dead ends: 386 [2018-06-22 10:51:27,279 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:51:27,279 INFO ]: Start minimizeSevpa. Operand 386 states. [2018-06-22 10:51:27,299 INFO ]: Finished minimizeSevpa. Reduced states from 386 to 378. [2018-06-22 10:51:27,299 INFO ]: Start removeUnreachable. Operand 378 states. [2018-06-22 10:51:27,301 INFO ]: Finished removeUnreachable. Reduced from 378 states to 378 states and 437 transitions. [2018-06-22 10:51:27,301 INFO ]: Start accepts. Automaton has 378 states and 437 transitions. Word has length 105 [2018-06-22 10:51:27,301 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:27,301 INFO ]: Abstraction has 378 states and 437 transitions. [2018-06-22 10:51:27,301 INFO ]: Interpolant automaton has 24 states. [2018-06-22 10:51:27,301 INFO ]: Start isEmpty. Operand 378 states and 437 transitions. [2018-06-22 10:51:27,303 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:51:27,303 INFO ]: Found error trace [2018-06-22 10:51:27,303 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:27,303 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:27,303 INFO ]: Analyzing trace with hash -558553200, now seen corresponding path program 1 times [2018-06-22 10:51:27,304 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:27,304 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:27,304 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:27,304 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:27,304 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:27,323 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:27,879 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:27,879 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:27,879 INFO ]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-06-22 10:51:27,879 INFO ]: Interpolant automaton has 24 states [2018-06-22 10:51:27,879 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 10:51:27,879 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:51:27,879 INFO ]: Start difference. First operand 378 states and 437 transitions. Second operand 24 states. [2018-06-22 10:51:28,288 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:28,288 INFO ]: Finished difference Result 386 states and 445 transitions. [2018-06-22 10:51:28,289 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 10:51:28,289 INFO ]: Start accepts. Automaton has 24 states. Word has length 105 [2018-06-22 10:51:28,289 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:28,290 INFO ]: With dead ends: 386 [2018-06-22 10:51:28,290 INFO ]: Without dead ends: 386 [2018-06-22 10:51:28,290 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:51:28,291 INFO ]: Start minimizeSevpa. Operand 386 states. [2018-06-22 10:51:28,305 INFO ]: Finished minimizeSevpa. Reduced states from 386 to 378. [2018-06-22 10:51:28,305 INFO ]: Start removeUnreachable. Operand 378 states. [2018-06-22 10:51:28,307 INFO ]: Finished removeUnreachable. Reduced from 378 states to 378 states and 437 transitions. [2018-06-22 10:51:28,307 INFO ]: Start accepts. Automaton has 378 states and 437 transitions. Word has length 105 [2018-06-22 10:51:28,307 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:28,307 INFO ]: Abstraction has 378 states and 437 transitions. [2018-06-22 10:51:28,307 INFO ]: Interpolant automaton has 24 states. [2018-06-22 10:51:28,308 INFO ]: Start isEmpty. Operand 378 states and 437 transitions. [2018-06-22 10:51:28,309 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:51:28,309 INFO ]: Found error trace [2018-06-22 10:51:28,310 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:28,310 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:28,310 INFO ]: Analyzing trace with hash 1157257400, now seen corresponding path program 1 times [2018-06-22 10:51:28,310 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:28,310 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:28,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:28,311 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:28,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:28,327 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:28,709 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:28,709 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:28,709 INFO ]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-06-22 10:51:28,710 INFO ]: Interpolant automaton has 24 states [2018-06-22 10:51:28,710 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 10:51:28,710 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:51:28,710 INFO ]: Start difference. First operand 378 states and 437 transitions. Second operand 24 states. [2018-06-22 10:51:29,099 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:29,099 INFO ]: Finished difference Result 410 states and 475 transitions. [2018-06-22 10:51:29,099 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 10:51:29,100 INFO ]: Start accepts. Automaton has 24 states. Word has length 105 [2018-06-22 10:51:29,100 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:29,101 INFO ]: With dead ends: 410 [2018-06-22 10:51:29,101 INFO ]: Without dead ends: 410 [2018-06-22 10:51:29,101 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:51:29,101 INFO ]: Start minimizeSevpa. Operand 410 states. [2018-06-22 10:51:29,118 INFO ]: Finished minimizeSevpa. Reduced states from 410 to 402. [2018-06-22 10:51:29,118 INFO ]: Start removeUnreachable. Operand 402 states. [2018-06-22 10:51:29,120 INFO ]: Finished removeUnreachable. Reduced from 402 states to 402 states and 466 transitions. [2018-06-22 10:51:29,120 INFO ]: Start accepts. Automaton has 402 states and 466 transitions. Word has length 105 [2018-06-22 10:51:29,120 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:29,120 INFO ]: Abstraction has 402 states and 466 transitions. [2018-06-22 10:51:29,120 INFO ]: Interpolant automaton has 24 states. [2018-06-22 10:51:29,121 INFO ]: Start isEmpty. Operand 402 states and 466 transitions. [2018-06-22 10:51:29,122 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:51:29,122 INFO ]: Found error trace [2018-06-22 10:51:29,123 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:29,123 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:29,123 INFO ]: Analyzing trace with hash 898548525, now seen corresponding path program 1 times [2018-06-22 10:51:29,123 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:29,123 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:29,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:29,124 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:29,124 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:29,141 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:29,564 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:29,564 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:29,564 INFO ]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-06-22 10:51:29,564 INFO ]: Interpolant automaton has 24 states [2018-06-22 10:51:29,564 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 10:51:29,564 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:51:29,565 INFO ]: Start difference. First operand 402 states and 466 transitions. Second operand 24 states. [2018-06-22 10:51:29,957 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:29,957 INFO ]: Finished difference Result 410 states and 474 transitions. [2018-06-22 10:51:29,957 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 10:51:29,957 INFO ]: Start accepts. Automaton has 24 states. Word has length 105 [2018-06-22 10:51:29,957 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:29,959 INFO ]: With dead ends: 410 [2018-06-22 10:51:29,959 INFO ]: Without dead ends: 410 [2018-06-22 10:51:29,959 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:51:29,959 INFO ]: Start minimizeSevpa. Operand 410 states. [2018-06-22 10:51:29,976 INFO ]: Finished minimizeSevpa. Reduced states from 410 to 402. [2018-06-22 10:51:29,976 INFO ]: Start removeUnreachable. Operand 402 states. [2018-06-22 10:51:29,978 INFO ]: Finished removeUnreachable. Reduced from 402 states to 402 states and 466 transitions. [2018-06-22 10:51:29,978 INFO ]: Start accepts. Automaton has 402 states and 466 transitions. Word has length 105 [2018-06-22 10:51:29,978 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:29,978 INFO ]: Abstraction has 402 states and 466 transitions. [2018-06-22 10:51:29,978 INFO ]: Interpolant automaton has 24 states. [2018-06-22 10:51:29,978 INFO ]: Start isEmpty. Operand 402 states and 466 transitions. [2018-06-22 10:51:29,980 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:51:29,980 INFO ]: Found error trace [2018-06-22 10:51:29,981 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:29,981 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:29,981 INFO ]: Analyzing trace with hash -1680608171, now seen corresponding path program 1 times [2018-06-22 10:51:29,981 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:29,981 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:29,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:29,981 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:29,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:30,002 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:30,536 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:30,536 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:30,536 INFO ]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-06-22 10:51:30,536 INFO ]: Interpolant automaton has 24 states [2018-06-22 10:51:30,536 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 10:51:30,536 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:51:30,537 INFO ]: Start difference. First operand 402 states and 466 transitions. Second operand 24 states. [2018-06-22 10:51:30,934 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:30,934 INFO ]: Finished difference Result 434 states and 504 transitions. [2018-06-22 10:51:30,934 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 10:51:30,934 INFO ]: Start accepts. Automaton has 24 states. Word has length 105 [2018-06-22 10:51:30,935 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:30,936 INFO ]: With dead ends: 434 [2018-06-22 10:51:30,936 INFO ]: Without dead ends: 434 [2018-06-22 10:51:30,937 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:51:30,937 INFO ]: Start minimizeSevpa. Operand 434 states. [2018-06-22 10:51:30,955 INFO ]: Finished minimizeSevpa. Reduced states from 434 to 426. [2018-06-22 10:51:30,955 INFO ]: Start removeUnreachable. Operand 426 states. [2018-06-22 10:51:30,957 INFO ]: Finished removeUnreachable. Reduced from 426 states to 426 states and 495 transitions. [2018-06-22 10:51:30,957 INFO ]: Start accepts. Automaton has 426 states and 495 transitions. Word has length 105 [2018-06-22 10:51:30,957 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:30,958 INFO ]: Abstraction has 426 states and 495 transitions. [2018-06-22 10:51:30,958 INFO ]: Interpolant automaton has 24 states. [2018-06-22 10:51:30,958 INFO ]: Start isEmpty. Operand 426 states and 495 transitions. [2018-06-22 10:51:30,959 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:51:30,959 INFO ]: Found error trace [2018-06-22 10:51:30,960 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:30,960 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:30,960 INFO ]: Analyzing trace with hash -1945600077, now seen corresponding path program 1 times [2018-06-22 10:51:30,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:30,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:30,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:30,960 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:30,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:30,976 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:31,961 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:31,961 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:31,961 INFO ]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-06-22 10:51:31,961 INFO ]: Interpolant automaton has 24 states [2018-06-22 10:51:31,961 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 10:51:31,962 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:51:31,962 INFO ]: Start difference. First operand 426 states and 495 transitions. Second operand 24 states. [2018-06-22 10:51:32,389 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:32,389 INFO ]: Finished difference Result 434 states and 503 transitions. [2018-06-22 10:51:32,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 10:51:32,437 INFO ]: Start accepts. Automaton has 24 states. Word has length 105 [2018-06-22 10:51:32,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:32,438 INFO ]: With dead ends: 434 [2018-06-22 10:51:32,438 INFO ]: Without dead ends: 434 [2018-06-22 10:51:32,438 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:51:32,438 INFO ]: Start minimizeSevpa. Operand 434 states. [2018-06-22 10:51:32,458 INFO ]: Finished minimizeSevpa. Reduced states from 434 to 426. [2018-06-22 10:51:32,458 INFO ]: Start removeUnreachable. Operand 426 states. [2018-06-22 10:51:32,460 INFO ]: Finished removeUnreachable. Reduced from 426 states to 426 states and 495 transitions. [2018-06-22 10:51:32,460 INFO ]: Start accepts. Automaton has 426 states and 495 transitions. Word has length 105 [2018-06-22 10:51:32,460 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:32,460 INFO ]: Abstraction has 426 states and 495 transitions. [2018-06-22 10:51:32,460 INFO ]: Interpolant automaton has 24 states. [2018-06-22 10:51:32,460 INFO ]: Start isEmpty. Operand 426 states and 495 transitions. [2018-06-22 10:51:32,462 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:51:32,462 INFO ]: Found error trace [2018-06-22 10:51:32,462 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:32,462 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:32,462 INFO ]: Analyzing trace with hash -488498352, now seen corresponding path program 1 times [2018-06-22 10:51:32,462 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:32,462 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:32,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:32,463 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:32,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:32,477 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:32,754 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:32,754 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:32,754 INFO ]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-06-22 10:51:32,754 INFO ]: Interpolant automaton has 24 states [2018-06-22 10:51:32,754 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 10:51:32,754 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:51:32,754 INFO ]: Start difference. First operand 426 states and 495 transitions. Second operand 24 states. [2018-06-22 10:51:33,132 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:33,132 INFO ]: Finished difference Result 426 states and 494 transitions. [2018-06-22 10:51:33,133 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 10:51:33,133 INFO ]: Start accepts. Automaton has 24 states. Word has length 105 [2018-06-22 10:51:33,133 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:33,135 INFO ]: With dead ends: 426 [2018-06-22 10:51:33,135 INFO ]: Without dead ends: 426 [2018-06-22 10:51:33,135 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:51:33,135 INFO ]: Start minimizeSevpa. Operand 426 states. [2018-06-22 10:51:33,152 INFO ]: Finished minimizeSevpa. Reduced states from 426 to 418. [2018-06-22 10:51:33,152 INFO ]: Start removeUnreachable. Operand 418 states. [2018-06-22 10:51:33,154 INFO ]: Finished removeUnreachable. Reduced from 418 states to 418 states and 486 transitions. [2018-06-22 10:51:33,154 INFO ]: Start accepts. Automaton has 418 states and 486 transitions. Word has length 105 [2018-06-22 10:51:33,154 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:33,154 INFO ]: Abstraction has 418 states and 486 transitions. [2018-06-22 10:51:33,154 INFO ]: Interpolant automaton has 24 states. [2018-06-22 10:51:33,154 INFO ]: Start isEmpty. Operand 418 states and 486 transitions. [2018-06-22 10:51:33,156 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 10:51:33,156 INFO ]: Found error trace [2018-06-22 10:51:33,157 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:33,157 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:33,157 INFO ]: Analyzing trace with hash 280910182, now seen corresponding path program 1 times [2018-06-22 10:51:33,157 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:33,157 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:33,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:33,158 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:33,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:33,177 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:33,492 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:33,492 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:33,492 INFO ]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-06-22 10:51:33,492 INFO ]: Interpolant automaton has 25 states [2018-06-22 10:51:33,492 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 10:51:33,492 INFO ]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:51:33,492 INFO ]: Start difference. First operand 418 states and 486 transitions. Second operand 25 states. [2018-06-22 10:51:33,991 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:33,991 INFO ]: Finished difference Result 434 states and 502 transitions. [2018-06-22 10:51:33,991 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 10:51:33,991 INFO ]: Start accepts. Automaton has 25 states. Word has length 117 [2018-06-22 10:51:33,992 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:33,993 INFO ]: With dead ends: 434 [2018-06-22 10:51:33,993 INFO ]: Without dead ends: 434 [2018-06-22 10:51:33,994 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:51:33,994 INFO ]: Start minimizeSevpa. Operand 434 states. [2018-06-22 10:51:34,010 INFO ]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-06-22 10:51:34,011 INFO ]: Start removeUnreachable. Operand 434 states. [2018-06-22 10:51:34,012 INFO ]: Finished removeUnreachable. Reduced from 434 states to 434 states and 502 transitions. [2018-06-22 10:51:34,013 INFO ]: Start accepts. Automaton has 434 states and 502 transitions. Word has length 117 [2018-06-22 10:51:34,013 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:34,013 INFO ]: Abstraction has 434 states and 502 transitions. [2018-06-22 10:51:34,013 INFO ]: Interpolant automaton has 25 states. [2018-06-22 10:51:34,013 INFO ]: Start isEmpty. Operand 434 states and 502 transitions. [2018-06-22 10:51:34,016 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 10:51:34,016 INFO ]: Found error trace [2018-06-22 10:51:34,016 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:34,016 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:34,016 INFO ]: Analyzing trace with hash 1884649447, now seen corresponding path program 1 times [2018-06-22 10:51:34,016 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:34,016 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:34,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:34,017 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:34,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:34,034 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:34,657 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:34,657 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:34,657 INFO ]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-06-22 10:51:34,657 INFO ]: Interpolant automaton has 25 states [2018-06-22 10:51:34,657 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 10:51:34,658 INFO ]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:51:34,658 INFO ]: Start difference. First operand 434 states and 502 transitions. Second operand 25 states. [2018-06-22 10:51:34,987 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:34,987 INFO ]: Finished difference Result 450 states and 518 transitions. [2018-06-22 10:51:34,987 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 10:51:34,987 INFO ]: Start accepts. Automaton has 25 states. Word has length 117 [2018-06-22 10:51:34,988 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:34,989 INFO ]: With dead ends: 450 [2018-06-22 10:51:34,989 INFO ]: Without dead ends: 450 [2018-06-22 10:51:34,989 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:51:34,989 INFO ]: Start minimizeSevpa. Operand 450 states. [2018-06-22 10:51:35,004 INFO ]: Finished minimizeSevpa. Reduced states from 450 to 434. [2018-06-22 10:51:35,004 INFO ]: Start removeUnreachable. Operand 434 states. [2018-06-22 10:51:35,006 INFO ]: Finished removeUnreachable. Reduced from 434 states to 434 states and 502 transitions. [2018-06-22 10:51:35,006 INFO ]: Start accepts. Automaton has 434 states and 502 transitions. Word has length 117 [2018-06-22 10:51:35,006 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:35,006 INFO ]: Abstraction has 434 states and 502 transitions. [2018-06-22 10:51:35,006 INFO ]: Interpolant automaton has 25 states. [2018-06-22 10:51:35,007 INFO ]: Start isEmpty. Operand 434 states and 502 transitions. [2018-06-22 10:51:35,008 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 10:51:35,008 INFO ]: Found error trace [2018-06-22 10:51:35,009 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:35,009 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:35,009 INFO ]: Analyzing trace with hash 1468082628, now seen corresponding path program 1 times [2018-06-22 10:51:35,009 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:35,009 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:35,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:35,009 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:35,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:35,025 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:35,471 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:35,471 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:35,471 INFO ]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-06-22 10:51:35,471 INFO ]: Interpolant automaton has 25 states [2018-06-22 10:51:35,472 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 10:51:35,472 INFO ]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:51:35,472 INFO ]: Start difference. First operand 434 states and 502 transitions. Second operand 25 states. [2018-06-22 10:51:35,860 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:35,860 INFO ]: Finished difference Result 450 states and 518 transitions. [2018-06-22 10:51:35,861 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 10:51:35,861 INFO ]: Start accepts. Automaton has 25 states. Word has length 117 [2018-06-22 10:51:35,861 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:35,862 INFO ]: With dead ends: 450 [2018-06-22 10:51:35,862 INFO ]: Without dead ends: 450 [2018-06-22 10:51:35,862 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:51:35,863 INFO ]: Start minimizeSevpa. Operand 450 states. [2018-06-22 10:51:35,877 INFO ]: Finished minimizeSevpa. Reduced states from 450 to 434. [2018-06-22 10:51:35,877 INFO ]: Start removeUnreachable. Operand 434 states. [2018-06-22 10:51:35,879 INFO ]: Finished removeUnreachable. Reduced from 434 states to 434 states and 502 transitions. [2018-06-22 10:51:35,879 INFO ]: Start accepts. Automaton has 434 states and 502 transitions. Word has length 117 [2018-06-22 10:51:35,879 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:35,879 INFO ]: Abstraction has 434 states and 502 transitions. [2018-06-22 10:51:35,879 INFO ]: Interpolant automaton has 25 states. [2018-06-22 10:51:35,879 INFO ]: Start isEmpty. Operand 434 states and 502 transitions. [2018-06-22 10:51:35,881 INFO ]: Finished isEmpty. Found accepting run of length 122 [2018-06-22 10:51:35,881 INFO ]: Found error trace [2018-06-22 10:51:35,881 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:35,881 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:35,881 INFO ]: Analyzing trace with hash 1962243819, now seen corresponding path program 1 times [2018-06-22 10:51:35,881 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:35,881 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:35,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:35,882 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:35,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:35,896 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:36,095 WARN ]: Spent 132.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-06-22 10:51:36,368 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:51:36,368 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:51:36,368 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-22 10:51:36,380 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:36,541 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:36,565 INFO ]: Computing forward predicates... [2018-06-22 10:51:37,651 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:51:37,677 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 10:51:37,677 INFO ]: Number of different interpolants: perfect sequences [18] imperfect sequences [29] total 45 [2018-06-22 10:51:37,678 INFO ]: Interpolant automaton has 45 states [2018-06-22 10:51:37,678 INFO ]: Constructing interpolant automaton starting with 45 interpolants. [2018-06-22 10:51:37,679 INFO ]: CoverageRelationStatistics Valid=91, Invalid=1889, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 10:51:37,679 INFO ]: Start difference. First operand 434 states and 502 transitions. Second operand 45 states. [2018-06-22 10:51:40,394 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:40,394 INFO ]: Finished difference Result 482 states and 554 transitions. [2018-06-22 10:51:40,394 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-22 10:51:40,394 INFO ]: Start accepts. Automaton has 45 states. Word has length 121 [2018-06-22 10:51:40,394 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:40,397 INFO ]: With dead ends: 482 [2018-06-22 10:51:40,397 INFO ]: Without dead ends: 482 [2018-06-22 10:51:40,398 INFO ]: 0 DeclaredPredicates, 165 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 10:51:40,399 INFO ]: Start minimizeSevpa. Operand 482 states. [2018-06-22 10:51:40,431 INFO ]: Finished minimizeSevpa. Reduced states from 482 to 440. [2018-06-22 10:51:40,431 INFO ]: Start removeUnreachable. Operand 440 states. [2018-06-22 10:51:40,433 INFO ]: Finished removeUnreachable. Reduced from 440 states to 440 states and 511 transitions. [2018-06-22 10:51:40,433 INFO ]: Start accepts. Automaton has 440 states and 511 transitions. Word has length 121 [2018-06-22 10:51:40,433 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:40,433 INFO ]: Abstraction has 440 states and 511 transitions. [2018-06-22 10:51:40,433 INFO ]: Interpolant automaton has 45 states. [2018-06-22 10:51:40,433 INFO ]: Start isEmpty. Operand 440 states and 511 transitions. [2018-06-22 10:51:40,435 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 10:51:40,435 INFO ]: Found error trace [2018-06-22 10:51:40,435 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:40,435 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:40,435 INFO ]: Analyzing trace with hash 78383211, now seen corresponding path program 1 times [2018-06-22 10:51:40,435 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:40,435 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:40,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:40,436 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:40,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:40,461 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:41,490 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:41,490 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:41,490 INFO ]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-06-22 10:51:41,490 INFO ]: Interpolant automaton has 28 states [2018-06-22 10:51:41,490 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 10:51:41,491 INFO ]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-06-22 10:51:41,491 INFO ]: Start difference. First operand 440 states and 511 transitions. Second operand 28 states. [2018-06-22 10:51:41,935 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:41,936 INFO ]: Finished difference Result 460 states and 530 transitions. [2018-06-22 10:51:41,936 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 10:51:41,936 INFO ]: Start accepts. Automaton has 28 states. Word has length 125 [2018-06-22 10:51:41,936 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:41,937 INFO ]: With dead ends: 460 [2018-06-22 10:51:41,937 INFO ]: Without dead ends: 440 [2018-06-22 10:51:41,937 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-06-22 10:51:41,938 INFO ]: Start minimizeSevpa. Operand 440 states. [2018-06-22 10:51:41,955 INFO ]: Finished minimizeSevpa. Reduced states from 440 to 440. [2018-06-22 10:51:41,955 INFO ]: Start removeUnreachable. Operand 440 states. [2018-06-22 10:51:41,956 INFO ]: Finished removeUnreachable. Reduced from 440 states to 440 states and 510 transitions. [2018-06-22 10:51:41,956 INFO ]: Start accepts. Automaton has 440 states and 510 transitions. Word has length 125 [2018-06-22 10:51:41,957 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:41,957 INFO ]: Abstraction has 440 states and 510 transitions. [2018-06-22 10:51:41,957 INFO ]: Interpolant automaton has 28 states. [2018-06-22 10:51:41,957 INFO ]: Start isEmpty. Operand 440 states and 510 transitions. [2018-06-22 10:51:41,958 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 10:51:41,958 INFO ]: Found error trace [2018-06-22 10:51:41,959 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:41,959 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:41,959 INFO ]: Analyzing trace with hash 1855848044, now seen corresponding path program 1 times [2018-06-22 10:51:41,959 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:41,959 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:41,959 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:41,959 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:41,959 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:41,975 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:43,140 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:43,140 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:43,159 INFO ]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-06-22 10:51:43,159 INFO ]: Interpolant automaton has 28 states [2018-06-22 10:51:43,159 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 10:51:43,159 INFO ]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-06-22 10:51:43,159 INFO ]: Start difference. First operand 440 states and 510 transitions. Second operand 28 states. [2018-06-22 10:51:43,541 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:43,541 INFO ]: Finished difference Result 460 states and 529 transitions. [2018-06-22 10:51:43,541 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 10:51:43,541 INFO ]: Start accepts. Automaton has 28 states. Word has length 125 [2018-06-22 10:51:43,541 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:43,543 INFO ]: With dead ends: 460 [2018-06-22 10:51:43,543 INFO ]: Without dead ends: 440 [2018-06-22 10:51:43,543 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-06-22 10:51:43,544 INFO ]: Start minimizeSevpa. Operand 440 states. [2018-06-22 10:51:43,560 INFO ]: Finished minimizeSevpa. Reduced states from 440 to 440. [2018-06-22 10:51:43,560 INFO ]: Start removeUnreachable. Operand 440 states. [2018-06-22 10:51:43,562 INFO ]: Finished removeUnreachable. Reduced from 440 states to 440 states and 509 transitions. [2018-06-22 10:51:43,562 INFO ]: Start accepts. Automaton has 440 states and 509 transitions. Word has length 125 [2018-06-22 10:51:43,562 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:43,562 INFO ]: Abstraction has 440 states and 509 transitions. [2018-06-22 10:51:43,562 INFO ]: Interpolant automaton has 28 states. [2018-06-22 10:51:43,562 INFO ]: Start isEmpty. Operand 440 states and 509 transitions. [2018-06-22 10:51:43,565 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 10:51:43,565 INFO ]: Found error trace [2018-06-22 10:51:43,565 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:43,565 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:43,565 INFO ]: Analyzing trace with hash -1833731639, now seen corresponding path program 1 times [2018-06-22 10:51:43,565 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:43,565 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:43,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:43,566 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:43,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:43,580 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:45,900 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:51:45,900 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:51:45,900 INFO ]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-06-22 10:51:45,901 INFO ]: Interpolant automaton has 28 states [2018-06-22 10:51:45,901 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 10:51:45,901 INFO ]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-06-22 10:51:45,901 INFO ]: Start difference. First operand 440 states and 509 transitions. Second operand 28 states. [2018-06-22 10:51:46,937 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:46,937 INFO ]: Finished difference Result 460 states and 528 transitions. [2018-06-22 10:51:46,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 10:51:46,938 INFO ]: Start accepts. Automaton has 28 states. Word has length 125 [2018-06-22 10:51:46,939 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:46,940 INFO ]: With dead ends: 460 [2018-06-22 10:51:46,940 INFO ]: Without dead ends: 440 [2018-06-22 10:51:46,941 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-06-22 10:51:46,941 INFO ]: Start minimizeSevpa. Operand 440 states. [2018-06-22 10:51:46,963 INFO ]: Finished minimizeSevpa. Reduced states from 440 to 440. [2018-06-22 10:51:46,963 INFO ]: Start removeUnreachable. Operand 440 states. [2018-06-22 10:51:46,965 INFO ]: Finished removeUnreachable. Reduced from 440 states to 440 states and 508 transitions. [2018-06-22 10:51:46,965 INFO ]: Start accepts. Automaton has 440 states and 508 transitions. Word has length 125 [2018-06-22 10:51:46,965 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:46,965 INFO ]: Abstraction has 440 states and 508 transitions. [2018-06-22 10:51:46,965 INFO ]: Interpolant automaton has 28 states. [2018-06-22 10:51:46,965 INFO ]: Start isEmpty. Operand 440 states and 508 transitions. [2018-06-22 10:51:46,968 INFO ]: Finished isEmpty. Found accepting run of length 130 [2018-06-22 10:51:46,982 INFO ]: Found error trace [2018-06-22 10:51:46,982 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:46,982 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:46,982 INFO ]: Analyzing trace with hash 779711600, now seen corresponding path program 1 times [2018-06-22 10:51:46,982 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:46,982 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:46,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:46,983 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:46,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:47,000 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:47,265 WARN ]: Spent 203.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-06-22 10:51:47,747 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:51:47,747 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:51:47,747 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:51:47,753 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:47,867 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:47,885 INFO ]: Computing forward predicates... [2018-06-22 10:51:48,869 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:51:48,889 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 10:51:48,889 INFO ]: Number of different interpolants: perfect sequences [26] imperfect sequences [32] total 56 [2018-06-22 10:51:48,890 INFO ]: Interpolant automaton has 56 states [2018-06-22 10:51:48,890 INFO ]: Constructing interpolant automaton starting with 56 interpolants. [2018-06-22 10:51:48,890 INFO ]: CoverageRelationStatistics Valid=116, Invalid=2964, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 10:51:48,891 INFO ]: Start difference. First operand 440 states and 508 transitions. Second operand 56 states. [2018-06-22 10:51:50,431 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:50,431 INFO ]: Finished difference Result 514 states and 586 transitions. [2018-06-22 10:51:50,432 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-22 10:51:50,432 INFO ]: Start accepts. Automaton has 56 states. Word has length 129 [2018-06-22 10:51:50,432 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:50,433 INFO ]: With dead ends: 514 [2018-06-22 10:51:50,433 INFO ]: Without dead ends: 474 [2018-06-22 10:51:50,435 INFO ]: 0 DeclaredPredicates, 182 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=201, Invalid=5499, Unknown=0, NotChecked=0, Total=5700 [2018-06-22 10:51:50,435 INFO ]: Start minimizeSevpa. Operand 474 states. [2018-06-22 10:51:50,453 INFO ]: Finished minimizeSevpa. Reduced states from 474 to 464. [2018-06-22 10:51:50,453 INFO ]: Start removeUnreachable. Operand 464 states. [2018-06-22 10:51:50,455 INFO ]: Finished removeUnreachable. Reduced from 464 states to 464 states and 535 transitions. [2018-06-22 10:51:50,455 INFO ]: Start accepts. Automaton has 464 states and 535 transitions. Word has length 129 [2018-06-22 10:51:50,455 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:50,455 INFO ]: Abstraction has 464 states and 535 transitions. [2018-06-22 10:51:50,455 INFO ]: Interpolant automaton has 56 states. [2018-06-22 10:51:50,455 INFO ]: Start isEmpty. Operand 464 states and 535 transitions. [2018-06-22 10:51:50,457 INFO ]: Finished isEmpty. Found accepting run of length 130 [2018-06-22 10:51:50,457 INFO ]: Found error trace [2018-06-22 10:51:50,457 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:50,457 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:50,457 INFO ]: Analyzing trace with hash -473567695, now seen corresponding path program 1 times [2018-06-22 10:51:50,457 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:50,457 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:50,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:50,458 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:50,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:50,476 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:51,416 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:51:51,416 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:51:51,416 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-22 10:51:51,421 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:51,537 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:51,547 INFO ]: Computing forward predicates... [2018-06-22 10:51:52,431 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:51:52,451 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 10:51:52,451 INFO ]: Number of different interpolants: perfect sequences [26] imperfect sequences [32] total 56 [2018-06-22 10:51:52,451 INFO ]: Interpolant automaton has 56 states [2018-06-22 10:51:52,451 INFO ]: Constructing interpolant automaton starting with 56 interpolants. [2018-06-22 10:51:52,452 INFO ]: CoverageRelationStatistics Valid=116, Invalid=2964, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 10:51:52,452 INFO ]: Start difference. First operand 464 states and 535 transitions. Second operand 56 states. [2018-06-22 10:51:53,793 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:53,793 INFO ]: Finished difference Result 540 states and 615 transitions. [2018-06-22 10:51:53,793 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-22 10:51:53,793 INFO ]: Start accepts. Automaton has 56 states. Word has length 129 [2018-06-22 10:51:53,793 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:53,795 INFO ]: With dead ends: 540 [2018-06-22 10:51:53,795 INFO ]: Without dead ends: 500 [2018-06-22 10:51:53,796 INFO ]: 0 DeclaredPredicates, 182 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=201, Invalid=5499, Unknown=0, NotChecked=0, Total=5700 [2018-06-22 10:51:53,797 INFO ]: Start minimizeSevpa. Operand 500 states. [2018-06-22 10:51:53,812 INFO ]: Finished minimizeSevpa. Reduced states from 500 to 466. [2018-06-22 10:51:53,812 INFO ]: Start removeUnreachable. Operand 466 states. [2018-06-22 10:51:53,815 INFO ]: Finished removeUnreachable. Reduced from 466 states to 466 states and 536 transitions. [2018-06-22 10:51:53,815 INFO ]: Start accepts. Automaton has 466 states and 536 transitions. Word has length 129 [2018-06-22 10:51:53,815 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:53,815 INFO ]: Abstraction has 466 states and 536 transitions. [2018-06-22 10:51:53,815 INFO ]: Interpolant automaton has 56 states. [2018-06-22 10:51:53,815 INFO ]: Start isEmpty. Operand 466 states and 536 transitions. [2018-06-22 10:51:53,817 INFO ]: Finished isEmpty. Found accepting run of length 130 [2018-06-22 10:51:53,817 INFO ]: Found error trace [2018-06-22 10:51:53,817 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:53,817 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:53,818 INFO ]: Analyzing trace with hash 494055443, now seen corresponding path program 1 times [2018-06-22 10:51:53,818 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:53,818 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:53,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:53,818 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:53,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:53,834 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:54,107 WARN ]: Spent 202.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-06-22 10:51:54,644 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:51:54,644 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:51:54,644 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-22 10:51:54,651 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:54,778 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:54,785 INFO ]: Computing forward predicates... [2018-06-22 10:51:55,711 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:51:55,730 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 10:51:55,730 INFO ]: Number of different interpolants: perfect sequences [26] imperfect sequences [32] total 56 [2018-06-22 10:51:55,731 INFO ]: Interpolant automaton has 56 states [2018-06-22 10:51:55,731 INFO ]: Constructing interpolant automaton starting with 56 interpolants. [2018-06-22 10:51:55,732 INFO ]: CoverageRelationStatistics Valid=116, Invalid=2964, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 10:51:55,732 INFO ]: Start difference. First operand 466 states and 536 transitions. Second operand 56 states. [2018-06-22 10:51:57,135 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:51:57,135 INFO ]: Finished difference Result 540 states and 614 transitions. [2018-06-22 10:51:57,135 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-22 10:51:57,135 INFO ]: Start accepts. Automaton has 56 states. Word has length 129 [2018-06-22 10:51:57,136 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:51:57,137 INFO ]: With dead ends: 540 [2018-06-22 10:51:57,137 INFO ]: Without dead ends: 500 [2018-06-22 10:51:57,139 INFO ]: 0 DeclaredPredicates, 182 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=201, Invalid=5499, Unknown=0, NotChecked=0, Total=5700 [2018-06-22 10:51:57,139 INFO ]: Start minimizeSevpa. Operand 500 states. [2018-06-22 10:51:57,157 INFO ]: Finished minimizeSevpa. Reduced states from 500 to 474. [2018-06-22 10:51:57,157 INFO ]: Start removeUnreachable. Operand 474 states. [2018-06-22 10:51:57,160 INFO ]: Finished removeUnreachable. Reduced from 474 states to 474 states and 545 transitions. [2018-06-22 10:51:57,160 INFO ]: Start accepts. Automaton has 474 states and 545 transitions. Word has length 129 [2018-06-22 10:51:57,161 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:51:57,161 INFO ]: Abstraction has 474 states and 545 transitions. [2018-06-22 10:51:57,161 INFO ]: Interpolant automaton has 56 states. [2018-06-22 10:51:57,161 INFO ]: Start isEmpty. Operand 474 states and 545 transitions. [2018-06-22 10:51:57,163 INFO ]: Finished isEmpty. Found accepting run of length 130 [2018-06-22 10:51:57,163 INFO ]: Found error trace [2018-06-22 10:51:57,163 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:51:57,163 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:51:57,164 INFO ]: Analyzing trace with hash -759223852, now seen corresponding path program 1 times [2018-06-22 10:51:57,164 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:51:57,164 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:51:57,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:57,164 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:57,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:51:57,181 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:57,426 WARN ]: Spent 187.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-06-22 10:51:57,906 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:51:57,906 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:51:57,906 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-22 10:51:57,911 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:51:58,024 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:51:58,032 INFO ]: Computing forward predicates... [2018-06-22 10:51:58,845 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:51:58,864 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 10:51:58,865 INFO ]: Number of different interpolants: perfect sequences [26] imperfect sequences [32] total 56 [2018-06-22 10:51:58,865 INFO ]: Interpolant automaton has 56 states [2018-06-22 10:51:58,865 INFO ]: Constructing interpolant automaton starting with 56 interpolants. [2018-06-22 10:51:58,866 INFO ]: CoverageRelationStatistics Valid=116, Invalid=2964, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 10:51:58,866 INFO ]: Start difference. First operand 474 states and 545 transitions. Second operand 56 states. Received shutdown request... [2018-06-22 10:51:59,360 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 10:51:59,361 WARN ]: Verification canceled [2018-06-22 10:51:59,507 WARN ]: Timeout [2018-06-22 10:51:59,507 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:51:59 BoogieIcfgContainer [2018-06-22 10:51:59,507 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:51:59,508 INFO ]: Toolchain (without parser) took 53742.34 ms. Allocated memory was 309.3 MB in the beginning and 953.7 MB in the end (delta: 644.3 MB). Free memory was 229.8 MB in the beginning and 917.3 MB in the end (delta: -687.5 MB). Peak memory consumption was 457.8 MB. Max. memory is 3.6 GB. [2018-06-22 10:51:59,509 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:51:59,509 INFO ]: ChcToBoogie took 72.83 ms. Allocated memory is still 309.3 MB. Free memory was 229.8 MB in the beginning and 225.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:51:59,509 INFO ]: Boogie Preprocessor took 76.30 ms. Allocated memory is still 309.3 MB. Free memory was 225.8 MB in the beginning and 223.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:51:59,510 INFO ]: RCFGBuilder took 956.69 ms. Allocated memory was 309.3 MB in the beginning and 325.1 MB in the end (delta: 15.7 MB). Free memory was 223.8 MB in the beginning and 286.8 MB in the end (delta: -63.0 MB). Peak memory consumption was 41.3 MB. Max. memory is 3.6 GB. [2018-06-22 10:51:59,510 INFO ]: TraceAbstraction took 52624.89 ms. Allocated memory was 325.1 MB in the beginning and 953.7 MB in the end (delta: 628.6 MB). Free memory was 286.8 MB in the beginning and 917.3 MB in the end (delta: -630.5 MB). Peak memory consumption was 499.1 MB. Max. memory is 3.6 GB. [2018-06-22 10:51:59,512 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 72.83 ms. Allocated memory is still 309.3 MB. Free memory was 229.8 MB in the beginning and 225.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 76.30 ms. Allocated memory is still 309.3 MB. Free memory was 225.8 MB in the beginning and 223.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 956.69 ms. Allocated memory was 309.3 MB in the beginning and 325.1 MB in the end (delta: 15.7 MB). Free memory was 223.8 MB in the beginning and 286.8 MB in the end (delta: -63.0 MB). Peak memory consumption was 41.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 52624.89 ms. Allocated memory was 325.1 MB in the beginning and 953.7 MB in the end (delta: 628.6 MB). Free memory was 286.8 MB in the beginning and 917.3 MB in the end (delta: -630.5 MB). Peak memory consumption was 499.1 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (474states) and interpolant automaton (currently 18 states, 56 states before enhancement), while ReachableStatesComputation was computing reachable states (131 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 39 procedures, 164 locations, 1 error locations. TIMEOUT Result, 52.5s OverallTime, 33 OverallIterations, 2 TraceHistogramMax, 23.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5502 SDtfs, 92 SDslu, 134831 SDs, 0 SdLazy, 23989 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1601 GetRequests, 638 SyntacticMatches, 15 SemanticMatches, 948 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 26.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=474occurred in iteration=32, 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.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 264 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 26.5s InterpolantComputationTime, 4134 NumberOfCodeBlocks, 4134 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 4096 ConstructedInterpolants, 0 QuantifiedInterpolants, 1112452 SizeOfPredicates, 16 NumberOfNonLiveVariables, 5834 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 38 InterpolantComputations, 33 PerfectInterpolantSequences, 218/238 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-51-59-534.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-51-59-534.csv Completed graceful shutdown