java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/dll_circular_traversal-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 10:38:34,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 10:38:34,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 10:38:34,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 10:38:34,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 10:38:34,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 10:38:34,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 10:38:34,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 10:38:34,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 10:38:34,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 10:38:34,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 10:38:34,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 10:38:34,178 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 10:38:34,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 10:38:34,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 10:38:34,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 10:38:34,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 10:38:34,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 10:38:34,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 10:38:34,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 10:38:34,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 10:38:34,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 10:38:34,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 10:38:34,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 10:38:34,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 10:38:34,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 10:38:34,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 10:38:34,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 10:38:34,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 10:38:34,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 10:38:34,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 10:38:34,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 10:38:34,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 10:38:34,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 10:38:34,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 10:38:34,200 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 10:38:34,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 10:38:34,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 10:38:34,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 10:38:34,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 10:38:34,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 10:38:34,204 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 10:38:34,231 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 10:38:34,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 10:38:34,232 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 10:38:34,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 10:38:34,233 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 10:38:34,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 10:38:34,234 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 10:38:34,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 10:38:34,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 10:38:34,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 10:38:34,235 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 10:38:34,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 10:38:34,235 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 10:38:34,235 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 10:38:34,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 10:38:34,236 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 10:38:34,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 10:38:34,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 10:38:34,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 10:38:34,238 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 10:38:34,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 10:38:34,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 10:38:34,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 10:38:34,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 10:38:34,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 10:38:34,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 10:38:34,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 10:38:34,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 10:38:34,240 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 10:38:34,288 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 10:38:34,300 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 10:38:34,307 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 10:38:34,308 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 10:38:34,309 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 10:38:34,310 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/dll_circular_traversal-2.i [2019-10-02 10:38:34,389 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9cb23b45/c754f7b243f04784833846017dde2e1f/FLAG53ca5bfd1 [2019-10-02 10:38:35,017 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 10:38:35,018 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_circular_traversal-2.i [2019-10-02 10:38:35,033 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9cb23b45/c754f7b243f04784833846017dde2e1f/FLAG53ca5bfd1 [2019-10-02 10:38:35,251 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9cb23b45/c754f7b243f04784833846017dde2e1f [2019-10-02 10:38:35,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 10:38:35,264 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 10:38:35,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 10:38:35,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 10:38:35,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 10:38:35,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:38:35" (1/1) ... [2019-10-02 10:38:35,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5d720d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:38:35, skipping insertion in model container [2019-10-02 10:38:35,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:38:35" (1/1) ... [2019-10-02 10:38:35,281 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 10:38:35,341 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 10:38:35,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:38:35,772 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 10:38:35,835 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:38:35,891 INFO L192 MainTranslator]: Completed translation [2019-10-02 10:38:35,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:38:35 WrapperNode [2019-10-02 10:38:35,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 10:38:35,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 10:38:35,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 10:38:35,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 10:38:35,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:38:35" (1/1) ... [2019-10-02 10:38:35,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:38:35" (1/1) ... [2019-10-02 10:38:35,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:38:35" (1/1) ... [2019-10-02 10:38:35,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:38:35" (1/1) ... [2019-10-02 10:38:35,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:38:35" (1/1) ... [2019-10-02 10:38:35,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:38:35" (1/1) ... [2019-10-02 10:38:35,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:38:35" (1/1) ... [2019-10-02 10:38:35,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 10:38:35,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 10:38:35,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 10:38:35,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 10:38:35,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:38:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 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 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 10:38:36,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 10:38:36,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 10:38:36,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-02 10:38:36,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-02 10:38:36,019 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-02 10:38:36,020 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-10-02 10:38:36,020 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 10:38:36,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 10:38:36,021 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-02 10:38:36,021 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-02 10:38:36,021 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-02 10:38:36,021 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-02 10:38:36,022 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-02 10:38:36,022 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-02 10:38:36,023 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-02 10:38:36,024 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-02 10:38:36,025 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-02 10:38:36,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-02 10:38:36,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-02 10:38:36,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-02 10:38:36,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-02 10:38:36,027 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-02 10:38:36,027 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-02 10:38:36,027 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-02 10:38:36,027 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-02 10:38:36,027 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-02 10:38:36,027 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-02 10:38:36,027 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-02 10:38:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-02 10:38:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-02 10:38:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-02 10:38:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-02 10:38:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-02 10:38:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-02 10:38:36,029 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-02 10:38:36,029 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-02 10:38:36,029 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-02 10:38:36,029 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-02 10:38:36,030 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-02 10:38:36,030 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-02 10:38:36,030 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-02 10:38:36,030 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-02 10:38:36,031 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-02 10:38:36,031 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-02 10:38:36,031 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-02 10:38:36,031 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-02 10:38:36,031 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-02 10:38:36,032 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-02 10:38:36,032 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-02 10:38:36,032 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-02 10:38:36,032 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-02 10:38:36,032 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-02 10:38:36,032 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-02 10:38:36,032 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-02 10:38:36,033 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-02 10:38:36,033 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-02 10:38:36,033 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-02 10:38:36,033 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-02 10:38:36,033 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-02 10:38:36,033 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-02 10:38:36,034 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 10:38:36,034 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 10:38:36,034 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-02 10:38:36,034 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 10:38:36,034 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-02 10:38:36,034 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-02 10:38:36,034 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-02 10:38:36,035 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-02 10:38:36,036 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-02 10:38:36,036 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-02 10:38:36,036 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-02 10:38:36,036 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-02 10:38:36,036 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-02 10:38:36,037 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 10:38:36,037 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-02 10:38:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-02 10:38:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-02 10:38:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-02 10:38:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-02 10:38:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-02 10:38:36,039 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-02 10:38:36,039 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-02 10:38:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-02 10:38:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-02 10:38:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-02 10:38:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-02 10:38:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-02 10:38:36,041 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-02 10:38:36,041 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-02 10:38:36,041 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-02 10:38:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-02 10:38:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-02 10:38:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-02 10:38:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-02 10:38:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-02 10:38:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-02 10:38:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-02 10:38:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-02 10:38:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-02 10:38:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-02 10:38:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-02 10:38:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-02 10:38:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-02 10:38:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-02 10:38:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-02 10:38:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-02 10:38:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-02 10:38:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-02 10:38:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-02 10:38:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-02 10:38:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-02 10:38:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-02 10:38:36,045 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-02 10:38:36,046 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-02 10:38:36,046 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-10-02 10:38:36,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 10:38:36,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 10:38:36,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 10:38:36,047 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 10:38:36,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 10:38:36,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 10:38:36,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 10:38:36,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 10:38:36,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 10:38:36,583 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-02 10:38:36,659 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 10:38:36,659 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-02 10:38:36,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:38:36 BoogieIcfgContainer [2019-10-02 10:38:36,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 10:38:36,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 10:38:36,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 10:38:36,665 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 10:38:36,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 10:38:35" (1/3) ... [2019-10-02 10:38:36,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f85a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:38:36, skipping insertion in model container [2019-10-02 10:38:36,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:38:35" (2/3) ... [2019-10-02 10:38:36,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f85a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:38:36, skipping insertion in model container [2019-10-02 10:38:36,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:38:36" (3/3) ... [2019-10-02 10:38:36,669 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2019-10-02 10:38:36,680 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 10:38:36,690 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 10:38:36,709 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 10:38:36,747 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 10:38:36,748 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 10:38:36,749 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 10:38:36,752 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 10:38:36,752 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 10:38:36,752 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 10:38:36,753 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 10:38:36,753 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 10:38:36,753 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 10:38:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-02 10:38:36,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 10:38:36,777 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:38:36,778 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:38:36,780 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:38:36,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:38:36,785 INFO L82 PathProgramCache]: Analyzing trace with hash -189611821, now seen corresponding path program 1 times [2019-10-02 10:38:36,787 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:38:36,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:38:36,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:38:36,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:38:36,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:38:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:38:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:38:36,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:38:36,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 10:38:36,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 10:38:36,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 10:38:36,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 10:38:36,986 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2019-10-02 10:38:37,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:38:37,013 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-10-02 10:38:37,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 10:38:37,015 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-10-02 10:38:37,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:38:37,025 INFO L225 Difference]: With dead ends: 53 [2019-10-02 10:38:37,026 INFO L226 Difference]: Without dead ends: 26 [2019-10-02 10:38:37,030 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 10:38:37,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-02 10:38:37,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-02 10:38:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-02 10:38:37,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-10-02 10:38:37,077 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2019-10-02 10:38:37,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:38:37,078 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-10-02 10:38:37,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 10:38:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-10-02 10:38:37,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 10:38:37,079 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:38:37,079 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:38:37,080 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:38:37,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:38:37,080 INFO L82 PathProgramCache]: Analyzing trace with hash 371500639, now seen corresponding path program 1 times [2019-10-02 10:38:37,081 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:38:37,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:38:37,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:38:37,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:38:37,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:38:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:38:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:38:37,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:38:37,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 10:38:37,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 10:38:37,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 10:38:37,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:38:37,286 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 5 states. [2019-10-02 10:38:37,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:38:37,362 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-10-02 10:38:37,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 10:38:37,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-02 10:38:37,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:38:37,364 INFO L225 Difference]: With dead ends: 42 [2019-10-02 10:38:37,365 INFO L226 Difference]: Without dead ends: 29 [2019-10-02 10:38:37,366 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 10:38:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-02 10:38:37,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-10-02 10:38:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-02 10:38:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-10-02 10:38:37,373 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2019-10-02 10:38:37,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:38:37,374 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-10-02 10:38:37,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 10:38:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-10-02 10:38:37,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-02 10:38:37,375 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:38:37,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:38:37,375 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:38:37,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:38:37,376 INFO L82 PathProgramCache]: Analyzing trace with hash -2036002280, now seen corresponding path program 1 times [2019-10-02 10:38:37,376 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:38:37,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:38:37,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:38:37,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:38:37,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:38:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:38:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:38:37,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:38:37,519 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:38:37,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:38:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:38:37,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 10:38:37,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:38:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 10:38:37,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:38:37,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-10-02 10:38:37,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 10:38:37,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 10:38:37,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 10:38:37,701 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 6 states. [2019-10-02 10:38:37,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:38:37,765 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-10-02 10:38:37,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 10:38:37,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-10-02 10:38:37,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:38:37,766 INFO L225 Difference]: With dead ends: 45 [2019-10-02 10:38:37,767 INFO L226 Difference]: Without dead ends: 32 [2019-10-02 10:38:37,767 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-02 10:38:37,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-02 10:38:37,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-10-02 10:38:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-02 10:38:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-10-02 10:38:37,773 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2019-10-02 10:38:37,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:38:37,773 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-10-02 10:38:37,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 10:38:37,774 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-10-02 10:38:37,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 10:38:37,775 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:38:37,775 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:38:37,775 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:38:37,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:38:37,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1998380991, now seen corresponding path program 2 times [2019-10-02 10:38:37,776 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:38:37,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:38:37,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:38:37,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:38:37,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:38:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:38:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:38:37,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:38:37,922 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:38:38,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:38:38,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:38:38,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:38:38,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 10:38:38,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:38:38,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:38:38,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:38:38,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-10-02 10:38:38,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 10:38:38,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 10:38:38,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-02 10:38:38,089 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 7 states. [2019-10-02 10:38:38,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:38:38,153 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-10-02 10:38:38,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 10:38:38,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-10-02 10:38:38,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:38:38,157 INFO L225 Difference]: With dead ends: 48 [2019-10-02 10:38:38,157 INFO L226 Difference]: Without dead ends: 35 [2019-10-02 10:38:38,158 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-02 10:38:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-02 10:38:38,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-10-02 10:38:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-02 10:38:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-10-02 10:38:38,164 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 24 [2019-10-02 10:38:38,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:38:38,164 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-10-02 10:38:38,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 10:38:38,164 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-10-02 10:38:38,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-02 10:38:38,165 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:38:38,165 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:38:38,165 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:38:38,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:38:38,166 INFO L82 PathProgramCache]: Analyzing trace with hash -54403912, now seen corresponding path program 3 times [2019-10-02 10:38:38,166 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:38:38,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:38:38,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:38:38,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:38:38,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:38:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:38:38,276 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:38:38,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:38:38,276 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:38:38,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 10:38:38,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 10:38:38,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:38:38,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 10:38:38,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:38:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:38:38,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:38:38,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-10-02 10:38:38,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 10:38:38,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 10:38:38,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 10:38:38,778 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 8 states. [2019-10-02 10:38:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:38:38,877 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-10-02 10:38:38,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 10:38:38,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-10-02 10:38:38,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:38:38,879 INFO L225 Difference]: With dead ends: 51 [2019-10-02 10:38:38,879 INFO L226 Difference]: Without dead ends: 38 [2019-10-02 10:38:38,880 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-02 10:38:38,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-02 10:38:38,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-10-02 10:38:38,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-02 10:38:38,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-10-02 10:38:38,894 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 27 [2019-10-02 10:38:38,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:38:38,895 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-10-02 10:38:38,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 10:38:38,895 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-10-02 10:38:38,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 10:38:38,896 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:38:38,898 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:38:38,898 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:38:38,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:38:38,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1469878559, now seen corresponding path program 4 times [2019-10-02 10:38:38,899 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:38:38,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:38:38,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:38:38,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:38:38,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:38:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:38:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 10:38:39,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:38:39,656 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:38:39,729 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 10:38:42,943 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 10:38:42,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:38:42,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-02 10:38:42,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:38:43,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:38:43,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2019-10-02 10:38:43,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:38:43,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:43,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:38:43,143 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:14 [2019-10-02 10:38:43,185 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:38:43,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:43,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:38:43,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:38:43,233 INFO L341 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2019-10-02 10:38:43,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 32 [2019-10-02 10:38:43,235 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:38:43,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:43,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:38:43,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:38:43,278 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:11 [2019-10-02 10:38:43,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 10:38:43,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:38:43,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:43,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:38:43,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-10-02 10:38:43,379 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 10:38:43,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:38:43,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2019-10-02 10:38:43,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 10:38:43,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 10:38:43,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-10-02 10:38:43,389 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 21 states. [2019-10-02 10:38:43,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:38:43,996 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-10-02 10:38:43,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 10:38:43,996 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2019-10-02 10:38:43,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:38:43,997 INFO L225 Difference]: With dead ends: 40 [2019-10-02 10:38:43,998 INFO L226 Difference]: Without dead ends: 38 [2019-10-02 10:38:44,000 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2019-10-02 10:38:44,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-02 10:38:44,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-02 10:38:44,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-02 10:38:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-10-02 10:38:44,013 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 30 [2019-10-02 10:38:44,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:38:44,013 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-10-02 10:38:44,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 10:38:44,014 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-10-02 10:38:44,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-02 10:38:44,017 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:38:44,017 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:38:44,018 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:38:44,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:38:44,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1961746313, now seen corresponding path program 1 times [2019-10-02 10:38:44,018 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:38:44,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:38:44,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:38:44,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:38:44,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:38:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:38:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 10:38:44,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:38:44,776 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:38:44,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:38:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:38:44,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 81 conjunts are in the unsatisfiable core [2019-10-02 10:38:44,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:38:44,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-02 10:38:44,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:38:44,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:44,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:38:44,961 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-02 10:38:45,012 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:45,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-02 10:38:45,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:38:45,035 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-10-02 10:38:45,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:38:45,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2019-10-02 10:38:45,118 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:45,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-10-02 10:38:45,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:38:45,151 INFO L567 ElimStorePlain]: treesize reduction 28, result has 52.5 percent of original size [2019-10-02 10:38:45,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:38:45,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:31 [2019-10-02 10:38:45,310 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:45,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 99 [2019-10-02 10:38:45,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:38:45,388 INFO L567 ElimStorePlain]: treesize reduction 42, result has 54.8 percent of original size [2019-10-02 10:38:45,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:38:45,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:51 [2019-10-02 10:38:45,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2019-10-02 10:38:45,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:38:45,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:45,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:38:45,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:86, output treesize:58 [2019-10-02 10:38:45,616 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:45,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 48 [2019-10-02 10:38:45,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:38:45,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:45,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:38:45,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:66, output treesize:29 [2019-10-02 10:38:45,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2019-10-02 10:38:45,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:38:45,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:45,799 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:38:45,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:45,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-10-02 10:38:45,876 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:38:45,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:45,933 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:38:45,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:45,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-02 10:38:45,990 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 10:38:46,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:46,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2019-10-02 10:38:46,037 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 10:38:46,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:46,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:38:46,073 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:127, output treesize:71 [2019-10-02 10:38:46,178 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_31|], 5=[|v_#memory_int_33|], 8=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_24|]} [2019-10-02 10:38:46,182 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:38:46,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:46,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:38:46,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2019-10-02 10:38:46,267 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:38:46,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:46,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:38:46,342 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:38:46,400 INFO L341 Elim1Store]: treesize reduction 3, result has 94.4 percent of original size [2019-10-02 10:38:46,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 104 [2019-10-02 10:38:46,403 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:38:46,506 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-10-02 10:38:46,506 INFO L567 ElimStorePlain]: treesize reduction 75, result has 62.1 percent of original size [2019-10-02 10:38:46,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:38:46,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:38:46,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2019-10-02 10:38:46,518 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:38:46,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:46,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:38:46,556 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:175, output treesize:117 [2019-10-02 10:38:46,785 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 3=[|v_#memory_int_34|], 9=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_25|]} [2019-10-02 10:38:46,789 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:38:46,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:46,842 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:38:46,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:46,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:38:46,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2019-10-02 10:38:46,893 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:38:46,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:46,945 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:38:46,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 106 [2019-10-02 10:38:46,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:38:46,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:38:46,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:38:46,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:38:46,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:38:46,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:38:46,962 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_28, v_arrayElimCell_27], 1=[v_arrayElimCell_29]} [2019-10-02 10:38:47,164 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:38:47,166 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:465) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-02 10:38:47,173 INFO L168 Benchmark]: Toolchain (without parser) took 11909.11 ms. Allocated memory was 132.6 MB in the beginning and 322.4 MB in the end (delta: 189.8 MB). Free memory was 86.9 MB in the beginning and 173.8 MB in the end (delta: -86.9 MB). Peak memory consumption was 102.9 MB. Max. memory is 7.1 GB. [2019-10-02 10:38:47,173 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-02 10:38:47,174 INFO L168 Benchmark]: CACSL2BoogieTranslator took 627.17 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 86.7 MB in the beginning and 161.2 MB in the end (delta: -74.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-10-02 10:38:47,175 INFO L168 Benchmark]: Boogie Preprocessor took 62.65 ms. Allocated memory is still 199.2 MB. Free memory was 161.2 MB in the beginning and 157.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-10-02 10:38:47,176 INFO L168 Benchmark]: RCFGBuilder took 705.08 ms. Allocated memory is still 199.2 MB. Free memory was 157.9 MB in the beginning and 113.1 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. [2019-10-02 10:38:47,177 INFO L168 Benchmark]: TraceAbstraction took 10509.44 ms. Allocated memory was 199.2 MB in the beginning and 322.4 MB in the end (delta: 123.2 MB). Free memory was 113.1 MB in the beginning and 173.8 MB in the end (delta: -60.6 MB). Peak memory consumption was 62.6 MB. Max. memory is 7.1 GB. [2019-10-02 10:38:47,180 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 627.17 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 86.7 MB in the beginning and 161.2 MB in the end (delta: -74.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.65 ms. Allocated memory is still 199.2 MB. Free memory was 161.2 MB in the beginning and 157.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 705.08 ms. Allocated memory is still 199.2 MB. Free memory was 157.9 MB in the beginning and 113.1 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10509.44 ms. Allocated memory was 199.2 MB in the beginning and 322.4 MB in the end (delta: 123.2 MB). Free memory was 113.1 MB in the beginning and 173.8 MB in the end (delta: -60.6 MB). Peak memory consumption was 62.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...