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/42.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:56:03,884 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:56:03,886 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:56:03,897 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:56:03,897 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:56:03,898 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:56:03,899 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:56:03,901 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:56:03,903 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:56:03,903 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:56:03,904 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:56:03,905 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:56:03,905 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:56:03,907 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:56:03,907 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:56:03,908 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:56:03,910 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:56:03,912 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:56:03,922 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:56:03,924 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:56:03,925 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:56:03,927 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:56:03,927 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:56:03,928 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:56:03,929 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:56:03,935 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:56:03,935 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:56:03,936 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:56:03,937 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:56:03,937 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:56:03,938 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:56:03,939 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:56:03,939 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:56:03,946 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:56:03,947 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:56:03,947 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:56:03,964 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:56:03,965 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:56:03,965 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:56:03,965 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:56:03,966 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:56:03,966 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:56:03,970 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:56:03,971 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:56:03,971 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:56:03,971 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:56:03,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:56:03,971 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:56:03,972 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:56:03,972 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:56:03,972 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:56:03,972 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:56:03,972 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:56:03,973 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:56:03,973 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:56:03,975 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:56:03,975 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:56:04,027 INFO ]: Repository-Root is: /tmp [2018-06-22 10:56:04,041 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:56:04,048 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:56:04,049 INFO ]: Initializing SmtParser... [2018-06-22 10:56:04,049 INFO ]: SmtParser initialized [2018-06-22 10:56:04,050 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/42.c.smt2 [2018-06-22 10:56:04,051 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:56:04,140 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/42.c.smt2 unknown [2018-06-22 10:56:04,716 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/42.c.smt2 [2018-06-22 10:56:04,721 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:56:04,726 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:56:04,727 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:56:04,727 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:56:04,727 INFO ]: ChcToBoogie initialized [2018-06-22 10:56:04,730 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:56:04" (1/1) ... [2018-06-22 10:56:04,805 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:04 Unit [2018-06-22 10:56:04,806 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:56:04,806 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:56:04,806 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:56:04,806 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:56:04,828 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:04" (1/1) ... [2018-06-22 10:56:04,829 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:04" (1/1) ... [2018-06-22 10:56:04,839 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:04" (1/1) ... [2018-06-22 10:56:04,839 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:04" (1/1) ... [2018-06-22 10:56:04,846 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:04" (1/1) ... [2018-06-22 10:56:04,849 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:04" (1/1) ... [2018-06-22 10:56:04,851 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:04" (1/1) ... [2018-06-22 10:56:04,858 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:56:04,858 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:56:04,858 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:56:04,858 INFO ]: RCFGBuilder initialized [2018-06-22 10:56:04,859 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:04" (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:56:04,868 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:56:04,869 INFO ]: Found specification of procedure False [2018-06-22 10:56:04,869 INFO ]: Found implementation of procedure False [2018-06-22 10:56:04,869 INFO ]: Specification and implementation of procedure h39 given in one single declaration [2018-06-22 10:56:04,869 INFO ]: Found specification of procedure h39 [2018-06-22 10:56:04,869 INFO ]: Found implementation of procedure h39 [2018-06-22 10:56:04,869 INFO ]: Specification and implementation of procedure h37 given in one single declaration [2018-06-22 10:56:04,869 INFO ]: Found specification of procedure h37 [2018-06-22 10:56:04,869 INFO ]: Found implementation of procedure h37 [2018-06-22 10:56:04,869 INFO ]: Specification and implementation of procedure h36 given in one single declaration [2018-06-22 10:56:04,869 INFO ]: Found specification of procedure h36 [2018-06-22 10:56:04,869 INFO ]: Found implementation of procedure h36 [2018-06-22 10:56:04,869 INFO ]: Specification and implementation of procedure h32 given in one single declaration [2018-06-22 10:56:04,869 INFO ]: Found specification of procedure h32 [2018-06-22 10:56:04,869 INFO ]: Found implementation of procedure h32 [2018-06-22 10:56:04,869 INFO ]: Specification and implementation of procedure h20 given in one single declaration [2018-06-22 10:56:04,869 INFO ]: Found specification of procedure h20 [2018-06-22 10:56:04,869 INFO ]: Found implementation of procedure h20 [2018-06-22 10:56:04,869 INFO ]: Specification and implementation of procedure h19 given in one single declaration [2018-06-22 10:56:04,869 INFO ]: Found specification of procedure h19 [2018-06-22 10:56:04,869 INFO ]: Found implementation of procedure h19 [2018-06-22 10:56:04,869 INFO ]: Specification and implementation of procedure h18 given in one single declaration [2018-06-22 10:56:04,869 INFO ]: Found specification of procedure h18 [2018-06-22 10:56:04,869 INFO ]: Found implementation of procedure h18 [2018-06-22 10:56:04,869 INFO ]: Specification and implementation of procedure h14 given in one single declaration [2018-06-22 10:56:04,869 INFO ]: Found specification of procedure h14 [2018-06-22 10:56:04,869 INFO ]: Found implementation of procedure h14 [2018-06-22 10:56:04,869 INFO ]: Specification and implementation of procedure h13 given in one single declaration [2018-06-22 10:56:04,869 INFO ]: Found specification of procedure h13 [2018-06-22 10:56:04,869 INFO ]: Found implementation of procedure h13 [2018-06-22 10:56:04,870 INFO ]: Specification and implementation of procedure h12 given in one single declaration [2018-06-22 10:56:04,870 INFO ]: Found specification of procedure h12 [2018-06-22 10:56:04,870 INFO ]: Found implementation of procedure h12 [2018-06-22 10:56:04,870 INFO ]: Specification and implementation of procedure h11 given in one single declaration [2018-06-22 10:56:04,870 INFO ]: Found specification of procedure h11 [2018-06-22 10:56:04,870 INFO ]: Found implementation of procedure h11 [2018-06-22 10:56:04,870 INFO ]: Specification and implementation of procedure h28 given in one single declaration [2018-06-22 10:56:04,870 INFO ]: Found specification of procedure h28 [2018-06-22 10:56:04,870 INFO ]: Found implementation of procedure h28 [2018-06-22 10:56:04,870 INFO ]: Specification and implementation of procedure h27 given in one single declaration [2018-06-22 10:56:04,870 INFO ]: Found specification of procedure h27 [2018-06-22 10:56:04,870 INFO ]: Found implementation of procedure h27 [2018-06-22 10:56:04,870 INFO ]: Specification and implementation of procedure h26 given in one single declaration [2018-06-22 10:56:04,870 INFO ]: Found specification of procedure h26 [2018-06-22 10:56:04,870 INFO ]: Found implementation of procedure h26 [2018-06-22 10:56:04,870 INFO ]: Specification and implementation of procedure h25 given in one single declaration [2018-06-22 10:56:04,870 INFO ]: Found specification of procedure h25 [2018-06-22 10:56:04,870 INFO ]: Found implementation of procedure h25 [2018-06-22 10:56:04,870 INFO ]: Specification and implementation of procedure h24 given in one single declaration [2018-06-22 10:56:04,870 INFO ]: Found specification of procedure h24 [2018-06-22 10:56:04,870 INFO ]: Found implementation of procedure h24 [2018-06-22 10:56:04,870 INFO ]: Specification and implementation of procedure h16 given in one single declaration [2018-06-22 10:56:04,870 INFO ]: Found specification of procedure h16 [2018-06-22 10:56:04,870 INFO ]: Found implementation of procedure h16 [2018-06-22 10:56:04,870 INFO ]: Specification and implementation of procedure h15 given in one single declaration [2018-06-22 10:56:04,870 INFO ]: Found specification of procedure h15 [2018-06-22 10:56:04,870 INFO ]: Found implementation of procedure h15 [2018-06-22 10:56:04,871 INFO ]: Specification and implementation of procedure h17 given in one single declaration [2018-06-22 10:56:04,871 INFO ]: Found specification of procedure h17 [2018-06-22 10:56:04,871 INFO ]: Found implementation of procedure h17 [2018-06-22 10:56:04,871 INFO ]: Specification and implementation of procedure h22 given in one single declaration [2018-06-22 10:56:04,871 INFO ]: Found specification of procedure h22 [2018-06-22 10:56:04,871 INFO ]: Found implementation of procedure h22 [2018-06-22 10:56:04,871 INFO ]: Specification and implementation of procedure h21 given in one single declaration [2018-06-22 10:56:04,871 INFO ]: Found specification of procedure h21 [2018-06-22 10:56:04,871 INFO ]: Found implementation of procedure h21 [2018-06-22 10:56:04,871 INFO ]: Specification and implementation of procedure h23 given in one single declaration [2018-06-22 10:56:04,871 INFO ]: Found specification of procedure h23 [2018-06-22 10:56:04,871 INFO ]: Found implementation of procedure h23 [2018-06-22 10:56:04,871 INFO ]: Specification and implementation of procedure h10 given in one single declaration [2018-06-22 10:56:04,871 INFO ]: Found specification of procedure h10 [2018-06-22 10:56:04,871 INFO ]: Found implementation of procedure h10 [2018-06-22 10:56:04,871 INFO ]: Specification and implementation of procedure h9 given in one single declaration [2018-06-22 10:56:04,871 INFO ]: Found specification of procedure h9 [2018-06-22 10:56:04,871 INFO ]: Found implementation of procedure h9 [2018-06-22 10:56:04,871 INFO ]: Specification and implementation of procedure h8 given in one single declaration [2018-06-22 10:56:04,871 INFO ]: Found specification of procedure h8 [2018-06-22 10:56:04,871 INFO ]: Found implementation of procedure h8 [2018-06-22 10:56:04,871 INFO ]: Specification and implementation of procedure h7 given in one single declaration [2018-06-22 10:56:04,871 INFO ]: Found specification of procedure h7 [2018-06-22 10:56:04,871 INFO ]: Found implementation of procedure h7 [2018-06-22 10:56:04,871 INFO ]: Specification and implementation of procedure h3 given in one single declaration [2018-06-22 10:56:04,871 INFO ]: Found specification of procedure h3 [2018-06-22 10:56:04,871 INFO ]: Found implementation of procedure h3 [2018-06-22 10:56:04,871 INFO ]: Specification and implementation of procedure h2 given in one single declaration [2018-06-22 10:56:04,871 INFO ]: Found specification of procedure h2 [2018-06-22 10:56:04,871 INFO ]: Found implementation of procedure h2 [2018-06-22 10:56:04,871 INFO ]: Specification and implementation of procedure h1 given in one single declaration [2018-06-22 10:56:04,871 INFO ]: Found specification of procedure h1 [2018-06-22 10:56:04,871 INFO ]: Found implementation of procedure h1 [2018-06-22 10:56:04,872 INFO ]: Specification and implementation of procedure h5 given in one single declaration [2018-06-22 10:56:04,872 INFO ]: Found specification of procedure h5 [2018-06-22 10:56:04,872 INFO ]: Found implementation of procedure h5 [2018-06-22 10:56:04,872 INFO ]: Specification and implementation of procedure h4 given in one single declaration [2018-06-22 10:56:04,872 INFO ]: Found specification of procedure h4 [2018-06-22 10:56:04,872 INFO ]: Found implementation of procedure h4 [2018-06-22 10:56:04,872 INFO ]: Specification and implementation of procedure h6 given in one single declaration [2018-06-22 10:56:04,872 INFO ]: Found specification of procedure h6 [2018-06-22 10:56:04,872 INFO ]: Found implementation of procedure h6 [2018-06-22 10:56:04,872 INFO ]: Specification and implementation of procedure h30 given in one single declaration [2018-06-22 10:56:04,872 INFO ]: Found specification of procedure h30 [2018-06-22 10:56:04,872 INFO ]: Found implementation of procedure h30 [2018-06-22 10:56:04,872 INFO ]: Specification and implementation of procedure h29 given in one single declaration [2018-06-22 10:56:04,872 INFO ]: Found specification of procedure h29 [2018-06-22 10:56:04,872 INFO ]: Found implementation of procedure h29 [2018-06-22 10:56:04,872 INFO ]: Specification and implementation of procedure h31 given in one single declaration [2018-06-22 10:56:04,872 INFO ]: Found specification of procedure h31 [2018-06-22 10:56:04,872 INFO ]: Found implementation of procedure h31 [2018-06-22 10:56:04,872 INFO ]: Specification and implementation of procedure h34 given in one single declaration [2018-06-22 10:56:04,872 INFO ]: Found specification of procedure h34 [2018-06-22 10:56:04,872 INFO ]: Found implementation of procedure h34 [2018-06-22 10:56:04,872 INFO ]: Specification and implementation of procedure h35 given in one single declaration [2018-06-22 10:56:04,872 INFO ]: Found specification of procedure h35 [2018-06-22 10:56:04,872 INFO ]: Found implementation of procedure h35 [2018-06-22 10:56:04,872 INFO ]: Specification and implementation of procedure h33 given in one single declaration [2018-06-22 10:56:04,872 INFO ]: Found specification of procedure h33 [2018-06-22 10:56:04,872 INFO ]: Found implementation of procedure h33 [2018-06-22 10:56:04,872 INFO ]: Specification and implementation of procedure h38 given in one single declaration [2018-06-22 10:56:04,872 INFO ]: Found specification of procedure h38 [2018-06-22 10:56:04,872 INFO ]: Found implementation of procedure h38 [2018-06-22 10:56:04,872 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:56:04,872 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:56:04,872 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:56:05,505 INFO ]: Using library mode [2018-06-22 10:56:05,505 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:56:05 BoogieIcfgContainer [2018-06-22 10:56:05,505 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:56:05,507 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:56:05,507 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:56:05,516 INFO ]: TraceAbstraction initialized [2018-06-22 10:56:05,516 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:56:04" (1/3) ... [2018-06-22 10:56:05,517 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8cae88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:56:05, skipping insertion in model container [2018-06-22 10:56:05,517 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:56:04" (2/3) ... [2018-06-22 10:56:05,517 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8cae88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:56:05, skipping insertion in model container [2018-06-22 10:56:05,517 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:56:05" (3/3) ... [2018-06-22 10:56:05,519 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:56:05,530 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:56:05,540 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:56:05,576 INFO ]: Using default assertion order modulation [2018-06-22 10:56:05,577 INFO ]: Interprodecural is true [2018-06-22 10:56:05,577 INFO ]: Hoare is false [2018-06-22 10:56:05,577 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:56:05,577 INFO ]: Backedges is TWOTRACK [2018-06-22 10:56:05,577 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:56:05,577 INFO ]: Difference is false [2018-06-22 10:56:05,577 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:56:05,577 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:56:05,598 INFO ]: Start isEmpty. Operand 175 states. [2018-06-22 10:56:05,618 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 10:56:05,618 INFO ]: Found error trace [2018-06-22 10:56:05,619 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] [2018-06-22 10:56:05,619 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:05,626 INFO ]: Analyzing trace with hash -1036699816, now seen corresponding path program 1 times [2018-06-22 10:56:05,628 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:05,628 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:05,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:05,665 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:05,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:05,780 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:06,243 WARN ]: Spent 156.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-06-22 10:56:06,930 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:56:06,932 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:06,932 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-22 10:56:06,934 INFO ]: Interpolant automaton has 15 states [2018-06-22 10:56:06,949 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 10:56:06,950 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:56:06,953 INFO ]: Start difference. First operand 175 states. Second operand 15 states. [2018-06-22 10:56:07,742 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:07,742 INFO ]: Finished difference Result 195 states and 219 transitions. [2018-06-22 10:56:07,743 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 10:56:07,744 INFO ]: Start accepts. Automaton has 15 states. Word has length 77 [2018-06-22 10:56:07,745 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:07,759 INFO ]: With dead ends: 195 [2018-06-22 10:56:07,759 INFO ]: Without dead ends: 195 [2018-06-22 10:56:07,761 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:56:07,777 INFO ]: Start minimizeSevpa. Operand 195 states. [2018-06-22 10:56:07,823 INFO ]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-06-22 10:56:07,824 INFO ]: Start removeUnreachable. Operand 195 states. [2018-06-22 10:56:07,828 INFO ]: Finished removeUnreachable. Reduced from 195 states to 195 states and 219 transitions. [2018-06-22 10:56:07,829 INFO ]: Start accepts. Automaton has 195 states and 219 transitions. Word has length 77 [2018-06-22 10:56:07,830 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:07,830 INFO ]: Abstraction has 195 states and 219 transitions. [2018-06-22 10:56:07,830 INFO ]: Interpolant automaton has 15 states. [2018-06-22 10:56:07,830 INFO ]: Start isEmpty. Operand 195 states and 219 transitions. [2018-06-22 10:56:07,835 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 10:56:07,835 INFO ]: Found error trace [2018-06-22 10:56:07,835 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] [2018-06-22 10:56:07,835 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:07,835 INFO ]: Analyzing trace with hash 1648161781, now seen corresponding path program 1 times [2018-06-22 10:56:07,836 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:07,836 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:07,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:07,837 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:07,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:07,871 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:08,222 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:56:08,222 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:08,222 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-22 10:56:08,224 INFO ]: Interpolant automaton has 15 states [2018-06-22 10:56:08,225 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 10:56:08,225 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:56:08,225 INFO ]: Start difference. First operand 195 states and 219 transitions. Second operand 15 states. [2018-06-22 10:56:08,829 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:08,829 INFO ]: Finished difference Result 215 states and 242 transitions. [2018-06-22 10:56:08,830 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 10:56:08,830 INFO ]: Start accepts. Automaton has 15 states. Word has length 77 [2018-06-22 10:56:08,831 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:08,834 INFO ]: With dead ends: 215 [2018-06-22 10:56:08,834 INFO ]: Without dead ends: 215 [2018-06-22 10:56:08,836 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:56:08,836 INFO ]: Start minimizeSevpa. Operand 215 states. [2018-06-22 10:56:08,858 INFO ]: Finished minimizeSevpa. Reduced states from 215 to 193. [2018-06-22 10:56:08,858 INFO ]: Start removeUnreachable. Operand 193 states. [2018-06-22 10:56:08,861 INFO ]: Finished removeUnreachable. Reduced from 193 states to 193 states and 217 transitions. [2018-06-22 10:56:08,861 INFO ]: Start accepts. Automaton has 193 states and 217 transitions. Word has length 77 [2018-06-22 10:56:08,861 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:08,861 INFO ]: Abstraction has 193 states and 217 transitions. [2018-06-22 10:56:08,862 INFO ]: Interpolant automaton has 15 states. [2018-06-22 10:56:08,862 INFO ]: Start isEmpty. Operand 193 states and 217 transitions. [2018-06-22 10:56:08,865 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 10:56:08,865 INFO ]: Found error trace [2018-06-22 10:56:08,865 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] [2018-06-22 10:56:08,865 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:08,865 INFO ]: Analyzing trace with hash -1395508038, now seen corresponding path program 1 times [2018-06-22 10:56:08,865 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:08,865 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:08,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:08,866 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:08,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:08,886 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:09,170 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:56:09,170 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:09,170 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-06-22 10:56:09,171 INFO ]: Interpolant automaton has 16 states [2018-06-22 10:56:09,171 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 10:56:09,171 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:56:09,171 INFO ]: Start difference. First operand 193 states and 217 transitions. Second operand 16 states. [2018-06-22 10:56:09,435 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:09,435 INFO ]: Finished difference Result 213 states and 241 transitions. [2018-06-22 10:56:09,435 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:56:09,435 INFO ]: Start accepts. Automaton has 16 states. Word has length 77 [2018-06-22 10:56:09,436 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:09,439 INFO ]: With dead ends: 213 [2018-06-22 10:56:09,439 INFO ]: Without dead ends: 213 [2018-06-22 10:56:09,439 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:56:09,439 INFO ]: Start minimizeSevpa. Operand 213 states. [2018-06-22 10:56:09,459 INFO ]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-06-22 10:56:09,459 INFO ]: Start removeUnreachable. Operand 213 states. [2018-06-22 10:56:09,461 INFO ]: Finished removeUnreachable. Reduced from 213 states to 213 states and 241 transitions. [2018-06-22 10:56:09,461 INFO ]: Start accepts. Automaton has 213 states and 241 transitions. Word has length 77 [2018-06-22 10:56:09,462 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:09,462 INFO ]: Abstraction has 213 states and 241 transitions. [2018-06-22 10:56:09,462 INFO ]: Interpolant automaton has 16 states. [2018-06-22 10:56:09,462 INFO ]: Start isEmpty. Operand 213 states and 241 transitions. [2018-06-22 10:56:09,465 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 10:56:09,465 INFO ]: Found error trace [2018-06-22 10:56:09,465 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] [2018-06-22 10:56:09,465 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:09,465 INFO ]: Analyzing trace with hash 864360023, now seen corresponding path program 1 times [2018-06-22 10:56:09,465 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:09,465 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:09,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:09,466 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:09,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:09,484 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:09,679 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:56:09,679 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:09,679 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-06-22 10:56:09,680 INFO ]: Interpolant automaton has 16 states [2018-06-22 10:56:09,680 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 10:56:09,680 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:56:09,680 INFO ]: Start difference. First operand 213 states and 241 transitions. Second operand 16 states. [2018-06-22 10:56:10,076 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:10,076 INFO ]: Finished difference Result 213 states and 240 transitions. [2018-06-22 10:56:10,077 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:56:10,077 INFO ]: Start accepts. Automaton has 16 states. Word has length 77 [2018-06-22 10:56:10,077 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:10,079 INFO ]: With dead ends: 213 [2018-06-22 10:56:10,079 INFO ]: Without dead ends: 209 [2018-06-22 10:56:10,079 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:56:10,080 INFO ]: Start minimizeSevpa. Operand 209 states. [2018-06-22 10:56:10,095 INFO ]: Finished minimizeSevpa. Reduced states from 209 to 189. [2018-06-22 10:56:10,095 INFO ]: Start removeUnreachable. Operand 189 states. [2018-06-22 10:56:10,097 INFO ]: Finished removeUnreachable. Reduced from 189 states to 189 states and 213 transitions. [2018-06-22 10:56:10,097 INFO ]: Start accepts. Automaton has 189 states and 213 transitions. Word has length 77 [2018-06-22 10:56:10,098 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:10,098 INFO ]: Abstraction has 189 states and 213 transitions. [2018-06-22 10:56:10,098 INFO ]: Interpolant automaton has 16 states. [2018-06-22 10:56:10,098 INFO ]: Start isEmpty. Operand 189 states and 213 transitions. [2018-06-22 10:56:10,100 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 10:56:10,100 INFO ]: Found error trace [2018-06-22 10:56:10,100 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:56:10,100 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:10,100 INFO ]: Analyzing trace with hash -1619956998, now seen corresponding path program 1 times [2018-06-22 10:56:10,100 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:10,100 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:10,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:10,101 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:10,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:10,135 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:10,433 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:56:10,433 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:10,433 INFO ]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-06-22 10:56:10,434 INFO ]: Interpolant automaton has 18 states [2018-06-22 10:56:10,434 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 10:56:10,434 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:56:10,434 INFO ]: Start difference. First operand 189 states and 213 transitions. Second operand 18 states. [2018-06-22 10:56:10,738 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:10,738 INFO ]: Finished difference Result 215 states and 242 transitions. [2018-06-22 10:56:10,738 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 10:56:10,738 INFO ]: Start accepts. Automaton has 18 states. Word has length 81 [2018-06-22 10:56:10,739 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:10,740 INFO ]: With dead ends: 215 [2018-06-22 10:56:10,741 INFO ]: Without dead ends: 215 [2018-06-22 10:56:10,741 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-22 10:56:10,741 INFO ]: Start minimizeSevpa. Operand 215 states. [2018-06-22 10:56:10,754 INFO ]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-06-22 10:56:10,754 INFO ]: Start removeUnreachable. Operand 215 states. [2018-06-22 10:56:10,757 INFO ]: Finished removeUnreachable. Reduced from 215 states to 215 states and 242 transitions. [2018-06-22 10:56:10,757 INFO ]: Start accepts. Automaton has 215 states and 242 transitions. Word has length 81 [2018-06-22 10:56:10,757 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:10,757 INFO ]: Abstraction has 215 states and 242 transitions. [2018-06-22 10:56:10,757 INFO ]: Interpolant automaton has 18 states. [2018-06-22 10:56:10,757 INFO ]: Start isEmpty. Operand 215 states and 242 transitions. [2018-06-22 10:56:10,759 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 10:56:10,759 INFO ]: Found error trace [2018-06-22 10:56:10,759 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:56:10,759 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:10,760 INFO ]: Analyzing trace with hash 1972091830, now seen corresponding path program 1 times [2018-06-22 10:56:10,760 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:10,760 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:10,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:10,760 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:10,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:10,774 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:11,027 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:56:11,027 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:11,027 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-22 10:56:11,027 INFO ]: Interpolant automaton has 15 states [2018-06-22 10:56:11,028 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 10:56:11,028 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:56:11,028 INFO ]: Start difference. First operand 215 states and 242 transitions. Second operand 15 states. [2018-06-22 10:56:11,688 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:11,688 INFO ]: Finished difference Result 215 states and 241 transitions. [2018-06-22 10:56:11,688 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 10:56:11,688 INFO ]: Start accepts. Automaton has 15 states. Word has length 81 [2018-06-22 10:56:11,689 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:11,690 INFO ]: With dead ends: 215 [2018-06-22 10:56:11,690 INFO ]: Without dead ends: 215 [2018-06-22 10:56:11,691 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:56:11,691 INFO ]: Start minimizeSevpa. Operand 215 states. [2018-06-22 10:56:11,712 INFO ]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-06-22 10:56:11,712 INFO ]: Start removeUnreachable. Operand 215 states. [2018-06-22 10:56:11,718 INFO ]: Finished removeUnreachable. Reduced from 215 states to 215 states and 241 transitions. [2018-06-22 10:56:11,718 INFO ]: Start accepts. Automaton has 215 states and 241 transitions. Word has length 81 [2018-06-22 10:56:11,719 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:11,719 INFO ]: Abstraction has 215 states and 241 transitions. [2018-06-22 10:56:11,719 INFO ]: Interpolant automaton has 15 states. [2018-06-22 10:56:11,719 INFO ]: Start isEmpty. Operand 215 states and 241 transitions. [2018-06-22 10:56:11,720 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 10:56:11,720 INFO ]: Found error trace [2018-06-22 10:56:11,721 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:56:11,721 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:11,721 INFO ]: Analyzing trace with hash -815556615, now seen corresponding path program 1 times [2018-06-22 10:56:11,721 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:11,721 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:11,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:11,722 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:11,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:11,747 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:11,952 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:56:11,952 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:11,952 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-22 10:56:11,953 INFO ]: Interpolant automaton has 15 states [2018-06-22 10:56:11,953 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 10:56:11,953 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:56:11,953 INFO ]: Start difference. First operand 215 states and 241 transitions. Second operand 15 states. [2018-06-22 10:56:12,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:12,215 INFO ]: Finished difference Result 215 states and 240 transitions. [2018-06-22 10:56:12,216 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 10:56:12,216 INFO ]: Start accepts. Automaton has 15 states. Word has length 81 [2018-06-22 10:56:12,216 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:12,217 INFO ]: With dead ends: 215 [2018-06-22 10:56:12,217 INFO ]: Without dead ends: 207 [2018-06-22 10:56:12,218 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:56:12,218 INFO ]: Start minimizeSevpa. Operand 207 states. [2018-06-22 10:56:12,228 INFO ]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-06-22 10:56:12,228 INFO ]: Start removeUnreachable. Operand 207 states. [2018-06-22 10:56:12,229 INFO ]: Finished removeUnreachable. Reduced from 207 states to 207 states and 232 transitions. [2018-06-22 10:56:12,229 INFO ]: Start accepts. Automaton has 207 states and 232 transitions. Word has length 81 [2018-06-22 10:56:12,230 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:12,230 INFO ]: Abstraction has 207 states and 232 transitions. [2018-06-22 10:56:12,230 INFO ]: Interpolant automaton has 15 states. [2018-06-22 10:56:12,230 INFO ]: Start isEmpty. Operand 207 states and 232 transitions. [2018-06-22 10:56:12,231 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 10:56:12,231 INFO ]: Found error trace [2018-06-22 10:56:12,232 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:56:12,232 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:12,232 INFO ]: Analyzing trace with hash 798656023, now seen corresponding path program 1 times [2018-06-22 10:56:12,232 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:12,232 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:12,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:12,232 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:12,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:12,257 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:12,549 WARN ]: Spent 173.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-06-22 10:56:13,158 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:56:13,159 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:13,159 INFO ]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-06-22 10:56:13,159 INFO ]: Interpolant automaton has 18 states [2018-06-22 10:56:13,159 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 10:56:13,159 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:56:13,159 INFO ]: Start difference. First operand 207 states and 232 transitions. Second operand 18 states. [2018-06-22 10:56:13,619 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:13,619 INFO ]: Finished difference Result 207 states and 231 transitions. [2018-06-22 10:56:13,619 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 10:56:13,619 INFO ]: Start accepts. Automaton has 18 states. Word has length 81 [2018-06-22 10:56:13,619 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:13,621 INFO ]: With dead ends: 207 [2018-06-22 10:56:13,621 INFO ]: Without dead ends: 201 [2018-06-22 10:56:13,621 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-22 10:56:13,621 INFO ]: Start minimizeSevpa. Operand 201 states. [2018-06-22 10:56:13,630 INFO ]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-06-22 10:56:13,630 INFO ]: Start removeUnreachable. Operand 201 states. [2018-06-22 10:56:13,632 INFO ]: Finished removeUnreachable. Reduced from 201 states to 201 states and 225 transitions. [2018-06-22 10:56:13,632 INFO ]: Start accepts. Automaton has 201 states and 225 transitions. Word has length 81 [2018-06-22 10:56:13,632 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:13,632 INFO ]: Abstraction has 201 states and 225 transitions. [2018-06-22 10:56:13,632 INFO ]: Interpolant automaton has 18 states. [2018-06-22 10:56:13,632 INFO ]: Start isEmpty. Operand 201 states and 225 transitions. [2018-06-22 10:56:13,633 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 10:56:13,633 INFO ]: Found error trace [2018-06-22 10:56:13,634 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:56:13,634 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:13,634 INFO ]: Analyzing trace with hash 414687351, now seen corresponding path program 1 times [2018-06-22 10:56:13,634 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:13,634 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:13,635 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:13,635 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:13,635 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:13,649 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:13,888 WARN ]: Spent 187.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-06-22 10:56:14,129 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:56:14,129 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:14,129 INFO ]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-06-22 10:56:14,129 INFO ]: Interpolant automaton has 18 states [2018-06-22 10:56:14,130 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 10:56:14,130 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:56:14,130 INFO ]: Start difference. First operand 201 states and 225 transitions. Second operand 18 states. [2018-06-22 10:56:14,399 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:14,399 INFO ]: Finished difference Result 207 states and 231 transitions. [2018-06-22 10:56:14,424 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 10:56:14,424 INFO ]: Start accepts. Automaton has 18 states. Word has length 81 [2018-06-22 10:56:14,425 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:14,426 INFO ]: With dead ends: 207 [2018-06-22 10:56:14,426 INFO ]: Without dead ends: 207 [2018-06-22 10:56:14,427 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-22 10:56:14,427 INFO ]: Start minimizeSevpa. Operand 207 states. [2018-06-22 10:56:14,436 INFO ]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-06-22 10:56:14,436 INFO ]: Start removeUnreachable. Operand 207 states. [2018-06-22 10:56:14,439 INFO ]: Finished removeUnreachable. Reduced from 207 states to 207 states and 231 transitions. [2018-06-22 10:56:14,439 INFO ]: Start accepts. Automaton has 207 states and 231 transitions. Word has length 81 [2018-06-22 10:56:14,440 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:14,440 INFO ]: Abstraction has 207 states and 231 transitions. [2018-06-22 10:56:14,440 INFO ]: Interpolant automaton has 18 states. [2018-06-22 10:56:14,440 INFO ]: Start isEmpty. Operand 207 states and 231 transitions. [2018-06-22 10:56:14,441 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 10:56:14,441 INFO ]: Found error trace [2018-06-22 10:56:14,441 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:56:14,441 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:14,441 INFO ]: Analyzing trace with hash -2003925670, now seen corresponding path program 1 times [2018-06-22 10:56:14,441 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:14,441 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:14,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:14,442 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:14,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:14,464 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:14,743 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:56:14,743 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:14,743 INFO ]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-06-22 10:56:14,744 INFO ]: Interpolant automaton has 18 states [2018-06-22 10:56:14,744 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 10:56:14,744 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:56:14,744 INFO ]: Start difference. First operand 207 states and 231 transitions. Second operand 18 states. [2018-06-22 10:56:15,051 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:15,051 INFO ]: Finished difference Result 207 states and 230 transitions. [2018-06-22 10:56:15,051 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 10:56:15,051 INFO ]: Start accepts. Automaton has 18 states. Word has length 81 [2018-06-22 10:56:15,052 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:15,053 INFO ]: With dead ends: 207 [2018-06-22 10:56:15,053 INFO ]: Without dead ends: 193 [2018-06-22 10:56:15,053 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-22 10:56:15,054 INFO ]: Start minimizeSevpa. Operand 193 states. [2018-06-22 10:56:15,062 INFO ]: Finished minimizeSevpa. Reduced states from 193 to 181. [2018-06-22 10:56:15,062 INFO ]: Start removeUnreachable. Operand 181 states. [2018-06-22 10:56:15,063 INFO ]: Finished removeUnreachable. Reduced from 181 states to 181 states and 203 transitions. [2018-06-22 10:56:15,064 INFO ]: Start accepts. Automaton has 181 states and 203 transitions. Word has length 81 [2018-06-22 10:56:15,064 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:15,064 INFO ]: Abstraction has 181 states and 203 transitions. [2018-06-22 10:56:15,064 INFO ]: Interpolant automaton has 18 states. [2018-06-22 10:56:15,064 INFO ]: Start isEmpty. Operand 181 states and 203 transitions. [2018-06-22 10:56:15,065 INFO ]: Finished isEmpty. Found accepting run of length 122 [2018-06-22 10:56:15,065 INFO ]: Found error trace [2018-06-22 10:56:15,065 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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:56:15,065 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:15,065 INFO ]: Analyzing trace with hash 97610803, now seen corresponding path program 1 times [2018-06-22 10:56:15,065 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:15,065 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:15,066 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:15,066 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:15,066 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:15,086 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:15,225 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:15,225 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:15,225 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:56:15,226 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:56:15,226 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:56:15,226 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:15,226 INFO ]: Start difference. First operand 181 states and 203 transitions. Second operand 14 states. [2018-06-22 10:56:16,036 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:16,037 INFO ]: Finished difference Result 234 states and 277 transitions. [2018-06-22 10:56:16,038 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:56:16,038 INFO ]: Start accepts. Automaton has 14 states. Word has length 121 [2018-06-22 10:56:16,038 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:16,039 INFO ]: With dead ends: 234 [2018-06-22 10:56:16,039 INFO ]: Without dead ends: 234 [2018-06-22 10:56:16,040 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:16,040 INFO ]: Start minimizeSevpa. Operand 234 states. [2018-06-22 10:56:16,052 INFO ]: Finished minimizeSevpa. Reduced states from 234 to 232. [2018-06-22 10:56:16,053 INFO ]: Start removeUnreachable. Operand 232 states. [2018-06-22 10:56:16,059 INFO ]: Finished removeUnreachable. Reduced from 232 states to 232 states and 274 transitions. [2018-06-22 10:56:16,059 INFO ]: Start accepts. Automaton has 232 states and 274 transitions. Word has length 121 [2018-06-22 10:56:16,059 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:16,059 INFO ]: Abstraction has 232 states and 274 transitions. [2018-06-22 10:56:16,059 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:56:16,059 INFO ]: Start isEmpty. Operand 232 states and 274 transitions. [2018-06-22 10:56:16,061 INFO ]: Finished isEmpty. Found accepting run of length 122 [2018-06-22 10:56:16,061 INFO ]: Found error trace [2018-06-22 10:56:16,063 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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:56:16,063 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:16,063 INFO ]: Analyzing trace with hash -1381562900, now seen corresponding path program 1 times [2018-06-22 10:56:16,063 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:16,063 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:16,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:16,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:16,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:16,084 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:16,326 WARN ]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-06-22 10:56:16,403 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:16,404 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:16,404 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:56:16,405 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:56:16,405 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:56:16,405 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:16,406 INFO ]: Start difference. First operand 232 states and 274 transitions. Second operand 14 states. [2018-06-22 10:56:16,611 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:16,611 INFO ]: Finished difference Result 284 states and 334 transitions. [2018-06-22 10:56:16,611 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:56:16,612 INFO ]: Start accepts. Automaton has 14 states. Word has length 121 [2018-06-22 10:56:16,612 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:16,613 INFO ]: With dead ends: 284 [2018-06-22 10:56:16,613 INFO ]: Without dead ends: 284 [2018-06-22 10:56:16,614 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:16,614 INFO ]: Start minimizeSevpa. Operand 284 states. [2018-06-22 10:56:16,626 INFO ]: Finished minimizeSevpa. Reduced states from 284 to 258. [2018-06-22 10:56:16,626 INFO ]: Start removeUnreachable. Operand 258 states. [2018-06-22 10:56:16,627 INFO ]: Finished removeUnreachable. Reduced from 258 states to 258 states and 307 transitions. [2018-06-22 10:56:16,627 INFO ]: Start accepts. Automaton has 258 states and 307 transitions. Word has length 121 [2018-06-22 10:56:16,628 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:16,628 INFO ]: Abstraction has 258 states and 307 transitions. [2018-06-22 10:56:16,628 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:56:16,628 INFO ]: Start isEmpty. Operand 258 states and 307 transitions. [2018-06-22 10:56:16,630 INFO ]: Finished isEmpty. Found accepting run of length 122 [2018-06-22 10:56:16,630 INFO ]: Found error trace [2018-06-22 10:56:16,630 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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:56:16,630 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:16,630 INFO ]: Analyzing trace with hash 2056130538, now seen corresponding path program 1 times [2018-06-22 10:56:16,630 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:16,630 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:16,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:16,631 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:16,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:16,646 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:16,910 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:16,910 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:16,910 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-06-22 10:56:16,910 INFO ]: Interpolant automaton has 16 states [2018-06-22 10:56:16,910 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 10:56:16,910 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:56:16,910 INFO ]: Start difference. First operand 258 states and 307 transitions. Second operand 16 states. [2018-06-22 10:56:17,158 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:17,158 INFO ]: Finished difference Result 296 states and 352 transitions. [2018-06-22 10:56:17,158 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:56:17,159 INFO ]: Start accepts. Automaton has 16 states. Word has length 121 [2018-06-22 10:56:17,159 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:17,161 INFO ]: With dead ends: 296 [2018-06-22 10:56:17,161 INFO ]: Without dead ends: 296 [2018-06-22 10:56:17,161 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:56:17,161 INFO ]: Start minimizeSevpa. Operand 296 states. [2018-06-22 10:56:17,174 INFO ]: Finished minimizeSevpa. Reduced states from 296 to 284. [2018-06-22 10:56:17,174 INFO ]: Start removeUnreachable. Operand 284 states. [2018-06-22 10:56:17,176 INFO ]: Finished removeUnreachable. Reduced from 284 states to 284 states and 340 transitions. [2018-06-22 10:56:17,176 INFO ]: Start accepts. Automaton has 284 states and 340 transitions. Word has length 121 [2018-06-22 10:56:17,177 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:17,177 INFO ]: Abstraction has 284 states and 340 transitions. [2018-06-22 10:56:17,177 INFO ]: Interpolant automaton has 16 states. [2018-06-22 10:56:17,177 INFO ]: Start isEmpty. Operand 284 states and 340 transitions. [2018-06-22 10:56:17,178 INFO ]: Finished isEmpty. Found accepting run of length 122 [2018-06-22 10:56:17,178 INFO ]: Found error trace [2018-06-22 10:56:17,178 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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:56:17,178 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:17,179 INFO ]: Analyzing trace with hash 2116113805, now seen corresponding path program 1 times [2018-06-22 10:56:17,179 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:17,179 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:17,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:17,179 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:17,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:17,194 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:17,371 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:17,371 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:17,371 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:56:17,371 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:56:17,371 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:56:17,372 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:17,372 INFO ]: Start difference. First operand 284 states and 340 transitions. Second operand 14 states. [2018-06-22 10:56:18,504 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:18,504 INFO ]: Finished difference Result 323 states and 387 transitions. [2018-06-22 10:56:18,505 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:56:18,505 INFO ]: Start accepts. Automaton has 14 states. Word has length 121 [2018-06-22 10:56:18,505 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:18,507 INFO ]: With dead ends: 323 [2018-06-22 10:56:18,507 INFO ]: Without dead ends: 323 [2018-06-22 10:56:18,507 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:18,507 INFO ]: Start minimizeSevpa. Operand 323 states. [2018-06-22 10:56:18,521 INFO ]: Finished minimizeSevpa. Reduced states from 323 to 309. [2018-06-22 10:56:18,521 INFO ]: Start removeUnreachable. Operand 309 states. [2018-06-22 10:56:18,523 INFO ]: Finished removeUnreachable. Reduced from 309 states to 309 states and 372 transitions. [2018-06-22 10:56:18,523 INFO ]: Start accepts. Automaton has 309 states and 372 transitions. Word has length 121 [2018-06-22 10:56:18,523 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:18,523 INFO ]: Abstraction has 309 states and 372 transitions. [2018-06-22 10:56:18,523 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:56:18,523 INFO ]: Start isEmpty. Operand 309 states and 372 transitions. [2018-06-22 10:56:18,525 INFO ]: Finished isEmpty. Found accepting run of length 122 [2018-06-22 10:56:18,525 INFO ]: Found error trace [2018-06-22 10:56:18,526 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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:56:18,526 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:18,526 INFO ]: Analyzing trace with hash -474790252, now seen corresponding path program 1 times [2018-06-22 10:56:18,526 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:18,526 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:18,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:18,526 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:18,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:18,541 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:19,211 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:19,211 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:19,211 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-06-22 10:56:19,211 INFO ]: Interpolant automaton has 16 states [2018-06-22 10:56:19,212 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 10:56:19,212 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:56:19,212 INFO ]: Start difference. First operand 309 states and 372 transitions. Second operand 16 states. [2018-06-22 10:56:19,865 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:19,866 INFO ]: Finished difference Result 349 states and 416 transitions. [2018-06-22 10:56:19,866 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:56:19,866 INFO ]: Start accepts. Automaton has 16 states. Word has length 121 [2018-06-22 10:56:19,866 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:19,869 INFO ]: With dead ends: 349 [2018-06-22 10:56:19,869 INFO ]: Without dead ends: 349 [2018-06-22 10:56:19,870 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:56:19,872 INFO ]: Start minimizeSevpa. Operand 349 states. [2018-06-22 10:56:19,890 INFO ]: Finished minimizeSevpa. Reduced states from 349 to 321. [2018-06-22 10:56:19,890 INFO ]: Start removeUnreachable. Operand 321 states. [2018-06-22 10:56:19,891 INFO ]: Finished removeUnreachable. Reduced from 321 states to 321 states and 386 transitions. [2018-06-22 10:56:19,891 INFO ]: Start accepts. Automaton has 321 states and 386 transitions. Word has length 121 [2018-06-22 10:56:19,892 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:19,892 INFO ]: Abstraction has 321 states and 386 transitions. [2018-06-22 10:56:19,892 INFO ]: Interpolant automaton has 16 states. [2018-06-22 10:56:19,892 INFO ]: Start isEmpty. Operand 321 states and 386 transitions. [2018-06-22 10:56:19,893 INFO ]: Finished isEmpty. Found accepting run of length 122 [2018-06-22 10:56:19,893 INFO ]: Found error trace [2018-06-22 10:56:19,893 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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:56:19,894 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:19,894 INFO ]: Analyzing trace with hash 1659474795, now seen corresponding path program 1 times [2018-06-22 10:56:19,894 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:19,894 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:19,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:19,894 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:19,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:19,909 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:20,090 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:20,090 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:20,090 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-06-22 10:56:20,090 INFO ]: Interpolant automaton has 16 states [2018-06-22 10:56:20,091 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 10:56:20,091 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:56:20,091 INFO ]: Start difference. First operand 321 states and 386 transitions. Second operand 16 states. [2018-06-22 10:56:20,261 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:20,261 INFO ]: Finished difference Result 357 states and 424 transitions. [2018-06-22 10:56:20,261 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:56:20,261 INFO ]: Start accepts. Automaton has 16 states. Word has length 121 [2018-06-22 10:56:20,261 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:20,263 INFO ]: With dead ends: 357 [2018-06-22 10:56:20,263 INFO ]: Without dead ends: 357 [2018-06-22 10:56:20,263 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 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:56:20,263 INFO ]: Start minimizeSevpa. Operand 357 states. [2018-06-22 10:56:20,278 INFO ]: Finished minimizeSevpa. Reduced states from 357 to 327. [2018-06-22 10:56:20,278 INFO ]: Start removeUnreachable. Operand 327 states. [2018-06-22 10:56:20,280 INFO ]: Finished removeUnreachable. Reduced from 327 states to 327 states and 392 transitions. [2018-06-22 10:56:20,280 INFO ]: Start accepts. Automaton has 327 states and 392 transitions. Word has length 121 [2018-06-22 10:56:20,280 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:20,280 INFO ]: Abstraction has 327 states and 392 transitions. [2018-06-22 10:56:20,280 INFO ]: Interpolant automaton has 16 states. [2018-06-22 10:56:20,280 INFO ]: Start isEmpty. Operand 327 states and 392 transitions. [2018-06-22 10:56:20,283 INFO ]: Finished isEmpty. Found accepting run of length 122 [2018-06-22 10:56:20,283 INFO ]: Found error trace [2018-06-22 10:56:20,283 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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:56:20,283 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:20,283 INFO ]: Analyzing trace with hash -554817615, now seen corresponding path program 1 times [2018-06-22 10:56:20,283 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:20,283 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:20,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:20,284 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:20,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:20,304 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:20,661 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:20,661 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:20,661 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:56:20,661 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:56:20,662 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:56:20,662 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:20,662 INFO ]: Start difference. First operand 327 states and 392 transitions. Second operand 14 states. [2018-06-22 10:56:20,841 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:20,841 INFO ]: Finished difference Result 414 states and 499 transitions. [2018-06-22 10:56:20,842 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:56:20,842 INFO ]: Start accepts. Automaton has 14 states. Word has length 121 [2018-06-22 10:56:20,842 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:20,844 INFO ]: With dead ends: 414 [2018-06-22 10:56:20,844 INFO ]: Without dead ends: 405 [2018-06-22 10:56:20,844 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:20,845 INFO ]: Start minimizeSevpa. Operand 405 states. [2018-06-22 10:56:20,872 INFO ]: Finished minimizeSevpa. Reduced states from 405 to 363. [2018-06-22 10:56:20,873 INFO ]: Start removeUnreachable. Operand 363 states. [2018-06-22 10:56:20,874 INFO ]: Finished removeUnreachable. Reduced from 363 states to 363 states and 436 transitions. [2018-06-22 10:56:20,874 INFO ]: Start accepts. Automaton has 363 states and 436 transitions. Word has length 121 [2018-06-22 10:56:20,877 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:20,877 INFO ]: Abstraction has 363 states and 436 transitions. [2018-06-22 10:56:20,877 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:56:20,877 INFO ]: Start isEmpty. Operand 363 states and 436 transitions. [2018-06-22 10:56:20,879 INFO ]: Finished isEmpty. Found accepting run of length 122 [2018-06-22 10:56:20,879 INFO ]: Found error trace [2018-06-22 10:56:20,879 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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:56:20,879 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:20,879 INFO ]: Analyzing trace with hash 1113601453, now seen corresponding path program 1 times [2018-06-22 10:56:20,879 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:20,879 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:20,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:20,881 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:20,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:20,899 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:21,721 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:21,722 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:21,722 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-06-22 10:56:21,722 INFO ]: Interpolant automaton has 16 states [2018-06-22 10:56:21,722 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 10:56:21,722 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:56:21,722 INFO ]: Start difference. First operand 363 states and 436 transitions. Second operand 16 states. [2018-06-22 10:56:21,865 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:21,865 INFO ]: Finished difference Result 409 states and 484 transitions. [2018-06-22 10:56:21,865 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:56:21,865 INFO ]: Start accepts. Automaton has 16 states. Word has length 121 [2018-06-22 10:56:21,865 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:21,867 INFO ]: With dead ends: 409 [2018-06-22 10:56:21,867 INFO ]: Without dead ends: 409 [2018-06-22 10:56:21,868 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:56:21,868 INFO ]: Start minimizeSevpa. Operand 409 states. [2018-06-22 10:56:21,887 INFO ]: Finished minimizeSevpa. Reduced states from 409 to 363. [2018-06-22 10:56:21,887 INFO ]: Start removeUnreachable. Operand 363 states. [2018-06-22 10:56:21,889 INFO ]: Finished removeUnreachable. Reduced from 363 states to 363 states and 436 transitions. [2018-06-22 10:56:21,889 INFO ]: Start accepts. Automaton has 363 states and 436 transitions. Word has length 121 [2018-06-22 10:56:21,889 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:21,889 INFO ]: Abstraction has 363 states and 436 transitions. [2018-06-22 10:56:21,889 INFO ]: Interpolant automaton has 16 states. [2018-06-22 10:56:21,889 INFO ]: Start isEmpty. Operand 363 states and 436 transitions. [2018-06-22 10:56:21,891 INFO ]: Finished isEmpty. Found accepting run of length 122 [2018-06-22 10:56:21,891 INFO ]: Found error trace [2018-06-22 10:56:21,891 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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:56:21,891 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:21,891 INFO ]: Analyzing trace with hash 467738833, now seen corresponding path program 1 times [2018-06-22 10:56:21,891 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:21,891 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:21,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:21,892 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:21,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:21,905 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:22,335 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:22,336 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:22,336 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-06-22 10:56:22,336 INFO ]: Interpolant automaton has 16 states [2018-06-22 10:56:22,336 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 10:56:22,336 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:56:22,336 INFO ]: Start difference. First operand 363 states and 436 transitions. Second operand 16 states. [2018-06-22 10:56:23,022 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:23,022 INFO ]: Finished difference Result 411 states and 485 transitions. [2018-06-22 10:56:23,022 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:56:23,022 INFO ]: Start accepts. Automaton has 16 states. Word has length 121 [2018-06-22 10:56:23,023 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:23,024 INFO ]: With dead ends: 411 [2018-06-22 10:56:23,024 INFO ]: Without dead ends: 411 [2018-06-22 10:56:23,024 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:56:23,024 INFO ]: Start minimizeSevpa. Operand 411 states. [2018-06-22 10:56:23,038 INFO ]: Finished minimizeSevpa. Reduced states from 411 to 359. [2018-06-22 10:56:23,038 INFO ]: Start removeUnreachable. Operand 359 states. [2018-06-22 10:56:23,039 INFO ]: Finished removeUnreachable. Reduced from 359 states to 359 states and 432 transitions. [2018-06-22 10:56:23,039 INFO ]: Start accepts. Automaton has 359 states and 432 transitions. Word has length 121 [2018-06-22 10:56:23,040 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:23,040 INFO ]: Abstraction has 359 states and 432 transitions. [2018-06-22 10:56:23,040 INFO ]: Interpolant automaton has 16 states. [2018-06-22 10:56:23,040 INFO ]: Start isEmpty. Operand 359 states and 432 transitions. [2018-06-22 10:56:23,042 INFO ]: Finished isEmpty. Found accepting run of length 122 [2018-06-22 10:56:23,042 INFO ]: Found error trace [2018-06-22 10:56:23,042 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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:56:23,042 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:23,042 INFO ]: Analyzing trace with hash 1784434797, now seen corresponding path program 1 times [2018-06-22 10:56:23,042 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:23,042 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:23,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:23,043 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:23,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:23,055 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:23,266 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:23,266 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:23,266 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-06-22 10:56:23,266 INFO ]: Interpolant automaton has 16 states [2018-06-22 10:56:23,266 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 10:56:23,267 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:56:23,267 INFO ]: Start difference. First operand 359 states and 432 transitions. Second operand 16 states. [2018-06-22 10:56:23,919 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:23,919 INFO ]: Finished difference Result 407 states and 482 transitions. [2018-06-22 10:56:23,919 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:56:23,919 INFO ]: Start accepts. Automaton has 16 states. Word has length 121 [2018-06-22 10:56:23,920 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:23,922 INFO ]: With dead ends: 407 [2018-06-22 10:56:23,922 INFO ]: Without dead ends: 407 [2018-06-22 10:56:23,922 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 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:56:23,922 INFO ]: Start minimizeSevpa. Operand 407 states. [2018-06-22 10:56:23,937 INFO ]: Finished minimizeSevpa. Reduced states from 407 to 355. [2018-06-22 10:56:23,937 INFO ]: Start removeUnreachable. Operand 355 states. [2018-06-22 10:56:23,939 INFO ]: Finished removeUnreachable. Reduced from 355 states to 355 states and 422 transitions. [2018-06-22 10:56:23,939 INFO ]: Start accepts. Automaton has 355 states and 422 transitions. Word has length 121 [2018-06-22 10:56:23,939 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:23,939 INFO ]: Abstraction has 355 states and 422 transitions. [2018-06-22 10:56:23,939 INFO ]: Interpolant automaton has 16 states. [2018-06-22 10:56:23,939 INFO ]: Start isEmpty. Operand 355 states and 422 transitions. [2018-06-22 10:56:23,941 INFO ]: Finished isEmpty. Found accepting run of length 122 [2018-06-22 10:56:23,941 INFO ]: Found error trace [2018-06-22 10:56:23,941 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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:56:23,941 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:23,941 INFO ]: Analyzing trace with hash 1873518192, now seen corresponding path program 1 times [2018-06-22 10:56:23,941 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:23,941 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:23,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:23,943 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:23,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:23,956 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:24,220 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:24,221 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:24,221 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:56:24,221 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:56:24,221 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:56:24,221 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:24,221 INFO ]: Start difference. First operand 355 states and 422 transitions. Second operand 14 states. [2018-06-22 10:56:24,402 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:24,402 INFO ]: Finished difference Result 409 states and 488 transitions. [2018-06-22 10:56:24,403 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:56:24,403 INFO ]: Start accepts. Automaton has 14 states. Word has length 121 [2018-06-22 10:56:24,403 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:24,404 INFO ]: With dead ends: 409 [2018-06-22 10:56:24,404 INFO ]: Without dead ends: 399 [2018-06-22 10:56:24,405 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:24,405 INFO ]: Start minimizeSevpa. Operand 399 states. [2018-06-22 10:56:24,420 INFO ]: Finished minimizeSevpa. Reduced states from 399 to 379. [2018-06-22 10:56:24,420 INFO ]: Start removeUnreachable. Operand 379 states. [2018-06-22 10:56:24,421 INFO ]: Finished removeUnreachable. Reduced from 379 states to 379 states and 453 transitions. [2018-06-22 10:56:24,422 INFO ]: Start accepts. Automaton has 379 states and 453 transitions. Word has length 121 [2018-06-22 10:56:24,422 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:24,422 INFO ]: Abstraction has 379 states and 453 transitions. [2018-06-22 10:56:24,422 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:56:24,422 INFO ]: Start isEmpty. Operand 379 states and 453 transitions. [2018-06-22 10:56:24,424 INFO ]: Finished isEmpty. Found accepting run of length 122 [2018-06-22 10:56:24,424 INFO ]: Found error trace [2018-06-22 10:56:24,424 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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:56:24,424 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:24,424 INFO ]: Analyzing trace with hash 216005007, now seen corresponding path program 1 times [2018-06-22 10:56:24,424 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:24,424 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:24,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:24,425 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:24,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:24,438 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:24,840 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:24,840 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:24,840 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:56:24,840 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:56:24,840 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:56:24,840 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:24,840 INFO ]: Start difference. First operand 379 states and 453 transitions. Second operand 14 states. [2018-06-22 10:56:25,015 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:25,015 INFO ]: Finished difference Result 406 states and 485 transitions. [2018-06-22 10:56:25,017 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:56:25,017 INFO ]: Start accepts. Automaton has 14 states. Word has length 121 [2018-06-22 10:56:25,017 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:25,018 INFO ]: With dead ends: 406 [2018-06-22 10:56:25,018 INFO ]: Without dead ends: 388 [2018-06-22 10:56:25,019 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:25,019 INFO ]: Start minimizeSevpa. Operand 388 states. [2018-06-22 10:56:25,032 INFO ]: Finished minimizeSevpa. Reduced states from 388 to 372. [2018-06-22 10:56:25,033 INFO ]: Start removeUnreachable. Operand 372 states. [2018-06-22 10:56:25,034 INFO ]: Finished removeUnreachable. Reduced from 372 states to 372 states and 440 transitions. [2018-06-22 10:56:25,034 INFO ]: Start accepts. Automaton has 372 states and 440 transitions. Word has length 121 [2018-06-22 10:56:25,034 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:25,034 INFO ]: Abstraction has 372 states and 440 transitions. [2018-06-22 10:56:25,034 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:56:25,034 INFO ]: Start isEmpty. Operand 372 states and 440 transitions. [2018-06-22 10:56:25,036 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 10:56:25,036 INFO ]: Found error trace [2018-06-22 10:56:25,037 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-06-22 10:56:25,037 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:25,037 INFO ]: Analyzing trace with hash 1700423123, now seen corresponding path program 1 times [2018-06-22 10:56:25,037 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:25,037 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:25,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:25,037 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:25,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:25,049 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:25,362 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:25,362 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:25,362 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:56:25,362 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:56:25,362 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:56:25,362 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:25,362 INFO ]: Start difference. First operand 372 states and 440 transitions. Second operand 14 states. [2018-06-22 10:56:25,803 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:25,803 INFO ]: Finished difference Result 429 states and 507 transitions. [2018-06-22 10:56:25,803 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:56:25,803 INFO ]: Start accepts. Automaton has 14 states. Word has length 125 [2018-06-22 10:56:25,803 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:25,805 INFO ]: With dead ends: 429 [2018-06-22 10:56:25,805 INFO ]: Without dead ends: 417 [2018-06-22 10:56:25,805 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:25,806 INFO ]: Start minimizeSevpa. Operand 417 states. [2018-06-22 10:56:25,817 INFO ]: Finished minimizeSevpa. Reduced states from 417 to 379. [2018-06-22 10:56:25,817 INFO ]: Start removeUnreachable. Operand 379 states. [2018-06-22 10:56:25,819 INFO ]: Finished removeUnreachable. Reduced from 379 states to 379 states and 456 transitions. [2018-06-22 10:56:25,819 INFO ]: Start accepts. Automaton has 379 states and 456 transitions. Word has length 125 [2018-06-22 10:56:25,819 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:25,819 INFO ]: Abstraction has 379 states and 456 transitions. [2018-06-22 10:56:25,819 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:56:25,819 INFO ]: Start isEmpty. Operand 379 states and 456 transitions. [2018-06-22 10:56:25,821 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 10:56:25,821 INFO ]: Found error trace [2018-06-22 10:56:25,822 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-06-22 10:56:25,822 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:25,822 INFO ]: Analyzing trace with hash -1386444276, now seen corresponding path program 1 times [2018-06-22 10:56:25,822 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:25,822 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:25,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:25,822 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:25,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:25,835 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:25,978 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:25,978 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:25,978 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:56:25,978 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:56:25,979 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:56:25,979 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:25,979 INFO ]: Start difference. First operand 379 states and 456 transitions. Second operand 14 states. [2018-06-22 10:56:26,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:26,215 INFO ]: Finished difference Result 436 states and 516 transitions. [2018-06-22 10:56:26,215 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:56:26,215 INFO ]: Start accepts. Automaton has 14 states. Word has length 125 [2018-06-22 10:56:26,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:26,217 INFO ]: With dead ends: 436 [2018-06-22 10:56:26,217 INFO ]: Without dead ends: 424 [2018-06-22 10:56:26,217 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:26,217 INFO ]: Start minimizeSevpa. Operand 424 states. [2018-06-22 10:56:26,229 INFO ]: Finished minimizeSevpa. Reduced states from 424 to 388. [2018-06-22 10:56:26,229 INFO ]: Start removeUnreachable. Operand 388 states. [2018-06-22 10:56:26,231 INFO ]: Finished removeUnreachable. Reduced from 388 states to 388 states and 467 transitions. [2018-06-22 10:56:26,231 INFO ]: Start accepts. Automaton has 388 states and 467 transitions. Word has length 125 [2018-06-22 10:56:26,232 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:26,232 INFO ]: Abstraction has 388 states and 467 transitions. [2018-06-22 10:56:26,232 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:56:26,232 INFO ]: Start isEmpty. Operand 388 states and 467 transitions. [2018-06-22 10:56:26,234 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 10:56:26,234 INFO ]: Found error trace [2018-06-22 10:56:26,234 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-06-22 10:56:26,234 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:26,234 INFO ]: Analyzing trace with hash -971170730, now seen corresponding path program 1 times [2018-06-22 10:56:26,234 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:26,234 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:26,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:26,236 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:26,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:26,248 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:27,726 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:27,726 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:27,726 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-06-22 10:56:27,726 INFO ]: Interpolant automaton has 16 states [2018-06-22 10:56:27,727 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 10:56:27,727 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:56:27,727 INFO ]: Start difference. First operand 388 states and 467 transitions. Second operand 16 states. [2018-06-22 10:56:27,864 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:27,864 INFO ]: Finished difference Result 452 states and 537 transitions. [2018-06-22 10:56:27,866 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:56:27,866 INFO ]: Start accepts. Automaton has 16 states. Word has length 125 [2018-06-22 10:56:27,866 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:27,868 INFO ]: With dead ends: 452 [2018-06-22 10:56:27,868 INFO ]: Without dead ends: 452 [2018-06-22 10:56:27,869 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:56:27,869 INFO ]: Start minimizeSevpa. Operand 452 states. [2018-06-22 10:56:27,884 INFO ]: Finished minimizeSevpa. Reduced states from 452 to 412. [2018-06-22 10:56:27,884 INFO ]: Start removeUnreachable. Operand 412 states. [2018-06-22 10:56:27,886 INFO ]: Finished removeUnreachable. Reduced from 412 states to 412 states and 497 transitions. [2018-06-22 10:56:27,886 INFO ]: Start accepts. Automaton has 412 states and 497 transitions. Word has length 125 [2018-06-22 10:56:27,887 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:27,887 INFO ]: Abstraction has 412 states and 497 transitions. [2018-06-22 10:56:27,887 INFO ]: Interpolant automaton has 16 states. [2018-06-22 10:56:27,887 INFO ]: Start isEmpty. Operand 412 states and 497 transitions. [2018-06-22 10:56:27,889 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 10:56:27,889 INFO ]: Found error trace [2018-06-22 10:56:27,889 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-06-22 10:56:27,889 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:27,889 INFO ]: Analyzing trace with hash -486863825, now seen corresponding path program 1 times [2018-06-22 10:56:27,889 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:27,889 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:27,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:27,890 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:27,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:27,904 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:28,143 WARN ]: Spent 114.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 4 [2018-06-22 10:56:28,354 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:28,354 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:28,354 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:56:28,354 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:56:28,354 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:56:28,354 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:28,354 INFO ]: Start difference. First operand 412 states and 497 transitions. Second operand 14 states. [2018-06-22 10:56:28,565 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:28,565 INFO ]: Finished difference Result 471 states and 558 transitions. [2018-06-22 10:56:28,565 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:56:28,566 INFO ]: Start accepts. Automaton has 14 states. Word has length 125 [2018-06-22 10:56:28,566 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:28,567 INFO ]: With dead ends: 471 [2018-06-22 10:56:28,567 INFO ]: Without dead ends: 459 [2018-06-22 10:56:28,567 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:28,567 INFO ]: Start minimizeSevpa. Operand 459 states. [2018-06-22 10:56:28,582 INFO ]: Finished minimizeSevpa. Reduced states from 459 to 419. [2018-06-22 10:56:28,582 INFO ]: Start removeUnreachable. Operand 419 states. [2018-06-22 10:56:28,583 INFO ]: Finished removeUnreachable. Reduced from 419 states to 419 states and 505 transitions. [2018-06-22 10:56:28,583 INFO ]: Start accepts. Automaton has 419 states and 505 transitions. Word has length 125 [2018-06-22 10:56:28,584 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:28,584 INFO ]: Abstraction has 419 states and 505 transitions. [2018-06-22 10:56:28,584 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:56:28,584 INFO ]: Start isEmpty. Operand 419 states and 505 transitions. [2018-06-22 10:56:28,586 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 10:56:28,586 INFO ]: Found error trace [2018-06-22 10:56:28,586 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-06-22 10:56:28,586 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:28,586 INFO ]: Analyzing trace with hash -295432343, now seen corresponding path program 1 times [2018-06-22 10:56:28,586 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:28,586 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:28,587 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:28,587 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:28,587 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:28,598 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:31,141 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:31,141 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:31,141 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-06-22 10:56:31,141 INFO ]: Interpolant automaton has 16 states [2018-06-22 10:56:31,141 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 10:56:31,141 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:56:31,141 INFO ]: Start difference. First operand 419 states and 505 transitions. Second operand 16 states. [2018-06-22 10:56:31,323 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:31,323 INFO ]: Finished difference Result 481 states and 567 transitions. [2018-06-22 10:56:31,323 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:56:31,323 INFO ]: Start accepts. Automaton has 16 states. Word has length 125 [2018-06-22 10:56:31,324 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:31,325 INFO ]: With dead ends: 481 [2018-06-22 10:56:31,325 INFO ]: Without dead ends: 481 [2018-06-22 10:56:31,325 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:56:31,325 INFO ]: Start minimizeSevpa. Operand 481 states. [2018-06-22 10:56:31,339 INFO ]: Finished minimizeSevpa. Reduced states from 481 to 439. [2018-06-22 10:56:31,339 INFO ]: Start removeUnreachable. Operand 439 states. [2018-06-22 10:56:31,341 INFO ]: Finished removeUnreachable. Reduced from 439 states to 439 states and 525 transitions. [2018-06-22 10:56:31,341 INFO ]: Start accepts. Automaton has 439 states and 525 transitions. Word has length 125 [2018-06-22 10:56:31,341 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:31,341 INFO ]: Abstraction has 439 states and 525 transitions. [2018-06-22 10:56:31,341 INFO ]: Interpolant automaton has 16 states. [2018-06-22 10:56:31,341 INFO ]: Start isEmpty. Operand 439 states and 525 transitions. [2018-06-22 10:56:31,343 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 10:56:31,343 INFO ]: Found error trace [2018-06-22 10:56:31,344 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-06-22 10:56:31,344 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:31,344 INFO ]: Analyzing trace with hash 1276623727, now seen corresponding path program 1 times [2018-06-22 10:56:31,344 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:31,344 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:31,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:31,344 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:31,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:31,357 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:32,028 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:32,028 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:32,028 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-06-22 10:56:32,028 INFO ]: Interpolant automaton has 16 states [2018-06-22 10:56:32,029 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 10:56:32,029 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:56:32,029 INFO ]: Start difference. First operand 439 states and 525 transitions. Second operand 16 states. [2018-06-22 10:56:32,192 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:32,192 INFO ]: Finished difference Result 501 states and 587 transitions. [2018-06-22 10:56:32,192 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:56:32,192 INFO ]: Start accepts. Automaton has 16 states. Word has length 125 [2018-06-22 10:56:32,193 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:32,194 INFO ]: With dead ends: 501 [2018-06-22 10:56:32,194 INFO ]: Without dead ends: 501 [2018-06-22 10:56:32,195 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:56:32,195 INFO ]: Start minimizeSevpa. Operand 501 states. [2018-06-22 10:56:32,209 INFO ]: Finished minimizeSevpa. Reduced states from 501 to 443. [2018-06-22 10:56:32,210 INFO ]: Start removeUnreachable. Operand 443 states. [2018-06-22 10:56:32,211 INFO ]: Finished removeUnreachable. Reduced from 443 states to 443 states and 529 transitions. [2018-06-22 10:56:32,212 INFO ]: Start accepts. Automaton has 443 states and 529 transitions. Word has length 125 [2018-06-22 10:56:32,212 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:32,212 INFO ]: Abstraction has 443 states and 529 transitions. [2018-06-22 10:56:32,212 INFO ]: Interpolant automaton has 16 states. [2018-06-22 10:56:32,212 INFO ]: Start isEmpty. Operand 443 states and 529 transitions. [2018-06-22 10:56:32,214 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 10:56:32,214 INFO ]: Found error trace [2018-06-22 10:56:32,214 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-06-22 10:56:32,214 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:32,214 INFO ]: Analyzing trace with hash -779739248, now seen corresponding path program 1 times [2018-06-22 10:56:32,214 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:32,214 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:32,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:32,215 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:32,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:32,227 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:33,086 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:33,086 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:33,086 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:56:33,086 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:56:33,086 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:56:33,086 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:33,087 INFO ]: Start difference. First operand 443 states and 529 transitions. Second operand 14 states. [2018-06-22 10:56:33,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:33,306 INFO ]: Finished difference Result 497 states and 592 transitions. [2018-06-22 10:56:33,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:56:33,307 INFO ]: Start accepts. Automaton has 14 states. Word has length 125 [2018-06-22 10:56:33,307 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:33,308 INFO ]: With dead ends: 497 [2018-06-22 10:56:33,308 INFO ]: Without dead ends: 485 [2018-06-22 10:56:33,308 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:33,309 INFO ]: Start minimizeSevpa. Operand 485 states. [2018-06-22 10:56:33,321 INFO ]: Finished minimizeSevpa. Reduced states from 485 to 455. [2018-06-22 10:56:33,321 INFO ]: Start removeUnreachable. Operand 455 states. [2018-06-22 10:56:33,323 INFO ]: Finished removeUnreachable. Reduced from 455 states to 455 states and 549 transitions. [2018-06-22 10:56:33,323 INFO ]: Start accepts. Automaton has 455 states and 549 transitions. Word has length 125 [2018-06-22 10:56:33,323 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:33,323 INFO ]: Abstraction has 455 states and 549 transitions. [2018-06-22 10:56:33,323 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:56:33,323 INFO ]: Start isEmpty. Operand 455 states and 549 transitions. [2018-06-22 10:56:33,325 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 10:56:33,325 INFO ]: Found error trace [2018-06-22 10:56:33,325 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-06-22 10:56:33,325 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:33,325 INFO ]: Analyzing trace with hash 1013239158, now seen corresponding path program 1 times [2018-06-22 10:56:33,326 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:33,326 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:33,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:33,326 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:33,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:33,338 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:33,506 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:33,506 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:33,506 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:56:33,507 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:56:33,507 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:56:33,507 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:33,507 INFO ]: Start difference. First operand 455 states and 549 transitions. Second operand 14 states. [2018-06-22 10:56:33,714 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:33,714 INFO ]: Finished difference Result 512 states and 610 transitions. [2018-06-22 10:56:33,714 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:56:33,714 INFO ]: Start accepts. Automaton has 14 states. Word has length 125 [2018-06-22 10:56:33,714 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:33,715 INFO ]: With dead ends: 512 [2018-06-22 10:56:33,715 INFO ]: Without dead ends: 500 [2018-06-22 10:56:33,716 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:33,716 INFO ]: Start minimizeSevpa. Operand 500 states. [2018-06-22 10:56:33,731 INFO ]: Finished minimizeSevpa. Reduced states from 500 to 460. [2018-06-22 10:56:33,731 INFO ]: Start removeUnreachable. Operand 460 states. [2018-06-22 10:56:33,733 INFO ]: Finished removeUnreachable. Reduced from 460 states to 460 states and 556 transitions. [2018-06-22 10:56:33,733 INFO ]: Start accepts. Automaton has 460 states and 556 transitions. Word has length 125 [2018-06-22 10:56:33,733 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:33,733 INFO ]: Abstraction has 460 states and 556 transitions. [2018-06-22 10:56:33,733 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:56:33,734 INFO ]: Start isEmpty. Operand 460 states and 556 transitions. [2018-06-22 10:56:33,735 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 10:56:33,735 INFO ]: Found error trace [2018-06-22 10:56:33,736 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-06-22 10:56:33,736 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:33,736 INFO ]: Analyzing trace with hash 1799562255, now seen corresponding path program 1 times [2018-06-22 10:56:33,736 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:33,736 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:33,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:33,736 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:33,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:33,748 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:34,159 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:34,159 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:34,159 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-06-22 10:56:34,160 INFO ]: Interpolant automaton has 16 states [2018-06-22 10:56:34,160 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 10:56:34,160 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:56:34,160 INFO ]: Start difference. First operand 460 states and 556 transitions. Second operand 16 states. [2018-06-22 10:56:34,739 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:34,739 INFO ]: Finished difference Result 522 states and 618 transitions. [2018-06-22 10:56:34,740 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:56:34,740 INFO ]: Start accepts. Automaton has 16 states. Word has length 125 [2018-06-22 10:56:34,740 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:34,742 INFO ]: With dead ends: 522 [2018-06-22 10:56:34,742 INFO ]: Without dead ends: 522 [2018-06-22 10:56:34,742 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:56:34,743 INFO ]: Start minimizeSevpa. Operand 522 states. [2018-06-22 10:56:34,755 INFO ]: Finished minimizeSevpa. Reduced states from 522 to 460. [2018-06-22 10:56:34,755 INFO ]: Start removeUnreachable. Operand 460 states. [2018-06-22 10:56:34,758 INFO ]: Finished removeUnreachable. Reduced from 460 states to 460 states and 556 transitions. [2018-06-22 10:56:34,758 INFO ]: Start accepts. Automaton has 460 states and 556 transitions. Word has length 125 [2018-06-22 10:56:34,759 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:34,759 INFO ]: Abstraction has 460 states and 556 transitions. [2018-06-22 10:56:34,759 INFO ]: Interpolant automaton has 16 states. [2018-06-22 10:56:34,759 INFO ]: Start isEmpty. Operand 460 states and 556 transitions. [2018-06-22 10:56:34,761 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 10:56:34,761 INFO ]: Found error trace [2018-06-22 10:56:34,761 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-06-22 10:56:34,761 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:34,761 INFO ]: Analyzing trace with hash -2073628241, now seen corresponding path program 1 times [2018-06-22 10:56:34,761 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:34,761 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:34,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:34,762 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:34,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:34,775 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:34,988 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:34,988 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:34,988 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:56:34,988 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:56:34,988 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:56:34,988 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:34,989 INFO ]: Start difference. First operand 460 states and 556 transitions. Second operand 14 states. [2018-06-22 10:56:35,169 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:35,169 INFO ]: Finished difference Result 523 states and 623 transitions. [2018-06-22 10:56:35,169 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:56:35,169 INFO ]: Start accepts. Automaton has 14 states. Word has length 125 [2018-06-22 10:56:35,170 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:35,172 INFO ]: With dead ends: 523 [2018-06-22 10:56:35,172 INFO ]: Without dead ends: 511 [2018-06-22 10:56:35,172 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:35,172 INFO ]: Start minimizeSevpa. Operand 511 states. [2018-06-22 10:56:35,187 INFO ]: Finished minimizeSevpa. Reduced states from 511 to 477. [2018-06-22 10:56:35,187 INFO ]: Start removeUnreachable. Operand 477 states. [2018-06-22 10:56:35,189 INFO ]: Finished removeUnreachable. Reduced from 477 states to 477 states and 576 transitions. [2018-06-22 10:56:35,189 INFO ]: Start accepts. Automaton has 477 states and 576 transitions. Word has length 125 [2018-06-22 10:56:35,190 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:35,190 INFO ]: Abstraction has 477 states and 576 transitions. [2018-06-22 10:56:35,190 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:56:35,190 INFO ]: Start isEmpty. Operand 477 states and 576 transitions. [2018-06-22 10:56:35,192 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 10:56:35,192 INFO ]: Found error trace [2018-06-22 10:56:35,192 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-06-22 10:56:35,192 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:35,192 INFO ]: Analyzing trace with hash 1844697132, now seen corresponding path program 1 times [2018-06-22 10:56:35,192 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:35,192 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:35,193 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:35,193 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:35,193 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:35,204 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:35,513 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:35,513 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:35,513 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:56:35,513 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:56:35,513 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:56:35,513 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:35,513 INFO ]: Start difference. First operand 477 states and 576 transitions. Second operand 14 states. [2018-06-22 10:56:35,840 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:35,840 INFO ]: Finished difference Result 529 states and 629 transitions. [2018-06-22 10:56:35,840 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:56:35,840 INFO ]: Start accepts. Automaton has 14 states. Word has length 125 [2018-06-22 10:56:35,840 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:35,842 INFO ]: With dead ends: 529 [2018-06-22 10:56:35,842 INFO ]: Without dead ends: 517 [2018-06-22 10:56:35,843 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:35,843 INFO ]: Start minimizeSevpa. Operand 517 states. [2018-06-22 10:56:35,858 INFO ]: Finished minimizeSevpa. Reduced states from 517 to 481. [2018-06-22 10:56:35,858 INFO ]: Start removeUnreachable. Operand 481 states. [2018-06-22 10:56:35,860 INFO ]: Finished removeUnreachable. Reduced from 481 states to 481 states and 580 transitions. [2018-06-22 10:56:35,860 INFO ]: Start accepts. Automaton has 481 states and 580 transitions. Word has length 125 [2018-06-22 10:56:35,860 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:35,860 INFO ]: Abstraction has 481 states and 580 transitions. [2018-06-22 10:56:35,860 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:56:35,860 INFO ]: Start isEmpty. Operand 481 states and 580 transitions. [2018-06-22 10:56:35,863 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 10:56:35,863 INFO ]: Found error trace [2018-06-22 10:56:35,864 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-06-22 10:56:35,864 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:35,864 INFO ]: Analyzing trace with hash -1259746230, now seen corresponding path program 1 times [2018-06-22 10:56:35,864 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:35,864 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:35,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:35,864 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:35,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:35,879 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:36,517 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:36,517 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:36,517 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:56:36,518 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:56:36,518 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:56:36,518 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:36,518 INFO ]: Start difference. First operand 481 states and 580 transitions. Second operand 14 states. [2018-06-22 10:56:36,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:36,690 INFO ]: Finished difference Result 524 states and 627 transitions. [2018-06-22 10:56:36,690 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:56:36,690 INFO ]: Start accepts. Automaton has 14 states. Word has length 125 [2018-06-22 10:56:36,690 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:36,692 INFO ]: With dead ends: 524 [2018-06-22 10:56:36,692 INFO ]: Without dead ends: 510 [2018-06-22 10:56:36,692 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:36,692 INFO ]: Start minimizeSevpa. Operand 510 states. [2018-06-22 10:56:36,703 INFO ]: Finished minimizeSevpa. Reduced states from 510 to 470. [2018-06-22 10:56:36,703 INFO ]: Start removeUnreachable. Operand 470 states. [2018-06-22 10:56:36,705 INFO ]: Finished removeUnreachable. Reduced from 470 states to 470 states and 571 transitions. [2018-06-22 10:56:36,705 INFO ]: Start accepts. Automaton has 470 states and 571 transitions. Word has length 125 [2018-06-22 10:56:36,706 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:36,706 INFO ]: Abstraction has 470 states and 571 transitions. [2018-06-22 10:56:36,706 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:56:36,706 INFO ]: Start isEmpty. Operand 470 states and 571 transitions. [2018-06-22 10:56:36,707 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 10:56:36,707 INFO ]: Found error trace [2018-06-22 10:56:36,708 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-06-22 10:56:36,708 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:36,708 INFO ]: Analyzing trace with hash -1453175151, now seen corresponding path program 1 times [2018-06-22 10:56:36,708 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:36,708 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:36,708 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:36,708 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:36,708 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:36,720 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:36,941 WARN ]: Spent 102.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 4 [2018-06-22 10:56:37,183 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:37,183 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:37,183 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:56:37,183 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:56:37,183 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:56:37,183 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:37,183 INFO ]: Start difference. First operand 470 states and 571 transitions. Second operand 14 states. [2018-06-22 10:56:37,359 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:37,359 INFO ]: Finished difference Result 520 states and 622 transitions. [2018-06-22 10:56:37,360 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:56:37,360 INFO ]: Start accepts. Automaton has 14 states. Word has length 125 [2018-06-22 10:56:37,360 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:37,361 INFO ]: With dead ends: 520 [2018-06-22 10:56:37,361 INFO ]: Without dead ends: 503 [2018-06-22 10:56:37,361 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:37,361 INFO ]: Start minimizeSevpa. Operand 503 states. [2018-06-22 10:56:37,369 INFO ]: Finished minimizeSevpa. Reduced states from 503 to 469. [2018-06-22 10:56:37,369 INFO ]: Start removeUnreachable. Operand 469 states. [2018-06-22 10:56:37,371 INFO ]: Finished removeUnreachable. Reduced from 469 states to 469 states and 569 transitions. [2018-06-22 10:56:37,371 INFO ]: Start accepts. Automaton has 469 states and 569 transitions. Word has length 125 [2018-06-22 10:56:37,372 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:37,372 INFO ]: Abstraction has 469 states and 569 transitions. [2018-06-22 10:56:37,372 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:56:37,372 INFO ]: Start isEmpty. Operand 469 states and 569 transitions. [2018-06-22 10:56:37,374 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 10:56:37,374 INFO ]: Found error trace [2018-06-22 10:56:37,374 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-06-22 10:56:37,374 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:37,374 INFO ]: Analyzing trace with hash 951299177, now seen corresponding path program 1 times [2018-06-22 10:56:37,374 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:37,374 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:37,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:37,374 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:37,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:37,385 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:37,927 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:37,927 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:37,927 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:56:37,928 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:56:37,928 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:56:37,928 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:37,928 INFO ]: Start difference. First operand 469 states and 569 transitions. Second operand 14 states. [2018-06-22 10:56:38,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:38,140 INFO ]: Finished difference Result 525 states and 627 transitions. [2018-06-22 10:56:38,141 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:56:38,141 INFO ]: Start accepts. Automaton has 14 states. Word has length 125 [2018-06-22 10:56:38,141 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:38,143 INFO ]: With dead ends: 525 [2018-06-22 10:56:38,143 INFO ]: Without dead ends: 509 [2018-06-22 10:56:38,143 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:38,143 INFO ]: Start minimizeSevpa. Operand 509 states. [2018-06-22 10:56:38,154 INFO ]: Finished minimizeSevpa. Reduced states from 509 to 475. [2018-06-22 10:56:38,154 INFO ]: Start removeUnreachable. Operand 475 states. [2018-06-22 10:56:38,155 INFO ]: Finished removeUnreachable. Reduced from 475 states to 475 states and 576 transitions. [2018-06-22 10:56:38,155 INFO ]: Start accepts. Automaton has 475 states and 576 transitions. Word has length 125 [2018-06-22 10:56:38,155 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:38,156 INFO ]: Abstraction has 475 states and 576 transitions. [2018-06-22 10:56:38,156 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:56:38,156 INFO ]: Start isEmpty. Operand 475 states and 576 transitions. [2018-06-22 10:56:38,157 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 10:56:38,157 INFO ]: Found error trace [2018-06-22 10:56:38,157 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-06-22 10:56:38,158 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:38,162 INFO ]: Analyzing trace with hash 1327941100, now seen corresponding path program 1 times [2018-06-22 10:56:38,162 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:38,162 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:38,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:38,162 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:38,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:38,172 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:38,403 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:38,403 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:38,403 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:56:38,403 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:56:38,403 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:56:38,404 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:38,404 INFO ]: Start difference. First operand 475 states and 576 transitions. Second operand 14 states. [2018-06-22 10:56:38,587 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:38,587 INFO ]: Finished difference Result 509 states and 611 transitions. [2018-06-22 10:56:38,588 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:56:38,588 INFO ]: Start accepts. Automaton has 14 states. Word has length 125 [2018-06-22 10:56:38,588 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:38,590 INFO ]: With dead ends: 509 [2018-06-22 10:56:38,590 INFO ]: Without dead ends: 489 [2018-06-22 10:56:38,590 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:38,591 INFO ]: Start minimizeSevpa. Operand 489 states. [2018-06-22 10:56:38,603 INFO ]: Finished minimizeSevpa. Reduced states from 489 to 453. [2018-06-22 10:56:38,603 INFO ]: Start removeUnreachable. Operand 453 states. [2018-06-22 10:56:38,609 INFO ]: Finished removeUnreachable. Reduced from 453 states to 453 states and 549 transitions. [2018-06-22 10:56:38,609 INFO ]: Start accepts. Automaton has 453 states and 549 transitions. Word has length 125 [2018-06-22 10:56:38,609 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:38,609 INFO ]: Abstraction has 453 states and 549 transitions. [2018-06-22 10:56:38,609 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:56:38,609 INFO ]: Start isEmpty. Operand 453 states and 549 transitions. [2018-06-22 10:56:38,611 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 10:56:38,611 INFO ]: Found error trace [2018-06-22 10:56:38,611 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-06-22 10:56:38,611 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:56:38,611 INFO ]: Analyzing trace with hash 406534130, now seen corresponding path program 1 times [2018-06-22 10:56:38,611 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:56:38,611 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:56:38,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:38,612 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:56:38,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:56:38,658 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:56:38,895 INFO ]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:56:38,895 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:56:38,895 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 10:56:38,895 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:56:38,895 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:56:38,895 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:38,895 INFO ]: Start difference. First operand 453 states and 549 transitions. Second operand 14 states. [2018-06-22 10:56:39,194 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:56:39,194 INFO ]: Finished difference Result 471 states and 568 transitions. [2018-06-22 10:56:39,194 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:56:39,194 INFO ]: Start accepts. Automaton has 14 states. Word has length 125 [2018-06-22 10:56:39,194 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:56:39,194 INFO ]: With dead ends: 471 [2018-06-22 10:56:39,194 INFO ]: Without dead ends: 0 [2018-06-22 10:56:39,195 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:56:39,195 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 10:56:39,195 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 10:56:39,195 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 10:56:39,195 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 10:56:39,195 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2018-06-22 10:56:39,195 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:56:39,195 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 10:56:39,195 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:56:39,195 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 10:56:39,195 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 10:56:39,199 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:56:39 BoogieIcfgContainer [2018-06-22 10:56:39,199 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:56:39,200 INFO ]: Toolchain (without parser) took 34478.22 ms. Allocated memory was 306.7 MB in the beginning and 578.8 MB in the end (delta: 272.1 MB). Free memory was 240.1 MB in the beginning and 462.4 MB in the end (delta: -222.3 MB). Peak memory consumption was 49.8 MB. Max. memory is 3.6 GB. [2018-06-22 10:56:39,200 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:56:39,200 INFO ]: ChcToBoogie took 79.15 ms. Allocated memory is still 306.7 MB. Free memory was 240.1 MB in the beginning and 238.1 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:56:39,201 INFO ]: Boogie Preprocessor took 51.67 ms. Allocated memory is still 306.7 MB. Free memory was 238.1 MB in the beginning and 236.1 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:56:39,201 INFO ]: RCFGBuilder took 647.01 ms. Allocated memory is still 306.7 MB. Free memory was 236.1 MB in the beginning and 201.1 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:56:39,201 INFO ]: TraceAbstraction took 33691.56 ms. Allocated memory was 306.7 MB in the beginning and 578.8 MB in the end (delta: 272.1 MB). Free memory was 201.1 MB in the beginning and 462.4 MB in the end (delta: -261.3 MB). Peak memory consumption was 10.8 MB. Max. memory is 3.6 GB. [2018-06-22 10:56:39,203 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 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 79.15 ms. Allocated memory is still 306.7 MB. Free memory was 240.1 MB in the beginning and 238.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 51.67 ms. Allocated memory is still 306.7 MB. Free memory was 238.1 MB in the beginning and 236.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 647.01 ms. Allocated memory is still 306.7 MB. Free memory was 236.1 MB in the beginning and 201.1 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 33691.56 ms. Allocated memory was 306.7 MB in the beginning and 578.8 MB in the end (delta: 272.1 MB). Free memory was 201.1 MB in the beginning and 462.4 MB in the end (delta: -261.3 MB). Peak memory consumption was 10.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 41 procedures, 175 locations, 1 error locations. SAFE Result, 33.6s OverallTime, 38 OverallIterations, 2 TraceHistogramMax, 13.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7855 SDtfs, 320 SDslu, 101127 SDs, 0 SdLazy, 11952 SolverSat, 206 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 584 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 504 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=481occurred in iteration=33, 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, 38 MinimizatonAttempts, 994 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 18.0s InterpolantComputationTime, 4246 NumberOfCodeBlocks, 4246 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 4208 ConstructedInterpolants, 0 QuantifiedInterpolants, 836528 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 420/420 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/42.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-56-39-213.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/42.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-56-39-213.csv Received shutdown request...