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_Bitvector.epf -i ../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:21:10,882 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:21:10,884 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:21:10,900 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:21:10,901 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:21:10,902 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:21:10,903 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:21:10,909 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:21:10,911 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:21:10,915 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:21:10,916 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:21:10,916 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:21:10,919 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:21:10,920 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:21:10,924 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:21:10,925 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:21:10,926 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:21:10,933 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:21:10,935 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:21:10,940 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:21:10,941 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:21:10,946 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:21:10,948 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:21:10,952 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:21:10,953 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:21:10,954 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:21:10,954 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:21:10,955 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:21:10,959 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:21:10,960 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:21:10,960 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:21:10,963 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:21:10,963 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:21:10,965 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:21:10,966 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:21:10,967 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:21:10,967 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:21:10,983 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:21:10,983 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:21:10,984 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:21:10,984 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:21:10,985 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:21:10,985 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:21:10,985 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:21:10,985 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:21:10,986 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:21:10,986 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:21:10,986 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:21:10,986 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:21:10,986 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:21:10,987 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:21:10,987 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:21:10,987 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:21:10,987 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:21:10,987 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:21:10,987 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:21:10,988 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:21:10,988 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:21:10,988 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:21:10,988 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:21:10,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:21:10,989 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:21:10,989 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:21:10,989 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:21:10,989 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:21:10,989 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:21:10,990 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:21:10,990 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:21:10,990 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:21:11,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:21:11,049 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:21:11,053 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:21:11,054 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:21:11,055 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:21:11,055 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i [2018-11-14 16:21:11,110 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48b09e6eb/ab6144f9a15242338d82fac47f83df13/FLAGddf6a8d9e [2018-11-14 16:21:11,745 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:21:11,746 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i [2018-11-14 16:21:11,773 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48b09e6eb/ab6144f9a15242338d82fac47f83df13/FLAGddf6a8d9e [2018-11-14 16:21:11,793 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48b09e6eb/ab6144f9a15242338d82fac47f83df13 [2018-11-14 16:21:11,804 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:21:11,805 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:21:11,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:21:11,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:21:11,810 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:21:11,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:21:11" (1/1) ... [2018-11-14 16:21:11,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c37439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:21:11, skipping insertion in model container [2018-11-14 16:21:11,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:21:11" (1/1) ... [2018-11-14 16:21:11,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:21:11,908 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:21:12,526 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:21:12,553 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:21:12,739 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:21:12,898 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:21:12,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:21:12 WrapperNode [2018-11-14 16:21:12,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:21:12,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:21:12,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:21:12,900 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:21:12,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:21:12" (1/1) ... [2018-11-14 16:21:12,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:21:12" (1/1) ... [2018-11-14 16:21:12,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:21:12" (1/1) ... [2018-11-14 16:21:12,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:21:12" (1/1) ... [2018-11-14 16:21:13,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:21:12" (1/1) ... [2018-11-14 16:21:13,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:21:12" (1/1) ... [2018-11-14 16:21:13,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:21:12" (1/1) ... [2018-11-14 16:21:13,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:21:13,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:21:13,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:21:13,063 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:21:13,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:21:12" (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 16:21:13,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:21:13,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:21:13,133 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 16:21:13,133 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 16:21:13,134 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-11-14 16:21:13,134 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2018-11-14 16:21:13,134 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2018-11-14 16:21:13,134 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del [2018-11-14 16:21:13,134 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2018-11-14 16:21:13,134 INFO L138 BoogieDeclarations]: Found implementation of procedure list_move [2018-11-14 16:21:13,135 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-11-14 16:21:13,135 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_read [2018-11-14 16:21:13,135 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-11-14 16:21:13,136 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-11-14 16:21:13,136 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2018-11-14 16:21:13,136 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-11-14 16:21:13,136 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:21:13,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:21:13,136 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 16:21:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 16:21:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 16:21:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 16:21:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 16:21:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 16:21:13,138 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 16:21:13,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 16:21:13,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 16:21:13,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 16:21:13,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 16:21:13,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 16:21:13,139 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 16:21:13,139 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 16:21:13,139 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 16:21:13,139 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 16:21:13,139 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 16:21:13,139 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 16:21:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 16:21:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 16:21:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 16:21:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 16:21:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 16:21:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 16:21:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 16:21:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 16:21:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 16:21:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 16:21:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 16:21:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 16:21:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 16:21:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 16:21:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 16:21:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 16:21:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 16:21:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 16:21:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 16:21:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 16:21:13,143 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 16:21:13,143 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 16:21:13,143 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 16:21:13,143 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 16:21:13,143 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 16:21:13,143 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 16:21:13,144 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 16:21:13,144 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 16:21:13,144 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 16:21:13,144 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 16:21:13,144 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 16:21:13,144 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 16:21:13,144 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 16:21:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 16:21:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 16:21:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 16:21:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 16:21:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 16:21:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 16:21:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 16:21:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 16:21:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 16:21:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 16:21:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 16:21:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 16:21:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 16:21:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 16:21:13,147 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 16:21:13,147 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 16:21:13,147 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 16:21:13,147 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 16:21:13,147 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 16:21:13,147 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 16:21:13,147 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 16:21:13,148 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 16:21:13,148 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 16:21:13,148 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 16:21:13,148 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 16:21:13,148 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 16:21:13,148 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 16:21:13,149 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 16:21:13,149 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 16:21:13,149 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 16:21:13,149 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 16:21:13,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 16:21:13,149 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 16:21:13,149 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 16:21:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 16:21:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 16:21:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 16:21:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 16:21:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 16:21:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 16:21:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 16:21:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 16:21:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 16:21:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 16:21:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 16:21:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 16:21:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 16:21:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 16:21:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 16:21:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 16:21:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 16:21:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2018-11-14 16:21:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2018-11-14 16:21:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2018-11-14 16:21:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2018-11-14 16:21:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2018-11-14 16:21:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2018-11-14 16:21:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2018-11-14 16:21:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2018-11-14 16:21:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2018-11-14 16:21:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2018-11-14 16:21:13,154 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2018-11-14 16:21:13,154 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2018-11-14 16:21:13,154 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2018-11-14 16:21:13,154 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2018-11-14 16:21:13,154 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2018-11-14 16:21:13,154 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2018-11-14 16:21:13,154 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2018-11-14 16:21:13,155 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2018-11-14 16:21:13,155 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2018-11-14 16:21:13,155 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2018-11-14 16:21:13,155 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2018-11-14 16:21:13,155 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2018-11-14 16:21:13,155 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2018-11-14 16:21:13,156 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2018-11-14 16:21:13,156 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2018-11-14 16:21:13,156 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2018-11-14 16:21:13,156 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2018-11-14 16:21:13,156 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2018-11-14 16:21:13,156 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2018-11-14 16:21:13,156 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2018-11-14 16:21:13,157 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2018-11-14 16:21:13,157 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2018-11-14 16:21:13,157 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2018-11-14 16:21:13,157 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2018-11-14 16:21:13,157 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2018-11-14 16:21:13,157 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2018-11-14 16:21:13,157 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2018-11-14 16:21:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2018-11-14 16:21:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2018-11-14 16:21:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2018-11-14 16:21:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2018-11-14 16:21:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2018-11-14 16:21:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2018-11-14 16:21:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2018-11-14 16:21:13,159 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2018-11-14 16:21:13,159 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2018-11-14 16:21:13,159 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2018-11-14 16:21:13,159 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2018-11-14 16:21:13,159 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2018-11-14 16:21:13,159 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2018-11-14 16:21:13,159 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2018-11-14 16:21:13,159 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2018-11-14 16:21:13,160 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2018-11-14 16:21:13,160 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2018-11-14 16:21:13,160 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2018-11-14 16:21:13,160 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2018-11-14 16:21:13,160 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2018-11-14 16:21:13,160 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2018-11-14 16:21:13,160 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2018-11-14 16:21:13,161 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2018-11-14 16:21:13,161 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2018-11-14 16:21:13,161 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2018-11-14 16:21:13,161 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2018-11-14 16:21:13,161 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2018-11-14 16:21:13,161 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2018-11-14 16:21:13,161 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2018-11-14 16:21:13,162 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2018-11-14 16:21:13,162 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2018-11-14 16:21:13,162 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2018-11-14 16:21:13,162 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2018-11-14 16:21:13,162 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2018-11-14 16:21:13,162 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2018-11-14 16:21:13,162 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2018-11-14 16:21:13,163 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2018-11-14 16:21:13,163 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2018-11-14 16:21:13,163 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2018-11-14 16:21:13,163 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2018-11-14 16:21:13,163 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2018-11-14 16:21:13,163 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2018-11-14 16:21:13,163 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2018-11-14 16:21:13,164 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2018-11-14 16:21:13,164 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2018-11-14 16:21:13,164 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2018-11-14 16:21:13,164 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2018-11-14 16:21:13,164 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2018-11-14 16:21:13,164 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2018-11-14 16:21:13,164 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2018-11-14 16:21:13,164 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2018-11-14 16:21:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2018-11-14 16:21:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2018-11-14 16:21:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2018-11-14 16:21:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2018-11-14 16:21:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2018-11-14 16:21:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2018-11-14 16:21:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2018-11-14 16:21:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2018-11-14 16:21:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2018-11-14 16:21:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2018-11-14 16:21:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2018-11-14 16:21:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2018-11-14 16:21:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2018-11-14 16:21:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:21:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-11-14 16:21:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2018-11-14 16:21:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 16:21:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2018-11-14 16:21:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 16:21:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del [2018-11-14 16:21:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2018-11-14 16:21:13,168 INFO L130 BoogieDeclarations]: Found specification of procedure list_move [2018-11-14 16:21:13,168 INFO L130 BoogieDeclarations]: Found specification of procedure gl_insert [2018-11-14 16:21:13,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:21:13,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 16:21:13,168 INFO L130 BoogieDeclarations]: Found specification of procedure gl_read [2018-11-14 16:21:13,168 INFO L130 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-11-14 16:21:13,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:21:13,169 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2018-11-14 16:21:13,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 16:21:13,169 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2018-11-14 16:21:13,169 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort [2018-11-14 16:21:13,169 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:21:13,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:21:13,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:21:13,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 16:21:16,054 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:21:16,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:21:16 BoogieIcfgContainer [2018-11-14 16:21:16,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:21:16,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:21:16,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:21:16,062 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:21:16,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:21:11" (1/3) ... [2018-11-14 16:21:16,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40dc8a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:21:16, skipping insertion in model container [2018-11-14 16:21:16,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:21:12" (2/3) ... [2018-11-14 16:21:16,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40dc8a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:21:16, skipping insertion in model container [2018-11-14 16:21:16,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:21:16" (3/3) ... [2018-11-14 16:21:16,066 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux_true-unreach-call_true-valid-memsafety.i [2018-11-14 16:21:16,077 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:21:16,087 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:21:16,106 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:21:16,147 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:21:16,147 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:21:16,148 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:21:16,148 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:21:16,148 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:21:16,148 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:21:16,148 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:21:16,148 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:21:16,148 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:21:16,169 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2018-11-14 16:21:16,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:21:16,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:21:16,178 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:21:16,180 INFO L423 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:21:16,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:21:16,187 INFO L82 PathProgramCache]: Analyzing trace with hash 344600023, now seen corresponding path program 1 times [2018-11-14 16:21:16,192 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:21:16,193 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:21:16,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:21:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:21:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:21:16,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:21:16,358 INFO L256 TraceCheckUtils]: 0: Hoare triple {157#true} call ULTIMATE.init(); {157#true} is VALID [2018-11-14 16:21:16,361 INFO L273 TraceCheckUtils]: 1: Hoare triple {157#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#gl_list~0.base, ~#gl_list~0.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~#gl_list~0.offset, 4bv32);call write~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~bvadd32(4bv32, ~#gl_list~0.offset), 4bv32); {157#true} is VALID [2018-11-14 16:21:16,362 INFO L273 TraceCheckUtils]: 2: Hoare triple {157#true} assume true; {157#true} is VALID [2018-11-14 16:21:16,362 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {157#true} {157#true} #520#return; {157#true} is VALID [2018-11-14 16:21:16,362 INFO L256 TraceCheckUtils]: 4: Hoare triple {157#true} call #t~ret59 := main(); {157#true} is VALID [2018-11-14 16:21:16,363 INFO L256 TraceCheckUtils]: 5: Hoare triple {157#true} call gl_read(); {157#true} is VALID [2018-11-14 16:21:16,371 INFO L273 TraceCheckUtils]: 6: Hoare triple {157#true} assume !true; {158#false} is VALID [2018-11-14 16:21:16,372 INFO L273 TraceCheckUtils]: 7: Hoare triple {158#false} assume true; {158#false} is VALID [2018-11-14 16:21:16,372 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {158#false} {157#true} #504#return; {158#false} is VALID [2018-11-14 16:21:16,372 INFO L256 TraceCheckUtils]: 9: Hoare triple {158#false} call inspect(~#gl_list~0.base, ~#gl_list~0.offset); {158#false} is VALID [2018-11-14 16:21:16,373 INFO L273 TraceCheckUtils]: 10: Hoare triple {158#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {158#false} is VALID [2018-11-14 16:21:16,373 INFO L273 TraceCheckUtils]: 11: Hoare triple {158#false} assume true; {158#false} is VALID [2018-11-14 16:21:16,373 INFO L273 TraceCheckUtils]: 12: Hoare triple {158#false} assume ~head.base == 0bv32 && ~head.offset == 0bv32; {158#false} is VALID [2018-11-14 16:21:16,374 INFO L256 TraceCheckUtils]: 13: Hoare triple {158#false} call fail(); {158#false} is VALID [2018-11-14 16:21:16,374 INFO L273 TraceCheckUtils]: 14: Hoare triple {158#false} assume !false; {158#false} is VALID [2018-11-14 16:21:16,378 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 16:21:16,378 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:21:16,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:21:16,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:21:16,392 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 16:21:16,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:21:16,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:21:16,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:21:16,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:21:16,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:21:16,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:21:16,482 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 2 states. [2018-11-14 16:21:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:21:17,260 INFO L93 Difference]: Finished difference Result 298 states and 469 transitions. [2018-11-14 16:21:17,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:21:17,260 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 16:21:17,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:21:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:21:17,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 469 transitions. [2018-11-14 16:21:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:21:17,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 469 transitions. [2018-11-14 16:21:17,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 469 transitions. [2018-11-14 16:21:18,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 469 edges. 469 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:21:18,122 INFO L225 Difference]: With dead ends: 298 [2018-11-14 16:21:18,122 INFO L226 Difference]: Without dead ends: 138 [2018-11-14 16:21:18,128 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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 16:21:18,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-14 16:21:18,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-11-14 16:21:18,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:21:18,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 138 states. [2018-11-14 16:21:18,283 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 138 states. [2018-11-14 16:21:18,283 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 138 states. [2018-11-14 16:21:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:21:18,296 INFO L93 Difference]: Finished difference Result 138 states and 159 transitions. [2018-11-14 16:21:18,296 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 159 transitions. [2018-11-14 16:21:18,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:21:18,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:21:18,300 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 138 states. [2018-11-14 16:21:18,300 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 138 states. [2018-11-14 16:21:18,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:21:18,311 INFO L93 Difference]: Finished difference Result 138 states and 159 transitions. [2018-11-14 16:21:18,312 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 159 transitions. [2018-11-14 16:21:18,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:21:18,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:21:18,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:21:18,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:21:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-14 16:21:18,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 159 transitions. [2018-11-14 16:21:18,329 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 159 transitions. Word has length 15 [2018-11-14 16:21:18,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:21:18,330 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 159 transitions. [2018-11-14 16:21:18,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:21:18,330 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 159 transitions. [2018-11-14 16:21:18,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 16:21:18,332 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:21:18,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:21:18,332 INFO L423 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:21:18,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:21:18,333 INFO L82 PathProgramCache]: Analyzing trace with hash 826001747, now seen corresponding path program 1 times [2018-11-14 16:21:18,334 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:21:18,334 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:21:18,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:21:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:21:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:21:18,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:21:18,804 INFO L256 TraceCheckUtils]: 0: Hoare triple {1066#true} call ULTIMATE.init(); {1066#true} is VALID [2018-11-14 16:21:18,806 INFO L273 TraceCheckUtils]: 1: Hoare triple {1066#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#gl_list~0.base, ~#gl_list~0.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~#gl_list~0.offset, 4bv32);call write~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~bvadd32(4bv32, ~#gl_list~0.offset), 4bv32); {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,807 INFO L273 TraceCheckUtils]: 2: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} assume true; {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,808 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} {1066#true} #520#return; {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,809 INFO L256 TraceCheckUtils]: 4: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} call #t~ret59 := main(); {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,810 INFO L256 TraceCheckUtils]: 5: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} call gl_read(); {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,811 INFO L273 TraceCheckUtils]: 6: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} assume true; {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,812 INFO L256 TraceCheckUtils]: 7: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} call gl_insert(#t~nondet50); {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,813 INFO L273 TraceCheckUtils]: 8: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} ~value := #in~value;call #t~malloc48.base, #t~malloc48.offset := #Ultimate.alloc(20bv32);~node~1.base, ~node~1.offset := #t~malloc48.base, #t~malloc48.offset; {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,814 INFO L273 TraceCheckUtils]: 9: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} assume !(~node~1.base == 0bv32 && ~node~1.offset == 0bv32); {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,815 INFO L273 TraceCheckUtils]: 10: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} call write~intINTTYPE4(~value, ~node~1.base, ~node~1.offset, 4bv32); {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,816 INFO L256 TraceCheckUtils]: 11: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} call list_add(~node~1.base, ~bvadd32(4bv32, ~node~1.offset), ~#gl_list~0.base, ~#gl_list~0.offset); {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,817 INFO L273 TraceCheckUtils]: 12: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,819 INFO L256 TraceCheckUtils]: 13: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} call __list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem45.base, #t~mem45.offset); {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,821 INFO L273 TraceCheckUtils]: 14: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset;call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32);call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32);call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32);call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,822 INFO L273 TraceCheckUtils]: 15: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} assume true; {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,823 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} #514#return; {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,824 INFO L273 TraceCheckUtils]: 17: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} havoc #t~mem45.base, #t~mem45.offset; {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,825 INFO L273 TraceCheckUtils]: 18: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} assume true; {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,827 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} #458#return; {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,828 INFO L273 TraceCheckUtils]: 20: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} assume true;call write~$Pointer$(~node~1.base, ~bvadd32(12bv32, ~node~1.offset), ~node~1.base, ~bvadd32(12bv32, ~node~1.offset), 4bv32);call write~$Pointer$(~node~1.base, ~bvadd32(12bv32, ~node~1.offset), ~node~1.base, ~bvadd32(16bv32, ~node~1.offset), 4bv32); {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,828 INFO L273 TraceCheckUtils]: 21: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} assume true; {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,829 INFO L273 TraceCheckUtils]: 22: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} assume true; {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,832 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} #502#return; {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} havoc #t~nondet50; {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,836 INFO L273 TraceCheckUtils]: 25: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} assume !(#t~nondet49 != 0bv32);havoc #t~nondet49; {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,837 INFO L273 TraceCheckUtils]: 26: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} assume true; {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,837 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} #504#return; {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,838 INFO L256 TraceCheckUtils]: 28: Hoare triple {1074#(not (= |~#gl_list~0.base| (_ bv0 32)))} call inspect(~#gl_list~0.base, ~#gl_list~0.offset); {1156#(not (= |inspect_#in~head.base| (_ bv0 32)))} is VALID [2018-11-14 16:21:18,839 INFO L273 TraceCheckUtils]: 29: Hoare triple {1156#(not (= |inspect_#in~head.base| (_ bv0 32)))} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1160#(not (= (_ bv0 32) inspect_~head.base))} is VALID [2018-11-14 16:21:18,839 INFO L273 TraceCheckUtils]: 30: Hoare triple {1160#(not (= (_ bv0 32) inspect_~head.base))} assume true; {1160#(not (= (_ bv0 32) inspect_~head.base))} is VALID [2018-11-14 16:21:18,840 INFO L273 TraceCheckUtils]: 31: Hoare triple {1160#(not (= (_ bv0 32) inspect_~head.base))} assume ~head.base == 0bv32 && ~head.offset == 0bv32; {1067#false} is VALID [2018-11-14 16:21:18,841 INFO L256 TraceCheckUtils]: 32: Hoare triple {1067#false} call fail(); {1067#false} is VALID [2018-11-14 16:21:18,841 INFO L273 TraceCheckUtils]: 33: Hoare triple {1067#false} assume !false; {1067#false} is VALID [2018-11-14 16:21:18,851 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 16:21:18,851 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:21:18,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:21:18,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:21:18,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-14 16:21:18,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:21:18,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:21:18,947 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 16:21:18,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:21:18,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:21:18,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:21:18,949 INFO L87 Difference]: Start difference. First operand 138 states and 159 transitions. Second operand 5 states. [2018-11-14 16:21:20,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:21:20,427 INFO L93 Difference]: Finished difference Result 140 states and 160 transitions. [2018-11-14 16:21:20,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:21:20,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-14 16:21:20,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:21:20,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:21:20,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2018-11-14 16:21:20,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:21:20,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2018-11-14 16:21:20,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 160 transitions. [2018-11-14 16:21:20,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:21:20,667 INFO L225 Difference]: With dead ends: 140 [2018-11-14 16:21:20,667 INFO L226 Difference]: Without dead ends: 137 [2018-11-14 16:21:20,668 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:21:20,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-14 16:21:20,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-11-14 16:21:20,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:21:20,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 137 states. [2018-11-14 16:21:20,779 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 137 states. [2018-11-14 16:21:20,779 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 137 states. [2018-11-14 16:21:20,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:21:20,787 INFO L93 Difference]: Finished difference Result 137 states and 157 transitions. [2018-11-14 16:21:20,787 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2018-11-14 16:21:20,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:21:20,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:21:20,790 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 137 states. [2018-11-14 16:21:20,790 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 137 states. [2018-11-14 16:21:20,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:21:20,797 INFO L93 Difference]: Finished difference Result 137 states and 157 transitions. [2018-11-14 16:21:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2018-11-14 16:21:20,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:21:20,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:21:20,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:21:20,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:21:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-14 16:21:20,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2018-11-14 16:21:20,813 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 34 [2018-11-14 16:21:20,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:21:20,813 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2018-11-14 16:21:20,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:21:20,814 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2018-11-14 16:21:20,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 16:21:20,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:21:20,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:21:20,818 INFO L423 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:21:20,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:21:20,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1259587791, now seen corresponding path program 1 times [2018-11-14 16:21:20,819 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:21:20,819 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:21:20,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:21:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:21:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:21:20,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:21:21,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-14 16:21:21,096 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:21:21,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-14 16:21:21,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-14 16:21:21,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:21:21,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:21:21,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:27 [2018-11-14 16:21:21,181 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:21:21,398 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:21:21,400 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:21:21,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-14 16:21:21,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:21:21,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-14 16:21:21,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:21:21,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:21:21,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:7 [2018-11-14 16:21:21,461 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:21:21,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 48 [2018-11-14 16:21:21,838 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-14 16:21:21,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 16:21:21,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:21:22,257 INFO L303 Elim1Store]: Index analysis took 135 ms [2018-11-14 16:21:22,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 53 [2018-11-14 16:21:22,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2018-11-14 16:21:22,359 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:21:22,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-14 16:21:22,369 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:21:22,418 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:21:22,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 41 [2018-11-14 16:21:22,892 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:21:22,894 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:21:22,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 44 [2018-11-14 16:21:22,974 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-14 16:21:23,115 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:21:23,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-11-14 16:21:23,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:21:23,944 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 16:21:24,014 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:21:24,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-11-14 16:21:24,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:21:24,056 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 16:21:24,112 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:21:24,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 53 [2018-11-14 16:21:24,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-11-14 16:21:24,897 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-14 16:21:25,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-11-14 16:21:25,032 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-14 16:21:25,100 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:21:25,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:21:25,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 58 [2018-11-14 16:21:25,535 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:21:25,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2018-11-14 16:21:25,574 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:21:25,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2018-11-14 16:21:25,578 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-14 16:21:25,644 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:21:26,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-11-14 16:21:26,396 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:21:26,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-11-14 16:21:26,400 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-14 16:21:26,445 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:21:26,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-11-14 16:21:27,009 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:21:27,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2018-11-14 16:21:27,023 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-14 16:21:27,065 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:21:27,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2018-11-14 16:21:27,642 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:21:27,653 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:21:27,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 69 [2018-11-14 16:21:27,680 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-11-14 16:21:28,032 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:21:28,303 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:21:28,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-14 16:21:28,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-14 16:21:28,745 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 4 variables, input treesize:81, output treesize:93 [2018-11-14 16:21:30,962 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:21:47,314 WARN L179 SmtUtils]: Spent 16.27 s on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2018-11-14 16:21:55,929 WARN L179 SmtUtils]: Spent 8.34 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-14 16:22:06,326 WARN L179 SmtUtils]: Spent 10.25 s on a formula simplification that was a NOOP. DAG size: 38 [2018-11-14 16:22:06,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 66 [2018-11-14 16:22:06,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 80 [2018-11-14 16:22:06,902 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:06,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 113 [2018-11-14 16:22:06,984 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-14 16:22:07,364 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:07,367 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:07,371 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:07,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 99 [2018-11-14 16:22:07,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:22:07,555 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 16:22:08,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 16:22:09,531 INFO L303 Elim1Store]: Index analysis took 237 ms [2018-11-14 16:22:09,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 81 treesize of output 90 [2018-11-14 16:22:09,800 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:10,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 80 treesize of output 103 [2018-11-14 16:22:10,409 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:10,412 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:10,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 125 [2018-11-14 16:22:10,418 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 16:22:10,949 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:10,949 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:22:10,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 96 [2018-11-14 16:22:10,959 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 16:22:11,348 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:11,362 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:11,526 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:11,536 INFO L303 Elim1Store]: Index analysis took 200 ms [2018-11-14 16:22:11,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 142 [2018-11-14 16:22:11,733 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 16:22:12,803 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-14 16:22:17,075 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:17,136 INFO L303 Elim1Store]: Index analysis took 110 ms [2018-11-14 16:22:17,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 99 [2018-11-14 16:22:17,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:17,493 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:17,506 INFO L303 Elim1Store]: Index analysis took 103 ms [2018-11-14 16:22:17,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 117 [2018-11-14 16:22:17,510 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 16:22:18,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:18,475 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:18,520 INFO L303 Elim1Store]: Index analysis took 125 ms [2018-11-14 16:22:19,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 130 [2018-11-14 16:22:19,076 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-11-14 16:22:20,263 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:20,280 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:20,286 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:20,290 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:20,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 122 [2018-11-14 16:22:20,295 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-14 16:22:20,657 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 16:22:24,004 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:24,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 72 [2018-11-14 16:22:24,477 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:24,497 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:24,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 83 [2018-11-14 16:22:24,836 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 16:22:25,919 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:25,921 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:25,922 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:22:25,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 71 [2018-11-14 16:22:25,934 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-14 16:22:28,178 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:28,192 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:28,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 73 [2018-11-14 16:22:28,206 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-14 16:22:29,098 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:29,115 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:29,119 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:29,120 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:22:29,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 81 [2018-11-14 16:22:29,126 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-14 16:22:29,447 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-14 16:22:30,647 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 9 xjuncts. [2018-11-14 16:22:32,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 28 dim-0 vars, and 12 xjuncts. [2018-11-14 16:22:32,896 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:157, output treesize:859 [2018-11-14 16:22:34,923 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:22:48,340 WARN L179 SmtUtils]: Spent 12.86 s on a formula simplification. DAG size of input: 242 DAG size of output: 24 [2018-11-14 16:22:49,296 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:49,302 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:49,305 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:49,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 50 [2018-11-14 16:22:49,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:22:49,409 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:49,412 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:49,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2018-11-14 16:22:49,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:22:49,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:22:49,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:117, output treesize:46 [2018-11-14 16:22:49,477 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:22:50,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2018-11-14 16:22:50,284 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:22:50,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2018-11-14 16:22:50,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:22:50,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-14 16:22:50,304 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:22:50,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:22:50,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:22:50,310 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:50, output treesize:4 [2018-11-14 16:22:50,317 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:22:50,360 INFO L256 TraceCheckUtils]: 0: Hoare triple {1825#true} call ULTIMATE.init(); {1825#true} is VALID [2018-11-14 16:22:50,365 INFO L273 TraceCheckUtils]: 1: Hoare triple {1825#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#gl_list~0.base, ~#gl_list~0.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~#gl_list~0.offset, 4bv32);call write~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~bvadd32(4bv32, ~#gl_list~0.offset), 4bv32); {1833#(or (and (= (bvadd (select |#valid| |~#gl_list~0.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|) (= (select |#valid| (_ bv0 32)) (_ bv0 1))) (and (= (bvadd (select |#valid| |~#gl_list~0.base|) (_ bv1 1)) (_ bv0 1)) (= |~#gl_list~0.base| (_ bv0 32)) (= (_ bv0 32) |~#gl_list~0.offset|)))} is VALID [2018-11-14 16:22:50,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {1833#(or (and (= (bvadd (select |#valid| |~#gl_list~0.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|) (= (select |#valid| (_ bv0 32)) (_ bv0 1))) (and (= (bvadd (select |#valid| |~#gl_list~0.base|) (_ bv1 1)) (_ bv0 1)) (= |~#gl_list~0.base| (_ bv0 32)) (= (_ bv0 32) |~#gl_list~0.offset|)))} assume true; {1833#(or (and (= (bvadd (select |#valid| |~#gl_list~0.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|) (= (select |#valid| (_ bv0 32)) (_ bv0 1))) (and (= (bvadd (select |#valid| |~#gl_list~0.base|) (_ bv1 1)) (_ bv0 1)) (= |~#gl_list~0.base| (_ bv0 32)) (= (_ bv0 32) |~#gl_list~0.offset|)))} is VALID [2018-11-14 16:22:50,367 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1833#(or (and (= (bvadd (select |#valid| |~#gl_list~0.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|) (= (select |#valid| (_ bv0 32)) (_ bv0 1))) (and (= (bvadd (select |#valid| |~#gl_list~0.base|) (_ bv1 1)) (_ bv0 1)) (= |~#gl_list~0.base| (_ bv0 32)) (= (_ bv0 32) |~#gl_list~0.offset|)))} {1825#true} #520#return; {1833#(or (and (= (bvadd (select |#valid| |~#gl_list~0.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|) (= (select |#valid| (_ bv0 32)) (_ bv0 1))) (and (= (bvadd (select |#valid| |~#gl_list~0.base|) (_ bv1 1)) (_ bv0 1)) (= |~#gl_list~0.base| (_ bv0 32)) (= (_ bv0 32) |~#gl_list~0.offset|)))} is VALID [2018-11-14 16:22:50,367 INFO L256 TraceCheckUtils]: 4: Hoare triple {1833#(or (and (= (bvadd (select |#valid| |~#gl_list~0.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|) (= (select |#valid| (_ bv0 32)) (_ bv0 1))) (and (= (bvadd (select |#valid| |~#gl_list~0.base|) (_ bv1 1)) (_ bv0 1)) (= |~#gl_list~0.base| (_ bv0 32)) (= (_ bv0 32) |~#gl_list~0.offset|)))} call #t~ret59 := main(); {1833#(or (and (= (bvadd (select |#valid| |~#gl_list~0.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|) (= (select |#valid| (_ bv0 32)) (_ bv0 1))) (and (= (bvadd (select |#valid| |~#gl_list~0.base|) (_ bv1 1)) (_ bv0 1)) (= |~#gl_list~0.base| (_ bv0 32)) (= (_ bv0 32) |~#gl_list~0.offset|)))} is VALID [2018-11-14 16:22:50,368 INFO L256 TraceCheckUtils]: 5: Hoare triple {1833#(or (and (= (bvadd (select |#valid| |~#gl_list~0.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|) (= (select |#valid| (_ bv0 32)) (_ bv0 1))) (and (= (bvadd (select |#valid| |~#gl_list~0.base|) (_ bv1 1)) (_ bv0 1)) (= |~#gl_list~0.base| (_ bv0 32)) (= (_ bv0 32) |~#gl_list~0.offset|)))} call gl_read(); {1846#(and (= |#valid| |old(#valid)|) (= (_ bv0 32) |~#gl_list~0.offset|))} is VALID [2018-11-14 16:22:50,369 INFO L273 TraceCheckUtils]: 6: Hoare triple {1846#(and (= |#valid| |old(#valid)|) (= (_ bv0 32) |~#gl_list~0.offset|))} assume true; {1846#(and (= |#valid| |old(#valid)|) (= (_ bv0 32) |~#gl_list~0.offset|))} is VALID [2018-11-14 16:22:50,369 INFO L256 TraceCheckUtils]: 7: Hoare triple {1846#(and (= |#valid| |old(#valid)|) (= (_ bv0 32) |~#gl_list~0.offset|))} call gl_insert(#t~nondet50); {1846#(and (= |#valid| |old(#valid)|) (= (_ bv0 32) |~#gl_list~0.offset|))} is VALID [2018-11-14 16:22:50,371 INFO L273 TraceCheckUtils]: 8: Hoare triple {1846#(and (= |#valid| |old(#valid)|) (= (_ bv0 32) |~#gl_list~0.offset|))} ~value := #in~value;call #t~malloc48.base, #t~malloc48.offset := #Ultimate.alloc(20bv32);~node~1.base, ~node~1.offset := #t~malloc48.base, #t~malloc48.offset; {1856#(and (= (_ bv0 1) (select |old(#valid)| gl_insert_~node~1.base)) (= (_ bv0 32) |~#gl_list~0.offset|))} is VALID [2018-11-14 16:22:50,372 INFO L273 TraceCheckUtils]: 9: Hoare triple {1856#(and (= (_ bv0 1) (select |old(#valid)| gl_insert_~node~1.base)) (= (_ bv0 32) |~#gl_list~0.offset|))} assume !(~node~1.base == 0bv32 && ~node~1.offset == 0bv32); {1856#(and (= (_ bv0 1) (select |old(#valid)| gl_insert_~node~1.base)) (= (_ bv0 32) |~#gl_list~0.offset|))} is VALID [2018-11-14 16:22:50,373 INFO L273 TraceCheckUtils]: 10: Hoare triple {1856#(and (= (_ bv0 1) (select |old(#valid)| gl_insert_~node~1.base)) (= (_ bv0 32) |~#gl_list~0.offset|))} call write~intINTTYPE4(~value, ~node~1.base, ~node~1.offset, 4bv32); {1856#(and (= (_ bv0 1) (select |old(#valid)| gl_insert_~node~1.base)) (= (_ bv0 32) |~#gl_list~0.offset|))} is VALID [2018-11-14 16:22:50,374 INFO L256 TraceCheckUtils]: 11: Hoare triple {1856#(and (= (_ bv0 1) (select |old(#valid)| gl_insert_~node~1.base)) (= (_ bv0 32) |~#gl_list~0.offset|))} call list_add(~node~1.base, ~bvadd32(4bv32, ~node~1.offset), ~#gl_list~0.base, ~#gl_list~0.offset); {1866#(= (_ bv0 32) |~#gl_list~0.offset|)} is VALID [2018-11-14 16:22:50,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {1866#(= (_ bv0 32) |~#gl_list~0.offset|)} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1870#(and (= list_add_~head.offset |list_add_#in~head.offset|) (= (_ bv0 32) |~#gl_list~0.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~new.base| list_add_~new.base))} is VALID [2018-11-14 16:22:50,379 INFO L256 TraceCheckUtils]: 13: Hoare triple {1870#(and (= list_add_~head.offset |list_add_#in~head.offset|) (= (_ bv0 32) |~#gl_list~0.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~new.base| list_add_~new.base))} call __list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem45.base, #t~mem45.offset); {1866#(= (_ bv0 32) |~#gl_list~0.offset|)} is VALID [2018-11-14 16:22:52,387 INFO L273 TraceCheckUtils]: 14: Hoare triple {1866#(= (_ bv0 32) |~#gl_list~0.offset|)} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset;call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32);call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32);call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32);call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); {1877#(or (and (exists ((__list_add_~new.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |__list_add_#in~new.base|) __list_add_~new.offset) |__list_add_#in~new.base|) (= |__list_add_#in~prev.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~new.base|) (bvadd __list_add_~new.offset (_ bv4 32)))))) (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (= (_ bv0 32) |~#gl_list~0.offset|)) (and (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (exists ((v_prenex_10 (_ BitVec 32)) (__list_add_~next.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~new.base|) v_prenex_10)) (bvadd __list_add_~next.offset (_ bv4 32))) |__list_add_#in~new.base|) (= |__list_add_#in~prev.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~new.base|) (bvadd v_prenex_10 (_ bv4 32)))))) (= (_ bv0 32) |~#gl_list~0.offset|)))} is UNKNOWN [2018-11-14 16:22:52,388 INFO L273 TraceCheckUtils]: 15: Hoare triple {1877#(or (and (exists ((__list_add_~new.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |__list_add_#in~new.base|) __list_add_~new.offset) |__list_add_#in~new.base|) (= |__list_add_#in~prev.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~new.base|) (bvadd __list_add_~new.offset (_ bv4 32)))))) (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (= (_ bv0 32) |~#gl_list~0.offset|)) (and (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (exists ((v_prenex_10 (_ BitVec 32)) (__list_add_~next.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~new.base|) v_prenex_10)) (bvadd __list_add_~next.offset (_ bv4 32))) |__list_add_#in~new.base|) (= |__list_add_#in~prev.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~new.base|) (bvadd v_prenex_10 (_ bv4 32)))))) (= (_ bv0 32) |~#gl_list~0.offset|)))} assume true; {1877#(or (and (exists ((__list_add_~new.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |__list_add_#in~new.base|) __list_add_~new.offset) |__list_add_#in~new.base|) (= |__list_add_#in~prev.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~new.base|) (bvadd __list_add_~new.offset (_ bv4 32)))))) (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (= (_ bv0 32) |~#gl_list~0.offset|)) (and (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (exists ((v_prenex_10 (_ BitVec 32)) (__list_add_~next.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~new.base|) v_prenex_10)) (bvadd __list_add_~next.offset (_ bv4 32))) |__list_add_#in~new.base|) (= |__list_add_#in~prev.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~new.base|) (bvadd v_prenex_10 (_ bv4 32)))))) (= (_ bv0 32) |~#gl_list~0.offset|)))} is VALID [2018-11-14 16:22:52,395 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1877#(or (and (exists ((__list_add_~new.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |__list_add_#in~new.base|) __list_add_~new.offset) |__list_add_#in~new.base|) (= |__list_add_#in~prev.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~new.base|) (bvadd __list_add_~new.offset (_ bv4 32)))))) (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (= (_ bv0 32) |~#gl_list~0.offset|)) (and (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (exists ((v_prenex_10 (_ BitVec 32)) (__list_add_~next.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~new.base|) v_prenex_10)) (bvadd __list_add_~next.offset (_ bv4 32))) |__list_add_#in~new.base|) (= |__list_add_#in~prev.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~new.base|) (bvadd v_prenex_10 (_ bv4 32)))))) (= (_ bv0 32) |~#gl_list~0.offset|)))} {1870#(and (= list_add_~head.offset |list_add_#in~head.offset|) (= (_ bv0 32) |~#gl_list~0.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~new.base| list_add_~new.base))} #514#return; {1884#(or (and (exists ((v_prenex_10 (_ BitVec 32)) (__list_add_~next.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) v_prenex_10)) (bvadd __list_add_~next.offset (_ bv4 32))) |list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) (bvadd v_prenex_10 (_ bv4 32))) |list_add_#in~head.base|))) (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.base|) (= (_ bv0 32) |~#gl_list~0.offset|)) (and (exists ((__list_add_~new.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) __list_add_~new.offset) |list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) (bvadd __list_add_~new.offset (_ bv4 32))) |list_add_#in~head.base|))) (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.base|) (= (_ bv0 32) |~#gl_list~0.offset|)))} is VALID [2018-11-14 16:22:52,396 INFO L273 TraceCheckUtils]: 17: Hoare triple {1884#(or (and (exists ((v_prenex_10 (_ BitVec 32)) (__list_add_~next.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) v_prenex_10)) (bvadd __list_add_~next.offset (_ bv4 32))) |list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) (bvadd v_prenex_10 (_ bv4 32))) |list_add_#in~head.base|))) (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.base|) (= (_ bv0 32) |~#gl_list~0.offset|)) (and (exists ((__list_add_~new.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) __list_add_~new.offset) |list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) (bvadd __list_add_~new.offset (_ bv4 32))) |list_add_#in~head.base|))) (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.base|) (= (_ bv0 32) |~#gl_list~0.offset|)))} havoc #t~mem45.base, #t~mem45.offset; {1884#(or (and (exists ((v_prenex_10 (_ BitVec 32)) (__list_add_~next.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) v_prenex_10)) (bvadd __list_add_~next.offset (_ bv4 32))) |list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) (bvadd v_prenex_10 (_ bv4 32))) |list_add_#in~head.base|))) (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.base|) (= (_ bv0 32) |~#gl_list~0.offset|)) (and (exists ((__list_add_~new.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) __list_add_~new.offset) |list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) (bvadd __list_add_~new.offset (_ bv4 32))) |list_add_#in~head.base|))) (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.base|) (= (_ bv0 32) |~#gl_list~0.offset|)))} is VALID [2018-11-14 16:22:52,396 INFO L273 TraceCheckUtils]: 18: Hoare triple {1884#(or (and (exists ((v_prenex_10 (_ BitVec 32)) (__list_add_~next.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) v_prenex_10)) (bvadd __list_add_~next.offset (_ bv4 32))) |list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) (bvadd v_prenex_10 (_ bv4 32))) |list_add_#in~head.base|))) (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.base|) (= (_ bv0 32) |~#gl_list~0.offset|)) (and (exists ((__list_add_~new.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) __list_add_~new.offset) |list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) (bvadd __list_add_~new.offset (_ bv4 32))) |list_add_#in~head.base|))) (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.base|) (= (_ bv0 32) |~#gl_list~0.offset|)))} assume true; {1884#(or (and (exists ((v_prenex_10 (_ BitVec 32)) (__list_add_~next.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) v_prenex_10)) (bvadd __list_add_~next.offset (_ bv4 32))) |list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) (bvadd v_prenex_10 (_ bv4 32))) |list_add_#in~head.base|))) (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.base|) (= (_ bv0 32) |~#gl_list~0.offset|)) (and (exists ((__list_add_~new.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) __list_add_~new.offset) |list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) (bvadd __list_add_~new.offset (_ bv4 32))) |list_add_#in~head.base|))) (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.base|) (= (_ bv0 32) |~#gl_list~0.offset|)))} is VALID [2018-11-14 16:22:52,402 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1884#(or (and (exists ((v_prenex_10 (_ BitVec 32)) (__list_add_~next.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) v_prenex_10)) (bvadd __list_add_~next.offset (_ bv4 32))) |list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) (bvadd v_prenex_10 (_ bv4 32))) |list_add_#in~head.base|))) (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.base|) (= (_ bv0 32) |~#gl_list~0.offset|)) (and (exists ((__list_add_~new.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) __list_add_~new.offset) |list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) (bvadd __list_add_~new.offset (_ bv4 32))) |list_add_#in~head.base|))) (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.base|) (= (_ bv0 32) |~#gl_list~0.offset|)))} {1856#(and (= (_ bv0 1) (select |old(#valid)| gl_insert_~node~1.base)) (= (_ bv0 32) |~#gl_list~0.offset|))} #458#return; {1894#(or (and (exists ((v_prenex_10 (_ BitVec 32)) (__list_add_~next.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| gl_insert_~node~1.base) v_prenex_10)) (bvadd __list_add_~next.offset (_ bv4 32))) gl_insert_~node~1.base) (= |~#gl_list~0.base| (select (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (bvadd v_prenex_10 (_ bv4 32)))))) (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) gl_insert_~node~1.base) (= (_ bv0 1) (select |old(#valid)| gl_insert_~node~1.base)) (= (_ bv0 32) |~#gl_list~0.offset|)) (and (exists ((__list_add_~new.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| gl_insert_~node~1.base) __list_add_~new.offset) gl_insert_~node~1.base) (= |~#gl_list~0.base| (select (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (bvadd __list_add_~new.offset (_ bv4 32)))))) (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) gl_insert_~node~1.base) (= (_ bv0 1) (select |old(#valid)| gl_insert_~node~1.base)) (= (_ bv0 32) |~#gl_list~0.offset|)))} is VALID [2018-11-14 16:22:52,420 INFO L273 TraceCheckUtils]: 20: Hoare triple {1894#(or (and (exists ((v_prenex_10 (_ BitVec 32)) (__list_add_~next.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| gl_insert_~node~1.base) v_prenex_10)) (bvadd __list_add_~next.offset (_ bv4 32))) gl_insert_~node~1.base) (= |~#gl_list~0.base| (select (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (bvadd v_prenex_10 (_ bv4 32)))))) (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) gl_insert_~node~1.base) (= (_ bv0 1) (select |old(#valid)| gl_insert_~node~1.base)) (= (_ bv0 32) |~#gl_list~0.offset|)) (and (exists ((__list_add_~new.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| gl_insert_~node~1.base) __list_add_~new.offset) gl_insert_~node~1.base) (= |~#gl_list~0.base| (select (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (bvadd __list_add_~new.offset (_ bv4 32)))))) (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) gl_insert_~node~1.base) (= (_ bv0 1) (select |old(#valid)| gl_insert_~node~1.base)) (= (_ bv0 32) |~#gl_list~0.offset|)))} assume true;call write~$Pointer$(~node~1.base, ~bvadd32(12bv32, ~node~1.offset), ~node~1.base, ~bvadd32(12bv32, ~node~1.offset), 4bv32);call write~$Pointer$(~node~1.base, ~bvadd32(12bv32, ~node~1.offset), ~node~1.base, ~bvadd32(16bv32, ~node~1.offset), 4bv32); {1898#(and (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv16 32)))))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|))} is VALID [2018-11-14 16:22:52,422 INFO L273 TraceCheckUtils]: 21: Hoare triple {1898#(and (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv16 32)))))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|))} assume true; {1898#(and (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv16 32)))))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|))} is VALID [2018-11-14 16:22:52,424 INFO L273 TraceCheckUtils]: 22: Hoare triple {1898#(and (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv16 32)))))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|))} assume true; {1898#(and (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv16 32)))))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|))} is VALID [2018-11-14 16:22:52,427 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1898#(and (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv16 32)))))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|))} {1846#(and (= |#valid| |old(#valid)|) (= (_ bv0 32) |~#gl_list~0.offset|))} #502#return; {1898#(and (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv16 32)))))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|))} is VALID [2018-11-14 16:22:52,429 INFO L273 TraceCheckUtils]: 24: Hoare triple {1898#(and (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv16 32)))))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|))} havoc #t~nondet50; {1898#(and (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv16 32)))))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|))} is VALID [2018-11-14 16:22:52,433 INFO L273 TraceCheckUtils]: 25: Hoare triple {1898#(and (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv16 32)))))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|))} assume !(#t~nondet49 != 0bv32);havoc #t~nondet49; {1898#(and (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv16 32)))))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|))} is VALID [2018-11-14 16:22:52,435 INFO L273 TraceCheckUtils]: 26: Hoare triple {1898#(and (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv16 32)))))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|))} assume true; {1898#(and (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv16 32)))))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|))} is VALID [2018-11-14 16:22:52,439 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1898#(and (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv16 32)))))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|))} {1833#(or (and (= (bvadd (select |#valid| |~#gl_list~0.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |~#gl_list~0.offset|) (= (select |#valid| (_ bv0 32)) (_ bv0 1))) (and (= (bvadd (select |#valid| |~#gl_list~0.base|) (_ bv1 1)) (_ bv0 1)) (= |~#gl_list~0.base| (_ bv0 32)) (= (_ bv0 32) |~#gl_list~0.offset|)))} #504#return; {1920#(and (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv16 32)))))) (not (= |~#gl_list~0.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|))) (= (_ bv0 32) |~#gl_list~0.offset|))} is VALID [2018-11-14 16:22:52,442 INFO L256 TraceCheckUtils]: 28: Hoare triple {1920#(and (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)) (bvadd v_prenex_38 (_ bv16 32)))))) (not (= |~#gl_list~0.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|))) (= (_ bv0 32) |~#gl_list~0.offset|))} call inspect(~#gl_list~0.base, ~#gl_list~0.offset); {1924#(and (not (= |inspect_#in~head.base| (select (select |#memory_$Pointer$.base| |inspect_#in~head.base|) |inspect_#in~head.offset|))) (= |inspect_#in~head.offset| (_ bv0 32)) (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_#in~head.base|) |inspect_#in~head.offset|)) (bvadd v_prenex_38 (_ bv16 32))) (select (select |#memory_$Pointer$.base| |inspect_#in~head.base|) |inspect_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_#in~head.base|) |inspect_#in~head.offset|)) (bvadd v_prenex_38 (_ bv12 32))) (select (select |#memory_$Pointer$.base| |inspect_#in~head.base|) |inspect_#in~head.offset|)))))} is VALID [2018-11-14 16:22:52,444 INFO L273 TraceCheckUtils]: 29: Hoare triple {1924#(and (not (= |inspect_#in~head.base| (select (select |#memory_$Pointer$.base| |inspect_#in~head.base|) |inspect_#in~head.offset|))) (= |inspect_#in~head.offset| (_ bv0 32)) (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_#in~head.base|) |inspect_#in~head.offset|)) (bvadd v_prenex_38 (_ bv16 32))) (select (select |#memory_$Pointer$.base| |inspect_#in~head.base|) |inspect_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_#in~head.base|) |inspect_#in~head.offset|)) (bvadd v_prenex_38 (_ bv12 32))) (select (select |#memory_$Pointer$.base| |inspect_#in~head.base|) |inspect_#in~head.offset|)))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1928#(and (= (_ bv0 32) inspect_~head.offset) (not (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) inspect_~head.base)) (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)) (bvadd v_prenex_38 (_ bv16 32)))))))} is VALID [2018-11-14 16:22:52,447 INFO L273 TraceCheckUtils]: 30: Hoare triple {1928#(and (= (_ bv0 32) inspect_~head.offset) (not (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) inspect_~head.base)) (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)) (bvadd v_prenex_38 (_ bv16 32)))))))} assume true; {1928#(and (= (_ bv0 32) inspect_~head.offset) (not (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) inspect_~head.base)) (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)) (bvadd v_prenex_38 (_ bv16 32)))))))} is VALID [2018-11-14 16:22:52,449 INFO L273 TraceCheckUtils]: 31: Hoare triple {1928#(and (= (_ bv0 32) inspect_~head.offset) (not (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) inspect_~head.base)) (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)) (bvadd v_prenex_38 (_ bv16 32)))))))} assume !(~head.base == 0bv32 && ~head.offset == 0bv32); {1928#(and (= (_ bv0 32) inspect_~head.offset) (not (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) inspect_~head.base)) (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)) (bvadd v_prenex_38 (_ bv16 32)))))))} is VALID [2018-11-14 16:22:52,452 INFO L273 TraceCheckUtils]: 32: Hoare triple {1928#(and (= (_ bv0 32) inspect_~head.offset) (not (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) inspect_~head.base)) (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)) (bvadd v_prenex_38 (_ bv16 32)))))))} assume true; {1928#(and (= (_ bv0 32) inspect_~head.offset) (not (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) inspect_~head.base)) (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)) (bvadd v_prenex_38 (_ bv16 32)))))))} is VALID [2018-11-14 16:22:52,453 INFO L273 TraceCheckUtils]: 33: Hoare triple {1928#(and (= (_ bv0 32) inspect_~head.offset) (not (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) inspect_~head.base)) (exists ((v_prenex_38 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)) (bvadd v_prenex_38 (_ bv12 32)))) (= (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)) (bvadd v_prenex_38 (_ bv16 32)))))))} assume true;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1941#(not (= |inspect_#t~mem30.base| inspect_~head.base))} is VALID [2018-11-14 16:22:52,454 INFO L273 TraceCheckUtils]: 34: Hoare triple {1941#(not (= |inspect_#t~mem30.base| inspect_~head.base))} assume !(#t~mem30.base != ~head.base || #t~mem30.offset != ~head.offset);havoc #t~mem30.base, #t~mem30.offset; {1826#false} is VALID [2018-11-14 16:22:52,454 INFO L256 TraceCheckUtils]: 35: Hoare triple {1826#false} call fail(); {1826#false} is VALID [2018-11-14 16:22:52,455 INFO L273 TraceCheckUtils]: 36: Hoare triple {1826#false} assume !false; {1826#false} is VALID [2018-11-14 16:22:52,465 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 16:22:52,465 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:22:52,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:22:52,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-14 16:22:52,468 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-11-14 16:22:52,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:22:52,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 16:22:53,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:22:53,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 16:22:53,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 16:22:53,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:22:53,994 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand 15 states.