/usr/bin/java -ea -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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:24:37,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:24:37,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:24:37,231 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:24:37,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:24:37,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:24:37,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:24:37,236 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:24:37,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:24:37,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:24:37,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:24:37,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:24:37,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:24:37,242 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:24:37,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:24:37,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:24:37,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:24:37,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:24:37,248 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:24:37,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:24:37,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:24:37,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:24:37,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:24:37,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:24:37,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:24:37,259 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:24:37,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:24:37,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:24:37,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:24:37,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:24:37,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:24:37,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:24:37,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:24:37,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:24:37,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:24:37,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:24:37,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:24:37,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:24:37,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:24:37,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:24:37,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:24:37,270 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:24:37,280 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:24:37,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:24:37,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:24:37,282 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:24:37,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:24:37,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:24:37,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:24:37,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:24:37,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:24:37,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:24:37,283 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:24:37,284 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:24:37,284 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:24:37,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:24:37,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:24:37,284 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:24:37,285 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:24:37,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:24:37,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:24:37,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:24:37,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:24:37,286 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:24:37,286 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:24:37,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:24:37,574 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:24:37,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:24:37,580 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:24:37,580 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:24:37,581 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2020-07-18 00:24:37,667 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee8e4cb8/8d954d3f44d1440f8420476c1dd98903/FLAG151df4f68 [2020-07-18 00:24:38,235 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:24:38,236 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2020-07-18 00:24:38,259 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee8e4cb8/8d954d3f44d1440f8420476c1dd98903/FLAG151df4f68 [2020-07-18 00:24:38,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee8e4cb8/8d954d3f44d1440f8420476c1dd98903 [2020-07-18 00:24:38,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:24:38,512 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:24:38,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:24:38,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:24:38,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:24:38,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:24:38" (1/1) ... [2020-07-18 00:24:38,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1f98c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:38, skipping insertion in model container [2020-07-18 00:24:38,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:24:38" (1/1) ... [2020-07-18 00:24:38,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:24:38,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:24:39,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:24:39,054 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:24:39,128 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:24:39,183 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:24:39,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:39 WrapperNode [2020-07-18 00:24:39,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:24:39,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:24:39,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:24:39,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:24:39,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:39" (1/1) ... [2020-07-18 00:24:39,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:39" (1/1) ... [2020-07-18 00:24:39,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:39" (1/1) ... [2020-07-18 00:24:39,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:39" (1/1) ... [2020-07-18 00:24:39,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:39" (1/1) ... [2020-07-18 00:24:39,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:39" (1/1) ... [2020-07-18 00:24:39,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:39" (1/1) ... [2020-07-18 00:24:39,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:24:39,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:24:39,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:24:39,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:24:39,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:39" (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 [2020-07-18 00:24:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:24:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:24:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-18 00:24:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-18 00:24:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-18 00:24:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:24:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:24:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:24:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-18 00:24:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-18 00:24:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-18 00:24:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-18 00:24:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-18 00:24:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-18 00:24:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-18 00:24:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-18 00:24:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-18 00:24:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-18 00:24:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-18 00:24:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-18 00:24:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-18 00:24:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-18 00:24:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-18 00:24:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-18 00:24:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-18 00:24:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-18 00:24:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-18 00:24:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-18 00:24:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-18 00:24:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-18 00:24:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-18 00:24:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-18 00:24:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-18 00:24:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-18 00:24:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-18 00:24:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-18 00:24:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-18 00:24:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-18 00:24:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-18 00:24:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-18 00:24:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-18 00:24:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-18 00:24:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-18 00:24:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-18 00:24:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-18 00:24:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-18 00:24:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-18 00:24:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-18 00:24:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-18 00:24:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-18 00:24:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-18 00:24:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-18 00:24:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-18 00:24:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-18 00:24:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-18 00:24:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-18 00:24:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-18 00:24:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-18 00:24:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-18 00:24:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-18 00:24:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 00:24:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-18 00:24:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-18 00:24:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-18 00:24:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-18 00:24:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-18 00:24:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-18 00:24:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-18 00:24:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-18 00:24:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:24:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-18 00:24:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-18 00:24:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-18 00:24:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-18 00:24:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-18 00:24:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-18 00:24:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-18 00:24:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-18 00:24:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-18 00:24:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-18 00:24:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-18 00:24:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-18 00:24:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-18 00:24:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-18 00:24:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-18 00:24:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-18 00:24:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-18 00:24:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-18 00:24:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-18 00:24:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-18 00:24:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-18 00:24:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-18 00:24:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-18 00:24:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-18 00:24:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-18 00:24:39,357 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-18 00:24:39,357 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-18 00:24:39,357 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-18 00:24:39,357 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-18 00:24:39,357 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-18 00:24:39,357 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-18 00:24:39,358 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-18 00:24:39,358 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-18 00:24:39,358 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-18 00:24:39,358 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-18 00:24:39,358 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-18 00:24:39,358 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-18 00:24:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-18 00:24:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-18 00:24:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-18 00:24:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-18 00:24:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-18 00:24:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-18 00:24:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-18 00:24:39,360 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:24:39,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 00:24:39,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-18 00:24:39,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-18 00:24:39,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:24:39,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:24:39,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:24:39,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:24:39,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:24:39,734 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-18 00:24:40,377 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:24:40,377 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-18 00:24:40,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:24:40 BoogieIcfgContainer [2020-07-18 00:24:40,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:24:40,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:24:40,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:24:40,391 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:24:40,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:24:38" (1/3) ... [2020-07-18 00:24:40,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9f8b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:24:40, skipping insertion in model container [2020-07-18 00:24:40,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:24:39" (2/3) ... [2020-07-18 00:24:40,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9f8b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:24:40, skipping insertion in model container [2020-07-18 00:24:40,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:24:40" (3/3) ... [2020-07-18 00:24:40,397 INFO L109 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2020-07-18 00:24:40,409 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:24:40,419 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:24:40,435 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:24:40,461 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:24:40,461 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:24:40,462 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:24:40,462 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:24:40,463 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:24:40,463 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:24:40,467 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:24:40,467 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:24:40,492 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states. [2020-07-18 00:24:40,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-18 00:24:40,507 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:40,509 INFO L422 BasicCegarLoop]: 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] [2020-07-18 00:24:40,509 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:40,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:40,517 INFO L82 PathProgramCache]: Analyzing trace with hash -652445128, now seen corresponding path program 1 times [2020-07-18 00:24:40,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:40,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [217032509] [2020-07-18 00:24:40,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:40,739 INFO L280 TraceCheckUtils]: 0: Hoare triple {187#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {180#true} is VALID [2020-07-18 00:24:40,739 INFO L280 TraceCheckUtils]: 1: Hoare triple {180#true} #valid := #valid[0 := 0]; {180#true} is VALID [2020-07-18 00:24:40,740 INFO L280 TraceCheckUtils]: 2: Hoare triple {180#true} assume 0 < #StackHeapBarrier; {180#true} is VALID [2020-07-18 00:24:40,741 INFO L280 TraceCheckUtils]: 3: Hoare triple {180#true} assume true; {180#true} is VALID [2020-07-18 00:24:40,741 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {180#true} {180#true} #349#return; {180#true} is VALID [2020-07-18 00:24:40,745 INFO L263 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {187#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:40,745 INFO L280 TraceCheckUtils]: 1: Hoare triple {187#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {180#true} is VALID [2020-07-18 00:24:40,746 INFO L280 TraceCheckUtils]: 2: Hoare triple {180#true} #valid := #valid[0 := 0]; {180#true} is VALID [2020-07-18 00:24:40,746 INFO L280 TraceCheckUtils]: 3: Hoare triple {180#true} assume 0 < #StackHeapBarrier; {180#true} is VALID [2020-07-18 00:24:40,747 INFO L280 TraceCheckUtils]: 4: Hoare triple {180#true} assume true; {180#true} is VALID [2020-07-18 00:24:40,747 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {180#true} {180#true} #349#return; {180#true} is VALID [2020-07-18 00:24:40,747 INFO L263 TraceCheckUtils]: 6: Hoare triple {180#true} call #t~ret41 := main(); {180#true} is VALID [2020-07-18 00:24:40,748 INFO L280 TraceCheckUtils]: 7: Hoare triple {180#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {180#true} is VALID [2020-07-18 00:24:40,748 INFO L280 TraceCheckUtils]: 8: Hoare triple {180#true} ~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset; {180#true} is VALID [2020-07-18 00:24:40,748 INFO L280 TraceCheckUtils]: 9: Hoare triple {180#true} havoc ~n~0.base, ~n~0.offset; {180#true} is VALID [2020-07-18 00:24:40,749 INFO L280 TraceCheckUtils]: 10: Hoare triple {180#true} SUMMARY for call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4); srcloc: L542 {180#true} is VALID [2020-07-18 00:24:40,749 INFO L280 TraceCheckUtils]: 11: Hoare triple {180#true} SUMMARY for call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); srcloc: L542-1 {180#true} is VALID [2020-07-18 00:24:40,750 INFO L280 TraceCheckUtils]: 12: Hoare triple {180#true} assume !true; {181#false} is VALID [2020-07-18 00:24:40,751 INFO L280 TraceCheckUtils]: 13: Hoare triple {181#false} ~n~0.base, ~n~0.offset := 0, 0; {181#false} is VALID [2020-07-18 00:24:40,751 INFO L280 TraceCheckUtils]: 14: Hoare triple {181#false} havoc ~pred~0.base, ~pred~0.offset; {181#false} is VALID [2020-07-18 00:24:40,751 INFO L280 TraceCheckUtils]: 15: Hoare triple {181#false} assume !(~root~0.base != 0 || ~root~0.offset != 0); {181#false} is VALID [2020-07-18 00:24:40,752 INFO L280 TraceCheckUtils]: 16: Hoare triple {181#false} SUMMARY for call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8); srcloc: L565-2 {181#false} is VALID [2020-07-18 00:24:40,752 INFO L280 TraceCheckUtils]: 17: Hoare triple {181#false} ~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {181#false} is VALID [2020-07-18 00:24:40,752 INFO L280 TraceCheckUtils]: 18: Hoare triple {181#false} assume !(~a~0.base == 0 && ~a~0.offset == 0); {181#false} is VALID [2020-07-18 00:24:40,753 INFO L280 TraceCheckUtils]: 19: Hoare triple {181#false} havoc ~t~0.base, ~t~0.offset; {181#false} is VALID [2020-07-18 00:24:40,753 INFO L280 TraceCheckUtils]: 20: Hoare triple {181#false} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {181#false} is VALID [2020-07-18 00:24:40,753 INFO L280 TraceCheckUtils]: 21: Hoare triple {181#false} assume !true; {181#false} is VALID [2020-07-18 00:24:40,754 INFO L280 TraceCheckUtils]: 22: Hoare triple {181#false} assume !true; {181#false} is VALID [2020-07-18 00:24:40,754 INFO L280 TraceCheckUtils]: 23: Hoare triple {181#false} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L595-5 {181#false} is VALID [2020-07-18 00:24:40,754 INFO L280 TraceCheckUtils]: 24: Hoare triple {181#false} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {181#false} is VALID [2020-07-18 00:24:40,755 INFO L280 TraceCheckUtils]: 25: Hoare triple {181#false} assume !true; {181#false} is VALID [2020-07-18 00:24:40,755 INFO L280 TraceCheckUtils]: 26: Hoare triple {181#false} assume !true; {181#false} is VALID [2020-07-18 00:24:40,755 INFO L280 TraceCheckUtils]: 27: Hoare triple {181#false} SUMMARY for call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L606-5 {181#false} is VALID [2020-07-18 00:24:40,756 INFO L280 TraceCheckUtils]: 28: Hoare triple {181#false} assume 3 != #t~mem40; {181#false} is VALID [2020-07-18 00:24:40,756 INFO L280 TraceCheckUtils]: 29: Hoare triple {181#false} havoc #t~mem40; {181#false} is VALID [2020-07-18 00:24:40,756 INFO L280 TraceCheckUtils]: 30: Hoare triple {181#false} assume !false; {181#false} is VALID [2020-07-18 00:24:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:24:40,763 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:40,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [217032509] [2020-07-18 00:24:40,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:40,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:24:40,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964724412] [2020-07-18 00:24:40,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-18 00:24:40,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:40,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:24:40,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:40,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:24:40,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:40,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:24:40,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:24:40,846 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 3 states. [2020-07-18 00:24:41,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:41,815 INFO L93 Difference]: Finished difference Result 342 states and 400 transitions. [2020-07-18 00:24:41,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:24:41,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-18 00:24:41,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:24:41,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2020-07-18 00:24:41,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:24:41,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2020-07-18 00:24:41,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 400 transitions. [2020-07-18 00:24:42,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 400 edges. 400 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:42,349 INFO L225 Difference]: With dead ends: 342 [2020-07-18 00:24:42,349 INFO L226 Difference]: Without dead ends: 166 [2020-07-18 00:24:42,354 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:24:42,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-07-18 00:24:42,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2020-07-18 00:24:42,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:42,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 166 states. [2020-07-18 00:24:42,486 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 166 states. [2020-07-18 00:24:42,486 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 166 states. [2020-07-18 00:24:42,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:42,498 INFO L93 Difference]: Finished difference Result 166 states and 183 transitions. [2020-07-18 00:24:42,499 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 183 transitions. [2020-07-18 00:24:42,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:42,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:42,501 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 166 states. [2020-07-18 00:24:42,501 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 166 states. [2020-07-18 00:24:42,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:42,527 INFO L93 Difference]: Finished difference Result 166 states and 183 transitions. [2020-07-18 00:24:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 183 transitions. [2020-07-18 00:24:42,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:42,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:42,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:42,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:42,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-07-18 00:24:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 183 transitions. [2020-07-18 00:24:42,544 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 183 transitions. Word has length 31 [2020-07-18 00:24:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:42,545 INFO L479 AbstractCegarLoop]: Abstraction has 166 states and 183 transitions. [2020-07-18 00:24:42,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:24:42,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 166 states and 183 transitions. [2020-07-18 00:24:42,778 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:42,778 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 183 transitions. [2020-07-18 00:24:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-18 00:24:42,782 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:42,782 INFO L422 BasicCegarLoop]: 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] [2020-07-18 00:24:42,782 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:24:42,782 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:42,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:42,783 INFO L82 PathProgramCache]: Analyzing trace with hash 473660712, now seen corresponding path program 1 times [2020-07-18 00:24:42,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:42,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [918595778] [2020-07-18 00:24:42,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:42,905 INFO L280 TraceCheckUtils]: 0: Hoare triple {1547#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1538#true} is VALID [2020-07-18 00:24:42,906 INFO L280 TraceCheckUtils]: 1: Hoare triple {1538#true} #valid := #valid[0 := 0]; {1538#true} is VALID [2020-07-18 00:24:42,906 INFO L280 TraceCheckUtils]: 2: Hoare triple {1538#true} assume 0 < #StackHeapBarrier; {1538#true} is VALID [2020-07-18 00:24:42,906 INFO L280 TraceCheckUtils]: 3: Hoare triple {1538#true} assume true; {1538#true} is VALID [2020-07-18 00:24:42,907 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1538#true} {1538#true} #349#return; {1538#true} is VALID [2020-07-18 00:24:42,908 INFO L263 TraceCheckUtils]: 0: Hoare triple {1538#true} call ULTIMATE.init(); {1547#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:42,912 INFO L280 TraceCheckUtils]: 1: Hoare triple {1547#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1538#true} is VALID [2020-07-18 00:24:42,912 INFO L280 TraceCheckUtils]: 2: Hoare triple {1538#true} #valid := #valid[0 := 0]; {1538#true} is VALID [2020-07-18 00:24:42,912 INFO L280 TraceCheckUtils]: 3: Hoare triple {1538#true} assume 0 < #StackHeapBarrier; {1538#true} is VALID [2020-07-18 00:24:42,913 INFO L280 TraceCheckUtils]: 4: Hoare triple {1538#true} assume true; {1538#true} is VALID [2020-07-18 00:24:42,913 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1538#true} {1538#true} #349#return; {1538#true} is VALID [2020-07-18 00:24:42,913 INFO L263 TraceCheckUtils]: 6: Hoare triple {1538#true} call #t~ret41 := main(); {1538#true} is VALID [2020-07-18 00:24:42,914 INFO L280 TraceCheckUtils]: 7: Hoare triple {1538#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {1545#(not (= 0 |main_#t~malloc2.base|))} is VALID [2020-07-18 00:24:42,915 INFO L280 TraceCheckUtils]: 8: Hoare triple {1545#(not (= 0 |main_#t~malloc2.base|))} ~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset; {1546#(not (= 0 main_~root~0.base))} is VALID [2020-07-18 00:24:42,916 INFO L280 TraceCheckUtils]: 9: Hoare triple {1546#(not (= 0 main_~root~0.base))} havoc ~n~0.base, ~n~0.offset; {1546#(not (= 0 main_~root~0.base))} is VALID [2020-07-18 00:24:42,917 INFO L280 TraceCheckUtils]: 10: Hoare triple {1546#(not (= 0 main_~root~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4); srcloc: L542 {1546#(not (= 0 main_~root~0.base))} is VALID [2020-07-18 00:24:42,918 INFO L280 TraceCheckUtils]: 11: Hoare triple {1546#(not (= 0 main_~root~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); srcloc: L542-1 {1546#(not (= 0 main_~root~0.base))} is VALID [2020-07-18 00:24:42,918 INFO L280 TraceCheckUtils]: 12: Hoare triple {1546#(not (= 0 main_~root~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1546#(not (= 0 main_~root~0.base))} is VALID [2020-07-18 00:24:42,919 INFO L280 TraceCheckUtils]: 13: Hoare triple {1546#(not (= 0 main_~root~0.base))} assume !(0 != #t~nondet3); {1546#(not (= 0 main_~root~0.base))} is VALID [2020-07-18 00:24:42,920 INFO L280 TraceCheckUtils]: 14: Hoare triple {1546#(not (= 0 main_~root~0.base))} havoc #t~nondet3; {1546#(not (= 0 main_~root~0.base))} is VALID [2020-07-18 00:24:42,921 INFO L280 TraceCheckUtils]: 15: Hoare triple {1546#(not (= 0 main_~root~0.base))} ~n~0.base, ~n~0.offset := 0, 0; {1546#(not (= 0 main_~root~0.base))} is VALID [2020-07-18 00:24:42,922 INFO L280 TraceCheckUtils]: 16: Hoare triple {1546#(not (= 0 main_~root~0.base))} havoc ~pred~0.base, ~pred~0.offset; {1546#(not (= 0 main_~root~0.base))} is VALID [2020-07-18 00:24:42,922 INFO L280 TraceCheckUtils]: 17: Hoare triple {1546#(not (= 0 main_~root~0.base))} assume !(~root~0.base != 0 || ~root~0.offset != 0); {1539#false} is VALID [2020-07-18 00:24:42,923 INFO L280 TraceCheckUtils]: 18: Hoare triple {1539#false} SUMMARY for call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8); srcloc: L565-2 {1539#false} is VALID [2020-07-18 00:24:42,923 INFO L280 TraceCheckUtils]: 19: Hoare triple {1539#false} ~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {1539#false} is VALID [2020-07-18 00:24:42,923 INFO L280 TraceCheckUtils]: 20: Hoare triple {1539#false} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1539#false} is VALID [2020-07-18 00:24:42,924 INFO L280 TraceCheckUtils]: 21: Hoare triple {1539#false} havoc ~t~0.base, ~t~0.offset; {1539#false} is VALID [2020-07-18 00:24:42,924 INFO L280 TraceCheckUtils]: 22: Hoare triple {1539#false} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1539#false} is VALID [2020-07-18 00:24:42,924 INFO L280 TraceCheckUtils]: 23: Hoare triple {1539#false} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {1539#false} is VALID [2020-07-18 00:24:42,925 INFO L280 TraceCheckUtils]: 24: Hoare triple {1539#false} assume !(0 != #t~nondet30); {1539#false} is VALID [2020-07-18 00:24:42,925 INFO L280 TraceCheckUtils]: 25: Hoare triple {1539#false} havoc #t~nondet30; {1539#false} is VALID [2020-07-18 00:24:42,925 INFO L280 TraceCheckUtils]: 26: Hoare triple {1539#false} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {1539#false} is VALID [2020-07-18 00:24:42,926 INFO L280 TraceCheckUtils]: 27: Hoare triple {1539#false} assume !(0 != #t~nondet33); {1539#false} is VALID [2020-07-18 00:24:42,926 INFO L280 TraceCheckUtils]: 28: Hoare triple {1539#false} havoc #t~nondet33; {1539#false} is VALID [2020-07-18 00:24:42,926 INFO L280 TraceCheckUtils]: 29: Hoare triple {1539#false} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L595-5 {1539#false} is VALID [2020-07-18 00:24:42,927 INFO L280 TraceCheckUtils]: 30: Hoare triple {1539#false} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1539#false} is VALID [2020-07-18 00:24:42,927 INFO L280 TraceCheckUtils]: 31: Hoare triple {1539#false} SUMMARY for call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L604-5 {1539#false} is VALID [2020-07-18 00:24:42,927 INFO L280 TraceCheckUtils]: 32: Hoare triple {1539#false} assume !(2 == #t~mem36); {1539#false} is VALID [2020-07-18 00:24:42,928 INFO L280 TraceCheckUtils]: 33: Hoare triple {1539#false} havoc #t~mem36; {1539#false} is VALID [2020-07-18 00:24:42,928 INFO L280 TraceCheckUtils]: 34: Hoare triple {1539#false} SUMMARY for call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L606-4 {1539#false} is VALID [2020-07-18 00:24:42,928 INFO L280 TraceCheckUtils]: 35: Hoare triple {1539#false} assume !(1 == #t~mem38); {1539#false} is VALID [2020-07-18 00:24:42,929 INFO L280 TraceCheckUtils]: 36: Hoare triple {1539#false} havoc #t~mem38; {1539#false} is VALID [2020-07-18 00:24:42,929 INFO L280 TraceCheckUtils]: 37: Hoare triple {1539#false} SUMMARY for call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L606-5 {1539#false} is VALID [2020-07-18 00:24:42,929 INFO L280 TraceCheckUtils]: 38: Hoare triple {1539#false} assume 3 != #t~mem40; {1539#false} is VALID [2020-07-18 00:24:42,930 INFO L280 TraceCheckUtils]: 39: Hoare triple {1539#false} havoc #t~mem40; {1539#false} is VALID [2020-07-18 00:24:42,930 INFO L280 TraceCheckUtils]: 40: Hoare triple {1539#false} assume !false; {1539#false} is VALID [2020-07-18 00:24:42,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:24:42,934 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:42,934 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [918595778] [2020-07-18 00:24:42,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:42,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:24:42,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689927787] [2020-07-18 00:24:42,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-18 00:24:42,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:42,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:24:42,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:42,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:24:42,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:42,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:24:42,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:24:42,981 INFO L87 Difference]: Start difference. First operand 166 states and 183 transitions. Second operand 5 states. [2020-07-18 00:24:44,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:44,140 INFO L93 Difference]: Finished difference Result 251 states and 277 transitions. [2020-07-18 00:24:44,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:24:44,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-18 00:24:44,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:44,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:24:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 277 transitions. [2020-07-18 00:24:44,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:24:44,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 277 transitions. [2020-07-18 00:24:44,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 277 transitions. [2020-07-18 00:24:44,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:44,484 INFO L225 Difference]: With dead ends: 251 [2020-07-18 00:24:44,484 INFO L226 Difference]: Without dead ends: 201 [2020-07-18 00:24:44,489 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:24:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-07-18 00:24:44,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2020-07-18 00:24:44,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:44,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand 200 states. [2020-07-18 00:24:44,789 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand 200 states. [2020-07-18 00:24:44,789 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 200 states. [2020-07-18 00:24:44,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:44,798 INFO L93 Difference]: Finished difference Result 201 states and 223 transitions. [2020-07-18 00:24:44,798 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 223 transitions. [2020-07-18 00:24:44,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:44,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:44,800 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 201 states. [2020-07-18 00:24:44,800 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 201 states. [2020-07-18 00:24:44,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:44,808 INFO L93 Difference]: Finished difference Result 201 states and 223 transitions. [2020-07-18 00:24:44,808 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 223 transitions. [2020-07-18 00:24:44,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:44,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:44,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:44,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:44,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-07-18 00:24:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2020-07-18 00:24:44,817 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 41 [2020-07-18 00:24:44,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:44,818 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2020-07-18 00:24:44,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:24:44,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 200 states and 222 transitions. [2020-07-18 00:24:45,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:45,086 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2020-07-18 00:24:45,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-18 00:24:45,089 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:45,089 INFO L422 BasicCegarLoop]: 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] [2020-07-18 00:24:45,089 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:24:45,090 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:45,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:45,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1870874818, now seen corresponding path program 1 times [2020-07-18 00:24:45,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:45,091 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [233701001] [2020-07-18 00:24:45,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:45,205 INFO L280 TraceCheckUtils]: 0: Hoare triple {2864#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2856#true} is VALID [2020-07-18 00:24:45,206 INFO L280 TraceCheckUtils]: 1: Hoare triple {2856#true} #valid := #valid[0 := 0]; {2856#true} is VALID [2020-07-18 00:24:45,206 INFO L280 TraceCheckUtils]: 2: Hoare triple {2856#true} assume 0 < #StackHeapBarrier; {2856#true} is VALID [2020-07-18 00:24:45,206 INFO L280 TraceCheckUtils]: 3: Hoare triple {2856#true} assume true; {2856#true} is VALID [2020-07-18 00:24:45,206 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2856#true} {2856#true} #349#return; {2856#true} is VALID [2020-07-18 00:24:45,207 INFO L263 TraceCheckUtils]: 0: Hoare triple {2856#true} call ULTIMATE.init(); {2864#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:45,208 INFO L280 TraceCheckUtils]: 1: Hoare triple {2864#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2856#true} is VALID [2020-07-18 00:24:45,208 INFO L280 TraceCheckUtils]: 2: Hoare triple {2856#true} #valid := #valid[0 := 0]; {2856#true} is VALID [2020-07-18 00:24:45,208 INFO L280 TraceCheckUtils]: 3: Hoare triple {2856#true} assume 0 < #StackHeapBarrier; {2856#true} is VALID [2020-07-18 00:24:45,208 INFO L280 TraceCheckUtils]: 4: Hoare triple {2856#true} assume true; {2856#true} is VALID [2020-07-18 00:24:45,209 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2856#true} {2856#true} #349#return; {2856#true} is VALID [2020-07-18 00:24:45,209 INFO L263 TraceCheckUtils]: 6: Hoare triple {2856#true} call #t~ret41 := main(); {2856#true} is VALID [2020-07-18 00:24:45,209 INFO L280 TraceCheckUtils]: 7: Hoare triple {2856#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {2856#true} is VALID [2020-07-18 00:24:45,209 INFO L280 TraceCheckUtils]: 8: Hoare triple {2856#true} ~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset; {2856#true} is VALID [2020-07-18 00:24:45,210 INFO L280 TraceCheckUtils]: 9: Hoare triple {2856#true} havoc ~n~0.base, ~n~0.offset; {2856#true} is VALID [2020-07-18 00:24:45,210 INFO L280 TraceCheckUtils]: 10: Hoare triple {2856#true} SUMMARY for call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4); srcloc: L542 {2856#true} is VALID [2020-07-18 00:24:45,210 INFO L280 TraceCheckUtils]: 11: Hoare triple {2856#true} SUMMARY for call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); srcloc: L542-1 {2856#true} is VALID [2020-07-18 00:24:45,211 INFO L280 TraceCheckUtils]: 12: Hoare triple {2856#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2856#true} is VALID [2020-07-18 00:24:45,211 INFO L280 TraceCheckUtils]: 13: Hoare triple {2856#true} assume !(0 != #t~nondet3); {2856#true} is VALID [2020-07-18 00:24:45,211 INFO L280 TraceCheckUtils]: 14: Hoare triple {2856#true} havoc #t~nondet3; {2856#true} is VALID [2020-07-18 00:24:45,211 INFO L280 TraceCheckUtils]: 15: Hoare triple {2856#true} ~n~0.base, ~n~0.offset := 0, 0; {2856#true} is VALID [2020-07-18 00:24:45,212 INFO L280 TraceCheckUtils]: 16: Hoare triple {2856#true} havoc ~pred~0.base, ~pred~0.offset; {2856#true} is VALID [2020-07-18 00:24:45,212 INFO L280 TraceCheckUtils]: 17: Hoare triple {2856#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0); {2856#true} is VALID [2020-07-18 00:24:45,212 INFO L280 TraceCheckUtils]: 18: Hoare triple {2856#true} ~pred~0.base, ~pred~0.offset := 0, 0; {2856#true} is VALID [2020-07-18 00:24:45,213 INFO L280 TraceCheckUtils]: 19: Hoare triple {2856#true} ~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {2856#true} is VALID [2020-07-18 00:24:45,213 INFO L280 TraceCheckUtils]: 20: Hoare triple {2856#true} SUMMARY for call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4); srcloc: L570-5 {2856#true} is VALID [2020-07-18 00:24:45,213 INFO L280 TraceCheckUtils]: 21: Hoare triple {2856#true} #t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {2856#true} is VALID [2020-07-18 00:24:45,214 INFO L280 TraceCheckUtils]: 22: Hoare triple {2856#true} assume #t~short24; {2863#|main_#t~short24|} is VALID [2020-07-18 00:24:45,215 INFO L280 TraceCheckUtils]: 23: Hoare triple {2863#|main_#t~short24|} assume !#t~short24; {2857#false} is VALID [2020-07-18 00:24:45,215 INFO L280 TraceCheckUtils]: 24: Hoare triple {2857#false} havoc #t~mem23.base, #t~mem23.offset; {2857#false} is VALID [2020-07-18 00:24:45,216 INFO L280 TraceCheckUtils]: 25: Hoare triple {2857#false} havoc #t~short24; {2857#false} is VALID [2020-07-18 00:24:45,216 INFO L280 TraceCheckUtils]: 26: Hoare triple {2857#false} havoc #t~mem22.base, #t~mem22.offset; {2857#false} is VALID [2020-07-18 00:24:45,216 INFO L280 TraceCheckUtils]: 27: Hoare triple {2857#false} assume !(~pred~0.base != 0 || ~pred~0.offset != 0); {2857#false} is VALID [2020-07-18 00:24:45,216 INFO L280 TraceCheckUtils]: 28: Hoare triple {2857#false} ~root~0.base, ~root~0.offset := 0, 0; {2857#false} is VALID [2020-07-18 00:24:45,217 INFO L280 TraceCheckUtils]: 29: Hoare triple {2857#false} SUMMARY for call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); srcloc: L575 {2857#false} is VALID [2020-07-18 00:24:45,217 INFO L280 TraceCheckUtils]: 30: Hoare triple {2857#false} assume !(~root~0.base != 0 || ~root~0.offset != 0); {2857#false} is VALID [2020-07-18 00:24:45,217 INFO L280 TraceCheckUtils]: 31: Hoare triple {2857#false} SUMMARY for call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8); srcloc: L565-2 {2857#false} is VALID [2020-07-18 00:24:45,218 INFO L280 TraceCheckUtils]: 32: Hoare triple {2857#false} ~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {2857#false} is VALID [2020-07-18 00:24:45,218 INFO L280 TraceCheckUtils]: 33: Hoare triple {2857#false} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2857#false} is VALID [2020-07-18 00:24:45,218 INFO L280 TraceCheckUtils]: 34: Hoare triple {2857#false} havoc ~t~0.base, ~t~0.offset; {2857#false} is VALID [2020-07-18 00:24:45,219 INFO L280 TraceCheckUtils]: 35: Hoare triple {2857#false} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2857#false} is VALID [2020-07-18 00:24:45,219 INFO L280 TraceCheckUtils]: 36: Hoare triple {2857#false} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {2857#false} is VALID [2020-07-18 00:24:45,219 INFO L280 TraceCheckUtils]: 37: Hoare triple {2857#false} assume !(0 != #t~nondet30); {2857#false} is VALID [2020-07-18 00:24:45,220 INFO L280 TraceCheckUtils]: 38: Hoare triple {2857#false} havoc #t~nondet30; {2857#false} is VALID [2020-07-18 00:24:45,220 INFO L280 TraceCheckUtils]: 39: Hoare triple {2857#false} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {2857#false} is VALID [2020-07-18 00:24:45,220 INFO L280 TraceCheckUtils]: 40: Hoare triple {2857#false} assume !(0 != #t~nondet33); {2857#false} is VALID [2020-07-18 00:24:45,220 INFO L280 TraceCheckUtils]: 41: Hoare triple {2857#false} havoc #t~nondet33; {2857#false} is VALID [2020-07-18 00:24:45,221 INFO L280 TraceCheckUtils]: 42: Hoare triple {2857#false} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L595-5 {2857#false} is VALID [2020-07-18 00:24:45,221 INFO L280 TraceCheckUtils]: 43: Hoare triple {2857#false} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2857#false} is VALID [2020-07-18 00:24:45,221 INFO L280 TraceCheckUtils]: 44: Hoare triple {2857#false} SUMMARY for call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L604-5 {2857#false} is VALID [2020-07-18 00:24:45,222 INFO L280 TraceCheckUtils]: 45: Hoare triple {2857#false} assume !(2 == #t~mem36); {2857#false} is VALID [2020-07-18 00:24:45,222 INFO L280 TraceCheckUtils]: 46: Hoare triple {2857#false} havoc #t~mem36; {2857#false} is VALID [2020-07-18 00:24:45,222 INFO L280 TraceCheckUtils]: 47: Hoare triple {2857#false} SUMMARY for call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L606-4 {2857#false} is VALID [2020-07-18 00:24:45,222 INFO L280 TraceCheckUtils]: 48: Hoare triple {2857#false} assume !(1 == #t~mem38); {2857#false} is VALID [2020-07-18 00:24:45,223 INFO L280 TraceCheckUtils]: 49: Hoare triple {2857#false} havoc #t~mem38; {2857#false} is VALID [2020-07-18 00:24:45,223 INFO L280 TraceCheckUtils]: 50: Hoare triple {2857#false} SUMMARY for call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L606-5 {2857#false} is VALID [2020-07-18 00:24:45,223 INFO L280 TraceCheckUtils]: 51: Hoare triple {2857#false} assume 3 != #t~mem40; {2857#false} is VALID [2020-07-18 00:24:45,224 INFO L280 TraceCheckUtils]: 52: Hoare triple {2857#false} havoc #t~mem40; {2857#false} is VALID [2020-07-18 00:24:45,224 INFO L280 TraceCheckUtils]: 53: Hoare triple {2857#false} assume !false; {2857#false} is VALID [2020-07-18 00:24:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:24:45,228 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:45,228 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [233701001] [2020-07-18 00:24:45,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:45,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:24:45,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602700428] [2020-07-18 00:24:45,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-07-18 00:24:45,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:45,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:24:45,278 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:45,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:24:45,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:45,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:24:45,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:24:45,279 INFO L87 Difference]: Start difference. First operand 200 states and 222 transitions. Second operand 4 states. [2020-07-18 00:24:46,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:46,132 INFO L93 Difference]: Finished difference Result 321 states and 359 transitions. [2020-07-18 00:24:46,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:24:46,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-07-18 00:24:46,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:46,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:24:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 279 transitions. [2020-07-18 00:24:46,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:24:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 279 transitions. [2020-07-18 00:24:46,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 279 transitions. [2020-07-18 00:24:46,429 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 279 edges. 279 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:46,435 INFO L225 Difference]: With dead ends: 321 [2020-07-18 00:24:46,435 INFO L226 Difference]: Without dead ends: 202 [2020-07-18 00:24:46,436 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:24:46,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-07-18 00:24:46,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2020-07-18 00:24:46,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:46,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand 202 states. [2020-07-18 00:24:46,681 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 202 states. [2020-07-18 00:24:46,681 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 202 states. [2020-07-18 00:24:46,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:46,692 INFO L93 Difference]: Finished difference Result 202 states and 224 transitions. [2020-07-18 00:24:46,692 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2020-07-18 00:24:46,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:46,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:46,693 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 202 states. [2020-07-18 00:24:46,693 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 202 states. [2020-07-18 00:24:46,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:46,701 INFO L93 Difference]: Finished difference Result 202 states and 224 transitions. [2020-07-18 00:24:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2020-07-18 00:24:46,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:46,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:46,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:46,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:46,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-07-18 00:24:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 224 transitions. [2020-07-18 00:24:46,710 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 224 transitions. Word has length 54 [2020-07-18 00:24:46,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:46,711 INFO L479 AbstractCegarLoop]: Abstraction has 202 states and 224 transitions. [2020-07-18 00:24:46,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:24:46,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 202 states and 224 transitions. [2020-07-18 00:24:46,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2020-07-18 00:24:46,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-18 00:24:46,996 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:46,996 INFO L422 BasicCegarLoop]: 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] [2020-07-18 00:24:46,996 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:24:46,997 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:46,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:46,997 INFO L82 PathProgramCache]: Analyzing trace with hash 129316031, now seen corresponding path program 1 times [2020-07-18 00:24:46,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:46,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1572242575] [2020-07-18 00:24:46,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:47,206 INFO L280 TraceCheckUtils]: 0: Hoare triple {4328#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4317#true} is VALID [2020-07-18 00:24:47,207 INFO L280 TraceCheckUtils]: 1: Hoare triple {4317#true} #valid := #valid[0 := 0]; {4317#true} is VALID [2020-07-18 00:24:47,207 INFO L280 TraceCheckUtils]: 2: Hoare triple {4317#true} assume 0 < #StackHeapBarrier; {4317#true} is VALID [2020-07-18 00:24:47,207 INFO L280 TraceCheckUtils]: 3: Hoare triple {4317#true} assume true; {4317#true} is VALID [2020-07-18 00:24:47,208 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4317#true} {4317#true} #349#return; {4317#true} is VALID [2020-07-18 00:24:47,209 INFO L263 TraceCheckUtils]: 0: Hoare triple {4317#true} call ULTIMATE.init(); {4328#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:47,209 INFO L280 TraceCheckUtils]: 1: Hoare triple {4328#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4317#true} is VALID [2020-07-18 00:24:47,209 INFO L280 TraceCheckUtils]: 2: Hoare triple {4317#true} #valid := #valid[0 := 0]; {4317#true} is VALID [2020-07-18 00:24:47,210 INFO L280 TraceCheckUtils]: 3: Hoare triple {4317#true} assume 0 < #StackHeapBarrier; {4317#true} is VALID [2020-07-18 00:24:47,210 INFO L280 TraceCheckUtils]: 4: Hoare triple {4317#true} assume true; {4317#true} is VALID [2020-07-18 00:24:47,210 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4317#true} {4317#true} #349#return; {4317#true} is VALID [2020-07-18 00:24:47,210 INFO L263 TraceCheckUtils]: 6: Hoare triple {4317#true} call #t~ret41 := main(); {4317#true} is VALID [2020-07-18 00:24:47,211 INFO L280 TraceCheckUtils]: 7: Hoare triple {4317#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {4317#true} is VALID [2020-07-18 00:24:47,211 INFO L280 TraceCheckUtils]: 8: Hoare triple {4317#true} ~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset; {4317#true} is VALID [2020-07-18 00:24:47,211 INFO L280 TraceCheckUtils]: 9: Hoare triple {4317#true} havoc ~n~0.base, ~n~0.offset; {4317#true} is VALID [2020-07-18 00:24:47,211 INFO L280 TraceCheckUtils]: 10: Hoare triple {4317#true} SUMMARY for call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4); srcloc: L542 {4317#true} is VALID [2020-07-18 00:24:47,212 INFO L280 TraceCheckUtils]: 11: Hoare triple {4317#true} SUMMARY for call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); srcloc: L542-1 {4317#true} is VALID [2020-07-18 00:24:47,212 INFO L280 TraceCheckUtils]: 12: Hoare triple {4317#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {4317#true} is VALID [2020-07-18 00:24:47,212 INFO L280 TraceCheckUtils]: 13: Hoare triple {4317#true} assume !(0 != #t~nondet3); {4317#true} is VALID [2020-07-18 00:24:47,212 INFO L280 TraceCheckUtils]: 14: Hoare triple {4317#true} havoc #t~nondet3; {4317#true} is VALID [2020-07-18 00:24:47,213 INFO L280 TraceCheckUtils]: 15: Hoare triple {4317#true} ~n~0.base, ~n~0.offset := 0, 0; {4317#true} is VALID [2020-07-18 00:24:47,213 INFO L280 TraceCheckUtils]: 16: Hoare triple {4317#true} havoc ~pred~0.base, ~pred~0.offset; {4317#true} is VALID [2020-07-18 00:24:47,213 INFO L280 TraceCheckUtils]: 17: Hoare triple {4317#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0); {4317#true} is VALID [2020-07-18 00:24:47,213 INFO L280 TraceCheckUtils]: 18: Hoare triple {4317#true} ~pred~0.base, ~pred~0.offset := 0, 0; {4317#true} is VALID [2020-07-18 00:24:47,214 INFO L280 TraceCheckUtils]: 19: Hoare triple {4317#true} ~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {4317#true} is VALID [2020-07-18 00:24:47,214 INFO L280 TraceCheckUtils]: 20: Hoare triple {4317#true} SUMMARY for call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4); srcloc: L570-5 {4317#true} is VALID [2020-07-18 00:24:47,214 INFO L280 TraceCheckUtils]: 21: Hoare triple {4317#true} #t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {4317#true} is VALID [2020-07-18 00:24:47,215 INFO L280 TraceCheckUtils]: 22: Hoare triple {4317#true} assume !#t~short24; {4317#true} is VALID [2020-07-18 00:24:47,215 INFO L280 TraceCheckUtils]: 23: Hoare triple {4317#true} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4); srcloc: L568-4 {4317#true} is VALID [2020-07-18 00:24:47,215 INFO L280 TraceCheckUtils]: 24: Hoare triple {4317#true} #t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {4317#true} is VALID [2020-07-18 00:24:47,215 INFO L280 TraceCheckUtils]: 25: Hoare triple {4317#true} assume !#t~short24; {4317#true} is VALID [2020-07-18 00:24:47,216 INFO L280 TraceCheckUtils]: 26: Hoare triple {4317#true} havoc #t~mem23.base, #t~mem23.offset; {4317#true} is VALID [2020-07-18 00:24:47,216 INFO L280 TraceCheckUtils]: 27: Hoare triple {4317#true} havoc #t~short24; {4317#true} is VALID [2020-07-18 00:24:47,216 INFO L280 TraceCheckUtils]: 28: Hoare triple {4317#true} havoc #t~mem22.base, #t~mem22.offset; {4317#true} is VALID [2020-07-18 00:24:47,216 INFO L280 TraceCheckUtils]: 29: Hoare triple {4317#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0); {4317#true} is VALID [2020-07-18 00:24:47,217 INFO L280 TraceCheckUtils]: 30: Hoare triple {4317#true} ~root~0.base, ~root~0.offset := 0, 0; {4317#true} is VALID [2020-07-18 00:24:47,217 INFO L280 TraceCheckUtils]: 31: Hoare triple {4317#true} SUMMARY for call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); srcloc: L575 {4317#true} is VALID [2020-07-18 00:24:47,217 INFO L280 TraceCheckUtils]: 32: Hoare triple {4317#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {4317#true} is VALID [2020-07-18 00:24:47,218 INFO L280 TraceCheckUtils]: 33: Hoare triple {4317#true} SUMMARY for call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8); srcloc: L565-2 {4317#true} is VALID [2020-07-18 00:24:47,218 INFO L280 TraceCheckUtils]: 34: Hoare triple {4317#true} ~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {4317#true} is VALID [2020-07-18 00:24:47,218 INFO L280 TraceCheckUtils]: 35: Hoare triple {4317#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {4317#true} is VALID [2020-07-18 00:24:47,218 INFO L280 TraceCheckUtils]: 36: Hoare triple {4317#true} havoc ~t~0.base, ~t~0.offset; {4317#true} is VALID [2020-07-18 00:24:47,219 INFO L280 TraceCheckUtils]: 37: Hoare triple {4317#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4324#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:24:47,221 INFO L280 TraceCheckUtils]: 38: Hoare triple {4324#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {4324#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:24:47,221 INFO L280 TraceCheckUtils]: 39: Hoare triple {4324#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet30); {4324#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:24:47,222 INFO L280 TraceCheckUtils]: 40: Hoare triple {4324#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} havoc #t~nondet30; {4324#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:24:47,223 INFO L280 TraceCheckUtils]: 41: Hoare triple {4324#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {4324#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:24:47,224 INFO L280 TraceCheckUtils]: 42: Hoare triple {4324#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet33); {4324#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:24:47,225 INFO L280 TraceCheckUtils]: 43: Hoare triple {4324#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} havoc #t~nondet33; {4324#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-18 00:24:47,226 INFO L280 TraceCheckUtils]: 44: Hoare triple {4324#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L595-5 {4325#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-18 00:24:47,227 INFO L280 TraceCheckUtils]: 45: Hoare triple {4325#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4326#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:24:47,228 INFO L280 TraceCheckUtils]: 46: Hoare triple {4326#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L604-5 {4326#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:24:47,228 INFO L280 TraceCheckUtils]: 47: Hoare triple {4326#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem36); {4326#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:24:47,229 INFO L280 TraceCheckUtils]: 48: Hoare triple {4326#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} havoc #t~mem36; {4326#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:24:47,230 INFO L280 TraceCheckUtils]: 49: Hoare triple {4326#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L606-4 {4326#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:24:47,231 INFO L280 TraceCheckUtils]: 50: Hoare triple {4326#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem38); {4326#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:24:47,231 INFO L280 TraceCheckUtils]: 51: Hoare triple {4326#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} havoc #t~mem38; {4326#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-18 00:24:47,232 INFO L280 TraceCheckUtils]: 52: Hoare triple {4326#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L606-5 {4327#(= |main_#t~mem40| 3)} is VALID [2020-07-18 00:24:47,233 INFO L280 TraceCheckUtils]: 53: Hoare triple {4327#(= |main_#t~mem40| 3)} assume 3 != #t~mem40; {4318#false} is VALID [2020-07-18 00:24:47,233 INFO L280 TraceCheckUtils]: 54: Hoare triple {4318#false} havoc #t~mem40; {4318#false} is VALID [2020-07-18 00:24:47,234 INFO L280 TraceCheckUtils]: 55: Hoare triple {4318#false} assume !false; {4318#false} is VALID [2020-07-18 00:24:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:24:47,238 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:47,239 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1572242575] [2020-07-18 00:24:47,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:47,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 00:24:47,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963448805] [2020-07-18 00:24:47,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-07-18 00:24:47,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:47,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 00:24:47,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:47,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 00:24:47,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:47,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 00:24:47,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:24:47,297 INFO L87 Difference]: Start difference. First operand 202 states and 224 transitions. Second operand 7 states. [2020-07-18 00:24:48,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:48,923 INFO L93 Difference]: Finished difference Result 279 states and 306 transitions. [2020-07-18 00:24:48,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:24:48,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-07-18 00:24:48,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:24:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 265 transitions. [2020-07-18 00:24:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:24:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 265 transitions. [2020-07-18 00:24:48,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 265 transitions. [2020-07-18 00:24:49,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:49,204 INFO L225 Difference]: With dead ends: 279 [2020-07-18 00:24:49,204 INFO L226 Difference]: Without dead ends: 273 [2020-07-18 00:24:49,206 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-18 00:24:49,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-07-18 00:24:49,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 215. [2020-07-18 00:24:49,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:49,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand 215 states. [2020-07-18 00:24:49,533 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand 215 states. [2020-07-18 00:24:49,533 INFO L87 Difference]: Start difference. First operand 273 states. Second operand 215 states. [2020-07-18 00:24:49,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:49,544 INFO L93 Difference]: Finished difference Result 273 states and 300 transitions. [2020-07-18 00:24:49,544 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 300 transitions. [2020-07-18 00:24:49,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:49,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:49,545 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand 273 states. [2020-07-18 00:24:49,546 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 273 states. [2020-07-18 00:24:49,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:49,556 INFO L93 Difference]: Finished difference Result 273 states and 300 transitions. [2020-07-18 00:24:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 300 transitions. [2020-07-18 00:24:49,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:49,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:49,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:49,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-07-18 00:24:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 240 transitions. [2020-07-18 00:24:49,566 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 240 transitions. Word has length 56 [2020-07-18 00:24:49,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:49,566 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 240 transitions. [2020-07-18 00:24:49,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 00:24:49,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 215 states and 240 transitions. [2020-07-18 00:24:49,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:49,907 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 240 transitions. [2020-07-18 00:24:49,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-18 00:24:49,908 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:49,908 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-18 00:24:49,909 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:24:49,909 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:49,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:49,909 INFO L82 PathProgramCache]: Analyzing trace with hash 593034583, now seen corresponding path program 1 times [2020-07-18 00:24:49,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:49,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [96845695] [2020-07-18 00:24:49,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:49,938 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:24:49,939 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:458) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:290) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) 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:317) 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) [2020-07-18 00:24:49,946 INFO L168 Benchmark]: Toolchain (without parser) took 11434.87 ms. Allocated memory was 136.8 MB in the beginning and 360.2 MB in the end (delta: 223.3 MB). Free memory was 100.7 MB in the beginning and 323.2 MB in the end (delta: -222.5 MB). Peak memory consumption was 853.5 kB. Max. memory is 7.1 GB. [2020-07-18 00:24:49,947 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 136.8 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 00:24:49,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.11 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 100.3 MB in the beginning and 166.6 MB in the end (delta: -66.3 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:24:49,949 INFO L168 Benchmark]: Boogie Preprocessor took 88.85 ms. Allocated memory is still 201.9 MB. Free memory was 166.6 MB in the beginning and 162.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:24:49,950 INFO L168 Benchmark]: RCFGBuilder took 1110.70 ms. Allocated memory was 201.9 MB in the beginning and 231.7 MB in the end (delta: 29.9 MB). Free memory was 162.6 MB in the beginning and 184.3 MB in the end (delta: -21.7 MB). Peak memory consumption was 83.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:24:49,951 INFO L168 Benchmark]: TraceAbstraction took 9555.86 ms. Allocated memory was 231.7 MB in the beginning and 360.2 MB in the end (delta: 128.5 MB). Free memory was 184.3 MB in the beginning and 323.2 MB in the end (delta: -139.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 00:24:49,954 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 136.8 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 671.11 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 100.3 MB in the beginning and 166.6 MB in the end (delta: -66.3 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 88.85 ms. Allocated memory is still 201.9 MB. Free memory was 166.6 MB in the beginning and 162.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1110.70 ms. Allocated memory was 201.9 MB in the beginning and 231.7 MB in the end (delta: 29.9 MB). Free memory was 162.6 MB in the beginning and 184.3 MB in the end (delta: -21.7 MB). Peak memory consumption was 83.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9555.86 ms. Allocated memory was 231.7 MB in the beginning and 360.2 MB in the end (delta: 128.5 MB). Free memory was 184.3 MB in the beginning and 323.2 MB in the end (delta: -139.0 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...