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/36.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:54:37,804 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:54:37,807 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:54:37,820 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:54:37,820 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:54:37,821 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:54:37,824 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:54:37,826 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:54:37,828 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:54:37,828 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:54:37,830 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:54:37,830 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:54:37,831 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:54:37,832 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:54:37,834 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:54:37,835 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:54:37,837 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:54:37,846 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:54:37,848 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:54:37,851 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:54:37,852 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:54:37,854 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:54:37,854 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:54:37,854 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:54:37,855 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:54:37,856 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:54:37,857 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:54:37,858 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:54:37,858 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:54:37,859 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:54:37,859 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:54:37,860 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:54:37,863 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:54:37,864 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:54:37,865 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:54:37,865 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:54:37,886 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:54:37,886 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:54:37,887 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:54:37,887 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:54:37,888 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:54:37,888 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:54:37,889 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:54:37,889 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:54:37,889 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:54:37,889 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:54:37,889 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:54:37,890 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:54:37,890 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:54:37,890 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:54:37,890 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:54:37,890 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:54:37,890 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:54:37,891 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:54:37,891 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:54:37,895 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:54:37,895 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:54:37,943 INFO ]: Repository-Root is: /tmp [2018-06-22 10:54:37,959 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:54:37,962 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:54:37,964 INFO ]: Initializing SmtParser... [2018-06-22 10:54:37,965 INFO ]: SmtParser initialized [2018-06-22 10:54:37,965 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/36.c.smt2 [2018-06-22 10:54:37,967 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:54:38,033 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/36.c.smt2 unknown [2018-06-22 10:54:39,214 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/36.c.smt2 [2018-06-22 10:54:39,219 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:54:39,228 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:54:39,229 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:54:39,229 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:54:39,229 INFO ]: ChcToBoogie initialized [2018-06-22 10:54:39,232 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:54:39" (1/1) ... [2018-06-22 10:54:39,308 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:54:39 Unit [2018-06-22 10:54:39,308 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:54:39,309 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:54:39,309 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:54:39,309 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:54:39,331 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:54:39" (1/1) ... [2018-06-22 10:54:39,331 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:54:39" (1/1) ... [2018-06-22 10:54:39,367 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:54:39" (1/1) ... [2018-06-22 10:54:39,367 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:54:39" (1/1) ... [2018-06-22 10:54:39,390 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:54:39" (1/1) ... [2018-06-22 10:54:39,393 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:54:39" (1/1) ... [2018-06-22 10:54:39,400 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:54:39" (1/1) ... [2018-06-22 10:54:39,420 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:54:39,420 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:54:39,420 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:54:39,420 INFO ]: RCFGBuilder initialized [2018-06-22 10:54:39,421 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:54:39" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:54:39,452 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:54:39,453 INFO ]: Found specification of procedure False [2018-06-22 10:54:39,453 INFO ]: Found implementation of procedure False [2018-06-22 10:54:39,453 INFO ]: Specification and implementation of procedure h74 given in one single declaration [2018-06-22 10:54:39,453 INFO ]: Found specification of procedure h74 [2018-06-22 10:54:39,453 INFO ]: Found implementation of procedure h74 [2018-06-22 10:54:39,453 INFO ]: Specification and implementation of procedure h69 given in one single declaration [2018-06-22 10:54:39,453 INFO ]: Found specification of procedure h69 [2018-06-22 10:54:39,453 INFO ]: Found implementation of procedure h69 [2018-06-22 10:54:39,453 INFO ]: Specification and implementation of procedure h68 given in one single declaration [2018-06-22 10:54:39,453 INFO ]: Found specification of procedure h68 [2018-06-22 10:54:39,453 INFO ]: Found implementation of procedure h68 [2018-06-22 10:54:39,453 INFO ]: Specification and implementation of procedure h67 given in one single declaration [2018-06-22 10:54:39,453 INFO ]: Found specification of procedure h67 [2018-06-22 10:54:39,453 INFO ]: Found implementation of procedure h67 [2018-06-22 10:54:39,453 INFO ]: Specification and implementation of procedure h60 given in one single declaration [2018-06-22 10:54:39,453 INFO ]: Found specification of procedure h60 [2018-06-22 10:54:39,453 INFO ]: Found implementation of procedure h60 [2018-06-22 10:54:39,453 INFO ]: Specification and implementation of procedure h59 given in one single declaration [2018-06-22 10:54:39,453 INFO ]: Found specification of procedure h59 [2018-06-22 10:54:39,453 INFO ]: Found implementation of procedure h59 [2018-06-22 10:54:39,453 INFO ]: Specification and implementation of procedure h58 given in one single declaration [2018-06-22 10:54:39,453 INFO ]: Found specification of procedure h58 [2018-06-22 10:54:39,453 INFO ]: Found implementation of procedure h58 [2018-06-22 10:54:39,453 INFO ]: Specification and implementation of procedure h54 given in one single declaration [2018-06-22 10:54:39,453 INFO ]: Found specification of procedure h54 [2018-06-22 10:54:39,453 INFO ]: Found implementation of procedure h54 [2018-06-22 10:54:39,453 INFO ]: Specification and implementation of procedure h53 given in one single declaration [2018-06-22 10:54:39,453 INFO ]: Found specification of procedure h53 [2018-06-22 10:54:39,453 INFO ]: Found implementation of procedure h53 [2018-06-22 10:54:39,453 INFO ]: Specification and implementation of procedure h52 given in one single declaration [2018-06-22 10:54:39,453 INFO ]: Found specification of procedure h52 [2018-06-22 10:54:39,453 INFO ]: Found implementation of procedure h52 [2018-06-22 10:54:39,453 INFO ]: Specification and implementation of procedure h51 given in one single declaration [2018-06-22 10:54:39,453 INFO ]: Found specification of procedure h51 [2018-06-22 10:54:39,453 INFO ]: Found implementation of procedure h51 [2018-06-22 10:54:39,453 INFO ]: Specification and implementation of procedure h63 given in one single declaration [2018-06-22 10:54:39,454 INFO ]: Found specification of procedure h63 [2018-06-22 10:54:39,454 INFO ]: Found implementation of procedure h63 [2018-06-22 10:54:39,454 INFO ]: Specification and implementation of procedure h64 given in one single declaration [2018-06-22 10:54:39,454 INFO ]: Found specification of procedure h64 [2018-06-22 10:54:39,454 INFO ]: Found implementation of procedure h64 [2018-06-22 10:54:39,454 INFO ]: Specification and implementation of procedure h61 given in one single declaration [2018-06-22 10:54:39,454 INFO ]: Found specification of procedure h61 [2018-06-22 10:54:39,454 INFO ]: Found implementation of procedure h61 [2018-06-22 10:54:39,454 INFO ]: Specification and implementation of procedure h56 given in one single declaration [2018-06-22 10:54:39,454 INFO ]: Found specification of procedure h56 [2018-06-22 10:54:39,454 INFO ]: Found implementation of procedure h56 [2018-06-22 10:54:39,454 INFO ]: Specification and implementation of procedure h55 given in one single declaration [2018-06-22 10:54:39,454 INFO ]: Found specification of procedure h55 [2018-06-22 10:54:39,454 INFO ]: Found implementation of procedure h55 [2018-06-22 10:54:39,454 INFO ]: Specification and implementation of procedure h57 given in one single declaration [2018-06-22 10:54:39,454 INFO ]: Found specification of procedure h57 [2018-06-22 10:54:39,454 INFO ]: Found implementation of procedure h57 [2018-06-22 10:54:39,454 INFO ]: Specification and implementation of procedure h62 given in one single declaration [2018-06-22 10:54:39,454 INFO ]: Found specification of procedure h62 [2018-06-22 10:54:39,454 INFO ]: Found implementation of procedure h62 [2018-06-22 10:54:39,454 INFO ]: Specification and implementation of procedure h66 given in one single declaration [2018-06-22 10:54:39,454 INFO ]: Found specification of procedure h66 [2018-06-22 10:54:39,454 INFO ]: Found implementation of procedure h66 [2018-06-22 10:54:39,454 INFO ]: Specification and implementation of procedure h65 given in one single declaration [2018-06-22 10:54:39,454 INFO ]: Found specification of procedure h65 [2018-06-22 10:54:39,454 INFO ]: Found implementation of procedure h65 [2018-06-22 10:54:39,454 INFO ]: Specification and implementation of procedure h50 given in one single declaration [2018-06-22 10:54:39,454 INFO ]: Found specification of procedure h50 [2018-06-22 10:54:39,454 INFO ]: Found implementation of procedure h50 [2018-06-22 10:54:39,454 INFO ]: Specification and implementation of procedure h49 given in one single declaration [2018-06-22 10:54:39,454 INFO ]: Found specification of procedure h49 [2018-06-22 10:54:39,454 INFO ]: Found implementation of procedure h49 [2018-06-22 10:54:39,454 INFO ]: Specification and implementation of procedure h48 given in one single declaration [2018-06-22 10:54:39,454 INFO ]: Found specification of procedure h48 [2018-06-22 10:54:39,454 INFO ]: Found implementation of procedure h48 [2018-06-22 10:54:39,454 INFO ]: Specification and implementation of procedure h14 given in one single declaration [2018-06-22 10:54:39,454 INFO ]: Found specification of procedure h14 [2018-06-22 10:54:39,454 INFO ]: Found implementation of procedure h14 [2018-06-22 10:54:39,454 INFO ]: Specification and implementation of procedure h13 given in one single declaration [2018-06-22 10:54:39,454 INFO ]: Found specification of procedure h13 [2018-06-22 10:54:39,454 INFO ]: Found implementation of procedure h13 [2018-06-22 10:54:39,454 INFO ]: Specification and implementation of procedure h12 given in one single declaration [2018-06-22 10:54:39,454 INFO ]: Found specification of procedure h12 [2018-06-22 10:54:39,454 INFO ]: Found implementation of procedure h12 [2018-06-22 10:54:39,455 INFO ]: Specification and implementation of procedure h8 given in one single declaration [2018-06-22 10:54:39,455 INFO ]: Found specification of procedure h8 [2018-06-22 10:54:39,455 INFO ]: Found implementation of procedure h8 [2018-06-22 10:54:39,455 INFO ]: Specification and implementation of procedure h7 given in one single declaration [2018-06-22 10:54:39,455 INFO ]: Found specification of procedure h7 [2018-06-22 10:54:39,455 INFO ]: Found implementation of procedure h7 [2018-06-22 10:54:39,455 INFO ]: Specification and implementation of procedure h6 given in one single declaration [2018-06-22 10:54:39,455 INFO ]: Found specification of procedure h6 [2018-06-22 10:54:39,455 INFO ]: Found implementation of procedure h6 [2018-06-22 10:54:39,455 INFO ]: Specification and implementation of procedure h5 given in one single declaration [2018-06-22 10:54:39,455 INFO ]: Found specification of procedure h5 [2018-06-22 10:54:39,455 INFO ]: Found implementation of procedure h5 [2018-06-22 10:54:39,455 INFO ]: Specification and implementation of procedure h4 given in one single declaration [2018-06-22 10:54:39,455 INFO ]: Found specification of procedure h4 [2018-06-22 10:54:39,455 INFO ]: Found implementation of procedure h4 [2018-06-22 10:54:39,455 INFO ]: Specification and implementation of procedure h3 given in one single declaration [2018-06-22 10:54:39,455 INFO ]: Found specification of procedure h3 [2018-06-22 10:54:39,455 INFO ]: Found implementation of procedure h3 [2018-06-22 10:54:39,455 INFO ]: Specification and implementation of procedure h2 given in one single declaration [2018-06-22 10:54:39,455 INFO ]: Found specification of procedure h2 [2018-06-22 10:54:39,455 INFO ]: Found implementation of procedure h2 [2018-06-22 10:54:39,455 INFO ]: Specification and implementation of procedure h1 given in one single declaration [2018-06-22 10:54:39,455 INFO ]: Found specification of procedure h1 [2018-06-22 10:54:39,455 INFO ]: Found implementation of procedure h1 [2018-06-22 10:54:39,455 INFO ]: Specification and implementation of procedure h47 given in one single declaration [2018-06-22 10:54:39,455 INFO ]: Found specification of procedure h47 [2018-06-22 10:54:39,455 INFO ]: Found implementation of procedure h47 [2018-06-22 10:54:39,455 INFO ]: Specification and implementation of procedure h41 given in one single declaration [2018-06-22 10:54:39,455 INFO ]: Found specification of procedure h41 [2018-06-22 10:54:39,455 INFO ]: Found implementation of procedure h41 [2018-06-22 10:54:39,455 INFO ]: Specification and implementation of procedure h40 given in one single declaration [2018-06-22 10:54:39,455 INFO ]: Found specification of procedure h40 [2018-06-22 10:54:39,455 INFO ]: Found implementation of procedure h40 [2018-06-22 10:54:39,455 INFO ]: Specification and implementation of procedure h39 given in one single declaration [2018-06-22 10:54:39,455 INFO ]: Found specification of procedure h39 [2018-06-22 10:54:39,455 INFO ]: Found implementation of procedure h39 [2018-06-22 10:54:39,455 INFO ]: Specification and implementation of procedure h35 given in one single declaration [2018-06-22 10:54:39,455 INFO ]: Found specification of procedure h35 [2018-06-22 10:54:39,455 INFO ]: Found implementation of procedure h35 [2018-06-22 10:54:39,455 INFO ]: Specification and implementation of procedure h34 given in one single declaration [2018-06-22 10:54:39,455 INFO ]: Found specification of procedure h34 [2018-06-22 10:54:39,455 INFO ]: Found implementation of procedure h34 [2018-06-22 10:54:39,455 INFO ]: Specification and implementation of procedure h33 given in one single declaration [2018-06-22 10:54:39,456 INFO ]: Found specification of procedure h33 [2018-06-22 10:54:39,456 INFO ]: Found implementation of procedure h33 [2018-06-22 10:54:39,456 INFO ]: Specification and implementation of procedure h32 given in one single declaration [2018-06-22 10:54:39,456 INFO ]: Found specification of procedure h32 [2018-06-22 10:54:39,456 INFO ]: Found implementation of procedure h32 [2018-06-22 10:54:39,456 INFO ]: Specification and implementation of procedure h45 given in one single declaration [2018-06-22 10:54:39,456 INFO ]: Found specification of procedure h45 [2018-06-22 10:54:39,456 INFO ]: Found implementation of procedure h45 [2018-06-22 10:54:39,456 INFO ]: Specification and implementation of procedure h44 given in one single declaration [2018-06-22 10:54:39,456 INFO ]: Found specification of procedure h44 [2018-06-22 10:54:39,456 INFO ]: Found implementation of procedure h44 [2018-06-22 10:54:39,456 INFO ]: Specification and implementation of procedure h37 given in one single declaration [2018-06-22 10:54:39,456 INFO ]: Found specification of procedure h37 [2018-06-22 10:54:39,456 INFO ]: Found implementation of procedure h37 [2018-06-22 10:54:39,456 INFO ]: Specification and implementation of procedure h38 given in one single declaration [2018-06-22 10:54:39,456 INFO ]: Found specification of procedure h38 [2018-06-22 10:54:39,456 INFO ]: Found implementation of procedure h38 [2018-06-22 10:54:39,456 INFO ]: Specification and implementation of procedure h36 given in one single declaration [2018-06-22 10:54:39,456 INFO ]: Found specification of procedure h36 [2018-06-22 10:54:39,456 INFO ]: Found implementation of procedure h36 [2018-06-22 10:54:39,456 INFO ]: Specification and implementation of procedure h46 given in one single declaration [2018-06-22 10:54:39,456 INFO ]: Found specification of procedure h46 [2018-06-22 10:54:39,456 INFO ]: Found implementation of procedure h46 [2018-06-22 10:54:39,456 INFO ]: Specification and implementation of procedure h43 given in one single declaration [2018-06-22 10:54:39,456 INFO ]: Found specification of procedure h43 [2018-06-22 10:54:39,456 INFO ]: Found implementation of procedure h43 [2018-06-22 10:54:39,456 INFO ]: Specification and implementation of procedure h42 given in one single declaration [2018-06-22 10:54:39,456 INFO ]: Found specification of procedure h42 [2018-06-22 10:54:39,456 INFO ]: Found implementation of procedure h42 [2018-06-22 10:54:39,456 INFO ]: Specification and implementation of procedure h31 given in one single declaration [2018-06-22 10:54:39,456 INFO ]: Found specification of procedure h31 [2018-06-22 10:54:39,456 INFO ]: Found implementation of procedure h31 [2018-06-22 10:54:39,456 INFO ]: Specification and implementation of procedure h29 given in one single declaration [2018-06-22 10:54:39,456 INFO ]: Found specification of procedure h29 [2018-06-22 10:54:39,456 INFO ]: Found implementation of procedure h29 [2018-06-22 10:54:39,456 INFO ]: Specification and implementation of procedure h28 given in one single declaration [2018-06-22 10:54:39,456 INFO ]: Found specification of procedure h28 [2018-06-22 10:54:39,456 INFO ]: Found implementation of procedure h28 [2018-06-22 10:54:39,456 INFO ]: Specification and implementation of procedure h25 given in one single declaration [2018-06-22 10:54:39,456 INFO ]: Found specification of procedure h25 [2018-06-22 10:54:39,456 INFO ]: Found implementation of procedure h25 [2018-06-22 10:54:39,456 INFO ]: Specification and implementation of procedure h24 given in one single declaration [2018-06-22 10:54:39,456 INFO ]: Found specification of procedure h24 [2018-06-22 10:54:39,456 INFO ]: Found implementation of procedure h24 [2018-06-22 10:54:39,457 INFO ]: Specification and implementation of procedure h23 given in one single declaration [2018-06-22 10:54:39,457 INFO ]: Found specification of procedure h23 [2018-06-22 10:54:39,457 INFO ]: Found implementation of procedure h23 [2018-06-22 10:54:39,457 INFO ]: Specification and implementation of procedure h22 given in one single declaration [2018-06-22 10:54:39,457 INFO ]: Found specification of procedure h22 [2018-06-22 10:54:39,457 INFO ]: Found implementation of procedure h22 [2018-06-22 10:54:39,457 INFO ]: Specification and implementation of procedure h21 given in one single declaration [2018-06-22 10:54:39,457 INFO ]: Found specification of procedure h21 [2018-06-22 10:54:39,457 INFO ]: Found implementation of procedure h21 [2018-06-22 10:54:39,457 INFO ]: Specification and implementation of procedure h18 given in one single declaration [2018-06-22 10:54:39,457 INFO ]: Found specification of procedure h18 [2018-06-22 10:54:39,457 INFO ]: Found implementation of procedure h18 [2018-06-22 10:54:39,457 INFO ]: Specification and implementation of procedure h17 given in one single declaration [2018-06-22 10:54:39,457 INFO ]: Found specification of procedure h17 [2018-06-22 10:54:39,457 INFO ]: Found implementation of procedure h17 [2018-06-22 10:54:39,457 INFO ]: Specification and implementation of procedure h20 given in one single declaration [2018-06-22 10:54:39,457 INFO ]: Found specification of procedure h20 [2018-06-22 10:54:39,457 INFO ]: Found implementation of procedure h20 [2018-06-22 10:54:39,457 INFO ]: Specification and implementation of procedure h19 given in one single declaration [2018-06-22 10:54:39,457 INFO ]: Found specification of procedure h19 [2018-06-22 10:54:39,457 INFO ]: Found implementation of procedure h19 [2018-06-22 10:54:39,457 INFO ]: Specification and implementation of procedure h16 given in one single declaration [2018-06-22 10:54:39,457 INFO ]: Found specification of procedure h16 [2018-06-22 10:54:39,457 INFO ]: Found implementation of procedure h16 [2018-06-22 10:54:39,457 INFO ]: Specification and implementation of procedure h15 given in one single declaration [2018-06-22 10:54:39,457 INFO ]: Found specification of procedure h15 [2018-06-22 10:54:39,457 INFO ]: Found implementation of procedure h15 [2018-06-22 10:54:39,457 INFO ]: Specification and implementation of procedure h10 given in one single declaration [2018-06-22 10:54:39,457 INFO ]: Found specification of procedure h10 [2018-06-22 10:54:39,457 INFO ]: Found implementation of procedure h10 [2018-06-22 10:54:39,457 INFO ]: Specification and implementation of procedure h11 given in one single declaration [2018-06-22 10:54:39,457 INFO ]: Found specification of procedure h11 [2018-06-22 10:54:39,457 INFO ]: Found implementation of procedure h11 [2018-06-22 10:54:39,457 INFO ]: Specification and implementation of procedure h9 given in one single declaration [2018-06-22 10:54:39,458 INFO ]: Found specification of procedure h9 [2018-06-22 10:54:39,458 INFO ]: Found implementation of procedure h9 [2018-06-22 10:54:39,458 INFO ]: Specification and implementation of procedure h30 given in one single declaration [2018-06-22 10:54:39,458 INFO ]: Found specification of procedure h30 [2018-06-22 10:54:39,458 INFO ]: Found implementation of procedure h30 [2018-06-22 10:54:39,458 INFO ]: Specification and implementation of procedure h27 given in one single declaration [2018-06-22 10:54:39,458 INFO ]: Found specification of procedure h27 [2018-06-22 10:54:39,458 INFO ]: Found implementation of procedure h27 [2018-06-22 10:54:39,458 INFO ]: Specification and implementation of procedure h26 given in one single declaration [2018-06-22 10:54:39,458 INFO ]: Found specification of procedure h26 [2018-06-22 10:54:39,458 INFO ]: Found implementation of procedure h26 [2018-06-22 10:54:39,458 INFO ]: Specification and implementation of procedure h73 given in one single declaration [2018-06-22 10:54:39,458 INFO ]: Found specification of procedure h73 [2018-06-22 10:54:39,458 INFO ]: Found implementation of procedure h73 [2018-06-22 10:54:39,458 INFO ]: Specification and implementation of procedure h70 given in one single declaration [2018-06-22 10:54:39,458 INFO ]: Found specification of procedure h70 [2018-06-22 10:54:39,458 INFO ]: Found implementation of procedure h70 [2018-06-22 10:54:39,458 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:54:39,458 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:54:39,458 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 10:54:40,710 INFO ]: Using library mode [2018-06-22 10:54:40,711 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:54:40 BoogieIcfgContainer [2018-06-22 10:54:40,711 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:54:40,712 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:54:40,712 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:54:40,716 INFO ]: TraceAbstraction initialized [2018-06-22 10:54:40,716 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:54:39" (1/3) ... [2018-06-22 10:54:40,717 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240a8b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:54:40, skipping insertion in model container [2018-06-22 10:54:40,717 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:54:39" (2/3) ... [2018-06-22 10:54:40,717 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240a8b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:54:40, skipping insertion in model container [2018-06-22 10:54:40,717 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:54:40" (3/3) ... [2018-06-22 10:54:40,720 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:54:40,729 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:54:40,739 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:54:40,781 INFO ]: Using default assertion order modulation [2018-06-22 10:54:40,781 INFO ]: Interprodecural is true [2018-06-22 10:54:40,781 INFO ]: Hoare is false [2018-06-22 10:54:40,781 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:54:40,781 INFO ]: Backedges is TWOTRACK [2018-06-22 10:54:40,781 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:54:40,781 INFO ]: Difference is false [2018-06-22 10:54:40,781 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:54:40,782 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:54:40,806 INFO ]: Start isEmpty. Operand 311 states. [2018-06-22 10:54:40,835 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:54:40,835 INFO ]: Found error trace [2018-06-22 10:54:40,836 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:40,836 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:40,843 INFO ]: Analyzing trace with hash 282440813, now seen corresponding path program 1 times [2018-06-22 10:54:40,844 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:40,844 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:40,878 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:40,878 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:40,878 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:41,103 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:41,579 WARN ]: Spent 194.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-06-22 10:54:42,587 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:54:42,590 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:54:42,590 INFO ]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-06-22 10:54:42,592 INFO ]: Interpolant automaton has 24 states [2018-06-22 10:54:42,608 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 10:54:42,609 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:54:42,612 INFO ]: Start difference. First operand 311 states. Second operand 24 states. [2018-06-22 10:54:44,557 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:44,557 INFO ]: Finished difference Result 345 states and 378 transitions. [2018-06-22 10:54:44,559 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 10:54:44,560 INFO ]: Start accepts. Automaton has 24 states. Word has length 97 [2018-06-22 10:54:44,562 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:44,580 INFO ]: With dead ends: 345 [2018-06-22 10:54:44,580 INFO ]: Without dead ends: 345 [2018-06-22 10:54:44,582 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:54:44,596 INFO ]: Start minimizeSevpa. Operand 345 states. [2018-06-22 10:54:44,653 INFO ]: Finished minimizeSevpa. Reduced states from 345 to 345. [2018-06-22 10:54:44,654 INFO ]: Start removeUnreachable. Operand 345 states. [2018-06-22 10:54:44,659 INFO ]: Finished removeUnreachable. Reduced from 345 states to 345 states and 378 transitions. [2018-06-22 10:54:44,661 INFO ]: Start accepts. Automaton has 345 states and 378 transitions. Word has length 97 [2018-06-22 10:54:44,662 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:44,662 INFO ]: Abstraction has 345 states and 378 transitions. [2018-06-22 10:54:44,662 INFO ]: Interpolant automaton has 24 states. [2018-06-22 10:54:44,662 INFO ]: Start isEmpty. Operand 345 states and 378 transitions. [2018-06-22 10:54:44,668 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:54:44,668 INFO ]: Found error trace [2018-06-22 10:54:44,668 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, 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:54:44,668 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:44,668 INFO ]: Analyzing trace with hash 2059690775, now seen corresponding path program 1 times [2018-06-22 10:54:44,668 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:44,668 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:44,669 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:44,669 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:44,669 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:44,704 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:45,024 WARN ]: Spent 181.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-06-22 10:54:45,713 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:54:45,713 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:54:45,743 INFO ]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-06-22 10:54:45,745 INFO ]: Interpolant automaton has 26 states [2018-06-22 10:54:45,745 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 10:54:45,745 INFO ]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-22 10:54:45,745 INFO ]: Start difference. First operand 345 states and 378 transitions. Second operand 26 states. [2018-06-22 10:54:46,716 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:46,716 INFO ]: Finished difference Result 349 states and 382 transitions. [2018-06-22 10:54:46,717 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 10:54:46,717 INFO ]: Start accepts. Automaton has 26 states. Word has length 105 [2018-06-22 10:54:46,717 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:46,721 INFO ]: With dead ends: 349 [2018-06-22 10:54:46,721 INFO ]: Without dead ends: 349 [2018-06-22 10:54:46,722 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-22 10:54:46,723 INFO ]: Start minimizeSevpa. Operand 349 states. [2018-06-22 10:54:46,760 INFO ]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-06-22 10:54:46,760 INFO ]: Start removeUnreachable. Operand 349 states. [2018-06-22 10:54:46,763 INFO ]: Finished removeUnreachable. Reduced from 349 states to 349 states and 382 transitions. [2018-06-22 10:54:46,763 INFO ]: Start accepts. Automaton has 349 states and 382 transitions. Word has length 105 [2018-06-22 10:54:46,764 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:46,764 INFO ]: Abstraction has 349 states and 382 transitions. [2018-06-22 10:54:46,764 INFO ]: Interpolant automaton has 26 states. [2018-06-22 10:54:46,764 INFO ]: Start isEmpty. Operand 349 states and 382 transitions. [2018-06-22 10:54:46,768 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 10:54:46,769 INFO ]: Found error trace [2018-06-22 10:54:46,769 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, 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:54:46,769 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:46,769 INFO ]: Analyzing trace with hash -299794446, now seen corresponding path program 1 times [2018-06-22 10:54:46,769 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:46,769 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:46,770 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:46,770 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:46,770 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:46,818 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:47,444 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:54:47,444 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:54:47,444 INFO ]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-06-22 10:54:47,444 INFO ]: Interpolant automaton has 26 states [2018-06-22 10:54:47,445 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 10:54:47,445 INFO ]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-22 10:54:47,445 INFO ]: Start difference. First operand 349 states and 382 transitions. Second operand 26 states. [2018-06-22 10:54:48,484 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:48,484 INFO ]: Finished difference Result 349 states and 381 transitions. [2018-06-22 10:54:48,485 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 10:54:48,485 INFO ]: Start accepts. Automaton has 26 states. Word has length 105 [2018-06-22 10:54:48,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:48,489 INFO ]: With dead ends: 349 [2018-06-22 10:54:48,489 INFO ]: Without dead ends: 337 [2018-06-22 10:54:48,490 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-22 10:54:48,490 INFO ]: Start minimizeSevpa. Operand 337 states. [2018-06-22 10:54:48,515 INFO ]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-06-22 10:54:48,515 INFO ]: Start removeUnreachable. Operand 337 states. [2018-06-22 10:54:48,518 INFO ]: Finished removeUnreachable. Reduced from 337 states to 337 states and 369 transitions. [2018-06-22 10:54:48,518 INFO ]: Start accepts. Automaton has 337 states and 369 transitions. Word has length 105 [2018-06-22 10:54:48,519 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:48,519 INFO ]: Abstraction has 337 states and 369 transitions. [2018-06-22 10:54:48,519 INFO ]: Interpolant automaton has 26 states. [2018-06-22 10:54:48,519 INFO ]: Start isEmpty. Operand 337 states and 369 transitions. [2018-06-22 10:54:48,528 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:54:48,528 INFO ]: Found error trace [2018-06-22 10:54:48,529 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:48,529 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:48,529 INFO ]: Analyzing trace with hash 1025774247, now seen corresponding path program 1 times [2018-06-22 10:54:48,529 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:48,529 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:48,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:48,530 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:48,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:48,586 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:48,820 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:54:48,820 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:54:48,820 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:54:48,820 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:54:48,821 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:54:48,821 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:54:48,821 INFO ]: Start difference. First operand 337 states and 369 transitions. Second operand 12 states. [2018-06-22 10:54:49,106 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:49,106 INFO ]: Finished difference Result 382 states and 432 transitions. [2018-06-22 10:54:49,106 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:54:49,106 INFO ]: Start accepts. Automaton has 12 states. Word has length 133 [2018-06-22 10:54:49,107 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:49,110 INFO ]: With dead ends: 382 [2018-06-22 10:54:49,110 INFO ]: Without dead ends: 382 [2018-06-22 10:54:49,111 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:54:49,111 INFO ]: Start minimizeSevpa. Operand 382 states. [2018-06-22 10:54:49,138 INFO ]: Finished minimizeSevpa. Reduced states from 382 to 380. [2018-06-22 10:54:49,139 INFO ]: Start removeUnreachable. Operand 380 states. [2018-06-22 10:54:49,143 INFO ]: Finished removeUnreachable. Reduced from 380 states to 380 states and 429 transitions. [2018-06-22 10:54:49,143 INFO ]: Start accepts. Automaton has 380 states and 429 transitions. Word has length 133 [2018-06-22 10:54:49,144 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:49,144 INFO ]: Abstraction has 380 states and 429 transitions. [2018-06-22 10:54:49,144 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:54:49,144 INFO ]: Start isEmpty. Operand 380 states and 429 transitions. [2018-06-22 10:54:49,147 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:54:49,147 INFO ]: Found error trace [2018-06-22 10:54:49,147 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:49,147 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:49,147 INFO ]: Analyzing trace with hash -1045225180, now seen corresponding path program 1 times [2018-06-22 10:54:49,148 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:49,148 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:49,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:49,148 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:49,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:49,177 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:49,400 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:54:49,400 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:54:49,400 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:54:49,400 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:54:49,400 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:54:49,400 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:54:49,400 INFO ]: Start difference. First operand 380 states and 429 transitions. Second operand 12 states. [2018-06-22 10:54:49,627 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:49,627 INFO ]: Finished difference Result 418 states and 467 transitions. [2018-06-22 10:54:49,627 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:54:49,627 INFO ]: Start accepts. Automaton has 12 states. Word has length 133 [2018-06-22 10:54:49,628 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:49,630 INFO ]: With dead ends: 418 [2018-06-22 10:54:49,630 INFO ]: Without dead ends: 418 [2018-06-22 10:54:49,630 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:54:49,631 INFO ]: Start minimizeSevpa. Operand 418 states. [2018-06-22 10:54:49,659 INFO ]: Finished minimizeSevpa. Reduced states from 418 to 390. [2018-06-22 10:54:49,659 INFO ]: Start removeUnreachable. Operand 390 states. [2018-06-22 10:54:49,663 INFO ]: Finished removeUnreachable. Reduced from 390 states to 390 states and 438 transitions. [2018-06-22 10:54:49,663 INFO ]: Start accepts. Automaton has 390 states and 438 transitions. Word has length 133 [2018-06-22 10:54:49,663 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:49,663 INFO ]: Abstraction has 390 states and 438 transitions. [2018-06-22 10:54:49,664 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:54:49,664 INFO ]: Start isEmpty. Operand 390 states and 438 transitions. [2018-06-22 10:54:49,666 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:54:49,666 INFO ]: Found error trace [2018-06-22 10:54:49,666 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:49,667 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:49,667 INFO ]: Analyzing trace with hash -164287746, now seen corresponding path program 1 times [2018-06-22 10:54:49,667 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:49,667 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:49,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:49,667 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:49,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:49,703 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:50,039 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:54:50,039 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:54:50,039 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:54:50,039 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:54:50,040 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:54:50,040 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:54:50,040 INFO ]: Start difference. First operand 390 states and 438 transitions. Second operand 12 states. [2018-06-22 10:54:50,447 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:50,447 INFO ]: Finished difference Result 416 states and 470 transitions. [2018-06-22 10:54:50,447 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:54:50,447 INFO ]: Start accepts. Automaton has 12 states. Word has length 133 [2018-06-22 10:54:50,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:50,451 INFO ]: With dead ends: 416 [2018-06-22 10:54:50,451 INFO ]: Without dead ends: 416 [2018-06-22 10:54:50,451 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:54:50,452 INFO ]: Start minimizeSevpa. Operand 416 states. [2018-06-22 10:54:50,468 INFO ]: Finished minimizeSevpa. Reduced states from 416 to 406. [2018-06-22 10:54:50,468 INFO ]: Start removeUnreachable. Operand 406 states. [2018-06-22 10:54:50,471 INFO ]: Finished removeUnreachable. Reduced from 406 states to 406 states and 459 transitions. [2018-06-22 10:54:50,471 INFO ]: Start accepts. Automaton has 406 states and 459 transitions. Word has length 133 [2018-06-22 10:54:50,471 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:50,472 INFO ]: Abstraction has 406 states and 459 transitions. [2018-06-22 10:54:50,472 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:54:50,472 INFO ]: Start isEmpty. Operand 406 states and 459 transitions. [2018-06-22 10:54:50,475 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:54:50,476 INFO ]: Found error trace [2018-06-22 10:54:50,476 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:50,476 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:50,476 INFO ]: Analyzing trace with hash -2000279871, now seen corresponding path program 1 times [2018-06-22 10:54:50,476 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:50,476 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:50,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:50,477 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:50,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:50,513 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:51,689 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:54:51,689 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:54:51,689 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:54:51,689 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:54:51,690 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:54:51,690 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:54:51,690 INFO ]: Start difference. First operand 406 states and 459 transitions. Second operand 12 states. [2018-06-22 10:54:51,955 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:51,955 INFO ]: Finished difference Result 463 states and 534 transitions. [2018-06-22 10:54:51,956 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:54:51,956 INFO ]: Start accepts. Automaton has 12 states. Word has length 133 [2018-06-22 10:54:51,957 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:51,961 INFO ]: With dead ends: 463 [2018-06-22 10:54:51,961 INFO ]: Without dead ends: 450 [2018-06-22 10:54:51,961 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:54:51,962 INFO ]: Start minimizeSevpa. Operand 450 states. [2018-06-22 10:54:51,981 INFO ]: Finished minimizeSevpa. Reduced states from 450 to 428. [2018-06-22 10:54:51,981 INFO ]: Start removeUnreachable. Operand 428 states. [2018-06-22 10:54:51,984 INFO ]: Finished removeUnreachable. Reduced from 428 states to 428 states and 487 transitions. [2018-06-22 10:54:51,984 INFO ]: Start accepts. Automaton has 428 states and 487 transitions. Word has length 133 [2018-06-22 10:54:51,984 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:51,984 INFO ]: Abstraction has 428 states and 487 transitions. [2018-06-22 10:54:51,984 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:54:51,984 INFO ]: Start isEmpty. Operand 428 states and 487 transitions. [2018-06-22 10:54:51,986 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:54:51,986 INFO ]: Found error trace [2018-06-22 10:54:51,987 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:51,987 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:51,987 INFO ]: Analyzing trace with hash 70719556, now seen corresponding path program 1 times [2018-06-22 10:54:51,987 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:51,987 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:51,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:51,988 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:51,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:52,013 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:52,238 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:54:52,238 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:54:52,239 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:54:52,239 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:54:52,239 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:54:52,239 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:54:52,239 INFO ]: Start difference. First operand 428 states and 487 transitions. Second operand 12 states. [2018-06-22 10:54:53,510 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:53,510 INFO ]: Finished difference Result 460 states and 523 transitions. [2018-06-22 10:54:53,511 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:54:53,511 INFO ]: Start accepts. Automaton has 12 states. Word has length 133 [2018-06-22 10:54:53,512 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:53,514 INFO ]: With dead ends: 460 [2018-06-22 10:54:53,514 INFO ]: Without dead ends: 445 [2018-06-22 10:54:53,515 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:54:53,515 INFO ]: Start minimizeSevpa. Operand 445 states. [2018-06-22 10:54:53,533 INFO ]: Finished minimizeSevpa. Reduced states from 445 to 433. [2018-06-22 10:54:53,533 INFO ]: Start removeUnreachable. Operand 433 states. [2018-06-22 10:54:53,536 INFO ]: Finished removeUnreachable. Reduced from 433 states to 433 states and 492 transitions. [2018-06-22 10:54:53,536 INFO ]: Start accepts. Automaton has 433 states and 492 transitions. Word has length 133 [2018-06-22 10:54:53,536 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:53,536 INFO ]: Abstraction has 433 states and 492 transitions. [2018-06-22 10:54:53,536 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:54:53,536 INFO ]: Start isEmpty. Operand 433 states and 492 transitions. [2018-06-22 10:54:53,541 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 10:54:53,541 INFO ]: Found error trace [2018-06-22 10:54:53,541 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:54:53,541 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:53,541 INFO ]: Analyzing trace with hash -1119342437, now seen corresponding path program 1 times [2018-06-22 10:54:53,541 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:53,541 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:53,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:53,542 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:53,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:53,567 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:53,836 WARN ]: Spent 108.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-06-22 10:54:54,409 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:54:54,409 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:54:54,409 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 10:54:54,410 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:54:54,410 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:54:54,410 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:54:54,410 INFO ]: Start difference. First operand 433 states and 492 transitions. Second operand 12 states. [2018-06-22 10:54:54,706 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:54,706 INFO ]: Finished difference Result 467 states and 532 transitions. [2018-06-22 10:54:54,706 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:54:54,706 INFO ]: Start accepts. Automaton has 12 states. Word has length 133 [2018-06-22 10:54:54,707 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:54,708 INFO ]: With dead ends: 467 [2018-06-22 10:54:54,708 INFO ]: Without dead ends: 277 [2018-06-22 10:54:54,709 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:54:54,709 INFO ]: Start minimizeSevpa. Operand 277 states. [2018-06-22 10:54:54,717 INFO ]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-06-22 10:54:54,717 INFO ]: Start removeUnreachable. Operand 277 states. [2018-06-22 10:54:54,718 INFO ]: Finished removeUnreachable. Reduced from 277 states to 277 states and 299 transitions. [2018-06-22 10:54:54,718 INFO ]: Start accepts. Automaton has 277 states and 299 transitions. Word has length 133 [2018-06-22 10:54:54,718 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:54,718 INFO ]: Abstraction has 277 states and 299 transitions. [2018-06-22 10:54:54,718 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:54:54,718 INFO ]: Start isEmpty. Operand 277 states and 299 transitions. [2018-06-22 10:54:54,721 INFO ]: Finished isEmpty. Found accepting run of length 202 [2018-06-22 10:54:54,721 INFO ]: Found error trace [2018-06-22 10:54:54,721 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:54,721 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:54,721 INFO ]: Analyzing trace with hash -808921353, now seen corresponding path program 1 times [2018-06-22 10:54:54,721 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:54,721 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:54,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:54,722 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:54,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:54,783 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:55,308 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:54:55,308 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:54:55,308 INFO ]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2018-06-22 10:54:55,308 INFO ]: Interpolant automaton has 29 states [2018-06-22 10:54:55,308 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 10:54:55,308 INFO ]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-22 10:54:55,308 INFO ]: Start difference. First operand 277 states and 299 transitions. Second operand 29 states. [2018-06-22 10:54:56,296 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:56,296 INFO ]: Finished difference Result 393 states and 458 transitions. [2018-06-22 10:54:56,366 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 10:54:56,366 INFO ]: Start accepts. Automaton has 29 states. Word has length 201 [2018-06-22 10:54:56,366 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:56,369 INFO ]: With dead ends: 393 [2018-06-22 10:54:56,369 INFO ]: Without dead ends: 393 [2018-06-22 10:54:56,369 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-22 10:54:56,370 INFO ]: Start minimizeSevpa. Operand 393 states. [2018-06-22 10:54:56,384 INFO ]: Finished minimizeSevpa. Reduced states from 393 to 391. [2018-06-22 10:54:56,384 INFO ]: Start removeUnreachable. Operand 391 states. [2018-06-22 10:54:56,386 INFO ]: Finished removeUnreachable. Reduced from 391 states to 391 states and 455 transitions. [2018-06-22 10:54:56,386 INFO ]: Start accepts. Automaton has 391 states and 455 transitions. Word has length 201 [2018-06-22 10:54:56,388 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:56,388 INFO ]: Abstraction has 391 states and 455 transitions. [2018-06-22 10:54:56,388 INFO ]: Interpolant automaton has 29 states. [2018-06-22 10:54:56,388 INFO ]: Start isEmpty. Operand 391 states and 455 transitions. [2018-06-22 10:54:56,394 INFO ]: Finished isEmpty. Found accepting run of length 202 [2018-06-22 10:54:56,394 INFO ]: Found error trace [2018-06-22 10:54:56,394 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:56,395 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:56,395 INFO ]: Analyzing trace with hash 1836359663, now seen corresponding path program 1 times [2018-06-22 10:54:56,395 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:56,395 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:56,395 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:56,395 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:56,395 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:56,450 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:57,580 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:54:57,580 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:54:57,580 INFO ]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2018-06-22 10:54:57,581 INFO ]: Interpolant automaton has 29 states [2018-06-22 10:54:57,581 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 10:54:57,581 INFO ]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-22 10:54:57,581 INFO ]: Start difference. First operand 391 states and 455 transitions. Second operand 29 states. [2018-06-22 10:54:58,952 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:54:58,952 INFO ]: Finished difference Result 549 states and 680 transitions. [2018-06-22 10:54:58,952 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 10:54:58,952 INFO ]: Start accepts. Automaton has 29 states. Word has length 201 [2018-06-22 10:54:58,953 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:54:58,957 INFO ]: With dead ends: 549 [2018-06-22 10:54:58,957 INFO ]: Without dead ends: 540 [2018-06-22 10:54:58,957 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-22 10:54:58,958 INFO ]: Start minimizeSevpa. Operand 540 states. [2018-06-22 10:54:58,987 INFO ]: Finished minimizeSevpa. Reduced states from 540 to 522. [2018-06-22 10:54:58,987 INFO ]: Start removeUnreachable. Operand 522 states. [2018-06-22 10:54:58,992 INFO ]: Finished removeUnreachable. Reduced from 522 states to 522 states and 635 transitions. [2018-06-22 10:54:58,992 INFO ]: Start accepts. Automaton has 522 states and 635 transitions. Word has length 201 [2018-06-22 10:54:58,992 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:54:58,992 INFO ]: Abstraction has 522 states and 635 transitions. [2018-06-22 10:54:58,992 INFO ]: Interpolant automaton has 29 states. [2018-06-22 10:54:58,992 INFO ]: Start isEmpty. Operand 522 states and 635 transitions. [2018-06-22 10:54:58,996 INFO ]: Finished isEmpty. Found accepting run of length 202 [2018-06-22 10:54:58,996 INFO ]: Found error trace [2018-06-22 10:54:58,996 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:58,996 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:54:58,997 INFO ]: Analyzing trace with hash 1395904946, now seen corresponding path program 1 times [2018-06-22 10:54:58,997 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:54:58,997 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:54:58,998 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:58,998 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:54:58,998 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:54:59,059 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:54:59,635 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:54:59,635 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:54:59,635 INFO ]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2018-06-22 10:54:59,635 INFO ]: Interpolant automaton has 29 states [2018-06-22 10:54:59,635 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 10:54:59,636 INFO ]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-22 10:54:59,636 INFO ]: Start difference. First operand 522 states and 635 transitions. Second operand 29 states. [2018-06-22 10:55:00,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:00,521 INFO ]: Finished difference Result 715 states and 814 transitions. [2018-06-22 10:55:00,526 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 10:55:00,526 INFO ]: Start accepts. Automaton has 29 states. Word has length 201 [2018-06-22 10:55:00,527 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:00,531 INFO ]: With dead ends: 715 [2018-06-22 10:55:00,531 INFO ]: Without dead ends: 699 [2018-06-22 10:55:00,531 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-22 10:55:00,532 INFO ]: Start minimizeSevpa. Operand 699 states. [2018-06-22 10:55:00,556 INFO ]: Finished minimizeSevpa. Reduced states from 699 to 599. [2018-06-22 10:55:00,556 INFO ]: Start removeUnreachable. Operand 599 states. [2018-06-22 10:55:00,559 INFO ]: Finished removeUnreachable. Reduced from 599 states to 599 states and 696 transitions. [2018-06-22 10:55:00,559 INFO ]: Start accepts. Automaton has 599 states and 696 transitions. Word has length 201 [2018-06-22 10:55:00,559 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:00,559 INFO ]: Abstraction has 599 states and 696 transitions. [2018-06-22 10:55:00,559 INFO ]: Interpolant automaton has 29 states. [2018-06-22 10:55:00,559 INFO ]: Start isEmpty. Operand 599 states and 696 transitions. [2018-06-22 10:55:00,563 INFO ]: Finished isEmpty. Found accepting run of length 202 [2018-06-22 10:55:00,563 INFO ]: Found error trace [2018-06-22 10:55:00,563 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:00,563 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:00,564 INFO ]: Analyzing trace with hash -368466636, now seen corresponding path program 1 times [2018-06-22 10:55:00,564 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:00,564 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:00,564 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:00,564 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:00,564 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:00,615 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:01,243 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:55:01,243 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:55:01,243 INFO ]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2018-06-22 10:55:01,243 INFO ]: Interpolant automaton has 29 states [2018-06-22 10:55:01,243 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 10:55:01,243 INFO ]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-22 10:55:01,243 INFO ]: Start difference. First operand 599 states and 696 transitions. Second operand 29 states. [2018-06-22 10:55:02,116 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:02,116 INFO ]: Finished difference Result 758 states and 865 transitions. [2018-06-22 10:55:02,116 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 10:55:02,116 INFO ]: Start accepts. Automaton has 29 states. Word has length 201 [2018-06-22 10:55:02,117 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:02,119 INFO ]: With dead ends: 758 [2018-06-22 10:55:02,119 INFO ]: Without dead ends: 742 [2018-06-22 10:55:02,120 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-22 10:55:02,120 INFO ]: Start minimizeSevpa. Operand 742 states. [2018-06-22 10:55:02,150 INFO ]: Finished minimizeSevpa. Reduced states from 742 to 676. [2018-06-22 10:55:02,150 INFO ]: Start removeUnreachable. Operand 676 states. [2018-06-22 10:55:02,153 INFO ]: Finished removeUnreachable. Reduced from 676 states to 676 states and 780 transitions. [2018-06-22 10:55:02,153 INFO ]: Start accepts. Automaton has 676 states and 780 transitions. Word has length 201 [2018-06-22 10:55:02,153 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:02,154 INFO ]: Abstraction has 676 states and 780 transitions. [2018-06-22 10:55:02,154 INFO ]: Interpolant automaton has 29 states. [2018-06-22 10:55:02,154 INFO ]: Start isEmpty. Operand 676 states and 780 transitions. [2018-06-22 10:55:02,158 INFO ]: Finished isEmpty. Found accepting run of length 206 [2018-06-22 10:55:02,158 INFO ]: Found error trace [2018-06-22 10:55:02,158 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:02,158 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:02,158 INFO ]: Analyzing trace with hash -1191968560, now seen corresponding path program 1 times [2018-06-22 10:55:02,158 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:02,158 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:02,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:02,159 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:02,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:02,211 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:02,783 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:55:02,783 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:55:02,783 INFO ]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2018-06-22 10:55:02,784 INFO ]: Interpolant automaton has 30 states [2018-06-22 10:55:02,784 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 10:55:02,784 INFO ]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-22 10:55:02,784 INFO ]: Start difference. First operand 676 states and 780 transitions. Second operand 30 states. [2018-06-22 10:55:03,998 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:03,998 INFO ]: Finished difference Result 797 states and 919 transitions. [2018-06-22 10:55:03,998 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 10:55:03,998 INFO ]: Start accepts. Automaton has 30 states. Word has length 205 [2018-06-22 10:55:03,999 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:04,002 INFO ]: With dead ends: 797 [2018-06-22 10:55:04,002 INFO ]: Without dead ends: 781 [2018-06-22 10:55:04,003 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-22 10:55:04,004 INFO ]: Start minimizeSevpa. Operand 781 states. [2018-06-22 10:55:04,030 INFO ]: Finished minimizeSevpa. Reduced states from 781 to 725. [2018-06-22 10:55:04,030 INFO ]: Start removeUnreachable. Operand 725 states. [2018-06-22 10:55:04,033 INFO ]: Finished removeUnreachable. Reduced from 725 states to 725 states and 845 transitions. [2018-06-22 10:55:04,033 INFO ]: Start accepts. Automaton has 725 states and 845 transitions. Word has length 205 [2018-06-22 10:55:04,034 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:04,034 INFO ]: Abstraction has 725 states and 845 transitions. [2018-06-22 10:55:04,034 INFO ]: Interpolant automaton has 30 states. [2018-06-22 10:55:04,034 INFO ]: Start isEmpty. Operand 725 states and 845 transitions. [2018-06-22 10:55:04,038 INFO ]: Finished isEmpty. Found accepting run of length 206 [2018-06-22 10:55:04,038 INFO ]: Found error trace [2018-06-22 10:55:04,038 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:04,038 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:04,038 INFO ]: Analyzing trace with hash 1178219469, now seen corresponding path program 1 times [2018-06-22 10:55:04,038 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:04,038 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:04,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:04,039 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:04,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:04,092 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:04,598 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:55:04,598 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:55:04,598 INFO ]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2018-06-22 10:55:04,598 INFO ]: Interpolant automaton has 30 states [2018-06-22 10:55:04,598 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 10:55:04,598 INFO ]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-22 10:55:04,598 INFO ]: Start difference. First operand 725 states and 845 transitions. Second operand 30 states. [2018-06-22 10:55:05,628 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:05,628 INFO ]: Finished difference Result 864 states and 1002 transitions. [2018-06-22 10:55:05,631 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 10:55:05,631 INFO ]: Start accepts. Automaton has 30 states. Word has length 205 [2018-06-22 10:55:05,632 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:05,636 INFO ]: With dead ends: 864 [2018-06-22 10:55:05,636 INFO ]: Without dead ends: 848 [2018-06-22 10:55:05,636 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-22 10:55:05,637 INFO ]: Start minimizeSevpa. Operand 848 states. [2018-06-22 10:55:05,667 INFO ]: Finished minimizeSevpa. Reduced states from 848 to 806. [2018-06-22 10:55:05,668 INFO ]: Start removeUnreachable. Operand 806 states. [2018-06-22 10:55:05,671 INFO ]: Finished removeUnreachable. Reduced from 806 states to 806 states and 942 transitions. [2018-06-22 10:55:05,671 INFO ]: Start accepts. Automaton has 806 states and 942 transitions. Word has length 205 [2018-06-22 10:55:05,671 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:05,671 INFO ]: Abstraction has 806 states and 942 transitions. [2018-06-22 10:55:05,671 INFO ]: Interpolant automaton has 30 states. [2018-06-22 10:55:05,671 INFO ]: Start isEmpty. Operand 806 states and 942 transitions. [2018-06-22 10:55:05,675 INFO ]: Finished isEmpty. Found accepting run of length 218 [2018-06-22 10:55:05,675 INFO ]: Found error trace [2018-06-22 10:55:05,676 INFO ]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:05,676 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:05,676 INFO ]: Analyzing trace with hash -1423722596, now seen corresponding path program 1 times [2018-06-22 10:55:05,676 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:05,676 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:05,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:05,677 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:05,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:05,729 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:07,667 INFO ]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:55:07,667 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:55:07,667 INFO ]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2018-06-22 10:55:07,668 INFO ]: Interpolant automaton has 31 states [2018-06-22 10:55:07,668 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 10:55:07,668 INFO ]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-22 10:55:07,668 INFO ]: Start difference. First operand 806 states and 942 transitions. Second operand 31 states. [2018-06-22 10:55:08,799 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:08,799 INFO ]: Finished difference Result 993 states and 1152 transitions. [2018-06-22 10:55:08,799 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 10:55:08,799 INFO ]: Start accepts. Automaton has 31 states. Word has length 217 [2018-06-22 10:55:08,800 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:08,804 INFO ]: With dead ends: 993 [2018-06-22 10:55:08,804 INFO ]: Without dead ends: 977 [2018-06-22 10:55:08,805 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-22 10:55:08,805 INFO ]: Start minimizeSevpa. Operand 977 states. [2018-06-22 10:55:08,840 INFO ]: Finished minimizeSevpa. Reduced states from 977 to 867. [2018-06-22 10:55:08,840 INFO ]: Start removeUnreachable. Operand 867 states. [2018-06-22 10:55:08,845 INFO ]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1023 transitions. [2018-06-22 10:55:08,845 INFO ]: Start accepts. Automaton has 867 states and 1023 transitions. Word has length 217 [2018-06-22 10:55:08,845 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:08,845 INFO ]: Abstraction has 867 states and 1023 transitions. [2018-06-22 10:55:08,845 INFO ]: Interpolant automaton has 31 states. [2018-06-22 10:55:08,845 INFO ]: Start isEmpty. Operand 867 states and 1023 transitions. [2018-06-22 10:55:08,850 INFO ]: Finished isEmpty. Found accepting run of length 218 [2018-06-22 10:55:08,850 INFO ]: Found error trace [2018-06-22 10:55:08,851 INFO ]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:08,851 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:08,851 INFO ]: Analyzing trace with hash 1799517791, now seen corresponding path program 1 times [2018-06-22 10:55:08,851 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:08,851 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:08,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:08,852 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:08,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:08,896 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:09,607 INFO ]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:55:09,607 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:55:09,607 INFO ]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2018-06-22 10:55:09,607 INFO ]: Interpolant automaton has 31 states [2018-06-22 10:55:09,607 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 10:55:09,608 INFO ]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-22 10:55:09,608 INFO ]: Start difference. First operand 867 states and 1023 transitions. Second operand 31 states. [2018-06-22 10:55:10,624 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:10,625 INFO ]: Finished difference Result 1042 states and 1218 transitions. [2018-06-22 10:55:10,625 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 10:55:10,625 INFO ]: Start accepts. Automaton has 31 states. Word has length 217 [2018-06-22 10:55:10,625 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:10,630 INFO ]: With dead ends: 1042 [2018-06-22 10:55:10,630 INFO ]: Without dead ends: 1026 [2018-06-22 10:55:10,630 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-22 10:55:10,631 INFO ]: Start minimizeSevpa. Operand 1026 states. [2018-06-22 10:55:10,662 INFO ]: Finished minimizeSevpa. Reduced states from 1026 to 904. [2018-06-22 10:55:10,662 INFO ]: Start removeUnreachable. Operand 904 states. [2018-06-22 10:55:10,666 INFO ]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1075 transitions. [2018-06-22 10:55:10,666 INFO ]: Start accepts. Automaton has 904 states and 1075 transitions. Word has length 217 [2018-06-22 10:55:10,666 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:10,666 INFO ]: Abstraction has 904 states and 1075 transitions. [2018-06-22 10:55:10,666 INFO ]: Interpolant automaton has 31 states. [2018-06-22 10:55:10,666 INFO ]: Start isEmpty. Operand 904 states and 1075 transitions. [2018-06-22 10:55:10,670 INFO ]: Finished isEmpty. Found accepting run of length 218 [2018-06-22 10:55:10,670 INFO ]: Found error trace [2018-06-22 10:55:10,671 INFO ]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:10,671 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:10,671 INFO ]: Analyzing trace with hash -1305068262, now seen corresponding path program 1 times [2018-06-22 10:55:10,671 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:10,671 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:10,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:10,672 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:10,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:10,712 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:11,169 INFO ]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:55:11,170 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:55:11,170 INFO ]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2018-06-22 10:55:11,170 INFO ]: Interpolant automaton has 31 states [2018-06-22 10:55:11,170 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 10:55:11,170 INFO ]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-22 10:55:11,170 INFO ]: Start difference. First operand 904 states and 1075 transitions. Second operand 31 states. [2018-06-22 10:55:12,499 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:12,499 INFO ]: Finished difference Result 1071 states and 1255 transitions. [2018-06-22 10:55:12,533 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 10:55:12,533 INFO ]: Start accepts. Automaton has 31 states. Word has length 217 [2018-06-22 10:55:12,534 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:12,536 INFO ]: With dead ends: 1071 [2018-06-22 10:55:12,536 INFO ]: Without dead ends: 1055 [2018-06-22 10:55:12,537 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-22 10:55:12,537 INFO ]: Start minimizeSevpa. Operand 1055 states. [2018-06-22 10:55:12,570 INFO ]: Finished minimizeSevpa. Reduced states from 1055 to 961. [2018-06-22 10:55:12,570 INFO ]: Start removeUnreachable. Operand 961 states. [2018-06-22 10:55:12,574 INFO ]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1142 transitions. [2018-06-22 10:55:12,574 INFO ]: Start accepts. Automaton has 961 states and 1142 transitions. Word has length 217 [2018-06-22 10:55:12,574 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:12,574 INFO ]: Abstraction has 961 states and 1142 transitions. [2018-06-22 10:55:12,574 INFO ]: Interpolant automaton has 31 states. [2018-06-22 10:55:12,574 INFO ]: Start isEmpty. Operand 961 states and 1142 transitions. [2018-06-22 10:55:12,579 INFO ]: Finished isEmpty. Found accepting run of length 218 [2018-06-22 10:55:12,579 INFO ]: Found error trace [2018-06-22 10:55:12,579 INFO ]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:12,579 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:12,579 INFO ]: Analyzing trace with hash -233341353, now seen corresponding path program 1 times [2018-06-22 10:55:12,579 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:12,579 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:12,580 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:12,580 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:12,580 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:12,620 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:13,194 INFO ]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:55:13,194 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:55:13,194 INFO ]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2018-06-22 10:55:13,194 INFO ]: Interpolant automaton has 31 states [2018-06-22 10:55:13,194 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 10:55:13,195 INFO ]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-22 10:55:13,195 INFO ]: Start difference. First operand 961 states and 1142 transitions. Second operand 31 states. [2018-06-22 10:55:14,561 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:14,561 INFO ]: Finished difference Result 1108 states and 1304 transitions. [2018-06-22 10:55:14,565 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 10:55:14,565 INFO ]: Start accepts. Automaton has 31 states. Word has length 217 [2018-06-22 10:55:14,566 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:14,570 INFO ]: With dead ends: 1108 [2018-06-22 10:55:14,570 INFO ]: Without dead ends: 1092 [2018-06-22 10:55:14,570 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-22 10:55:14,571 INFO ]: Start minimizeSevpa. Operand 1092 states. [2018-06-22 10:55:14,604 INFO ]: Finished minimizeSevpa. Reduced states from 1092 to 994. [2018-06-22 10:55:14,604 INFO ]: Start removeUnreachable. Operand 994 states. [2018-06-22 10:55:14,607 INFO ]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1185 transitions. [2018-06-22 10:55:14,607 INFO ]: Start accepts. Automaton has 994 states and 1185 transitions. Word has length 217 [2018-06-22 10:55:14,608 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:14,608 INFO ]: Abstraction has 994 states and 1185 transitions. [2018-06-22 10:55:14,608 INFO ]: Interpolant automaton has 31 states. [2018-06-22 10:55:14,608 INFO ]: Start isEmpty. Operand 994 states and 1185 transitions. [2018-06-22 10:55:14,612 INFO ]: Finished isEmpty. Found accepting run of length 222 [2018-06-22 10:55:14,612 INFO ]: Found error trace [2018-06-22 10:55:14,612 INFO ]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:14,612 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:14,612 INFO ]: Analyzing trace with hash 861380661, now seen corresponding path program 1 times [2018-06-22 10:55:14,612 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:14,612 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:14,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:14,614 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:14,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:14,653 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:15,424 INFO ]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:55:15,424 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:55:15,425 INFO ]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2018-06-22 10:55:15,425 INFO ]: Interpolant automaton has 32 states [2018-06-22 10:55:15,425 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 10:55:15,425 INFO ]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-22 10:55:15,425 INFO ]: Start difference. First operand 994 states and 1185 transitions. Second operand 32 states. [2018-06-22 10:55:16,562 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:16,562 INFO ]: Finished difference Result 1129 states and 1337 transitions. [2018-06-22 10:55:16,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 10:55:16,568 INFO ]: Start accepts. Automaton has 32 states. Word has length 221 [2018-06-22 10:55:16,569 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:16,573 INFO ]: With dead ends: 1129 [2018-06-22 10:55:16,573 INFO ]: Without dead ends: 1113 [2018-06-22 10:55:16,574 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-22 10:55:16,574 INFO ]: Start minimizeSevpa. Operand 1113 states. [2018-06-22 10:55:16,612 INFO ]: Finished minimizeSevpa. Reduced states from 1113 to 1055. [2018-06-22 10:55:16,612 INFO ]: Start removeUnreachable. Operand 1055 states. [2018-06-22 10:55:16,616 INFO ]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1260 transitions. [2018-06-22 10:55:16,617 INFO ]: Start accepts. Automaton has 1055 states and 1260 transitions. Word has length 221 [2018-06-22 10:55:16,617 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:16,617 INFO ]: Abstraction has 1055 states and 1260 transitions. [2018-06-22 10:55:16,617 INFO ]: Interpolant automaton has 32 states. [2018-06-22 10:55:16,617 INFO ]: Start isEmpty. Operand 1055 states and 1260 transitions. [2018-06-22 10:55:16,622 INFO ]: Finished isEmpty. Found accepting run of length 222 [2018-06-22 10:55:16,622 INFO ]: Found error trace [2018-06-22 10:55:16,622 INFO ]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:16,623 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:16,623 INFO ]: Analyzing trace with hash 1723972152, now seen corresponding path program 1 times [2018-06-22 10:55:16,623 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:16,623 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:16,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:16,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:16,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:16,663 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:17,220 INFO ]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:55:17,220 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:55:17,220 INFO ]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2018-06-22 10:55:17,220 INFO ]: Interpolant automaton has 32 states [2018-06-22 10:55:17,220 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 10:55:17,221 INFO ]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-22 10:55:17,221 INFO ]: Start difference. First operand 1055 states and 1260 transitions. Second operand 32 states. [2018-06-22 10:55:18,385 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:18,385 INFO ]: Finished difference Result 1172 states and 1392 transitions. [2018-06-22 10:55:18,390 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 10:55:18,390 INFO ]: Start accepts. Automaton has 32 states. Word has length 221 [2018-06-22 10:55:18,390 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:18,396 INFO ]: With dead ends: 1172 [2018-06-22 10:55:18,396 INFO ]: Without dead ends: 1156 [2018-06-22 10:55:18,397 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-22 10:55:18,398 INFO ]: Start minimizeSevpa. Operand 1156 states. [2018-06-22 10:55:18,431 INFO ]: Finished minimizeSevpa. Reduced states from 1156 to 1084. [2018-06-22 10:55:18,431 INFO ]: Start removeUnreachable. Operand 1084 states. [2018-06-22 10:55:18,439 INFO ]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1299 transitions. [2018-06-22 10:55:18,439 INFO ]: Start accepts. Automaton has 1084 states and 1299 transitions. Word has length 221 [2018-06-22 10:55:18,439 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:18,439 INFO ]: Abstraction has 1084 states and 1299 transitions. [2018-06-22 10:55:18,439 INFO ]: Interpolant automaton has 32 states. [2018-06-22 10:55:18,439 INFO ]: Start isEmpty. Operand 1084 states and 1299 transitions. [2018-06-22 10:55:18,448 INFO ]: Finished isEmpty. Found accepting run of length 234 [2018-06-22 10:55:18,448 INFO ]: Found error trace [2018-06-22 10:55:18,449 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:18,449 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:18,449 INFO ]: Analyzing trace with hash 99475280, now seen corresponding path program 1 times [2018-06-22 10:55:18,449 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:18,449 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:18,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:18,449 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:18,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:18,497 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:18,755 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:55:18,755 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:55:18,755 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 10:55:18,755 INFO ]: Interpolant automaton has 11 states [2018-06-22 10:55:18,755 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 10:55:18,755 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:55:18,756 INFO ]: Start difference. First operand 1084 states and 1299 transitions. Second operand 11 states. [2018-06-22 10:55:18,959 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:18,959 INFO ]: Finished difference Result 1141 states and 1372 transitions. [2018-06-22 10:55:18,960 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:55:18,960 INFO ]: Start accepts. Automaton has 11 states. Word has length 233 [2018-06-22 10:55:18,960 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:18,963 INFO ]: With dead ends: 1141 [2018-06-22 10:55:18,963 INFO ]: Without dead ends: 1125 [2018-06-22 10:55:18,964 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:55:18,964 INFO ]: Start minimizeSevpa. Operand 1125 states. [2018-06-22 10:55:18,995 INFO ]: Finished minimizeSevpa. Reduced states from 1125 to 1123. [2018-06-22 10:55:18,995 INFO ]: Start removeUnreachable. Operand 1123 states. [2018-06-22 10:55:18,998 INFO ]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1353 transitions. [2018-06-22 10:55:18,998 INFO ]: Start accepts. Automaton has 1123 states and 1353 transitions. Word has length 233 [2018-06-22 10:55:18,998 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:18,998 INFO ]: Abstraction has 1123 states and 1353 transitions. [2018-06-22 10:55:18,998 INFO ]: Interpolant automaton has 11 states. [2018-06-22 10:55:18,998 INFO ]: Start isEmpty. Operand 1123 states and 1353 transitions. [2018-06-22 10:55:19,004 INFO ]: Finished isEmpty. Found accepting run of length 234 [2018-06-22 10:55:19,004 INFO ]: Found error trace [2018-06-22 10:55:19,004 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:19,004 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:19,004 INFO ]: Analyzing trace with hash -1130554835, now seen corresponding path program 1 times [2018-06-22 10:55:19,004 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:19,004 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:19,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:19,005 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:19,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:19,048 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:19,226 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:55:19,226 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:55:19,226 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 10:55:19,226 INFO ]: Interpolant automaton has 11 states [2018-06-22 10:55:19,226 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 10:55:19,226 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:55:19,226 INFO ]: Start difference. First operand 1123 states and 1353 transitions. Second operand 11 states. [2018-06-22 10:55:19,389 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:19,389 INFO ]: Finished difference Result 1190 states and 1439 transitions. [2018-06-22 10:55:19,389 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:55:19,389 INFO ]: Start accepts. Automaton has 11 states. Word has length 233 [2018-06-22 10:55:19,389 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:19,392 INFO ]: With dead ends: 1190 [2018-06-22 10:55:19,392 INFO ]: Without dead ends: 1162 [2018-06-22 10:55:19,393 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:55:19,393 INFO ]: Start minimizeSevpa. Operand 1162 states. [2018-06-22 10:55:19,424 INFO ]: Finished minimizeSevpa. Reduced states from 1162 to 1144. [2018-06-22 10:55:19,424 INFO ]: Start removeUnreachable. Operand 1144 states. [2018-06-22 10:55:19,427 INFO ]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1378 transitions. [2018-06-22 10:55:19,427 INFO ]: Start accepts. Automaton has 1144 states and 1378 transitions. Word has length 233 [2018-06-22 10:55:19,427 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:19,427 INFO ]: Abstraction has 1144 states and 1378 transitions. [2018-06-22 10:55:19,427 INFO ]: Interpolant automaton has 11 states. [2018-06-22 10:55:19,427 INFO ]: Start isEmpty. Operand 1144 states and 1378 transitions. [2018-06-22 10:55:19,433 INFO ]: Finished isEmpty. Found accepting run of length 234 [2018-06-22 10:55:19,433 INFO ]: Found error trace [2018-06-22 10:55:19,433 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:19,433 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:19,433 INFO ]: Analyzing trace with hash 464832834, now seen corresponding path program 1 times [2018-06-22 10:55:19,434 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:19,434 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:19,434 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:19,434 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:19,434 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:19,471 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:19,625 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:55:19,625 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:55:19,625 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 10:55:19,625 INFO ]: Interpolant automaton has 11 states [2018-06-22 10:55:19,625 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 10:55:19,625 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:55:19,626 INFO ]: Start difference. First operand 1144 states and 1378 transitions. Second operand 11 states. [2018-06-22 10:55:19,776 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:19,776 INFO ]: Finished difference Result 1202 states and 1434 transitions. [2018-06-22 10:55:19,777 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:55:19,777 INFO ]: Start accepts. Automaton has 11 states. Word has length 233 [2018-06-22 10:55:19,777 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:19,780 INFO ]: With dead ends: 1202 [2018-06-22 10:55:19,780 INFO ]: Without dead ends: 1176 [2018-06-22 10:55:19,780 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:55:19,781 INFO ]: Start minimizeSevpa. Operand 1176 states. [2018-06-22 10:55:19,812 INFO ]: Finished minimizeSevpa. Reduced states from 1176 to 1144. [2018-06-22 10:55:19,812 INFO ]: Start removeUnreachable. Operand 1144 states. [2018-06-22 10:55:19,815 INFO ]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1375 transitions. [2018-06-22 10:55:19,815 INFO ]: Start accepts. Automaton has 1144 states and 1375 transitions. Word has length 233 [2018-06-22 10:55:19,815 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:19,816 INFO ]: Abstraction has 1144 states and 1375 transitions. [2018-06-22 10:55:19,816 INFO ]: Interpolant automaton has 11 states. [2018-06-22 10:55:19,816 INFO ]: Start isEmpty. Operand 1144 states and 1375 transitions. [2018-06-22 10:55:19,821 INFO ]: Finished isEmpty. Found accepting run of length 234 [2018-06-22 10:55:19,821 INFO ]: Found error trace [2018-06-22 10:55:19,821 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:19,821 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:19,821 INFO ]: Analyzing trace with hash -1554336403, now seen corresponding path program 1 times [2018-06-22 10:55:19,821 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:19,821 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:19,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:19,822 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:19,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:19,860 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:20,168 WARN ]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-22 10:55:20,709 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:55:20,709 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:55:20,709 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 10:55:20,709 INFO ]: Interpolant automaton has 11 states [2018-06-22 10:55:20,709 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 10:55:20,709 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:55:20,709 INFO ]: Start difference. First operand 1144 states and 1375 transitions. Second operand 11 states. [2018-06-22 10:55:20,848 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:20,848 INFO ]: Finished difference Result 1188 states and 1420 transitions. [2018-06-22 10:55:20,848 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:55:20,848 INFO ]: Start accepts. Automaton has 11 states. Word has length 233 [2018-06-22 10:55:20,848 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:20,851 INFO ]: With dead ends: 1188 [2018-06-22 10:55:20,851 INFO ]: Without dead ends: 1155 [2018-06-22 10:55:20,851 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:55:20,852 INFO ]: Start minimizeSevpa. Operand 1155 states. [2018-06-22 10:55:20,874 INFO ]: Finished minimizeSevpa. Reduced states from 1155 to 1143. [2018-06-22 10:55:20,874 INFO ]: Start removeUnreachable. Operand 1143 states. [2018-06-22 10:55:20,876 INFO ]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1369 transitions. [2018-06-22 10:55:20,877 INFO ]: Start accepts. Automaton has 1143 states and 1369 transitions. Word has length 233 [2018-06-22 10:55:20,877 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:20,877 INFO ]: Abstraction has 1143 states and 1369 transitions. [2018-06-22 10:55:20,877 INFO ]: Interpolant automaton has 11 states. [2018-06-22 10:55:20,877 INFO ]: Start isEmpty. Operand 1143 states and 1369 transitions. [2018-06-22 10:55:20,881 INFO ]: Finished isEmpty. Found accepting run of length 234 [2018-06-22 10:55:20,881 INFO ]: Found error trace [2018-06-22 10:55:20,881 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:20,881 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:20,881 INFO ]: Analyzing trace with hash 2056670055, now seen corresponding path program 1 times [2018-06-22 10:55:20,881 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:20,882 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:20,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:20,882 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:20,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:20,924 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:21,269 WARN ]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-22 10:55:21,342 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:55:21,342 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:55:21,342 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 10:55:21,343 INFO ]: Interpolant automaton has 11 states [2018-06-22 10:55:21,343 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 10:55:21,343 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:55:21,343 INFO ]: Start difference. First operand 1143 states and 1369 transitions. Second operand 11 states. [2018-06-22 10:55:21,516 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:21,516 INFO ]: Finished difference Result 1189 states and 1420 transitions. [2018-06-22 10:55:21,516 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:55:21,516 INFO ]: Start accepts. Automaton has 11 states. Word has length 233 [2018-06-22 10:55:21,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:21,519 INFO ]: With dead ends: 1189 [2018-06-22 10:55:21,519 INFO ]: Without dead ends: 1165 [2018-06-22 10:55:21,519 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:55:21,520 INFO ]: Start minimizeSevpa. Operand 1165 states. [2018-06-22 10:55:21,544 INFO ]: Finished minimizeSevpa. Reduced states from 1165 to 1155. [2018-06-22 10:55:21,544 INFO ]: Start removeUnreachable. Operand 1155 states. [2018-06-22 10:55:21,547 INFO ]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1385 transitions. [2018-06-22 10:55:21,547 INFO ]: Start accepts. Automaton has 1155 states and 1385 transitions. Word has length 233 [2018-06-22 10:55:21,547 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:21,547 INFO ]: Abstraction has 1155 states and 1385 transitions. [2018-06-22 10:55:21,547 INFO ]: Interpolant automaton has 11 states. [2018-06-22 10:55:21,547 INFO ]: Start isEmpty. Operand 1155 states and 1385 transitions. [2018-06-22 10:55:21,551 INFO ]: Finished isEmpty. Found accepting run of length 234 [2018-06-22 10:55:21,551 INFO ]: Found error trace [2018-06-22 10:55:21,551 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:21,552 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:55:21,552 INFO ]: Analyzing trace with hash 826639940, now seen corresponding path program 1 times [2018-06-22 10:55:21,552 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:55:21,552 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:55:21,552 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:21,552 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:55:21,552 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:55:21,589 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:55:21,733 INFO ]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:55:21,733 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:55:21,733 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 10:55:21,733 INFO ]: Interpolant automaton has 11 states [2018-06-22 10:55:21,734 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 10:55:21,734 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:55:21,734 INFO ]: Start difference. First operand 1155 states and 1385 transitions. Second operand 11 states. [2018-06-22 10:55:21,983 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:55:21,983 INFO ]: Finished difference Result 1135 states and 1367 transitions. [2018-06-22 10:55:21,984 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:55:21,984 INFO ]: Start accepts. Automaton has 11 states. Word has length 233 [2018-06-22 10:55:21,984 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:55:21,984 INFO ]: With dead ends: 1135 [2018-06-22 10:55:21,984 INFO ]: Without dead ends: 0 [2018-06-22 10:55:21,984 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:55:21,984 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 10:55:21,984 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 10:55:21,984 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 10:55:21,984 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 10:55:21,984 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 233 [2018-06-22 10:55:21,984 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:55:21,984 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 10:55:21,984 INFO ]: Interpolant automaton has 11 states. [2018-06-22 10:55:21,984 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 10:55:21,984 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 10:55:21,988 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:55:21 BoogieIcfgContainer [2018-06-22 10:55:21,988 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:55:21,989 INFO ]: Toolchain (without parser) took 42769.46 ms. Allocated memory was 321.4 MB in the beginning and 1.1 GB in the end (delta: 757.6 MB). Free memory was 253.3 MB in the beginning and 1.0 GB in the end (delta: -760.4 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:55:21,989 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:55:21,989 INFO ]: ChcToBoogie took 79.68 ms. Allocated memory is still 321.4 MB. Free memory was 253.3 MB in the beginning and 247.4 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 3.6 GB. [2018-06-22 10:55:21,990 INFO ]: Boogie Preprocessor took 111.14 ms. Allocated memory is still 321.4 MB. Free memory was 247.4 MB in the beginning and 244.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 3.6 GB. [2018-06-22 10:55:21,990 INFO ]: RCFGBuilder took 1290.63 ms. Allocated memory was 321.4 MB in the beginning and 362.3 MB in the end (delta: 40.9 MB). Free memory was 244.5 MB in the beginning and 282.1 MB in the end (delta: -37.6 MB). Peak memory consumption was 72.9 MB. Max. memory is 3.6 GB. [2018-06-22 10:55:21,990 INFO ]: TraceAbstraction took 41275.92 ms. Allocated memory was 362.3 MB in the beginning and 1.1 GB in the end (delta: 716.7 MB). Free memory was 282.1 MB in the beginning and 1.0 GB in the end (delta: -731.6 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:55:21,991 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 79.68 ms. Allocated memory is still 321.4 MB. Free memory was 253.3 MB in the beginning and 247.4 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 111.14 ms. Allocated memory is still 321.4 MB. Free memory was 247.4 MB in the beginning and 244.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1290.63 ms. Allocated memory was 321.4 MB in the beginning and 362.3 MB in the end (delta: 40.9 MB). Free memory was 244.5 MB in the beginning and 282.1 MB in the end (delta: -37.6 MB). Peak memory consumption was 72.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 41275.92 ms. Allocated memory was 362.3 MB in the beginning and 1.1 GB in the end (delta: 716.7 MB). Free memory was 282.1 MB in the beginning and 1.0 GB in the end (delta: -731.6 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 74 procedures, 311 locations, 1 error locations. SAFE Result, 41.2s OverallTime, 27 OverallIterations, 2 TraceHistogramMax, 21.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9276 SDtfs, 561 SDslu, 180519 SDs, 0 SdLazy, 26256 SolverSat, 436 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 524 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1155occurred in iteration=26, 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.8s AutomataMinimizationTime, 27 MinimizatonAttempts, 986 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 5027 NumberOfCodeBlocks, 5027 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 5000 ConstructedInterpolants, 0 QuantifiedInterpolants, 1632168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 492/492 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/36.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-55-21-999.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/36.c.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-55-21-999.csv Received shutdown request...