java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-manipulation/tree_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:21:47,903 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:21:47,905 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:21:47,917 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:21:47,918 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:21:47,919 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:21:47,920 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:21:47,922 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:21:47,924 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:21:47,925 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:21:47,926 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:21:47,926 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:21:47,927 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:21:47,928 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:21:47,929 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:21:47,930 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:21:47,931 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:21:47,933 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:21:47,935 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:21:47,937 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:21:47,938 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:21:47,939 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:21:47,942 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:21:47,942 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:21:47,942 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:21:47,943 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:21:47,945 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:21:47,945 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:21:47,946 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:21:47,948 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:21:47,948 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:21:47,949 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:21:47,949 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:21:47,949 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:21:47,950 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:21:47,951 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:21:47,952 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:21:47,968 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:21:47,968 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:21:47,969 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:21:47,969 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:21:47,970 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:21:47,970 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:21:47,970 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:21:47,970 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:21:47,971 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:21:47,971 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:21:47,971 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:21:47,971 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:21:47,971 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:21:47,972 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:21:47,972 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:21:47,972 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:21:47,972 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:21:47,972 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:21:47,973 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:21:47,973 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:21:47,973 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:21:47,973 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:21:47,973 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:21:47,973 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:21:47,974 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:21:47,974 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:21:47,974 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:21:47,974 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:21:47,974 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:21:47,975 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:21:48,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:21:48,029 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:21:48,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:21:48,034 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:21:48,035 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:21:48,036 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/tree_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:21:48,095 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa7dd9d74/6b789db08406419a990745592e6ba19f/FLAG51a461dac [2018-11-14 17:21:48,624 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:21:48,625 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/tree_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:21:48,653 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa7dd9d74/6b789db08406419a990745592e6ba19f/FLAG51a461dac [2018-11-14 17:21:48,668 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa7dd9d74/6b789db08406419a990745592e6ba19f [2018-11-14 17:21:48,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:21:48,681 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:21:48,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:21:48,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:21:48,686 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:21:48,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:21:48" (1/1) ... [2018-11-14 17:21:48,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@727b9634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:48, skipping insertion in model container [2018-11-14 17:21:48,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:21:48" (1/1) ... [2018-11-14 17:21:48,702 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:21:48,750 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:21:49,193 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:21:49,211 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:21:49,284 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:21:49,438 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:21:49,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:49 WrapperNode [2018-11-14 17:21:49,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:21:49,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:21:49,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:21:49,440 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:21:49,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:49" (1/1) ... [2018-11-14 17:21:49,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:49" (1/1) ... [2018-11-14 17:21:49,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:49" (1/1) ... [2018-11-14 17:21:49,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:49" (1/1) ... [2018-11-14 17:21:49,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:49" (1/1) ... [2018-11-14 17:21:49,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:49" (1/1) ... [2018-11-14 17:21:49,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:49" (1/1) ... [2018-11-14 17:21:49,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:21:49,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:21:49,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:21:49,536 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:21:49,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:49" (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 [2018-11-14 17:21:49,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:21:49,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:21:49,605 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 17:21:49,605 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 17:21:49,606 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-11-14 17:21:49,606 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2018-11-14 17:21:49,606 INFO L138 BoogieDeclarations]: Found implementation of procedure create_tree [2018-11-14 17:21:49,606 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tree [2018-11-14 17:21:49,606 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:21:49,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:21:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 17:21:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 17:21:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 17:21:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 17:21:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 17:21:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 17:21:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 17:21:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 17:21:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 17:21:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 17:21:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 17:21:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 17:21:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 17:21:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 17:21:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 17:21:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 17:21:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 17:21:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 17:21:49,610 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 17:21:49,610 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 17:21:49,610 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 17:21:49,610 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 17:21:49,610 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 17:21:49,610 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 17:21:49,611 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 17:21:49,611 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 17:21:49,611 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 17:21:49,611 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 17:21:49,611 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 17:21:49,611 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 17:21:49,611 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 17:21:49,612 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 17:21:49,612 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 17:21:49,612 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 17:21:49,612 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 17:21:49,612 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 17:21:49,612 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 17:21:49,613 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 17:21:49,613 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 17:21:49,613 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 17:21:49,613 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 17:21:49,613 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 17:21:49,613 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 17:21:49,614 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 17:21:49,614 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 17:21:49,614 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 17:21:49,614 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 17:21:49,614 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 17:21:49,614 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 17:21:49,614 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 17:21:49,615 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 17:21:49,615 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 17:21:49,615 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:21:49,615 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 17:21:49,615 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 17:21:49,615 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 17:21:49,615 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 17:21:49,616 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 17:21:49,616 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 17:21:49,616 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 17:21:49,616 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 17:21:49,616 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 17:21:49,616 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 17:21:49,617 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 17:21:49,617 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 17:21:49,617 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 17:21:49,617 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 17:21:49,617 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 17:21:49,617 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 17:21:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 17:21:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 17:21:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 17:21:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 17:21:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 17:21:49,619 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 17:21:49,619 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 17:21:49,619 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 17:21:49,619 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 17:21:49,619 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 17:21:49,619 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 17:21:49,620 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 17:21:49,620 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 17:21:49,620 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 17:21:49,620 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 17:21:49,620 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 17:21:49,620 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 17:21:49,621 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 17:21:49,621 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 17:21:49,621 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 17:21:49,621 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 17:21:49,621 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 17:21:49,621 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 17:21:49,622 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 17:21:49,622 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 17:21:49,622 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 17:21:49,622 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 17:21:49,622 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 17:21:49,622 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 17:21:49,623 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 17:21:49,623 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 17:21:49,623 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 17:21:49,623 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 17:21:49,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:21:49,623 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-11-14 17:21:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2018-11-14 17:21:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:21:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:21:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure create_tree [2018-11-14 17:21:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:21:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:21:49,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:21:49,625 INFO L130 BoogieDeclarations]: Found specification of procedure free_tree [2018-11-14 17:21:49,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:21:49,625 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:21:49,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:21:49,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:21:49,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:21:50,868 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:21:50,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:21:50 BoogieIcfgContainer [2018-11-14 17:21:50,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:21:50,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:21:50,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:21:50,874 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:21:50,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:21:48" (1/3) ... [2018-11-14 17:21:50,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a7b399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:21:50, skipping insertion in model container [2018-11-14 17:21:50,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:49" (2/3) ... [2018-11-14 17:21:50,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a7b399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:21:50, skipping insertion in model container [2018-11-14 17:21:50,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:21:50" (3/3) ... [2018-11-14 17:21:50,878 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:21:50,888 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:21:50,897 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:21:50,915 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:21:50,949 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:21:50,950 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:21:50,950 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:21:50,951 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:21:50,951 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:21:50,953 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:21:50,953 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:21:50,954 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:21:50,954 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:21:50,976 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2018-11-14 17:21:50,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:21:50,983 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:21:50,984 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:21:50,987 INFO L423 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:21:50,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:21:50,993 INFO L82 PathProgramCache]: Analyzing trace with hash -887985475, now seen corresponding path program 1 times [2018-11-14 17:21:50,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:21:50,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:21:51,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:51,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:21:51,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:21:51,141 INFO L256 TraceCheckUtils]: 0: Hoare triple {70#true} call ULTIMATE.init(); {70#true} is VALID [2018-11-14 17:21:51,145 INFO L273 TraceCheckUtils]: 1: Hoare triple {70#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {70#true} is VALID [2018-11-14 17:21:51,146 INFO L273 TraceCheckUtils]: 2: Hoare triple {70#true} assume true; {70#true} is VALID [2018-11-14 17:21:51,147 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {70#true} {70#true} #215#return; {70#true} is VALID [2018-11-14 17:21:51,148 INFO L256 TraceCheckUtils]: 4: Hoare triple {70#true} call #t~ret24 := main(); {70#true} is VALID [2018-11-14 17:21:51,148 INFO L256 TraceCheckUtils]: 5: Hoare triple {70#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {70#true} is VALID [2018-11-14 17:21:51,148 INFO L273 TraceCheckUtils]: 6: Hoare triple {70#true} ~nodelast~0.base, ~nodelast~0.offset := 0, 0;~node~0.base, ~node~0.offset := 0, 0; {70#true} is VALID [2018-11-14 17:21:51,154 INFO L273 TraceCheckUtils]: 7: Hoare triple {70#true} assume !true; {71#false} is VALID [2018-11-14 17:21:51,154 INFO L273 TraceCheckUtils]: 8: Hoare triple {71#false} assume ~node~0.base != 0 || ~node~0.offset != 0;call write~$Pointer$(0, 0, ~node~0.base, ~node~0.offset + 8, 4); {71#false} is VALID [2018-11-14 17:21:51,155 INFO L273 TraceCheckUtils]: 9: Hoare triple {71#false} assume !true; {71#false} is VALID [2018-11-14 17:21:51,155 INFO L273 TraceCheckUtils]: 10: Hoare triple {71#false} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {71#false} is VALID [2018-11-14 17:21:51,155 INFO L273 TraceCheckUtils]: 11: Hoare triple {71#false} assume true; {71#false} is VALID [2018-11-14 17:21:51,156 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {71#false} {70#true} #203#return; {71#false} is VALID [2018-11-14 17:21:51,156 INFO L273 TraceCheckUtils]: 13: Hoare triple {71#false} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {71#false} is VALID [2018-11-14 17:21:51,156 INFO L273 TraceCheckUtils]: 14: Hoare triple {71#false} assume !(~data~0.base == 0 && ~data~0.offset == 0); {71#false} is VALID [2018-11-14 17:21:51,157 INFO L256 TraceCheckUtils]: 15: Hoare triple {71#false} call inspect(~data~0.base, ~data~0.offset); {71#false} is VALID [2018-11-14 17:21:51,157 INFO L273 TraceCheckUtils]: 16: Hoare triple {71#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {71#false} is VALID [2018-11-14 17:21:51,157 INFO L273 TraceCheckUtils]: 17: Hoare triple {71#false} assume true; {71#false} is VALID [2018-11-14 17:21:51,158 INFO L273 TraceCheckUtils]: 18: Hoare triple {71#false} assume ~node.base == 0 && ~node.offset == 0; {71#false} is VALID [2018-11-14 17:21:51,158 INFO L256 TraceCheckUtils]: 19: Hoare triple {71#false} call fail(); {71#false} is VALID [2018-11-14 17:21:51,158 INFO L273 TraceCheckUtils]: 20: Hoare triple {71#false} assume !false; {71#false} is VALID [2018-11-14 17:21:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:21:51,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:21:51,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:21:51,171 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-14 17:21:51,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:21:51,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:21:51,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:51,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:21:51,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:21:51,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:21:51,508 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 2 states. [2018-11-14 17:21:52,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:52,114 INFO L93 Difference]: Finished difference Result 125 states and 186 transitions. [2018-11-14 17:21:52,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:21:52,114 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-14 17:21:52,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:21:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:21:52,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 186 transitions. [2018-11-14 17:21:52,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:21:52,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 186 transitions. [2018-11-14 17:21:52,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 186 transitions. [2018-11-14 17:21:52,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:52,823 INFO L225 Difference]: With dead ends: 125 [2018-11-14 17:21:52,823 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 17:21:52,827 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:21:52,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 17:21:52,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-14 17:21:52,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:21:52,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-14 17:21:52,923 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 17:21:52,923 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 17:21:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:52,928 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-14 17:21:52,929 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-14 17:21:52,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:52,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:52,930 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 17:21:52,930 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 17:21:52,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:52,935 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-14 17:21:52,935 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-14 17:21:52,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:52,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:52,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:21:52,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:21:52,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 17:21:52,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-14 17:21:52,944 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 21 [2018-11-14 17:21:52,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:21:52,944 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-14 17:21:52,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:21:52,944 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-14 17:21:52,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 17:21:52,947 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:21:52,948 INFO L375 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] [2018-11-14 17:21:52,948 INFO L423 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:21:52,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:21:52,948 INFO L82 PathProgramCache]: Analyzing trace with hash 955978790, now seen corresponding path program 1 times [2018-11-14 17:21:52,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:21:52,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:21:52,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:52,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:21:52,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:21:53,121 INFO L256 TraceCheckUtils]: 0: Hoare triple {374#true} call ULTIMATE.init(); {374#true} is VALID [2018-11-14 17:21:53,121 INFO L273 TraceCheckUtils]: 1: Hoare triple {374#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {374#true} is VALID [2018-11-14 17:21:53,122 INFO L273 TraceCheckUtils]: 2: Hoare triple {374#true} assume true; {374#true} is VALID [2018-11-14 17:21:53,122 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {374#true} {374#true} #215#return; {374#true} is VALID [2018-11-14 17:21:53,122 INFO L256 TraceCheckUtils]: 4: Hoare triple {374#true} call #t~ret24 := main(); {374#true} is VALID [2018-11-14 17:21:53,122 INFO L256 TraceCheckUtils]: 5: Hoare triple {374#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {374#true} is VALID [2018-11-14 17:21:53,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {374#true} ~nodelast~0.base, ~nodelast~0.offset := 0, 0;~node~0.base, ~node~0.offset := 0, 0; {376#(and (= create_tree_~node~0.offset 0) (= create_tree_~node~0.base 0))} is VALID [2018-11-14 17:21:53,124 INFO L273 TraceCheckUtils]: 7: Hoare triple {376#(and (= create_tree_~node~0.offset 0) (= create_tree_~node~0.base 0))} assume true; {376#(and (= create_tree_~node~0.offset 0) (= create_tree_~node~0.base 0))} is VALID [2018-11-14 17:21:53,124 INFO L273 TraceCheckUtils]: 8: Hoare triple {376#(and (= create_tree_~node~0.offset 0) (= create_tree_~node~0.base 0))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {376#(and (= create_tree_~node~0.offset 0) (= create_tree_~node~0.base 0))} is VALID [2018-11-14 17:21:53,135 INFO L273 TraceCheckUtils]: 9: Hoare triple {376#(and (= create_tree_~node~0.offset 0) (= create_tree_~node~0.base 0))} assume !(#t~nondet7 != 0);havoc #t~nondet7; {376#(and (= create_tree_~node~0.offset 0) (= create_tree_~node~0.base 0))} is VALID [2018-11-14 17:21:53,137 INFO L273 TraceCheckUtils]: 10: Hoare triple {376#(and (= create_tree_~node~0.offset 0) (= create_tree_~node~0.base 0))} assume ~node~0.base != 0 || ~node~0.offset != 0;call write~$Pointer$(0, 0, ~node~0.base, ~node~0.offset + 8, 4); {375#false} is VALID [2018-11-14 17:21:53,137 INFO L273 TraceCheckUtils]: 11: Hoare triple {375#false} assume true; {375#false} is VALID [2018-11-14 17:21:53,137 INFO L273 TraceCheckUtils]: 12: Hoare triple {375#false} assume !(~node~0.base != 0 || ~node~0.offset != 0); {375#false} is VALID [2018-11-14 17:21:53,138 INFO L273 TraceCheckUtils]: 13: Hoare triple {375#false} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {375#false} is VALID [2018-11-14 17:21:53,138 INFO L273 TraceCheckUtils]: 14: Hoare triple {375#false} assume true; {375#false} is VALID [2018-11-14 17:21:53,138 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {375#false} {374#true} #203#return; {375#false} is VALID [2018-11-14 17:21:53,139 INFO L273 TraceCheckUtils]: 16: Hoare triple {375#false} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {375#false} is VALID [2018-11-14 17:21:53,139 INFO L273 TraceCheckUtils]: 17: Hoare triple {375#false} assume !(~data~0.base == 0 && ~data~0.offset == 0); {375#false} is VALID [2018-11-14 17:21:53,140 INFO L256 TraceCheckUtils]: 18: Hoare triple {375#false} call inspect(~data~0.base, ~data~0.offset); {375#false} is VALID [2018-11-14 17:21:53,140 INFO L273 TraceCheckUtils]: 19: Hoare triple {375#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {375#false} is VALID [2018-11-14 17:21:53,140 INFO L273 TraceCheckUtils]: 20: Hoare triple {375#false} assume true; {375#false} is VALID [2018-11-14 17:21:53,141 INFO L273 TraceCheckUtils]: 21: Hoare triple {375#false} assume ~node.base == 0 && ~node.offset == 0; {375#false} is VALID [2018-11-14 17:21:53,141 INFO L256 TraceCheckUtils]: 22: Hoare triple {375#false} call fail(); {375#false} is VALID [2018-11-14 17:21:53,141 INFO L273 TraceCheckUtils]: 23: Hoare triple {375#false} assume !false; {375#false} is VALID [2018-11-14 17:21:53,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:21:53,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:21:53,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:21:53,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 17:21:53,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:21:53,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:21:53,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:53,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:21:53,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:21:53,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:21:53,223 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 3 states. [2018-11-14 17:21:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:53,409 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2018-11-14 17:21:53,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:21:53,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 17:21:53,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:21:53,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:21:53,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-14 17:21:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:21:53,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-14 17:21:53,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2018-11-14 17:21:53,549 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:53,552 INFO L225 Difference]: With dead ends: 79 [2018-11-14 17:21:53,552 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 17:21:53,553 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:21:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 17:21:53,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-14 17:21:53,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:21:53,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-14 17:21:53,579 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 17:21:53,579 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 17:21:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:53,583 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-14 17:21:53,583 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-11-14 17:21:53,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:53,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:53,585 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 17:21:53,585 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 17:21:53,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:53,589 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-14 17:21:53,589 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-11-14 17:21:53,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:53,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:53,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:21:53,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:21:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 17:21:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2018-11-14 17:21:53,594 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 24 [2018-11-14 17:21:53,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:21:53,594 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2018-11-14 17:21:53,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:21:53,595 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-11-14 17:21:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 17:21:53,596 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:21:53,596 INFO L375 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] [2018-11-14 17:21:53,596 INFO L423 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:21:53,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:21:53,597 INFO L82 PathProgramCache]: Analyzing trace with hash -55138460, now seen corresponding path program 1 times [2018-11-14 17:21:53,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:21:53,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:21:53,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:53,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:21:53,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:21:53,831 INFO L256 TraceCheckUtils]: 0: Hoare triple {646#true} call ULTIMATE.init(); {646#true} is VALID [2018-11-14 17:21:53,831 INFO L273 TraceCheckUtils]: 1: Hoare triple {646#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {646#true} is VALID [2018-11-14 17:21:53,831 INFO L273 TraceCheckUtils]: 2: Hoare triple {646#true} assume true; {646#true} is VALID [2018-11-14 17:21:53,832 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {646#true} {646#true} #215#return; {646#true} is VALID [2018-11-14 17:21:53,832 INFO L256 TraceCheckUtils]: 4: Hoare triple {646#true} call #t~ret24 := main(); {646#true} is VALID [2018-11-14 17:21:53,832 INFO L256 TraceCheckUtils]: 5: Hoare triple {646#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {646#true} is VALID [2018-11-14 17:21:53,836 INFO L273 TraceCheckUtils]: 6: Hoare triple {646#true} ~nodelast~0.base, ~nodelast~0.offset := 0, 0;~node~0.base, ~node~0.offset := 0, 0; {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} is VALID [2018-11-14 17:21:53,837 INFO L273 TraceCheckUtils]: 7: Hoare triple {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} assume true; {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} is VALID [2018-11-14 17:21:53,838 INFO L273 TraceCheckUtils]: 8: Hoare triple {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} is VALID [2018-11-14 17:21:53,838 INFO L273 TraceCheckUtils]: 9: Hoare triple {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} assume !(#t~nondet7 != 0);havoc #t~nondet7; {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} is VALID [2018-11-14 17:21:53,840 INFO L273 TraceCheckUtils]: 10: Hoare triple {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} assume !(~node~0.base != 0 || ~node~0.offset != 0); {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} is VALID [2018-11-14 17:21:53,841 INFO L273 TraceCheckUtils]: 11: Hoare triple {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} assume true; {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} is VALID [2018-11-14 17:21:53,842 INFO L273 TraceCheckUtils]: 12: Hoare triple {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} assume !(~node~0.base != 0 || ~node~0.offset != 0); {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} is VALID [2018-11-14 17:21:53,864 INFO L273 TraceCheckUtils]: 13: Hoare triple {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {649#(and (= 0 |create_tree_#res.base|) (= 0 |create_tree_#res.offset|))} is VALID [2018-11-14 17:21:53,876 INFO L273 TraceCheckUtils]: 14: Hoare triple {649#(and (= 0 |create_tree_#res.base|) (= 0 |create_tree_#res.offset|))} assume true; {649#(and (= 0 |create_tree_#res.base|) (= 0 |create_tree_#res.offset|))} is VALID [2018-11-14 17:21:53,880 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {649#(and (= 0 |create_tree_#res.base|) (= 0 |create_tree_#res.offset|))} {646#true} #203#return; {650#(and (= 0 |main_#t~ret23.base|) (= 0 |main_#t~ret23.offset|))} is VALID [2018-11-14 17:21:53,889 INFO L273 TraceCheckUtils]: 16: Hoare triple {650#(and (= 0 |main_#t~ret23.base|) (= 0 |main_#t~ret23.offset|))} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {651#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base))} is VALID [2018-11-14 17:21:53,891 INFO L273 TraceCheckUtils]: 17: Hoare triple {651#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {647#false} is VALID [2018-11-14 17:21:53,892 INFO L256 TraceCheckUtils]: 18: Hoare triple {647#false} call inspect(~data~0.base, ~data~0.offset); {647#false} is VALID [2018-11-14 17:21:53,892 INFO L273 TraceCheckUtils]: 19: Hoare triple {647#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {647#false} is VALID [2018-11-14 17:21:53,892 INFO L273 TraceCheckUtils]: 20: Hoare triple {647#false} assume true; {647#false} is VALID [2018-11-14 17:21:53,893 INFO L273 TraceCheckUtils]: 21: Hoare triple {647#false} assume ~node.base == 0 && ~node.offset == 0; {647#false} is VALID [2018-11-14 17:21:53,893 INFO L256 TraceCheckUtils]: 22: Hoare triple {647#false} call fail(); {647#false} is VALID [2018-11-14 17:21:53,893 INFO L273 TraceCheckUtils]: 23: Hoare triple {647#false} assume !false; {647#false} is VALID [2018-11-14 17:21:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:21:53,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:21:53,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:21:53,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-14 17:21:53,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:21:53,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:21:53,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:53,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:21:53,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:21:53,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:21:53,931 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand 6 states. [2018-11-14 17:21:54,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:54,306 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2018-11-14 17:21:54,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:21:54,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-14 17:21:54,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:21:54,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:21:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2018-11-14 17:21:54,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:21:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2018-11-14 17:21:54,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 112 transitions. [2018-11-14 17:21:54,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:54,506 INFO L225 Difference]: With dead ends: 100 [2018-11-14 17:21:54,506 INFO L226 Difference]: Without dead ends: 53 [2018-11-14 17:21:54,507 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:21:54,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-14 17:21:54,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-11-14 17:21:54,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:21:54,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 52 states. [2018-11-14 17:21:54,538 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 52 states. [2018-11-14 17:21:54,538 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 52 states. [2018-11-14 17:21:54,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:54,541 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-14 17:21:54,542 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-14 17:21:54,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:54,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:54,543 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 53 states. [2018-11-14 17:21:54,543 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 53 states. [2018-11-14 17:21:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:54,546 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-14 17:21:54,546 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-14 17:21:54,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:54,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:54,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:21:54,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:21:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 17:21:54,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-11-14 17:21:54,551 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 24 [2018-11-14 17:21:54,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:21:54,551 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-14 17:21:54,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:21:54,551 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-14 17:21:54,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 17:21:54,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:21:54,553 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:21:54,553 INFO L423 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:21:54,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:21:54,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1484430908, now seen corresponding path program 1 times [2018-11-14 17:21:54,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:21:54,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:21:54,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:54,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:21:54,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:21:54,633 INFO L256 TraceCheckUtils]: 0: Hoare triple {953#true} call ULTIMATE.init(); {953#true} is VALID [2018-11-14 17:21:54,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {953#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {953#true} is VALID [2018-11-14 17:21:54,634 INFO L273 TraceCheckUtils]: 2: Hoare triple {953#true} assume true; {953#true} is VALID [2018-11-14 17:21:54,634 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {953#true} {953#true} #215#return; {953#true} is VALID [2018-11-14 17:21:54,635 INFO L256 TraceCheckUtils]: 4: Hoare triple {953#true} call #t~ret24 := main(); {953#true} is VALID [2018-11-14 17:21:54,635 INFO L256 TraceCheckUtils]: 5: Hoare triple {953#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {953#true} is VALID [2018-11-14 17:21:54,635 INFO L273 TraceCheckUtils]: 6: Hoare triple {953#true} ~nodelast~0.base, ~nodelast~0.offset := 0, 0;~node~0.base, ~node~0.offset := 0, 0; {953#true} is VALID [2018-11-14 17:21:54,636 INFO L273 TraceCheckUtils]: 7: Hoare triple {953#true} assume true; {953#true} is VALID [2018-11-14 17:21:54,636 INFO L273 TraceCheckUtils]: 8: Hoare triple {953#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {953#true} is VALID [2018-11-14 17:21:54,637 INFO L273 TraceCheckUtils]: 9: Hoare triple {953#true} assume !!(#t~nondet7 != 0);havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(16);~node~0.base, ~node~0.offset := #t~malloc8.base, #t~malloc8.offset; {955#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 17:21:54,637 INFO L273 TraceCheckUtils]: 10: Hoare triple {955#(not (= create_tree_~node~0.base 0))} assume !(~node~0.base == 0 && ~node~0.offset == 0); {955#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 17:21:54,639 INFO L273 TraceCheckUtils]: 11: Hoare triple {955#(not (= create_tree_~node~0.base 0))} call write~$Pointer$(0, 0, ~node~0.base, ~node~0.offset + 0, 4);call write~$Pointer$(~nodelast~0.base, ~nodelast~0.offset, ~node~0.base, ~node~0.offset + 4, 4); {955#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 17:21:54,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {955#(not (= create_tree_~node~0.base 0))} assume !(~nodelast~0.base != 0 || ~nodelast~0.offset != 0); {955#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 17:21:54,642 INFO L273 TraceCheckUtils]: 13: Hoare triple {955#(not (= create_tree_~node~0.base 0))} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~value~0 := #t~nondet9;havoc #t~nondet9;call write~int(~value~0, ~node~0.base, ~node~0.offset + 12, 4);~nodelast~0.base, ~nodelast~0.offset := ~node~0.base, ~node~0.offset; {955#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 17:21:54,643 INFO L273 TraceCheckUtils]: 14: Hoare triple {955#(not (= create_tree_~node~0.base 0))} assume true; {955#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 17:21:54,643 INFO L273 TraceCheckUtils]: 15: Hoare triple {955#(not (= create_tree_~node~0.base 0))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {955#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 17:21:54,648 INFO L273 TraceCheckUtils]: 16: Hoare triple {955#(not (= create_tree_~node~0.base 0))} assume !(#t~nondet7 != 0);havoc #t~nondet7; {955#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 17:21:54,648 INFO L273 TraceCheckUtils]: 17: Hoare triple {955#(not (= create_tree_~node~0.base 0))} assume ~node~0.base != 0 || ~node~0.offset != 0;call write~$Pointer$(0, 0, ~node~0.base, ~node~0.offset + 8, 4); {955#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 17:21:54,650 INFO L273 TraceCheckUtils]: 18: Hoare triple {955#(not (= create_tree_~node~0.base 0))} assume true; {955#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 17:21:54,650 INFO L273 TraceCheckUtils]: 19: Hoare triple {955#(not (= create_tree_~node~0.base 0))} assume !(~node~0.base != 0 || ~node~0.offset != 0); {954#false} is VALID [2018-11-14 17:21:54,650 INFO L273 TraceCheckUtils]: 20: Hoare triple {954#false} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {954#false} is VALID [2018-11-14 17:21:54,651 INFO L273 TraceCheckUtils]: 21: Hoare triple {954#false} assume true; {954#false} is VALID [2018-11-14 17:21:54,651 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {954#false} {953#true} #203#return; {954#false} is VALID [2018-11-14 17:21:54,652 INFO L273 TraceCheckUtils]: 23: Hoare triple {954#false} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {954#false} is VALID [2018-11-14 17:21:54,652 INFO L273 TraceCheckUtils]: 24: Hoare triple {954#false} assume !(~data~0.base == 0 && ~data~0.offset == 0); {954#false} is VALID [2018-11-14 17:21:54,653 INFO L256 TraceCheckUtils]: 25: Hoare triple {954#false} call inspect(~data~0.base, ~data~0.offset); {954#false} is VALID [2018-11-14 17:21:54,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {954#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {954#false} is VALID [2018-11-14 17:21:54,654 INFO L273 TraceCheckUtils]: 27: Hoare triple {954#false} assume true; {954#false} is VALID [2018-11-14 17:21:54,654 INFO L273 TraceCheckUtils]: 28: Hoare triple {954#false} assume ~node.base == 0 && ~node.offset == 0; {954#false} is VALID [2018-11-14 17:21:54,654 INFO L256 TraceCheckUtils]: 29: Hoare triple {954#false} call fail(); {954#false} is VALID [2018-11-14 17:21:54,655 INFO L273 TraceCheckUtils]: 30: Hoare triple {954#false} assume !false; {954#false} is VALID [2018-11-14 17:21:54,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:21:54,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:21:54,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:21:54,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 17:21:54,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:21:54,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:21:54,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:54,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:21:54,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:21:54,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:21:54,741 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 3 states. [2018-11-14 17:21:55,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:55,008 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2018-11-14 17:21:55,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:21:55,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 17:21:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:21:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:21:55,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2018-11-14 17:21:55,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:21:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2018-11-14 17:21:55,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 89 transitions. [2018-11-14 17:21:55,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:55,194 INFO L225 Difference]: With dead ends: 81 [2018-11-14 17:21:55,194 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 17:21:55,195 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:21:55,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 17:21:55,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-14 17:21:55,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:21:55,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 52 states. [2018-11-14 17:21:55,227 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 52 states. [2018-11-14 17:21:55,227 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 52 states. [2018-11-14 17:21:55,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:55,230 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-14 17:21:55,230 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-14 17:21:55,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:55,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:55,232 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 54 states. [2018-11-14 17:21:55,232 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 54 states. [2018-11-14 17:21:55,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:55,235 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-14 17:21:55,235 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-14 17:21:55,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:55,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:55,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:21:55,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:21:55,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 17:21:55,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-11-14 17:21:55,240 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 31 [2018-11-14 17:21:55,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:21:55,241 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-11-14 17:21:55,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:21:55,241 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-14 17:21:55,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 17:21:55,242 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:21:55,242 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:21:55,247 INFO L423 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:21:55,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:21:55,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1103659356, now seen corresponding path program 1 times [2018-11-14 17:21:55,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:21:55,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:21:55,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:55,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:21:55,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:21:55,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {1237#true} call ULTIMATE.init(); {1237#true} is VALID [2018-11-14 17:21:55,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {1237#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1237#true} is VALID [2018-11-14 17:21:55,513 INFO L273 TraceCheckUtils]: 2: Hoare triple {1237#true} assume true; {1237#true} is VALID [2018-11-14 17:21:55,514 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1237#true} {1237#true} #215#return; {1237#true} is VALID [2018-11-14 17:21:55,514 INFO L256 TraceCheckUtils]: 4: Hoare triple {1237#true} call #t~ret24 := main(); {1237#true} is VALID [2018-11-14 17:21:55,514 INFO L256 TraceCheckUtils]: 5: Hoare triple {1237#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {1237#true} is VALID [2018-11-14 17:21:55,515 INFO L273 TraceCheckUtils]: 6: Hoare triple {1237#true} ~nodelast~0.base, ~nodelast~0.offset := 0, 0;~node~0.base, ~node~0.offset := 0, 0; {1237#true} is VALID [2018-11-14 17:21:55,515 INFO L273 TraceCheckUtils]: 7: Hoare triple {1237#true} assume true; {1237#true} is VALID [2018-11-14 17:21:55,515 INFO L273 TraceCheckUtils]: 8: Hoare triple {1237#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1237#true} is VALID [2018-11-14 17:21:55,519 INFO L273 TraceCheckUtils]: 9: Hoare triple {1237#true} assume !!(#t~nondet7 != 0);havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(16);~node~0.base, ~node~0.offset := #t~malloc8.base, #t~malloc8.offset; {1239#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 17:21:55,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {1239#(not (= create_tree_~node~0.base 0))} assume !(~node~0.base == 0 && ~node~0.offset == 0); {1239#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 17:21:55,521 INFO L273 TraceCheckUtils]: 11: Hoare triple {1239#(not (= create_tree_~node~0.base 0))} call write~$Pointer$(0, 0, ~node~0.base, ~node~0.offset + 0, 4);call write~$Pointer$(~nodelast~0.base, ~nodelast~0.offset, ~node~0.base, ~node~0.offset + 4, 4); {1239#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 17:21:55,524 INFO L273 TraceCheckUtils]: 12: Hoare triple {1239#(not (= create_tree_~node~0.base 0))} assume !(~nodelast~0.base != 0 || ~nodelast~0.offset != 0); {1239#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 17:21:55,525 INFO L273 TraceCheckUtils]: 13: Hoare triple {1239#(not (= create_tree_~node~0.base 0))} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~value~0 := #t~nondet9;havoc #t~nondet9;call write~int(~value~0, ~node~0.base, ~node~0.offset + 12, 4);~nodelast~0.base, ~nodelast~0.offset := ~node~0.base, ~node~0.offset; {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-14 17:21:55,526 INFO L273 TraceCheckUtils]: 14: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} assume true; {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-14 17:21:55,526 INFO L273 TraceCheckUtils]: 15: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-14 17:21:55,527 INFO L273 TraceCheckUtils]: 16: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} assume !(#t~nondet7 != 0);havoc #t~nondet7; {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-14 17:21:55,527 INFO L273 TraceCheckUtils]: 17: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} assume ~node~0.base != 0 || ~node~0.offset != 0;call write~$Pointer$(0, 0, ~node~0.base, ~node~0.offset + 8, 4); {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-14 17:21:55,528 INFO L273 TraceCheckUtils]: 18: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} assume true; {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-14 17:21:55,528 INFO L273 TraceCheckUtils]: 19: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} assume !!(~node~0.base != 0 || ~node~0.offset != 0);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(16);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~node~0.base, ~node~0.offset + 0, 4); {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-14 17:21:55,529 INFO L273 TraceCheckUtils]: 20: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} assume !(~node~0.base == 0 && ~node~0.offset == 0); {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-14 17:21:55,546 INFO L273 TraceCheckUtils]: 21: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~node~0.base, ~node~0.offset + 0, 4);call write~$Pointer$(0, 0, #t~mem11.base, #t~mem11.offset + 0, 4);havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~node~0.base, ~node~0.offset + 0, 4);call write~$Pointer$(0, 0, #t~mem12.base, #t~mem12.offset + 4, 4);havoc #t~mem12.base, #t~mem12.offset;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~node~0.base, ~node~0.offset + 0, 4);call write~int(42, #t~mem13.base, #t~mem13.offset + 12, 4);havoc #t~mem13.base, #t~mem13.offset;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~node~0.base, ~node~0.offset + 0, 4);call write~$Pointer$(~node~0.base, ~node~0.offset, #t~mem14.base, #t~mem14.offset + 8, 4);havoc #t~mem14.base, #t~mem14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~node~0.base, ~node~0.offset + 4, 4);~node~0.base, ~node~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-14 17:21:55,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} assume true; {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-14 17:21:55,547 INFO L273 TraceCheckUtils]: 23: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} assume !(~node~0.base != 0 || ~node~0.offset != 0); {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-14 17:21:55,549 INFO L273 TraceCheckUtils]: 24: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {1241#(not (= |create_tree_#res.base| 0))} is VALID [2018-11-14 17:21:55,549 INFO L273 TraceCheckUtils]: 25: Hoare triple {1241#(not (= |create_tree_#res.base| 0))} assume true; {1241#(not (= |create_tree_#res.base| 0))} is VALID [2018-11-14 17:21:55,554 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1241#(not (= |create_tree_#res.base| 0))} {1237#true} #203#return; {1242#(not (= |main_#t~ret23.base| 0))} is VALID [2018-11-14 17:21:55,554 INFO L273 TraceCheckUtils]: 27: Hoare triple {1242#(not (= |main_#t~ret23.base| 0))} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {1243#(not (= main_~data~0.base 0))} is VALID [2018-11-14 17:21:55,559 INFO L273 TraceCheckUtils]: 28: Hoare triple {1243#(not (= main_~data~0.base 0))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {1243#(not (= main_~data~0.base 0))} is VALID [2018-11-14 17:21:55,560 INFO L256 TraceCheckUtils]: 29: Hoare triple {1243#(not (= main_~data~0.base 0))} call inspect(~data~0.base, ~data~0.offset); {1244#(not (= |inspect_#in~node.base| 0))} is VALID [2018-11-14 17:21:55,560 INFO L273 TraceCheckUtils]: 30: Hoare triple {1244#(not (= |inspect_#in~node.base| 0))} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {1245#(not (= inspect_~node.base 0))} is VALID [2018-11-14 17:21:55,561 INFO L273 TraceCheckUtils]: 31: Hoare triple {1245#(not (= inspect_~node.base 0))} assume true; {1245#(not (= inspect_~node.base 0))} is VALID [2018-11-14 17:21:55,561 INFO L273 TraceCheckUtils]: 32: Hoare triple {1245#(not (= inspect_~node.base 0))} assume ~node.base == 0 && ~node.offset == 0; {1238#false} is VALID [2018-11-14 17:21:55,561 INFO L256 TraceCheckUtils]: 33: Hoare triple {1238#false} call fail(); {1238#false} is VALID [2018-11-14 17:21:55,562 INFO L273 TraceCheckUtils]: 34: Hoare triple {1238#false} assume !false; {1238#false} is VALID [2018-11-14 17:21:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:21:55,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:21:55,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 17:21:55,567 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-14 17:21:55,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:21:55,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:21:55,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:55,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:21:55,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:21:55,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:21:55,632 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 9 states. [2018-11-14 17:21:56,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:56,440 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2018-11-14 17:21:56,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:21:56,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-14 17:21:56,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:21:56,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:21:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2018-11-14 17:21:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:21:56,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2018-11-14 17:21:56,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 118 transitions. [2018-11-14 17:21:56,650 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:56,653 INFO L225 Difference]: With dead ends: 105 [2018-11-14 17:21:56,653 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 17:21:56,654 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:21:56,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 17:21:56,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2018-11-14 17:21:56,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:21:56,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 51 states. [2018-11-14 17:21:56,679 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 51 states. [2018-11-14 17:21:56,679 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 51 states. [2018-11-14 17:21:56,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:56,683 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-11-14 17:21:56,683 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-11-14 17:21:56,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:56,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:56,684 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 66 states. [2018-11-14 17:21:56,684 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 66 states. [2018-11-14 17:21:56,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:56,687 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-11-14 17:21:56,687 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-11-14 17:21:56,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:56,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:56,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:21:56,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:21:56,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-14 17:21:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-14 17:21:56,690 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 35 [2018-11-14 17:21:56,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:21:56,690 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-14 17:21:56,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:21:56,691 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-14 17:21:56,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 17:21:56,691 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:21:56,692 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:21:56,692 INFO L423 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:21:56,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:21:56,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1604943851, now seen corresponding path program 1 times [2018-11-14 17:21:56,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:21:56,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:21:56,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:56,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:21:56,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:21:57,198 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 20 [2018-11-14 17:21:57,275 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 17:21:57,280 INFO L168 Benchmark]: Toolchain (without parser) took 8599.82 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -253.1 MB). Peak memory consumption was 505.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:21:57,281 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:21:57,282 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -817.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:21:57,283 INFO L168 Benchmark]: Boogie Preprocessor took 93.20 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:21:57,284 INFO L168 Benchmark]: RCFGBuilder took 1333.64 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 77.6 MB). Peak memory consumption was 77.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:21:57,285 INFO L168 Benchmark]: TraceAbstraction took 6407.97 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 460.1 MB). Peak memory consumption was 460.1 MB. Max. memory is 7.1 GB. [2018-11-14 17:21:57,289 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 756.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -817.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 93.20 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1333.64 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 77.6 MB). Peak memory consumption was 77.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6407.97 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 460.1 MB). Peak memory consumption was 460.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...