/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_remove_all.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:32:36,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:32:36,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:32:36,109 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:32:36,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:32:36,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:32:36,112 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:32:36,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:32:36,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:32:36,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:32:36,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:32:36,119 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:32:36,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:32:36,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:32:36,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:32:36,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:32:36,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:32:36,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:32:36,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:32:36,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:32:36,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:32:36,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:32:36,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:32:36,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:32:36,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:32:36,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:32:36,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:32:36,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:32:36,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:32:36,139 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:32:36,139 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:32:36,140 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:32:36,141 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:32:36,141 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:32:36,142 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:32:36,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:32:36,143 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:32:36,144 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:32:36,144 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:32:36,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:32:36,145 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:32:36,146 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:32:36,175 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:32:36,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:32:36,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:32:36,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:32:36,178 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:32:36,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:32:36,179 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:32:36,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:32:36,179 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:32:36,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:32:36,180 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:32:36,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:32:36,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:32:36,181 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:32:36,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:32:36,182 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:32:36,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:32:36,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:32:36,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:32:36,182 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:32:36,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:32:36,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:32:36,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:32:36,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:32:36,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:32:36,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:32:36,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:32:36,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:32:36,184 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:32:36,185 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:32:36,503 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:32:36,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:32:36,520 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:32:36,522 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:32:36,523 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:32:36,523 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_remove_all.i [2020-07-17 22:32:36,607 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1612a583/63ddf41b90ce432189e371ae3a3ba5dd/FLAGbbd156e51 [2020-07-17 22:32:37,178 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:32:37,179 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_remove_all.i [2020-07-17 22:32:37,192 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1612a583/63ddf41b90ce432189e371ae3a3ba5dd/FLAGbbd156e51 [2020-07-17 22:32:37,443 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1612a583/63ddf41b90ce432189e371ae3a3ba5dd [2020-07-17 22:32:37,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:32:37,455 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:32:37,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:32:37,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:32:37,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:32:37,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:32:37" (1/1) ... [2020-07-17 22:32:37,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2173f6bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:32:37, skipping insertion in model container [2020-07-17 22:32:37,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:32:37" (1/1) ... [2020-07-17 22:32:37,474 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:32:37,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:32:38,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:32:38,047 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:32:38,113 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:32:38,175 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:32:38,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:32:38 WrapperNode [2020-07-17 22:32:38,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:32:38,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:32:38,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:32:38,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:32:38,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:32:38" (1/1) ... [2020-07-17 22:32:38,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:32:38" (1/1) ... [2020-07-17 22:32:38,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:32:38" (1/1) ... [2020-07-17 22:32:38,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:32:38" (1/1) ... [2020-07-17 22:32:38,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:32:38" (1/1) ... [2020-07-17 22:32:38,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:32:38" (1/1) ... [2020-07-17 22:32:38,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:32:38" (1/1) ... [2020-07-17 22:32:38,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:32:38,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:32:38,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:32:38,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:32:38,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:32:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:32:38,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:32:38,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:32:38,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-17 22:32:38,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-17 22:32:38,349 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-17 22:32:38,349 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2020-07-17 22:32:38,349 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2020-07-17 22:32:38,349 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_remove_first [2020-07-17 22:32:38,350 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:32:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:32:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-17 22:32:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-17 22:32:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-17 22:32:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-17 22:32:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-17 22:32:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-17 22:32:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-17 22:32:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-17 22:32:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-17 22:32:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-17 22:32:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-17 22:32:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-17 22:32:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-17 22:32:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-17 22:32:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-17 22:32:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-17 22:32:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-17 22:32:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-17 22:32:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-17 22:32:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-17 22:32:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-17 22:32:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-17 22:32:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-17 22:32:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-17 22:32:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-17 22:32:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-17 22:32:38,356 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-17 22:32:38,356 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-17 22:32:38,356 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-17 22:32:38,356 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-17 22:32:38,356 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-17 22:32:38,357 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-17 22:32:38,357 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-17 22:32:38,357 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-17 22:32:38,357 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-17 22:32:38,357 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-17 22:32:38,357 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-17 22:32:38,357 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-17 22:32:38,358 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-17 22:32:38,358 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-17 22:32:38,358 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-17 22:32:38,358 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-17 22:32:38,358 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-17 22:32:38,358 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-17 22:32:38,358 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-17 22:32:38,358 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-17 22:32:38,358 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-17 22:32:38,358 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-17 22:32:38,359 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-17 22:32:38,359 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-17 22:32:38,359 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-17 22:32:38,359 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-17 22:32:38,359 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:32:38,359 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-17 22:32:38,359 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-17 22:32:38,359 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-17 22:32:38,359 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-17 22:32:38,360 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-17 22:32:38,360 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-17 22:32:38,361 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-17 22:32:38,361 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-17 22:32:38,361 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:32:38,361 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-17 22:32:38,361 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-17 22:32:38,361 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-17 22:32:38,361 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-17 22:32:38,361 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-17 22:32:38,362 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-17 22:32:38,362 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-17 22:32:38,362 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-17 22:32:38,362 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-17 22:32:38,362 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-17 22:32:38,362 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-17 22:32:38,362 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-17 22:32:38,363 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-17 22:32:38,363 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-17 22:32:38,363 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-17 22:32:38,363 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-17 22:32:38,363 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-17 22:32:38,363 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-17 22:32:38,363 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-17 22:32:38,364 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-17 22:32:38,364 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-17 22:32:38,364 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-17 22:32:38,364 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-17 22:32:38,364 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-17 22:32:38,364 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-17 22:32:38,364 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-17 22:32:38,365 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-17 22:32:38,365 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-17 22:32:38,365 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-17 22:32:38,365 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-17 22:32:38,365 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-17 22:32:38,365 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-17 22:32:38,365 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-17 22:32:38,365 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-17 22:32:38,365 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-17 22:32:38,366 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-17 22:32:38,366 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-17 22:32:38,366 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-17 22:32:38,366 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-17 22:32:38,366 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-17 22:32:38,366 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-17 22:32:38,366 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-17 22:32:38,366 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-17 22:32:38,366 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-17 22:32:38,366 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2020-07-17 22:32:38,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:32:38,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-17 22:32:38,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:32:38,367 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2020-07-17 22:32:38,367 INFO L130 BoogieDeclarations]: Found specification of procedure dll_remove_first [2020-07-17 22:32:38,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-17 22:32:38,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:32:38,368 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:32:38,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:32:38,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-17 22:32:38,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:32:38,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:32:38,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:32:38,747 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-17 22:32:39,114 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:32:39,115 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-17 22:32:39,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:32:39 BoogieIcfgContainer [2020-07-17 22:32:39,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:32:39,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:32:39,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:32:39,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:32:39,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:32:37" (1/3) ... [2020-07-17 22:32:39,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb96766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:32:39, skipping insertion in model container [2020-07-17 22:32:39,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:32:38" (2/3) ... [2020-07-17 22:32:39,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb96766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:32:39, skipping insertion in model container [2020-07-17 22:32:39,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:32:39" (3/3) ... [2020-07-17 22:32:39,131 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all.i [2020-07-17 22:32:39,147 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:32:39,157 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:32:39,173 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:32:39,203 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:32:39,204 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:32:39,204 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:32:39,204 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:32:39,204 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:32:39,204 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:32:39,205 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:32:39,205 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:32:39,228 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-17 22:32:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:32:39,238 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:32:39,239 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:32:39,240 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:32:39,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:32:39,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1664510762, now seen corresponding path program 1 times [2020-07-17 22:32:39,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:32:39,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751181492] [2020-07-17 22:32:39,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:32:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:39,528 INFO L280 TraceCheckUtils]: 0: Hoare triple {49#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {39#true} is VALID [2020-07-17 22:32:39,529 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:32:39,530 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #98#return; {39#true} is VALID [2020-07-17 22:32:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:39,629 INFO L280 TraceCheckUtils]: 0: Hoare triple {50#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {39#true} is VALID [2020-07-17 22:32:39,631 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume !true; {40#false} is VALID [2020-07-17 22:32:39,631 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {40#false} is VALID [2020-07-17 22:32:39,632 INFO L280 TraceCheckUtils]: 3: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-17 22:32:39,632 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {40#false} {39#true} #92#return; {40#false} is VALID [2020-07-17 22:32:39,635 INFO L263 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {49#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:32:39,635 INFO L280 TraceCheckUtils]: 1: Hoare triple {49#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {39#true} is VALID [2020-07-17 22:32:39,635 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:32:39,636 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #98#return; {39#true} is VALID [2020-07-17 22:32:39,636 INFO L263 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret11 := main(); {39#true} is VALID [2020-07-17 22:32:39,638 INFO L280 TraceCheckUtils]: 5: Hoare triple {39#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {39#true} is VALID [2020-07-17 22:32:39,640 INFO L263 TraceCheckUtils]: 6: Hoare triple {39#true} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {50#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:32:39,640 INFO L280 TraceCheckUtils]: 7: Hoare triple {50#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {39#true} is VALID [2020-07-17 22:32:39,641 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#true} assume !true; {40#false} is VALID [2020-07-17 22:32:39,641 INFO L280 TraceCheckUtils]: 9: Hoare triple {40#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {40#false} is VALID [2020-07-17 22:32:39,642 INFO L280 TraceCheckUtils]: 10: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-17 22:32:39,642 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {40#false} {39#true} #92#return; {40#false} is VALID [2020-07-17 22:32:39,643 INFO L280 TraceCheckUtils]: 12: Hoare triple {40#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {40#false} is VALID [2020-07-17 22:32:39,643 INFO L280 TraceCheckUtils]: 13: Hoare triple {40#false} assume !(~i~0 >= 0); {40#false} is VALID [2020-07-17 22:32:39,644 INFO L280 TraceCheckUtils]: 14: Hoare triple {40#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {40#false} is VALID [2020-07-17 22:32:39,644 INFO L280 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {40#false} is VALID [2020-07-17 22:32:39,645 INFO L280 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2020-07-17 22:32:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:32:39,650 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751181492] [2020-07-17 22:32:39,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:32:39,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:32:39,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817035214] [2020-07-17 22:32:39,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-17 22:32:39,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:32:39,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:32:39,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:32:39,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:32:39,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:32:39,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:32:39,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:32:39,744 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 4 states. [2020-07-17 22:32:40,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:40,126 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2020-07-17 22:32:40,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:32:40,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-17 22:32:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:32:40,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:32:40,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2020-07-17 22:32:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:32:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2020-07-17 22:32:40,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 73 transitions. [2020-07-17 22:32:40,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:32:40,283 INFO L225 Difference]: With dead ends: 61 [2020-07-17 22:32:40,283 INFO L226 Difference]: Without dead ends: 34 [2020-07-17 22:32:40,287 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:32:40,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-17 22:32:40,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2020-07-17 22:32:40,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:32:40,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 29 states. [2020-07-17 22:32:40,352 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 29 states. [2020-07-17 22:32:40,352 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 29 states. [2020-07-17 22:32:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:40,357 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-17 22:32:40,357 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-17 22:32:40,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:32:40,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:32:40,358 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 34 states. [2020-07-17 22:32:40,358 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 34 states. [2020-07-17 22:32:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:40,363 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-17 22:32:40,363 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-17 22:32:40,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:32:40,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:32:40,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:32:40,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:32:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-17 22:32:40,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2020-07-17 22:32:40,369 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 17 [2020-07-17 22:32:40,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:32:40,370 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2020-07-17 22:32:40,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:32:40,370 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-07-17 22:32:40,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:32:40,371 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:32:40,371 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:32:40,372 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:32:40,372 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:32:40,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:32:40,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1646407191, now seen corresponding path program 1 times [2020-07-17 22:32:40,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:32:40,373 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011690416] [2020-07-17 22:32:40,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:32:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:40,513 INFO L280 TraceCheckUtils]: 0: Hoare triple {255#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {244#true} is VALID [2020-07-17 22:32:40,513 INFO L280 TraceCheckUtils]: 1: Hoare triple {244#true} assume true; {244#true} is VALID [2020-07-17 22:32:40,514 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {244#true} {244#true} #98#return; {244#true} is VALID [2020-07-17 22:32:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:40,612 INFO L280 TraceCheckUtils]: 0: Hoare triple {256#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {257#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:32:40,613 INFO L280 TraceCheckUtils]: 1: Hoare triple {257#(= dll_create_~len |dll_create_#in~len|)} assume !(~len > 0); {258#(<= |dll_create_#in~len| 0)} is VALID [2020-07-17 22:32:40,613 INFO L280 TraceCheckUtils]: 2: Hoare triple {258#(<= |dll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {258#(<= |dll_create_#in~len| 0)} is VALID [2020-07-17 22:32:40,617 INFO L280 TraceCheckUtils]: 3: Hoare triple {258#(<= |dll_create_#in~len| 0)} assume true; {258#(<= |dll_create_#in~len| 0)} is VALID [2020-07-17 22:32:40,619 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {258#(<= |dll_create_#in~len| 0)} {249#(<= 2 main_~len~0)} #92#return; {245#false} is VALID [2020-07-17 22:32:40,621 INFO L263 TraceCheckUtils]: 0: Hoare triple {244#true} call ULTIMATE.init(); {255#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:32:40,621 INFO L280 TraceCheckUtils]: 1: Hoare triple {255#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {244#true} is VALID [2020-07-17 22:32:40,621 INFO L280 TraceCheckUtils]: 2: Hoare triple {244#true} assume true; {244#true} is VALID [2020-07-17 22:32:40,622 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {244#true} {244#true} #98#return; {244#true} is VALID [2020-07-17 22:32:40,622 INFO L263 TraceCheckUtils]: 4: Hoare triple {244#true} call #t~ret11 := main(); {244#true} is VALID [2020-07-17 22:32:40,631 INFO L280 TraceCheckUtils]: 5: Hoare triple {244#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {249#(<= 2 main_~len~0)} is VALID [2020-07-17 22:32:40,633 INFO L263 TraceCheckUtils]: 6: Hoare triple {249#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {256#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:32:40,635 INFO L280 TraceCheckUtils]: 7: Hoare triple {256#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {257#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:32:40,636 INFO L280 TraceCheckUtils]: 8: Hoare triple {257#(= dll_create_~len |dll_create_#in~len|)} assume !(~len > 0); {258#(<= |dll_create_#in~len| 0)} is VALID [2020-07-17 22:32:40,636 INFO L280 TraceCheckUtils]: 9: Hoare triple {258#(<= |dll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {258#(<= |dll_create_#in~len| 0)} is VALID [2020-07-17 22:32:40,638 INFO L280 TraceCheckUtils]: 10: Hoare triple {258#(<= |dll_create_#in~len| 0)} assume true; {258#(<= |dll_create_#in~len| 0)} is VALID [2020-07-17 22:32:40,640 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {258#(<= |dll_create_#in~len| 0)} {249#(<= 2 main_~len~0)} #92#return; {245#false} is VALID [2020-07-17 22:32:40,640 INFO L280 TraceCheckUtils]: 12: Hoare triple {245#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {245#false} is VALID [2020-07-17 22:32:40,641 INFO L280 TraceCheckUtils]: 13: Hoare triple {245#false} assume !(~i~0 >= 0); {245#false} is VALID [2020-07-17 22:32:40,641 INFO L280 TraceCheckUtils]: 14: Hoare triple {245#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {245#false} is VALID [2020-07-17 22:32:40,641 INFO L280 TraceCheckUtils]: 15: Hoare triple {245#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {245#false} is VALID [2020-07-17 22:32:40,642 INFO L280 TraceCheckUtils]: 16: Hoare triple {245#false} assume !false; {245#false} is VALID [2020-07-17 22:32:40,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:32:40,644 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011690416] [2020-07-17 22:32:40,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:32:40,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:32:40,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275495966] [2020-07-17 22:32:40,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-07-17 22:32:40,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:32:40,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:32:40,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:32:40,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:32:40,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:32:40,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:32:40,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:32:40,684 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 7 states. [2020-07-17 22:32:41,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:41,228 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2020-07-17 22:32:41,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:32:41,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-07-17 22:32:41,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:32:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:32:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2020-07-17 22:32:41,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:32:41,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2020-07-17 22:32:41,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 57 transitions. [2020-07-17 22:32:41,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:32:41,341 INFO L225 Difference]: With dead ends: 51 [2020-07-17 22:32:41,341 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 22:32:41,343 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:32:41,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 22:32:41,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2020-07-17 22:32:41,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:32:41,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 30 states. [2020-07-17 22:32:41,372 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 30 states. [2020-07-17 22:32:41,372 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 30 states. [2020-07-17 22:32:41,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:41,375 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-17 22:32:41,376 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-17 22:32:41,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:32:41,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:32:41,377 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 35 states. [2020-07-17 22:32:41,377 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 35 states. [2020-07-17 22:32:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:41,380 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-17 22:32:41,380 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-17 22:32:41,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:32:41,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:32:41,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:32:41,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:32:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 22:32:41,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-17 22:32:41,384 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 17 [2020-07-17 22:32:41,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:32:41,384 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-17 22:32:41,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:32:41,384 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-17 22:32:41,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:32:41,385 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:32:41,386 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:32:41,386 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:32:41,386 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:32:41,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:32:41,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1603407070, now seen corresponding path program 1 times [2020-07-17 22:32:41,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:32:41,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335563724] [2020-07-17 22:32:41,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:32:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:41,465 INFO L280 TraceCheckUtils]: 0: Hoare triple {463#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {447#true} is VALID [2020-07-17 22:32:41,466 INFO L280 TraceCheckUtils]: 1: Hoare triple {447#true} assume true; {447#true} is VALID [2020-07-17 22:32:41,466 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {447#true} {447#true} #98#return; {447#true} is VALID [2020-07-17 22:32:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:41,524 INFO L280 TraceCheckUtils]: 0: Hoare triple {464#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:32:41,525 INFO L280 TraceCheckUtils]: 1: Hoare triple {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:32:41,526 INFO L280 TraceCheckUtils]: 2: Hoare triple {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:32:41,527 INFO L280 TraceCheckUtils]: 3: Hoare triple {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:32:41,528 INFO L280 TraceCheckUtils]: 4: Hoare triple {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {448#false} is VALID [2020-07-17 22:32:41,529 INFO L280 TraceCheckUtils]: 5: Hoare triple {448#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {448#false} is VALID [2020-07-17 22:32:41,529 INFO L280 TraceCheckUtils]: 6: Hoare triple {448#false} assume !(~len > 0); {448#false} is VALID [2020-07-17 22:32:41,529 INFO L280 TraceCheckUtils]: 7: Hoare triple {448#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {448#false} is VALID [2020-07-17 22:32:41,529 INFO L280 TraceCheckUtils]: 8: Hoare triple {448#false} assume true; {448#false} is VALID [2020-07-17 22:32:41,530 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {448#false} {452#(<= 2 main_~len~0)} #92#return; {448#false} is VALID [2020-07-17 22:32:41,531 INFO L263 TraceCheckUtils]: 0: Hoare triple {447#true} call ULTIMATE.init(); {463#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:32:41,531 INFO L280 TraceCheckUtils]: 1: Hoare triple {463#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {447#true} is VALID [2020-07-17 22:32:41,532 INFO L280 TraceCheckUtils]: 2: Hoare triple {447#true} assume true; {447#true} is VALID [2020-07-17 22:32:41,532 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {447#true} {447#true} #98#return; {447#true} is VALID [2020-07-17 22:32:41,532 INFO L263 TraceCheckUtils]: 4: Hoare triple {447#true} call #t~ret11 := main(); {447#true} is VALID [2020-07-17 22:32:41,533 INFO L280 TraceCheckUtils]: 5: Hoare triple {447#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {452#(<= 2 main_~len~0)} is VALID [2020-07-17 22:32:41,535 INFO L263 TraceCheckUtils]: 6: Hoare triple {452#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {464#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:32:41,536 INFO L280 TraceCheckUtils]: 7: Hoare triple {464#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:32:41,537 INFO L280 TraceCheckUtils]: 8: Hoare triple {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:32:41,537 INFO L280 TraceCheckUtils]: 9: Hoare triple {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:32:41,539 INFO L280 TraceCheckUtils]: 10: Hoare triple {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:32:41,540 INFO L280 TraceCheckUtils]: 11: Hoare triple {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {448#false} is VALID [2020-07-17 22:32:41,540 INFO L280 TraceCheckUtils]: 12: Hoare triple {448#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {448#false} is VALID [2020-07-17 22:32:41,540 INFO L280 TraceCheckUtils]: 13: Hoare triple {448#false} assume !(~len > 0); {448#false} is VALID [2020-07-17 22:32:41,541 INFO L280 TraceCheckUtils]: 14: Hoare triple {448#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {448#false} is VALID [2020-07-17 22:32:41,541 INFO L280 TraceCheckUtils]: 15: Hoare triple {448#false} assume true; {448#false} is VALID [2020-07-17 22:32:41,541 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {448#false} {452#(<= 2 main_~len~0)} #92#return; {448#false} is VALID [2020-07-17 22:32:41,541 INFO L280 TraceCheckUtils]: 17: Hoare triple {448#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {448#false} is VALID [2020-07-17 22:32:41,542 INFO L280 TraceCheckUtils]: 18: Hoare triple {448#false} assume !(~i~0 >= 0); {448#false} is VALID [2020-07-17 22:32:41,542 INFO L280 TraceCheckUtils]: 19: Hoare triple {448#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {448#false} is VALID [2020-07-17 22:32:41,542 INFO L280 TraceCheckUtils]: 20: Hoare triple {448#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {448#false} is VALID [2020-07-17 22:32:41,542 INFO L280 TraceCheckUtils]: 21: Hoare triple {448#false} assume !false; {448#false} is VALID [2020-07-17 22:32:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:32:41,544 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335563724] [2020-07-17 22:32:41,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:32:41,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:32:41,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679525459] [2020-07-17 22:32:41,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-07-17 22:32:41,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:32:41,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:32:41,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:32:41,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:32:41,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:32:41,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:32:41,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:32:41,574 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 6 states. [2020-07-17 22:32:41,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:41,980 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2020-07-17 22:32:41,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:32:41,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-07-17 22:32:41,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:32:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:32:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2020-07-17 22:32:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:32:41,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2020-07-17 22:32:41,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2020-07-17 22:32:42,078 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:32:42,080 INFO L225 Difference]: With dead ends: 56 [2020-07-17 22:32:42,080 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 22:32:42,084 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:32:42,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 22:32:42,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2020-07-17 22:32:42,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:32:42,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 33 states. [2020-07-17 22:32:42,110 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 33 states. [2020-07-17 22:32:42,110 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 33 states. [2020-07-17 22:32:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:42,113 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-17 22:32:42,113 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-17 22:32:42,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:32:42,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:32:42,114 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 35 states. [2020-07-17 22:32:42,114 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 35 states. [2020-07-17 22:32:42,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:42,117 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-17 22:32:42,117 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-17 22:32:42,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:32:42,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:32:42,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:32:42,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:32:42,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-17 22:32:42,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2020-07-17 22:32:42,120 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 22 [2020-07-17 22:32:42,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:32:42,120 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2020-07-17 22:32:42,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:32:42,121 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2020-07-17 22:32:42,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:32:42,122 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:32:42,122 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:32:42,122 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:32:42,122 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:32:42,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:32:42,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1990495648, now seen corresponding path program 1 times [2020-07-17 22:32:42,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:32:42,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312583587] [2020-07-17 22:32:42,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:32:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:42,189 INFO L280 TraceCheckUtils]: 0: Hoare triple {677#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {661#true} is VALID [2020-07-17 22:32:42,189 INFO L280 TraceCheckUtils]: 1: Hoare triple {661#true} assume true; {661#true} is VALID [2020-07-17 22:32:42,189 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {661#true} {661#true} #98#return; {661#true} is VALID [2020-07-17 22:32:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:42,266 INFO L280 TraceCheckUtils]: 0: Hoare triple {678#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {679#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:32:42,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {679#(= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {679#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:32:42,268 INFO L280 TraceCheckUtils]: 2: Hoare triple {679#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {679#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:32:42,269 INFO L280 TraceCheckUtils]: 3: Hoare triple {679#(= dll_create_~len |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {679#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:32:42,269 INFO L280 TraceCheckUtils]: 4: Hoare triple {679#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {679#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:32:42,270 INFO L280 TraceCheckUtils]: 5: Hoare triple {679#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {680#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:32:42,271 INFO L280 TraceCheckUtils]: 6: Hoare triple {680#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {681#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:32:42,271 INFO L280 TraceCheckUtils]: 7: Hoare triple {681#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {681#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:32:42,272 INFO L280 TraceCheckUtils]: 8: Hoare triple {681#(<= |dll_create_#in~len| 1)} assume true; {681#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:32:42,273 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {681#(<= |dll_create_#in~len| 1)} {666#(<= 2 main_~len~0)} #92#return; {662#false} is VALID [2020-07-17 22:32:42,275 INFO L263 TraceCheckUtils]: 0: Hoare triple {661#true} call ULTIMATE.init(); {677#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:32:42,275 INFO L280 TraceCheckUtils]: 1: Hoare triple {677#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {661#true} is VALID [2020-07-17 22:32:42,275 INFO L280 TraceCheckUtils]: 2: Hoare triple {661#true} assume true; {661#true} is VALID [2020-07-17 22:32:42,276 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {661#true} {661#true} #98#return; {661#true} is VALID [2020-07-17 22:32:42,276 INFO L263 TraceCheckUtils]: 4: Hoare triple {661#true} call #t~ret11 := main(); {661#true} is VALID [2020-07-17 22:32:42,277 INFO L280 TraceCheckUtils]: 5: Hoare triple {661#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {666#(<= 2 main_~len~0)} is VALID [2020-07-17 22:32:42,278 INFO L263 TraceCheckUtils]: 6: Hoare triple {666#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {678#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:32:42,279 INFO L280 TraceCheckUtils]: 7: Hoare triple {678#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {679#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:32:42,279 INFO L280 TraceCheckUtils]: 8: Hoare triple {679#(= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {679#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:32:42,280 INFO L280 TraceCheckUtils]: 9: Hoare triple {679#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {679#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:32:42,281 INFO L280 TraceCheckUtils]: 10: Hoare triple {679#(= dll_create_~len |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {679#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:32:42,281 INFO L280 TraceCheckUtils]: 11: Hoare triple {679#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {679#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:32:42,282 INFO L280 TraceCheckUtils]: 12: Hoare triple {679#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {680#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:32:42,282 INFO L280 TraceCheckUtils]: 13: Hoare triple {680#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {681#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:32:42,283 INFO L280 TraceCheckUtils]: 14: Hoare triple {681#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {681#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:32:42,283 INFO L280 TraceCheckUtils]: 15: Hoare triple {681#(<= |dll_create_#in~len| 1)} assume true; {681#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:32:42,284 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {681#(<= |dll_create_#in~len| 1)} {666#(<= 2 main_~len~0)} #92#return; {662#false} is VALID [2020-07-17 22:32:42,284 INFO L280 TraceCheckUtils]: 17: Hoare triple {662#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {662#false} is VALID [2020-07-17 22:32:42,285 INFO L280 TraceCheckUtils]: 18: Hoare triple {662#false} assume !(~i~0 >= 0); {662#false} is VALID [2020-07-17 22:32:42,285 INFO L280 TraceCheckUtils]: 19: Hoare triple {662#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {662#false} is VALID [2020-07-17 22:32:42,285 INFO L280 TraceCheckUtils]: 20: Hoare triple {662#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {662#false} is VALID [2020-07-17 22:32:42,285 INFO L280 TraceCheckUtils]: 21: Hoare triple {662#false} assume !false; {662#false} is VALID [2020-07-17 22:32:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:32:42,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312583587] [2020-07-17 22:32:42,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62882200] [2020-07-17 22:32:42,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:32:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:42,401 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-17 22:32:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:42,428 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:32:42,577 INFO L263 TraceCheckUtils]: 0: Hoare triple {661#true} call ULTIMATE.init(); {661#true} is VALID [2020-07-17 22:32:42,578 INFO L280 TraceCheckUtils]: 1: Hoare triple {661#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {661#true} is VALID [2020-07-17 22:32:42,578 INFO L280 TraceCheckUtils]: 2: Hoare triple {661#true} assume true; {661#true} is VALID [2020-07-17 22:32:42,581 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {661#true} {661#true} #98#return; {661#true} is VALID [2020-07-17 22:32:42,582 INFO L263 TraceCheckUtils]: 4: Hoare triple {661#true} call #t~ret11 := main(); {661#true} is VALID [2020-07-17 22:32:42,600 INFO L280 TraceCheckUtils]: 5: Hoare triple {661#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {666#(<= 2 main_~len~0)} is VALID [2020-07-17 22:32:42,600 INFO L263 TraceCheckUtils]: 6: Hoare triple {666#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {661#true} is VALID [2020-07-17 22:32:42,605 INFO L280 TraceCheckUtils]: 7: Hoare triple {661#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {706#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:32:42,610 INFO L280 TraceCheckUtils]: 8: Hoare triple {706#(<= |dll_create_#in~len| dll_create_~len)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {706#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:32:42,611 INFO L280 TraceCheckUtils]: 9: Hoare triple {706#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {706#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:32:42,612 INFO L280 TraceCheckUtils]: 10: Hoare triple {706#(<= |dll_create_#in~len| dll_create_~len)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {706#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:32:42,612 INFO L280 TraceCheckUtils]: 11: Hoare triple {706#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {706#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:32:42,613 INFO L280 TraceCheckUtils]: 12: Hoare triple {706#(<= |dll_create_#in~len| dll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {680#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:32:42,614 INFO L280 TraceCheckUtils]: 13: Hoare triple {680#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {681#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:32:42,615 INFO L280 TraceCheckUtils]: 14: Hoare triple {681#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {681#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:32:42,615 INFO L280 TraceCheckUtils]: 15: Hoare triple {681#(<= |dll_create_#in~len| 1)} assume true; {681#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:32:42,617 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {681#(<= |dll_create_#in~len| 1)} {666#(<= 2 main_~len~0)} #92#return; {662#false} is VALID [2020-07-17 22:32:42,617 INFO L280 TraceCheckUtils]: 17: Hoare triple {662#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {662#false} is VALID [2020-07-17 22:32:42,618 INFO L280 TraceCheckUtils]: 18: Hoare triple {662#false} assume !(~i~0 >= 0); {662#false} is VALID [2020-07-17 22:32:42,618 INFO L280 TraceCheckUtils]: 19: Hoare triple {662#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {662#false} is VALID [2020-07-17 22:32:42,618 INFO L280 TraceCheckUtils]: 20: Hoare triple {662#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {662#false} is VALID [2020-07-17 22:32:42,618 INFO L280 TraceCheckUtils]: 21: Hoare triple {662#false} assume !false; {662#false} is VALID [2020-07-17 22:32:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:32:42,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:32:42,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2020-07-17 22:32:42,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476264095] [2020-07-17 22:32:42,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-07-17 22:32:42,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:32:42,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:32:42,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:32:42,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:32:42,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:32:42,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:32:42,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:32:42,680 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 9 states. [2020-07-17 22:32:43,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:43,223 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2020-07-17 22:32:43,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:32:43,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-07-17 22:32:43,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:32:43,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:32:43,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2020-07-17 22:32:43,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:32:43,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2020-07-17 22:32:43,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2020-07-17 22:32:43,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:32:43,327 INFO L225 Difference]: With dead ends: 56 [2020-07-17 22:32:43,328 INFO L226 Difference]: Without dead ends: 40 [2020-07-17 22:32:43,328 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:32:43,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-17 22:32:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2020-07-17 22:32:43,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:32:43,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 35 states. [2020-07-17 22:32:43,356 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 35 states. [2020-07-17 22:32:43,356 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 35 states. [2020-07-17 22:32:43,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:43,359 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-17 22:32:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-17 22:32:43,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:32:43,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:32:43,361 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 40 states. [2020-07-17 22:32:43,361 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 40 states. [2020-07-17 22:32:43,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:43,363 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-17 22:32:43,363 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-17 22:32:43,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:32:43,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:32:43,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:32:43,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:32:43,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-17 22:32:43,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2020-07-17 22:32:43,367 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 22 [2020-07-17 22:32:43,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:32:43,367 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2020-07-17 22:32:43,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:32:43,368 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-17 22:32:43,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:32:43,369 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:32:43,369 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:32:43,582 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:32:43,584 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:32:43,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:32:43,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1511329333, now seen corresponding path program 1 times [2020-07-17 22:32:43,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:32:43,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265434016] [2020-07-17 22:32:43,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:32:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:43,684 INFO L280 TraceCheckUtils]: 0: Hoare triple {978#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {956#true} is VALID [2020-07-17 22:32:43,684 INFO L280 TraceCheckUtils]: 1: Hoare triple {956#true} assume true; {956#true} is VALID [2020-07-17 22:32:43,684 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {956#true} {956#true} #98#return; {956#true} is VALID [2020-07-17 22:32:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:43,736 INFO L280 TraceCheckUtils]: 0: Hoare triple {979#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {956#true} is VALID [2020-07-17 22:32:43,736 INFO L280 TraceCheckUtils]: 1: Hoare triple {956#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {956#true} is VALID [2020-07-17 22:32:43,737 INFO L280 TraceCheckUtils]: 2: Hoare triple {956#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {956#true} is VALID [2020-07-17 22:32:43,737 INFO L280 TraceCheckUtils]: 3: Hoare triple {956#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {956#true} is VALID [2020-07-17 22:32:43,737 INFO L280 TraceCheckUtils]: 4: Hoare triple {956#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {956#true} is VALID [2020-07-17 22:32:43,737 INFO L280 TraceCheckUtils]: 5: Hoare triple {956#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {956#true} is VALID [2020-07-17 22:32:43,738 INFO L280 TraceCheckUtils]: 6: Hoare triple {956#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {956#true} is VALID [2020-07-17 22:32:43,738 INFO L280 TraceCheckUtils]: 7: Hoare triple {956#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {956#true} is VALID [2020-07-17 22:32:43,738 INFO L280 TraceCheckUtils]: 8: Hoare triple {956#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {956#true} is VALID [2020-07-17 22:32:43,739 INFO L280 TraceCheckUtils]: 9: Hoare triple {956#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {956#true} is VALID [2020-07-17 22:32:43,739 INFO L280 TraceCheckUtils]: 10: Hoare triple {956#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {956#true} is VALID [2020-07-17 22:32:43,739 INFO L280 TraceCheckUtils]: 11: Hoare triple {956#true} assume !(~len > 0); {956#true} is VALID [2020-07-17 22:32:43,739 INFO L280 TraceCheckUtils]: 12: Hoare triple {956#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {956#true} is VALID [2020-07-17 22:32:43,740 INFO L280 TraceCheckUtils]: 13: Hoare triple {956#true} assume true; {956#true} is VALID [2020-07-17 22:32:43,741 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {956#true} {961#(<= 2 main_~len~0)} #92#return; {961#(<= 2 main_~len~0)} is VALID [2020-07-17 22:32:43,742 INFO L263 TraceCheckUtils]: 0: Hoare triple {956#true} call ULTIMATE.init(); {978#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:32:43,742 INFO L280 TraceCheckUtils]: 1: Hoare triple {978#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {956#true} is VALID [2020-07-17 22:32:43,743 INFO L280 TraceCheckUtils]: 2: Hoare triple {956#true} assume true; {956#true} is VALID [2020-07-17 22:32:43,743 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {956#true} {956#true} #98#return; {956#true} is VALID [2020-07-17 22:32:43,743 INFO L263 TraceCheckUtils]: 4: Hoare triple {956#true} call #t~ret11 := main(); {956#true} is VALID [2020-07-17 22:32:43,746 INFO L280 TraceCheckUtils]: 5: Hoare triple {956#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {961#(<= 2 main_~len~0)} is VALID [2020-07-17 22:32:43,749 INFO L263 TraceCheckUtils]: 6: Hoare triple {961#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {979#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:32:43,749 INFO L280 TraceCheckUtils]: 7: Hoare triple {979#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {956#true} is VALID [2020-07-17 22:32:43,749 INFO L280 TraceCheckUtils]: 8: Hoare triple {956#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {956#true} is VALID [2020-07-17 22:32:43,750 INFO L280 TraceCheckUtils]: 9: Hoare triple {956#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {956#true} is VALID [2020-07-17 22:32:43,750 INFO L280 TraceCheckUtils]: 10: Hoare triple {956#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {956#true} is VALID [2020-07-17 22:32:43,750 INFO L280 TraceCheckUtils]: 11: Hoare triple {956#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {956#true} is VALID [2020-07-17 22:32:43,750 INFO L280 TraceCheckUtils]: 12: Hoare triple {956#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {956#true} is VALID [2020-07-17 22:32:43,751 INFO L280 TraceCheckUtils]: 13: Hoare triple {956#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {956#true} is VALID [2020-07-17 22:32:43,751 INFO L280 TraceCheckUtils]: 14: Hoare triple {956#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {956#true} is VALID [2020-07-17 22:32:43,751 INFO L280 TraceCheckUtils]: 15: Hoare triple {956#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {956#true} is VALID [2020-07-17 22:32:43,751 INFO L280 TraceCheckUtils]: 16: Hoare triple {956#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {956#true} is VALID [2020-07-17 22:32:43,752 INFO L280 TraceCheckUtils]: 17: Hoare triple {956#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {956#true} is VALID [2020-07-17 22:32:43,752 INFO L280 TraceCheckUtils]: 18: Hoare triple {956#true} assume !(~len > 0); {956#true} is VALID [2020-07-17 22:32:43,752 INFO L280 TraceCheckUtils]: 19: Hoare triple {956#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {956#true} is VALID [2020-07-17 22:32:43,752 INFO L280 TraceCheckUtils]: 20: Hoare triple {956#true} assume true; {956#true} is VALID [2020-07-17 22:32:43,754 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {956#true} {961#(<= 2 main_~len~0)} #92#return; {961#(<= 2 main_~len~0)} is VALID [2020-07-17 22:32:43,755 INFO L280 TraceCheckUtils]: 22: Hoare triple {961#(<= 2 main_~len~0)} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {977#(<= 1 main_~i~0)} is VALID [2020-07-17 22:32:43,757 INFO L280 TraceCheckUtils]: 23: Hoare triple {977#(<= 1 main_~i~0)} assume !(~i~0 >= 0); {957#false} is VALID [2020-07-17 22:32:43,757 INFO L280 TraceCheckUtils]: 24: Hoare triple {957#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {957#false} is VALID [2020-07-17 22:32:43,758 INFO L280 TraceCheckUtils]: 25: Hoare triple {957#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {957#false} is VALID [2020-07-17 22:32:43,758 INFO L280 TraceCheckUtils]: 26: Hoare triple {957#false} assume !false; {957#false} is VALID [2020-07-17 22:32:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-17 22:32:43,759 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265434016] [2020-07-17 22:32:43,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:32:43,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:32:43,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805826824] [2020-07-17 22:32:43,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-17 22:32:43,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:32:43,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:32:43,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:32:43,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:32:43,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:32:43,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:32:43,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:32:43,794 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 6 states. [2020-07-17 22:32:44,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:44,197 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2020-07-17 22:32:44,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:32:44,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-17 22:32:44,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:32:44,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:32:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2020-07-17 22:32:44,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:32:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2020-07-17 22:32:44,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2020-07-17 22:32:44,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:32:44,266 INFO L225 Difference]: With dead ends: 43 [2020-07-17 22:32:44,266 INFO L226 Difference]: Without dead ends: 39 [2020-07-17 22:32:44,267 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:32:44,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-17 22:32:44,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-07-17 22:32:44,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:32:44,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 36 states. [2020-07-17 22:32:44,290 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 36 states. [2020-07-17 22:32:44,291 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 36 states. [2020-07-17 22:32:44,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:44,294 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2020-07-17 22:32:44,294 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-17 22:32:44,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:32:44,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:32:44,295 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 39 states. [2020-07-17 22:32:44,295 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 39 states. [2020-07-17 22:32:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:44,298 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2020-07-17 22:32:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-17 22:32:44,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:32:44,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:32:44,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:32:44,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:32:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-17 22:32:44,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2020-07-17 22:32:44,301 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 27 [2020-07-17 22:32:44,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:32:44,302 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2020-07-17 22:32:44,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:32:44,302 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2020-07-17 22:32:44,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-17 22:32:44,303 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:32:44,303 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:32:44,304 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:32:44,304 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:32:44,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:32:44,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1801861723, now seen corresponding path program 1 times [2020-07-17 22:32:44,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:32:44,305 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112920632] [2020-07-17 22:32:44,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:32:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:44,418 INFO L280 TraceCheckUtils]: 0: Hoare triple {1202#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1174#true} is VALID [2020-07-17 22:32:44,418 INFO L280 TraceCheckUtils]: 1: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-17 22:32:44,418 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1174#true} {1174#true} #98#return; {1174#true} is VALID [2020-07-17 22:32:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:44,458 INFO L280 TraceCheckUtils]: 0: Hoare triple {1203#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1174#true} is VALID [2020-07-17 22:32:44,459 INFO L280 TraceCheckUtils]: 1: Hoare triple {1174#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1174#true} is VALID [2020-07-17 22:32:44,459 INFO L280 TraceCheckUtils]: 2: Hoare triple {1174#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1174#true} is VALID [2020-07-17 22:32:44,459 INFO L280 TraceCheckUtils]: 3: Hoare triple {1174#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1174#true} is VALID [2020-07-17 22:32:44,459 INFO L280 TraceCheckUtils]: 4: Hoare triple {1174#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1174#true} is VALID [2020-07-17 22:32:44,460 INFO L280 TraceCheckUtils]: 5: Hoare triple {1174#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1174#true} is VALID [2020-07-17 22:32:44,460 INFO L280 TraceCheckUtils]: 6: Hoare triple {1174#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1174#true} is VALID [2020-07-17 22:32:44,460 INFO L280 TraceCheckUtils]: 7: Hoare triple {1174#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1174#true} is VALID [2020-07-17 22:32:44,461 INFO L280 TraceCheckUtils]: 8: Hoare triple {1174#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1174#true} is VALID [2020-07-17 22:32:44,461 INFO L280 TraceCheckUtils]: 9: Hoare triple {1174#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1174#true} is VALID [2020-07-17 22:32:44,461 INFO L280 TraceCheckUtils]: 10: Hoare triple {1174#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1174#true} is VALID [2020-07-17 22:32:44,462 INFO L280 TraceCheckUtils]: 11: Hoare triple {1174#true} assume !(~len > 0); {1174#true} is VALID [2020-07-17 22:32:44,462 INFO L280 TraceCheckUtils]: 12: Hoare triple {1174#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1174#true} is VALID [2020-07-17 22:32:44,462 INFO L280 TraceCheckUtils]: 13: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-17 22:32:44,464 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1174#true} {1179#(<= 2 main_~len~0)} #92#return; {1179#(<= 2 main_~len~0)} is VALID [2020-07-17 22:32:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:44,512 INFO L280 TraceCheckUtils]: 0: Hoare triple {1204#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1174#true} is VALID [2020-07-17 22:32:44,512 INFO L280 TraceCheckUtils]: 1: Hoare triple {1174#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1174#true} is VALID [2020-07-17 22:32:44,512 INFO L280 TraceCheckUtils]: 2: Hoare triple {1174#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {1174#true} is VALID [2020-07-17 22:32:44,513 INFO L280 TraceCheckUtils]: 3: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-17 22:32:44,513 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1174#true} {1195#(<= 1 main_~i~0)} #94#return; {1195#(<= 1 main_~i~0)} is VALID [2020-07-17 22:32:44,514 INFO L263 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1202#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:32:44,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {1202#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1174#true} is VALID [2020-07-17 22:32:44,514 INFO L280 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-17 22:32:44,515 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #98#return; {1174#true} is VALID [2020-07-17 22:32:44,515 INFO L263 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret11 := main(); {1174#true} is VALID [2020-07-17 22:32:44,515 INFO L280 TraceCheckUtils]: 5: Hoare triple {1174#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {1179#(<= 2 main_~len~0)} is VALID [2020-07-17 22:32:44,516 INFO L263 TraceCheckUtils]: 6: Hoare triple {1179#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {1203#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:32:44,517 INFO L280 TraceCheckUtils]: 7: Hoare triple {1203#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1174#true} is VALID [2020-07-17 22:32:44,517 INFO L280 TraceCheckUtils]: 8: Hoare triple {1174#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1174#true} is VALID [2020-07-17 22:32:44,517 INFO L280 TraceCheckUtils]: 9: Hoare triple {1174#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1174#true} is VALID [2020-07-17 22:32:44,517 INFO L280 TraceCheckUtils]: 10: Hoare triple {1174#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1174#true} is VALID [2020-07-17 22:32:44,517 INFO L280 TraceCheckUtils]: 11: Hoare triple {1174#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1174#true} is VALID [2020-07-17 22:32:44,518 INFO L280 TraceCheckUtils]: 12: Hoare triple {1174#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1174#true} is VALID [2020-07-17 22:32:44,518 INFO L280 TraceCheckUtils]: 13: Hoare triple {1174#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1174#true} is VALID [2020-07-17 22:32:44,518 INFO L280 TraceCheckUtils]: 14: Hoare triple {1174#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1174#true} is VALID [2020-07-17 22:32:44,518 INFO L280 TraceCheckUtils]: 15: Hoare triple {1174#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1174#true} is VALID [2020-07-17 22:32:44,518 INFO L280 TraceCheckUtils]: 16: Hoare triple {1174#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1174#true} is VALID [2020-07-17 22:32:44,519 INFO L280 TraceCheckUtils]: 17: Hoare triple {1174#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1174#true} is VALID [2020-07-17 22:32:44,519 INFO L280 TraceCheckUtils]: 18: Hoare triple {1174#true} assume !(~len > 0); {1174#true} is VALID [2020-07-17 22:32:44,519 INFO L280 TraceCheckUtils]: 19: Hoare triple {1174#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1174#true} is VALID [2020-07-17 22:32:44,519 INFO L280 TraceCheckUtils]: 20: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-17 22:32:44,520 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1174#true} {1179#(<= 2 main_~len~0)} #92#return; {1179#(<= 2 main_~len~0)} is VALID [2020-07-17 22:32:44,521 INFO L280 TraceCheckUtils]: 22: Hoare triple {1179#(<= 2 main_~len~0)} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {1195#(<= 1 main_~i~0)} is VALID [2020-07-17 22:32:44,522 INFO L280 TraceCheckUtils]: 23: Hoare triple {1195#(<= 1 main_~i~0)} assume !!(~i~0 >= 0); {1195#(<= 1 main_~i~0)} is VALID [2020-07-17 22:32:44,523 INFO L263 TraceCheckUtils]: 24: Hoare triple {1195#(<= 1 main_~i~0)} call dll_remove_first(~#s~0.base, ~#s~0.offset); {1204#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:32:44,523 INFO L280 TraceCheckUtils]: 25: Hoare triple {1204#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1174#true} is VALID [2020-07-17 22:32:44,524 INFO L280 TraceCheckUtils]: 26: Hoare triple {1174#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1174#true} is VALID [2020-07-17 22:32:44,524 INFO L280 TraceCheckUtils]: 27: Hoare triple {1174#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {1174#true} is VALID [2020-07-17 22:32:44,524 INFO L280 TraceCheckUtils]: 28: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-17 22:32:44,525 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1174#true} {1195#(<= 1 main_~i~0)} #94#return; {1195#(<= 1 main_~i~0)} is VALID [2020-07-17 22:32:44,526 INFO L280 TraceCheckUtils]: 30: Hoare triple {1195#(<= 1 main_~i~0)} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {1201#(<= 0 main_~i~0)} is VALID [2020-07-17 22:32:44,526 INFO L280 TraceCheckUtils]: 31: Hoare triple {1201#(<= 0 main_~i~0)} assume !(~i~0 >= 0); {1175#false} is VALID [2020-07-17 22:32:44,527 INFO L280 TraceCheckUtils]: 32: Hoare triple {1175#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {1175#false} is VALID [2020-07-17 22:32:44,527 INFO L280 TraceCheckUtils]: 33: Hoare triple {1175#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1175#false} is VALID [2020-07-17 22:32:44,527 INFO L280 TraceCheckUtils]: 34: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2020-07-17 22:32:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-17 22:32:44,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112920632] [2020-07-17 22:32:44,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806103405] [2020-07-17 22:32:44,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:32:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:44,633 INFO L264 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:32:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:44,649 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:32:44,708 INFO L263 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1174#true} is VALID [2020-07-17 22:32:44,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {1174#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1174#true} is VALID [2020-07-17 22:32:44,708 INFO L280 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-17 22:32:44,709 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #98#return; {1174#true} is VALID [2020-07-17 22:32:44,709 INFO L263 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret11 := main(); {1174#true} is VALID [2020-07-17 22:32:44,710 INFO L280 TraceCheckUtils]: 5: Hoare triple {1174#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {1179#(<= 2 main_~len~0)} is VALID [2020-07-17 22:32:44,710 INFO L263 TraceCheckUtils]: 6: Hoare triple {1179#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {1174#true} is VALID [2020-07-17 22:32:44,710 INFO L280 TraceCheckUtils]: 7: Hoare triple {1174#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1174#true} is VALID [2020-07-17 22:32:44,711 INFO L280 TraceCheckUtils]: 8: Hoare triple {1174#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1174#true} is VALID [2020-07-17 22:32:44,711 INFO L280 TraceCheckUtils]: 9: Hoare triple {1174#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1174#true} is VALID [2020-07-17 22:32:44,711 INFO L280 TraceCheckUtils]: 10: Hoare triple {1174#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1174#true} is VALID [2020-07-17 22:32:44,711 INFO L280 TraceCheckUtils]: 11: Hoare triple {1174#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1174#true} is VALID [2020-07-17 22:32:44,712 INFO L280 TraceCheckUtils]: 12: Hoare triple {1174#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1174#true} is VALID [2020-07-17 22:32:44,712 INFO L280 TraceCheckUtils]: 13: Hoare triple {1174#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1174#true} is VALID [2020-07-17 22:32:44,712 INFO L280 TraceCheckUtils]: 14: Hoare triple {1174#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1174#true} is VALID [2020-07-17 22:32:44,712 INFO L280 TraceCheckUtils]: 15: Hoare triple {1174#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1174#true} is VALID [2020-07-17 22:32:44,713 INFO L280 TraceCheckUtils]: 16: Hoare triple {1174#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1174#true} is VALID [2020-07-17 22:32:44,713 INFO L280 TraceCheckUtils]: 17: Hoare triple {1174#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1174#true} is VALID [2020-07-17 22:32:44,713 INFO L280 TraceCheckUtils]: 18: Hoare triple {1174#true} assume !(~len > 0); {1174#true} is VALID [2020-07-17 22:32:44,713 INFO L280 TraceCheckUtils]: 19: Hoare triple {1174#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1174#true} is VALID [2020-07-17 22:32:44,714 INFO L280 TraceCheckUtils]: 20: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-17 22:32:44,715 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1174#true} {1179#(<= 2 main_~len~0)} #92#return; {1179#(<= 2 main_~len~0)} is VALID [2020-07-17 22:32:44,716 INFO L280 TraceCheckUtils]: 22: Hoare triple {1179#(<= 2 main_~len~0)} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {1195#(<= 1 main_~i~0)} is VALID [2020-07-17 22:32:44,717 INFO L280 TraceCheckUtils]: 23: Hoare triple {1195#(<= 1 main_~i~0)} assume !!(~i~0 >= 0); {1195#(<= 1 main_~i~0)} is VALID [2020-07-17 22:32:44,717 INFO L263 TraceCheckUtils]: 24: Hoare triple {1195#(<= 1 main_~i~0)} call dll_remove_first(~#s~0.base, ~#s~0.offset); {1174#true} is VALID [2020-07-17 22:32:44,718 INFO L280 TraceCheckUtils]: 25: Hoare triple {1174#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1174#true} is VALID [2020-07-17 22:32:44,718 INFO L280 TraceCheckUtils]: 26: Hoare triple {1174#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1174#true} is VALID [2020-07-17 22:32:44,718 INFO L280 TraceCheckUtils]: 27: Hoare triple {1174#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {1174#true} is VALID [2020-07-17 22:32:44,718 INFO L280 TraceCheckUtils]: 28: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-17 22:32:44,720 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1174#true} {1195#(<= 1 main_~i~0)} #94#return; {1195#(<= 1 main_~i~0)} is VALID [2020-07-17 22:32:44,721 INFO L280 TraceCheckUtils]: 30: Hoare triple {1195#(<= 1 main_~i~0)} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {1201#(<= 0 main_~i~0)} is VALID [2020-07-17 22:32:44,721 INFO L280 TraceCheckUtils]: 31: Hoare triple {1201#(<= 0 main_~i~0)} assume !(~i~0 >= 0); {1175#false} is VALID [2020-07-17 22:32:44,722 INFO L280 TraceCheckUtils]: 32: Hoare triple {1175#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {1175#false} is VALID [2020-07-17 22:32:44,722 INFO L280 TraceCheckUtils]: 33: Hoare triple {1175#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1175#false} is VALID [2020-07-17 22:32:44,722 INFO L280 TraceCheckUtils]: 34: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2020-07-17 22:32:44,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-17 22:32:44,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:32:44,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2020-07-17 22:32:44,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374206490] [2020-07-17 22:32:44,725 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2020-07-17 22:32:44,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:32:44,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:32:44,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:32:44,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:32:44,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:32:44,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:32:44,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:32:44,770 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 8 states. [2020-07-17 22:32:45,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:45,195 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-17 22:32:45,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:32:45,195 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2020-07-17 22:32:45,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:32:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:32:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2020-07-17 22:32:45,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:32:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2020-07-17 22:32:45,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2020-07-17 22:32:45,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:32:45,259 INFO L225 Difference]: With dead ends: 44 [2020-07-17 22:32:45,259 INFO L226 Difference]: Without dead ends: 40 [2020-07-17 22:32:45,260 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:32:45,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-17 22:32:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-07-17 22:32:45,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:32:45,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2020-07-17 22:32:45,289 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2020-07-17 22:32:45,289 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2020-07-17 22:32:45,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:45,291 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-17 22:32:45,292 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-17 22:32:45,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:32:45,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:32:45,292 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2020-07-17 22:32:45,292 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2020-07-17 22:32:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:45,296 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-17 22:32:45,296 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-17 22:32:45,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:32:45,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:32:45,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:32:45,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:32:45,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-17 22:32:45,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-17 22:32:45,300 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 35 [2020-07-17 22:32:45,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:32:45,302 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-17 22:32:45,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:32:45,302 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-17 22:32:45,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-17 22:32:45,305 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:32:45,305 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:32:45,513 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:32:45,514 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:32:45,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:32:45,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1626595457, now seen corresponding path program 2 times [2020-07-17 22:32:45,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:32:45,516 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460591304] [2020-07-17 22:32:45,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:32:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:45,913 INFO L280 TraceCheckUtils]: 0: Hoare triple {1548#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1512#true} is VALID [2020-07-17 22:32:45,914 INFO L280 TraceCheckUtils]: 1: Hoare triple {1512#true} assume true; {1512#true} is VALID [2020-07-17 22:32:45,914 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1512#true} {1512#true} #98#return; {1512#true} is VALID [2020-07-17 22:32:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:46,504 INFO L280 TraceCheckUtils]: 0: Hoare triple {1549#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1550#(and (= |#valid| |old(#valid)|) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:32:46,505 INFO L280 TraceCheckUtils]: 1: Hoare triple {1550#(and (= |#valid| |old(#valid)|) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1551#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} is VALID [2020-07-17 22:32:46,507 INFO L280 TraceCheckUtils]: 2: Hoare triple {1551#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1551#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} is VALID [2020-07-17 22:32:46,509 INFO L280 TraceCheckUtils]: 3: Hoare triple {1551#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1552#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 1 (select |#valid| dll_create_~new_head~0.base)))} is VALID [2020-07-17 22:32:46,510 INFO L280 TraceCheckUtils]: 4: Hoare triple {1552#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 1 (select |#valid| dll_create_~new_head~0.base)))} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1552#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 1 (select |#valid| dll_create_~new_head~0.base)))} is VALID [2020-07-17 22:32:46,511 INFO L280 TraceCheckUtils]: 5: Hoare triple {1552#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 1 (select |#valid| dll_create_~new_head~0.base)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1553#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= (select |#valid| dll_create_~head~0.base) 1))} is VALID [2020-07-17 22:32:46,513 INFO L280 TraceCheckUtils]: 6: Hoare triple {1553#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= (select |#valid| dll_create_~head~0.base) 1))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1554#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} is VALID [2020-07-17 22:32:46,513 INFO L280 TraceCheckUtils]: 7: Hoare triple {1554#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1554#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} is VALID [2020-07-17 22:32:46,516 INFO L280 TraceCheckUtils]: 8: Hoare triple {1554#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1555#(and (= (select |old(#valid)| (select (select (store |#memory_$Pointer$.base| dll_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base) 4)) (= 0 (select (store (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.offset) 4)) (= 0 (select (select (store |#memory_$Pointer$.offset| dll_create_~head~0.base (store (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.offset)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= (select (select (store |#memory_$Pointer$.base| dll_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~head~0.base))} is VALID [2020-07-17 22:32:46,517 INFO L280 TraceCheckUtils]: 9: Hoare triple {1555#(and (= (select |old(#valid)| (select (select (store |#memory_$Pointer$.base| dll_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base) 4)) (= 0 (select (store (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.offset) 4)) (= 0 (select (select (store |#memory_$Pointer$.offset| dll_create_~head~0.base (store (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.offset)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= (select (select (store |#memory_$Pointer$.base| dll_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~head~0.base))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1556#(and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4)))} is VALID [2020-07-17 22:32:46,518 INFO L280 TraceCheckUtils]: 10: Hoare triple {1556#(and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1557#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} is VALID [2020-07-17 22:32:46,521 INFO L280 TraceCheckUtils]: 11: Hoare triple {1557#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} assume !(~len > 0); {1557#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} is VALID [2020-07-17 22:32:46,522 INFO L280 TraceCheckUtils]: 12: Hoare triple {1557#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1558#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) 4)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 0) (= 0 |dll_create_#res.offset|))} is VALID [2020-07-17 22:32:46,522 INFO L280 TraceCheckUtils]: 13: Hoare triple {1558#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) 4)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 0) (= 0 |dll_create_#res.offset|))} assume true; {1558#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) 4)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 0) (= 0 |dll_create_#res.offset|))} is VALID [2020-07-17 22:32:46,526 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1558#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) 4)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 0) (= 0 |dll_create_#res.offset|))} {1517#(= (select |#valid| |main_~#s~0.base|) 1)} #92#return; {1533#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) 4)) 4)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) 4))) (= 0 |main_#t~ret8.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~ret8.base|) 4)))} is VALID [2020-07-17 22:32:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:46,813 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2020-07-17 22:32:47,011 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2020-07-17 22:32:47,114 INFO L280 TraceCheckUtils]: 0: Hoare triple {1559#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1560#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.base) (= 0 (+ dll_remove_first_~temp~1.offset 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.offset)) (not (= 0 (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset)))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} is VALID [2020-07-17 22:32:47,117 INFO L280 TraceCheckUtils]: 1: Hoare triple {1560#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.base) (= 0 (+ dll_remove_first_~temp~1.offset 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.offset)) (not (= 0 (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset)))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1561#(or (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)) (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (or (= dll_remove_first_~temp~1.base dll_remove_first_~head.base) (and (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)) (= (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base) 4) (select (select (store |#memory_$Pointer$.base| dll_remove_first_~head.base (store (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.base)) dll_remove_first_~temp~1.base) 4)) (= (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base) 4) (select (select (store |#memory_$Pointer$.offset| dll_remove_first_~head.base (store (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.offset)) dll_remove_first_~temp~1.base) 4)))) (or (not (= dll_remove_first_~temp~1.base dll_remove_first_~head.base)) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)))) (= 0 (+ dll_remove_first_~temp~1.offset 4))) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) dll_remove_first_~temp~1.offset) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)))} is VALID [2020-07-17 22:32:47,119 INFO L280 TraceCheckUtils]: 2: Hoare triple {1561#(or (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)) (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (or (= dll_remove_first_~temp~1.base dll_remove_first_~head.base) (and (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)) (= (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base) 4) (select (select (store |#memory_$Pointer$.base| dll_remove_first_~head.base (store (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.base)) dll_remove_first_~temp~1.base) 4)) (= (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base) 4) (select (select (store |#memory_$Pointer$.offset| dll_remove_first_~head.base (store (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.offset)) dll_remove_first_~temp~1.base) 4)))) (or (not (= dll_remove_first_~temp~1.base dll_remove_first_~head.base)) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)))) (= 0 (+ dll_remove_first_~temp~1.offset 4))) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) dll_remove_first_~temp~1.offset) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {1562#(or (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)) (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4))))))} is VALID [2020-07-17 22:32:47,120 INFO L280 TraceCheckUtils]: 3: Hoare triple {1562#(or (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)) (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4))))))} assume true; {1562#(or (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)) (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4))))))} is VALID [2020-07-17 22:32:47,123 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1562#(or (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)) (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4))))))} {1534#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) |main_~#s~0.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} #94#return; {1540#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} is VALID [2020-07-17 22:32:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:47,322 INFO L280 TraceCheckUtils]: 0: Hoare triple {1559#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1563#(or (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)) (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) dll_remove_first_~temp~1.offset) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)))} is VALID [2020-07-17 22:32:47,323 INFO L280 TraceCheckUtils]: 1: Hoare triple {1563#(or (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)) (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) dll_remove_first_~temp~1.offset) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)))} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1563#(or (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)) (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) dll_remove_first_~temp~1.offset) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)))} is VALID [2020-07-17 22:32:47,325 INFO L280 TraceCheckUtils]: 2: Hoare triple {1563#(or (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)) (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) dll_remove_first_~temp~1.offset) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {1564#(or (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))) (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)))} is VALID [2020-07-17 22:32:47,327 INFO L280 TraceCheckUtils]: 3: Hoare triple {1564#(or (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))) (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)))} assume true; {1564#(or (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))) (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)))} is VALID [2020-07-17 22:32:47,329 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1564#(or (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))) (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)))} {1540#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} #94#return; {1546#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} is VALID [2020-07-17 22:32:47,330 INFO L263 TraceCheckUtils]: 0: Hoare triple {1512#true} call ULTIMATE.init(); {1548#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:32:47,330 INFO L280 TraceCheckUtils]: 1: Hoare triple {1548#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1512#true} is VALID [2020-07-17 22:32:47,330 INFO L280 TraceCheckUtils]: 2: Hoare triple {1512#true} assume true; {1512#true} is VALID [2020-07-17 22:32:47,330 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1512#true} {1512#true} #98#return; {1512#true} is VALID [2020-07-17 22:32:47,330 INFO L263 TraceCheckUtils]: 4: Hoare triple {1512#true} call #t~ret11 := main(); {1512#true} is VALID [2020-07-17 22:32:47,336 INFO L280 TraceCheckUtils]: 5: Hoare triple {1512#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {1517#(= (select |#valid| |main_~#s~0.base|) 1)} is VALID [2020-07-17 22:32:47,343 INFO L263 TraceCheckUtils]: 6: Hoare triple {1517#(= (select |#valid| |main_~#s~0.base|) 1)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {1549#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:32:47,343 INFO L280 TraceCheckUtils]: 7: Hoare triple {1549#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1550#(and (= |#valid| |old(#valid)|) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:32:47,345 INFO L280 TraceCheckUtils]: 8: Hoare triple {1550#(and (= |#valid| |old(#valid)|) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1551#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} is VALID [2020-07-17 22:32:47,345 INFO L280 TraceCheckUtils]: 9: Hoare triple {1551#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1551#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} is VALID [2020-07-17 22:32:47,347 INFO L280 TraceCheckUtils]: 10: Hoare triple {1551#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1552#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 1 (select |#valid| dll_create_~new_head~0.base)))} is VALID [2020-07-17 22:32:47,348 INFO L280 TraceCheckUtils]: 11: Hoare triple {1552#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 1 (select |#valid| dll_create_~new_head~0.base)))} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1552#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 1 (select |#valid| dll_create_~new_head~0.base)))} is VALID [2020-07-17 22:32:47,350 INFO L280 TraceCheckUtils]: 12: Hoare triple {1552#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 1 (select |#valid| dll_create_~new_head~0.base)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1553#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= (select |#valid| dll_create_~head~0.base) 1))} is VALID [2020-07-17 22:32:47,352 INFO L280 TraceCheckUtils]: 13: Hoare triple {1553#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= (select |#valid| dll_create_~head~0.base) 1))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1554#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} is VALID [2020-07-17 22:32:47,352 INFO L280 TraceCheckUtils]: 14: Hoare triple {1554#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1554#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} is VALID [2020-07-17 22:32:47,354 INFO L280 TraceCheckUtils]: 15: Hoare triple {1554#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1555#(and (= (select |old(#valid)| (select (select (store |#memory_$Pointer$.base| dll_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base) 4)) (= 0 (select (store (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.offset) 4)) (= 0 (select (select (store |#memory_$Pointer$.offset| dll_create_~head~0.base (store (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.offset)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= (select (select (store |#memory_$Pointer$.base| dll_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~head~0.base))} is VALID [2020-07-17 22:32:47,356 INFO L280 TraceCheckUtils]: 16: Hoare triple {1555#(and (= (select |old(#valid)| (select (select (store |#memory_$Pointer$.base| dll_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base) 4)) (= 0 (select (store (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.offset) 4)) (= 0 (select (select (store |#memory_$Pointer$.offset| dll_create_~head~0.base (store (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.offset)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= (select (select (store |#memory_$Pointer$.base| dll_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~head~0.base))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1556#(and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4)))} is VALID [2020-07-17 22:32:47,357 INFO L280 TraceCheckUtils]: 17: Hoare triple {1556#(and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1557#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} is VALID [2020-07-17 22:32:47,358 INFO L280 TraceCheckUtils]: 18: Hoare triple {1557#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} assume !(~len > 0); {1557#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} is VALID [2020-07-17 22:32:47,359 INFO L280 TraceCheckUtils]: 19: Hoare triple {1557#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1558#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) 4)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 0) (= 0 |dll_create_#res.offset|))} is VALID [2020-07-17 22:32:47,359 INFO L280 TraceCheckUtils]: 20: Hoare triple {1558#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) 4)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 0) (= 0 |dll_create_#res.offset|))} assume true; {1558#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) 4)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 0) (= 0 |dll_create_#res.offset|))} is VALID [2020-07-17 22:32:47,361 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1558#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) 4)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 0) (= 0 |dll_create_#res.offset|))} {1517#(= (select |#valid| |main_~#s~0.base|) 1)} #92#return; {1533#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) 4)) 4)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) 4))) (= 0 |main_#t~ret8.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~ret8.base|) 4)))} is VALID [2020-07-17 22:32:47,362 INFO L280 TraceCheckUtils]: 22: Hoare triple {1533#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) 4)) 4)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) 4))) (= 0 |main_#t~ret8.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~ret8.base|) 4)))} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {1534#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) |main_~#s~0.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} is VALID [2020-07-17 22:32:47,363 INFO L280 TraceCheckUtils]: 23: Hoare triple {1534#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) |main_~#s~0.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} assume !!(~i~0 >= 0); {1534#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) |main_~#s~0.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} is VALID [2020-07-17 22:32:47,364 INFO L263 TraceCheckUtils]: 24: Hoare triple {1534#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) |main_~#s~0.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} call dll_remove_first(~#s~0.base, ~#s~0.offset); {1559#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:32:47,365 INFO L280 TraceCheckUtils]: 25: Hoare triple {1559#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1560#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.base) (= 0 (+ dll_remove_first_~temp~1.offset 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.offset)) (not (= 0 (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset)))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} is VALID [2020-07-17 22:32:47,373 INFO L280 TraceCheckUtils]: 26: Hoare triple {1560#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.base) (= 0 (+ dll_remove_first_~temp~1.offset 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.offset)) (not (= 0 (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset)))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1561#(or (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)) (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (or (= dll_remove_first_~temp~1.base dll_remove_first_~head.base) (and (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)) (= (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base) 4) (select (select (store |#memory_$Pointer$.base| dll_remove_first_~head.base (store (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.base)) dll_remove_first_~temp~1.base) 4)) (= (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base) 4) (select (select (store |#memory_$Pointer$.offset| dll_remove_first_~head.base (store (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.offset)) dll_remove_first_~temp~1.base) 4)))) (or (not (= dll_remove_first_~temp~1.base dll_remove_first_~head.base)) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)))) (= 0 (+ dll_remove_first_~temp~1.offset 4))) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) dll_remove_first_~temp~1.offset) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)))} is VALID [2020-07-17 22:32:47,376 INFO L280 TraceCheckUtils]: 27: Hoare triple {1561#(or (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)) (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (or (= dll_remove_first_~temp~1.base dll_remove_first_~head.base) (and (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)) (= (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base) 4) (select (select (store |#memory_$Pointer$.base| dll_remove_first_~head.base (store (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.base)) dll_remove_first_~temp~1.base) 4)) (= (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base) 4) (select (select (store |#memory_$Pointer$.offset| dll_remove_first_~head.base (store (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.offset)) dll_remove_first_~temp~1.base) 4)))) (or (not (= dll_remove_first_~temp~1.base dll_remove_first_~head.base)) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)))) (= 0 (+ dll_remove_first_~temp~1.offset 4))) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) dll_remove_first_~temp~1.offset) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {1562#(or (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)) (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4))))))} is VALID [2020-07-17 22:32:47,376 INFO L280 TraceCheckUtils]: 28: Hoare triple {1562#(or (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)) (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4))))))} assume true; {1562#(or (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)) (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4))))))} is VALID [2020-07-17 22:32:47,379 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1562#(or (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)) (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4))))))} {1534#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) |main_~#s~0.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} #94#return; {1540#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} is VALID [2020-07-17 22:32:47,379 INFO L280 TraceCheckUtils]: 30: Hoare triple {1540#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {1540#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} is VALID [2020-07-17 22:32:47,383 INFO L280 TraceCheckUtils]: 31: Hoare triple {1540#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} assume !!(~i~0 >= 0); {1540#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} is VALID [2020-07-17 22:32:47,385 INFO L263 TraceCheckUtils]: 32: Hoare triple {1540#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} call dll_remove_first(~#s~0.base, ~#s~0.offset); {1559#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:32:47,386 INFO L280 TraceCheckUtils]: 33: Hoare triple {1559#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1563#(or (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)) (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) dll_remove_first_~temp~1.offset) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)))} is VALID [2020-07-17 22:32:47,387 INFO L280 TraceCheckUtils]: 34: Hoare triple {1563#(or (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)) (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) dll_remove_first_~temp~1.offset) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)))} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1563#(or (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)) (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) dll_remove_first_~temp~1.offset) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)))} is VALID [2020-07-17 22:32:47,388 INFO L280 TraceCheckUtils]: 35: Hoare triple {1563#(or (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)) (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) dll_remove_first_~temp~1.offset) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {1564#(or (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))) (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)))} is VALID [2020-07-17 22:32:47,389 INFO L280 TraceCheckUtils]: 36: Hoare triple {1564#(or (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))) (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)))} assume true; {1564#(or (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))) (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)))} is VALID [2020-07-17 22:32:47,390 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1564#(or (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))) (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)))} {1540#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} #94#return; {1546#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} is VALID [2020-07-17 22:32:47,391 INFO L280 TraceCheckUtils]: 38: Hoare triple {1546#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {1546#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} is VALID [2020-07-17 22:32:47,392 INFO L280 TraceCheckUtils]: 39: Hoare triple {1546#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} assume !(~i~0 >= 0); {1546#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} is VALID [2020-07-17 22:32:47,392 INFO L280 TraceCheckUtils]: 40: Hoare triple {1546#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {1547#(and (= 0 |main_#t~mem10.base|) (= 0 |main_#t~mem10.offset|))} is VALID [2020-07-17 22:32:47,393 INFO L280 TraceCheckUtils]: 41: Hoare triple {1547#(and (= 0 |main_#t~mem10.base|) (= 0 |main_#t~mem10.offset|))} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1513#false} is VALID [2020-07-17 22:32:47,393 INFO L280 TraceCheckUtils]: 42: Hoare triple {1513#false} assume !false; {1513#false} is VALID [2020-07-17 22:32:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:32:47,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460591304] [2020-07-17 22:32:47,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114894408] [2020-07-17 22:32:47,409 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:32:47,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:32:47,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:32:47,532 INFO L264 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 84 conjunts are in the unsatisfiable core [2020-07-17 22:32:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:47,555 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:32:47,707 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-17 22:32:47,707 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:32:47,716 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:32:47,716 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:32:47,716 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2020-07-17 22:32:47,719 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:32:47,720 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_23|]. (and (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (< dll_create_~new_head~0.base |#StackHeapBarrier|) (= |#valid| (store |v_#valid_23| dll_create_~new_head~0.base 1)) (= 0 dll_create_~head~0.base)) [2020-07-17 22:32:47,720 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (< dll_create_~new_head~0.base |#StackHeapBarrier|) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base))) [2020-07-17 22:32:47,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:32:47,815 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2020-07-17 22:32:47,816 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:32:47,829 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:32:47,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:32:47,837 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2020-07-17 22:32:47,838 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:32:47,854 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:32:47,855 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:32:47,855 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:48 [2020-07-17 22:32:48,119 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:32:48,120 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-17 22:32:48,121 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:32:48,134 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:32:48,135 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:32:48,135 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:39 [2020-07-17 22:32:48,273 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-17 22:32:48,309 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:32:48,315 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-17 22:32:48,341 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:32:48,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:32:48,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:32:48,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:32:48,368 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46 [2020-07-17 22:32:48,376 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-17 22:32:48,406 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:32:48,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:32:48,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:32:48,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:32:48,434 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46 [2020-07-17 22:32:48,437 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-17 22:32:48,467 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:32:48,468 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:32:48,469 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:105, output treesize:75 [2020-07-17 22:32:49,868 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:32:49,869 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_26|, |v_#memory_$Pointer$.offset_27|, |v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.base_26|]. (let ((.cse0 (select |v_#memory_$Pointer$.offset_27| dll_create_~head~0.base)) (.cse1 (select |v_#memory_$Pointer$.offset_26| dll_create_~new_head~0.base)) (.cse2 (select |v_#memory_$Pointer$.base_27| dll_create_~head~0.base)) (.cse5 (select |v_#memory_$Pointer$.base_26| dll_create_~new_head~0.base)) (.cse3 (+ dll_create_~new_head~0.offset 4)) (.cse4 (+ dll_create_~new_head~0.offset 8))) (and (= 0 (select .cse0 4)) (= (store |v_#memory_$Pointer$.offset_27| dll_create_~new_head~0.base (store (select |v_#memory_$Pointer$.offset_27| dll_create_~new_head~0.base) dll_create_~new_head~0.offset (select .cse1 dll_create_~new_head~0.offset))) |v_#memory_$Pointer$.offset_26|) (= 0 (select .cse2 8)) (= 0 (select .cse0 8)) (= (store |v_#memory_$Pointer$.offset_26| dll_create_~new_head~0.base (store (store .cse1 .cse3 dll_create_~head~0.offset) .cse4 0)) |#memory_$Pointer$.offset|) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 dll_create_~head~0.offset) (= 0 (select .cse2 4)) (= |v_#memory_$Pointer$.base_26| (store |v_#memory_$Pointer$.base_27| dll_create_~new_head~0.base (store (select |v_#memory_$Pointer$.base_27| dll_create_~new_head~0.base) dll_create_~new_head~0.offset (select .cse5 dll_create_~new_head~0.offset)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_26| dll_create_~new_head~0.base (store (store .cse5 .cse3 dll_create_~head~0.base) .cse4 0))) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))) [2020-07-17 22:32:49,869 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_$Pointer$.base| dll_create_~head~0.base)) (.cse3 (select |#memory_$Pointer$.offset| dll_create_~head~0.base)) (.cse4 (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base)) (.cse2 (+ dll_create_~new_head~0.offset 4)) (.cse1 (select |#memory_$Pointer$.base| dll_create_~new_head~0.base)) (.cse5 (+ dll_create_~new_head~0.offset 8))) (and (= (select .cse0 4) 0) (= 0 dll_create_~head~0.offset) (= (select .cse1 .cse2) dll_create_~head~0.base) (= 0 (select .cse3 4)) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 (select .cse0 8)) (= 0 (select .cse4 .cse5)) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= 0 (select .cse3 8)) (= (select .cse4 .cse2) dll_create_~head~0.offset) (= 0 (select .cse1 .cse5)))) [2020-07-17 22:32:50,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:32:50,126 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:32:50,127 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 127 treesize of output 193 [2020-07-17 22:32:50,164 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[14, 3, 2, 1] term [2020-07-17 22:32:50,164 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:32:50,173 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:32:50,244 INFO L624 ElimStorePlain]: treesize reduction 134, result has 47.7 percent of original size [2020-07-17 22:32:50,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:32:50,258 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2020-07-17 22:32:50,266 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:32:50,294 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:32:50,294 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:32:50,295 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:145, output treesize:99 [2020-07-17 22:32:52,438 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:32:52,439 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_28|]. (let ((.cse3 (select |v_#memory_$Pointer$.base_28| dll_create_~new_head~0.base)) (.cse6 (+ dll_create_~new_head~0.offset 4))) (let ((.cse1 (select .cse3 .cse6))) (let ((.cse0 (select |v_#memory_$Pointer$.offset_28| .cse1)) (.cse2 (select |v_#memory_$Pointer$.base_28| .cse1)) (.cse5 (select |v_#memory_$Pointer$.offset_28| dll_create_~new_head~0.base)) (.cse4 (+ dll_create_~new_head~0.offset 8))) (and (= 0 (select .cse0 8)) (< .cse1 |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.offset_28| .cse1 (store .cse0 8 dll_create_~new_head~0.offset)) |#memory_$Pointer$.offset|) (= (select .cse2 8) 0) (= (select .cse0 4) 0) (not (= .cse1 dll_create_~new_head~0.base)) (= 0 (select .cse2 4)) (= (store |v_#memory_$Pointer$.base_28| .cse1 (store .cse2 8 dll_create_~new_head~0.base)) |#memory_$Pointer$.base|) (= 0 (select .cse3 .cse4)) (= 0 (select .cse5 .cse6)) (= (select .cse5 .cse4) 0))))) [2020-07-17 22:32:52,439 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse6 (select |#memory_$Pointer$.base| dll_create_~new_head~0.base)) (.cse4 (+ dll_create_~new_head~0.offset 4))) (let ((.cse1 (select .cse6 .cse4))) (let ((.cse0 (select |#memory_$Pointer$.offset| .cse1)) (.cse2 (select |#memory_$Pointer$.base| .cse1)) (.cse3 (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base)) (.cse5 (+ dll_create_~new_head~0.offset 8))) (and (= (select .cse0 4) 0) (< .cse1 |#StackHeapBarrier|) (= dll_create_~new_head~0.base (select .cse2 8)) (= (select .cse0 8) dll_create_~new_head~0.offset) (= 0 (select .cse3 .cse4)) (not (= .cse1 dll_create_~new_head~0.base)) (= 0 (select .cse2 4)) (= 0 (select .cse3 .cse5)) (= 0 (select .cse6 .cse5)))))) [2020-07-17 22:32:54,404 WARN L193 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2020-07-17 22:32:54,405 INFO L350 Elim1Store]: treesize reduction 181, result has 64.4 percent of original size [2020-07-17 22:32:54,405 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 443 treesize of output 478 [2020-07-17 22:32:54,441 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-17 22:32:54,467 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-17 22:32:54,487 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-17 22:32:54,503 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-17 22:32:54,521 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:32:54,542 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:32:54,553 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:32:54,561 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:32:54,575 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:32:54,580 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:54,586 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:54,590 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:54,621 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:54,643 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:54,673 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:54,677 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:54,693 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:54,709 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:54,724 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:54,735 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:54,753 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:54,772 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:54,792 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:32:54,809 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:32:54,815 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:54,821 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:54,826 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:54,846 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:54,868 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:54,886 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:54,891 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:54,912 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:54,939 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:54,964 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:54,969 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:54,989 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:55,022 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:55,062 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:32:55,078 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:32:55,088 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:32:55,100 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:32:55,108 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:32:55,116 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:32:55,122 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:32:55,127 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:55,132 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:55,136 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:55,151 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:55,165 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:55,180 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:55,184 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:55,196 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:55,221 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:55,248 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:55,254 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:55,272 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:55,292 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:55,319 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:32:55,328 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:32:55,335 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:55,342 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:55,347 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:55,370 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:55,387 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:55,408 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:55,414 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:55,432 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:55,450 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:55,473 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:55,478 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:55,501 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:55,545 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:55,564 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:55,570 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:32:55,574 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:55,578 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:55,581 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:55,585 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:55,596 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:55,615 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:32:55,619 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:55,632 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:55,646 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:55,651 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:55,669 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:55,684 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:55,688 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:55,691 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:55,704 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:55,717 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:32:55,722 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:55,736 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:55,757 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:32:55,762 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:55,782 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:55,826 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:32:55,841 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:32:55,858 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:32:55,872 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:32:55,881 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:55,889 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:32:55,895 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:55,901 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:55,909 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:55,913 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:32:55,916 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:55,933 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:55,957 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:55,961 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:55,976 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:55,993 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:55,998 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:32:56,003 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:56,020 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:56,040 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:32:56,045 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:56,060 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:56,078 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:56,085 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:32:56,089 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:32:56,100 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:32:56,116 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:32:56,122 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:56,140 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:56,163 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:56,170 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:56,184 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:56,189 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:56,204 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:56,221 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:32:56,227 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:56,246 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:56,265 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:56,276 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:56,283 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:56,302 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:56,315 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:32:56,318 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:56,331 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:56,347 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:56,362 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:56,372 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:56,388 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:56,405 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:56,409 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:56,425 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:56,470 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:32:56,482 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:32:56,500 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:32:56,510 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:32:56,522 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:56,530 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:32:56,537 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:56,544 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:56,549 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:32:56,555 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:56,576 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:56,597 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:56,603 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:56,625 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:56,645 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:32:56,651 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:56,672 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:56,695 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:56,707 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:56,714 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:56,740 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:56,765 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:32:56,771 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:56,793 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:56,818 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:56,825 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:56,848 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:56,904 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-17 22:32:56,922 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:32:56,941 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:32:56,958 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:32:56,973 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:32:56,993 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:32:57,010 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:32:57,023 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:32:57,033 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:57,063 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,070 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:57,091 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,111 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:57,136 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,144 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:57,167 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,201 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:57,214 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:57,217 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,237 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,253 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:57,279 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:57,291 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:32:57,296 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,302 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,306 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:32:57,311 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,327 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:32:57,332 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,347 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:57,350 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:57,367 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:57,370 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:57,373 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:57,385 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:32:57,393 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:57,407 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:57,411 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:57,453 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-17 22:32:57,465 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-17 22:32:57,482 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:32:57,491 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:32:57,504 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:32:57,511 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:32:57,521 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:32:57,532 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:57,536 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,541 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:57,552 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,563 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:57,585 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,589 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:57,604 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,617 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:57,631 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:57,644 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,665 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,684 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:57,720 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-17 22:32:57,737 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-17 22:32:57,752 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-17 22:32:57,766 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-17 22:32:57,777 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:32:57,792 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:32:57,802 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:32:57,809 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:32:57,815 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:32:57,821 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:57,830 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:57,834 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:57,850 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,867 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,896 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,902 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:57,919 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,936 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:57,959 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,964 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:57,982 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:58,001 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:58,026 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:32:58,036 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:32:58,046 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:58,054 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:58,062 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:58,085 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:58,110 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:58,135 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:58,143 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:58,166 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:58,190 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:58,215 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:58,223 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:58,250 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:58,279 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:58,329 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:32:58,348 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:32:58,365 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:32:58,384 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:32:58,398 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:32:58,411 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:32:58,422 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:32:58,431 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:58,441 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:58,448 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:58,477 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:58,504 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:58,534 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:58,542 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:58,568 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:58,595 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:58,623 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:58,631 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:58,661 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:58,685 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:58,722 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:32:58,733 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:32:58,742 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:58,751 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:58,757 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:58,776 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:58,800 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:58,825 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:58,833 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:58,912 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:58,930 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:58,950 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:58,956 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:58,973 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:58,991 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:59,016 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:59,023 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:32:59,028 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:59,034 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:59,038 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:59,043 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:59,058 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:59,074 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:32:59,078 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:59,093 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:59,109 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:59,115 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:59,134 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:59,155 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:59,163 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:59,167 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:59,185 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:59,204 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:32:59,209 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:59,229 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:59,250 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:32:59,256 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:59,278 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:59,325 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:32:59,342 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:32:59,358 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:32:59,368 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:32:59,376 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:32:59,384 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:32:59,390 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:59,396 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:59,401 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:59,405 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:32:59,409 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:59,420 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:59,437 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:59,441 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:59,455 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:59,470 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:59,475 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:32:59,480 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:59,493 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:59,512 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:32:59,517 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:59,531 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:59,546 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:59,553 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:32:59,558 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:32:59,569 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:32:59,580 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:32:59,584 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:59,597 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:59,613 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:59,618 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:59,626 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:59,628 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:59,648 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:59,663 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:32:59,670 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:59,688 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:59,706 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:59,716 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:59,721 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:59,738 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:59,755 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:32:59,759 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:59,776 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:32:59,797 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:32:59,811 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:59,818 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:59,842 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:59,865 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:32:59,872 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:59,894 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:32:59,944 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:32:59,961 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:32:59,977 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:32:59,991 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:00,006 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:00,016 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:00,022 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:00,028 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:33:00,036 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:00,042 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:00,063 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:00,084 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:00,090 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:33:00,108 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:33:00,127 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:00,135 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:00,161 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:00,186 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:00,194 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:00,203 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:33:00,230 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:33:00,257 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:00,265 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:00,293 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:00,321 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:00,330 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:33:00,357 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:33:00,412 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-17 22:33:00,432 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:33:00,450 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:33:00,467 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:00,481 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:00,499 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:00,511 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:00,521 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:00,529 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:00,537 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:00,544 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:33:00,562 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:00,583 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:33:00,610 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:00,618 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:33:00,643 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:00,670 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:33:00,698 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:00,706 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:00,737 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:00,766 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:00,801 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:00,811 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:00,819 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:00,826 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:00,873 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:00,878 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:00,898 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:00,905 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:00,926 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:00,931 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:33:00,951 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:33:00,956 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:00,960 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:33:00,976 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:00,981 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:00,997 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:01,002 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:33:01,049 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-17 22:33:01,062 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-17 22:33:01,076 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:33:01,095 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:01,115 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:01,125 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:01,135 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:01,142 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:01,149 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:01,156 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:33:01,177 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:01,197 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:33:01,219 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:01,225 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:33:01,244 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:01,265 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:33:01,285 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:01,291 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:01,311 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:01,334 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:01,379 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-17 22:33:01,673 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2020-07-17 22:33:01,676 INFO L624 ElimStorePlain]: treesize reduction 359, result has 41.8 percent of original size [2020-07-17 22:33:01,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:33:01,822 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2020-07-17 22:33:01,823 INFO L350 Elim1Store]: treesize reduction 32, result has 79.6 percent of original size [2020-07-17 22:33:01,824 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 230 treesize of output 240 [2020-07-17 22:33:01,850 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-17 22:33:01,862 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:33:01,870 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:01,887 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:01,896 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:01,905 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:01,912 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:01,919 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:01,925 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:01,931 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:01,935 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:01,956 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:01,968 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:01,975 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:01,989 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:01,993 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:01,995 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:01,999 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,015 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:02,018 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:02,030 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:02,036 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:02,042 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:02,061 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:02,067 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:02,072 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:02,090 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:02,094 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:02,095 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:02,107 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:02,136 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:02,153 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:02,160 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:02,166 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:02,171 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:02,174 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:02,193 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:02,197 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,225 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,231 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,237 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:02,252 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:02,259 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,268 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:02,269 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:02,286 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:02,312 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:02,317 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:02,322 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:02,339 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:02,346 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,354 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:02,371 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,375 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:02,401 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:02,412 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:02,419 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:02,427 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:02,432 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:02,437 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:02,440 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:02,461 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:02,478 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,489 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,494 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,498 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:02,510 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:02,513 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:02,519 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:02,533 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,538 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:02,557 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:02,563 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:02,568 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:02,570 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:02,574 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,594 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:02,597 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,602 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:02,652 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:02,668 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:02,676 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:02,685 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,703 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:02,709 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,714 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,718 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:02,721 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:02,725 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,743 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:02,744 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:02,747 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:02,779 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:02,785 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:02,790 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:02,826 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:02,830 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:02,845 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:02,856 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:02,858 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:02,868 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:02,875 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,880 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,885 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:02,898 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:02,907 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:02,909 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:02,934 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,941 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,947 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:02,955 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,961 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:02,967 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:02,982 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:02,991 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:02,996 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:03,017 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:03,034 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:03,038 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:03,055 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:03,061 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:03,065 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:03,080 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:03,083 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:03,089 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:03,094 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:03,099 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:03,110 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:03,113 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:03,128 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:03,142 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:03,144 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:03,148 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:03,178 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:03,185 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:03,191 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:03,197 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:03,202 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:03,205 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:03,221 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:03,225 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:03,238 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:03,242 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:03,257 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:03,269 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:03,283 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:03,287 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:03,302 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:03,315 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:03,320 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:03,325 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:03,328 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:03,344 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:03,355 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:33:03,357 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:03,369 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:03,374 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:03,385 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:03,388 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:03,391 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:03,412 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:03,420 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:03,429 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:03,438 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:03,458 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:03,467 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:03,474 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:03,481 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:03,484 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:03,506 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:03,512 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:03,517 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:03,531 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:03,536 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:03,552 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:03,571 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:03,575 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:03,578 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:03,587 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:03,603 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:03,605 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:03,609 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:03,631 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:03,645 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:03,651 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:03,657 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:03,662 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:03,674 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:03,684 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:03,686 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:03,705 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:03,719 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:03,723 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:03,737 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:03,740 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:03,744 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:03,757 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:03,760 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:03,766 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:03,770 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:03,781 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:03,792 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:03,806 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:03,816 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:03,826 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:03,833 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:03,840 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:03,845 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:03,850 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:03,852 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:03,857 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:03,886 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:03,898 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:03,906 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:03,922 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:03,940 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:03,954 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:03,959 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:03,963 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:03,982 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:03,988 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:04,004 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:04,009 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:04,043 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-17 22:33:04,056 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:04,066 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:04,079 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:04,090 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:04,098 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:04,107 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:04,115 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:04,120 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:04,122 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:04,145 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:04,151 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:04,155 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:04,175 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:04,180 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:04,185 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:04,188 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:04,205 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:04,208 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:04,233 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:04,241 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:04,249 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:04,255 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:04,260 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:04,273 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:04,282 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:04,286 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:04,307 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:04,313 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:04,319 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:04,323 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:04,342 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:04,344 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:04,370 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:04,379 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:04,388 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:04,396 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:04,406 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:04,419 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:04,424 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:04,447 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:04,463 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:04,475 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:04,483 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:04,494 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:04,511 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:04,520 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:04,523 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:04,561 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-17 22:33:04,572 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-17 22:33:04,588 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-17 22:33:04,598 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:04,608 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:33:04,615 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:04,622 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:04,629 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:04,633 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:04,670 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:04,683 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:04,689 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:04,694 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:04,698 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:04,715 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:04,719 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:33:04,722 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:04,741 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:04,748 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:04,753 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:04,758 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:04,762 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:04,766 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:04,769 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:04,790 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:04,812 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:04,820 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:04,825 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:04,830 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:04,833 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:04,858 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:04,872 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:04,883 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:04,891 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:33:04,899 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:04,904 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:04,909 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:04,912 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:04,933 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:04,937 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:04,959 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:04,964 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:04,968 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:04,982 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:04,990 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:33:04,994 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:05,027 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-17 22:33:05,044 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-17 22:33:05,053 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-17 22:33:05,062 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:05,071 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:33:05,079 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:05,085 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:05,091 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:05,107 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:05,117 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:05,124 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:05,130 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:05,133 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:05,160 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:05,169 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:05,177 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:05,185 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:05,192 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:05,198 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:05,211 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:05,221 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:05,226 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:05,249 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:05,258 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:05,267 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:05,271 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:05,301 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:05,314 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:33:05,323 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:05,331 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:05,337 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:05,341 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:05,368 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:05,378 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:05,385 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:05,390 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:05,426 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-17 22:33:05,439 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:33:05,449 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:05,471 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:05,481 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:05,491 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:05,499 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:05,507 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:05,513 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:05,519 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:05,523 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:05,546 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:05,560 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:05,570 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:05,587 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:05,593 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:05,596 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:05,601 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:05,621 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:05,624 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:05,636 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:05,643 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:05,649 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:05,664 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:05,667 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:05,673 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:05,692 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:05,696 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:05,697 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:05,710 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:05,743 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:05,763 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:05,772 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:05,780 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:05,786 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:05,789 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:05,810 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:05,814 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:05,838 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:05,844 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:05,851 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:05,867 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:05,873 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:05,880 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:05,881 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:05,895 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:05,916 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:05,921 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:05,927 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:05,944 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:05,950 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:05,956 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:05,971 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:05,974 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,000 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:06,008 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:06,015 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:06,023 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:06,029 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:06,035 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:06,037 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,058 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:06,072 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:06,082 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:06,087 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:06,091 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:06,104 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:06,108 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,113 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:06,128 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:06,133 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,151 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:06,157 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:06,161 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:06,162 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,165 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:06,186 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:06,189 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:06,193 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:06,242 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:06,253 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:06,264 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:06,271 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:06,285 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:06,299 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:06,304 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:06,309 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:06,311 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,316 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:06,336 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:06,337 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:06,340 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,369 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,382 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,388 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:06,403 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:06,408 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,425 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:06,437 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:06,438 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:06,451 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:06,458 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:06,463 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:06,469 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:06,485 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,492 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:06,497 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:06,533 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:06,539 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:06,544 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:06,548 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:06,551 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:06,554 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:06,565 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:06,569 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:06,572 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,586 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:06,600 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:06,603 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:06,617 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:06,621 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,627 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:06,636 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:06,639 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,649 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,653 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:06,655 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:06,664 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:06,666 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:06,680 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,691 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:06,693 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:06,703 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,729 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,737 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,745 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:06,752 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,756 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:06,759 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:06,775 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,779 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:06,795 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:06,799 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:06,810 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:06,820 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:06,831 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:06,834 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:06,847 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:06,857 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:06,861 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:06,864 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:06,866 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:06,880 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:06,890 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-17 22:33:06,892 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:06,901 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:06,905 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:06,916 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:06,918 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:06,920 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:06,943 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:06,950 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:06,958 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:06,965 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:06,979 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:06,984 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:06,990 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:06,995 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:06,998 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:07,015 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:07,019 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:07,023 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:07,035 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:07,039 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:07,054 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:07,072 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:07,075 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:07,079 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:07,087 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:07,101 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:07,103 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:07,106 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:07,123 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:07,133 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:07,140 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:07,145 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:07,149 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:07,161 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:07,166 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:07,169 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:07,185 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:07,197 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:07,201 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:07,212 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:07,215 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:07,218 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:07,229 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:07,232 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:07,239 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:07,244 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:07,255 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:07,266 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:07,270 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:07,277 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:07,285 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:07,291 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:07,297 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:07,302 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:07,306 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:07,307 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:07,310 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:07,344 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:07,352 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:07,357 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:07,372 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:07,380 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:07,396 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:07,401 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:07,404 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:07,418 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:07,424 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:07,437 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:07,440 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:07,468 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-17 22:33:07,478 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:07,487 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:07,497 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:07,506 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:07,513 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:07,519 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:07,525 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:07,530 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-17 22:33:07,532 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 22:33:07,547 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:07,552 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:07,555 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:07,574 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:07,579 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:07,584 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:07,585 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:07,602 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:07,605 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:07,626 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:07,634 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:07,639 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:07,645 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:07,650 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:07,663 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:07,671 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:07,675 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:07,693 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:07,703 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:07,709 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:07,712 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:07,730 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:07,733 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:07,755 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:07,762 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:07,770 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:07,776 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:07,781 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:07,787 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:07,790 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:07,811 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:07,831 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:07,839 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:07,844 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:07,850 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:07,865 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:07,871 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:07,873 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:07,912 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-17 22:33:07,921 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-17 22:33:07,929 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-17 22:33:07,937 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:07,945 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:33:07,951 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:07,957 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:07,963 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:07,965 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:07,983 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:08,009 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:08,019 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:08,025 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:08,030 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:08,046 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:08,052 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:33:08,056 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:08,081 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:08,091 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:08,100 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:08,109 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:08,115 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:08,120 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:08,123 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:08,144 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:08,160 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:08,185 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:08,192 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:08,199 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:08,203 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:08,229 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:08,244 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:08,258 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:08,269 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:33:08,278 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:08,285 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:08,291 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:08,294 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:08,326 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:08,328 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:08,343 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:08,346 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:08,350 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:08,362 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:08,367 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:33:08,369 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:08,396 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-17 22:33:08,410 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-17 22:33:08,418 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-17 22:33:08,425 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:08,431 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:33:08,437 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:08,441 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:08,445 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:08,458 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:08,464 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:08,468 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:08,480 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:08,482 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:08,505 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:08,513 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:08,520 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:08,527 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:08,532 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:08,539 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:08,550 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:08,556 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-17 22:33:08,559 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-17 22:33:08,574 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:08,578 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:08,582 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:08,585 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:08,604 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:08,609 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-17 22:33:08,615 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:08,620 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-17 22:33:08,624 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-17 22:33:08,627 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-17 22:33:08,644 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:08,649 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-17 22:33:08,653 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-17 22:33:08,656 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-17 22:33:08,670 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-17 22:33:08,828 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2020-07-17 22:33:08,829 INFO L624 ElimStorePlain]: treesize reduction 135, result has 54.8 percent of original size [2020-07-17 22:33:08,835 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:08,840 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:08,844 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:08,847 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:08,865 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:08,869 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:08,881 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:08,884 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-17 22:33:08,892 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:33:08,903 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:08,906 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:08,917 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-17 22:33:08,917 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:443, output treesize:164 [2020-07-17 22:33:11,610 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:33:11,610 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_BEFORE_CALL_2|, |v_#memory_$Pointer$.offset_BEFORE_CALL_2|]. (let ((.cse11 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse9 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_2| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse0 (select |v_#memory_$Pointer$.base_BEFORE_CALL_2| .cse9)) (.cse4 (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| .cse9)) (.cse12 (+ .cse11 4))) (let ((.cse5 (select .cse4 .cse12)) (.cse2 (select .cse0 .cse12))) (let ((.cse1 (+ .cse11 8)) (.cse3 (select |v_#memory_$Pointer$.base_BEFORE_CALL_2| .cse2)) (.cse8 (+ .cse5 8)) (.cse7 (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| .cse2))) (and (= 0 (select .cse0 .cse1)) (<= (+ .cse2 2) |main_~#s~0.base|) (= 0 (select .cse3 4)) (= 0 (select .cse4 .cse1)) (= 0 .cse5) (= (let ((.cse6 (store |v_#memory_$Pointer$.offset_BEFORE_CALL_2| .cse2 (store .cse7 .cse8 0)))) (store .cse6 |main_~#s~0.base| (store (select .cse6 |main_~#s~0.base|) |main_~#s~0.offset| .cse5))) |#memory_$Pointer$.offset|) (= .cse9 (select .cse3 8)) (not (= .cse9 .cse2)) (= 0 (select .cse7 4)) (= |#memory_$Pointer$.base| (let ((.cse10 (store |v_#memory_$Pointer$.base_BEFORE_CALL_2| .cse2 (store .cse3 .cse8 0)))) (store .cse10 |main_~#s~0.base| (store (select .cse10 |main_~#s~0.base|) |main_~#s~0.offset| .cse2)))) (= (select .cse7 8) .cse11)))))) [2020-07-17 22:33:11,610 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_18, v_arrayElimIndex_5]. (let ((.cse8 (+ v_arrayElimIndex_5 4))) (let ((.cse5 (= |main_~#s~0.base| v_arrayElimCell_18)) (.cse6 (= |main_~#s~0.offset| .cse8)) (.cse10 (select |#memory_$Pointer$.offset| v_arrayElimCell_18)) (.cse4 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse0 (select |#memory_$Pointer$.offset| .cse4)) (.cse9 (select |#memory_$Pointer$.base| .cse4)) (.cse1 (select .cse10 v_arrayElimIndex_5)) (.cse7 (select |#memory_$Pointer$.base| v_arrayElimCell_18)) (.cse2 (not .cse6)) (.cse3 (not .cse5))) (and (= 0 (select .cse0 4)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) .cse1) (= 0 .cse1) (or .cse2 .cse3 (= 0 v_arrayElimCell_18)) (<= (+ .cse4 2) |main_~#s~0.base|) (= 0 (select .cse0 8)) (or (and .cse5 .cse6) (= (select .cse7 .cse8) 0)) (= (select .cse9 4) 0) (or (not (= v_arrayElimIndex_5 |main_~#s~0.offset|)) .cse3) (= 0 (select .cse9 (+ .cse1 8))) (= .cse4 (select .cse7 v_arrayElimIndex_5)) (not (= .cse4 v_arrayElimCell_18)) (= 0 (select .cse10 .cse8)) (or (= 0 (+ v_arrayElimIndex_5 (- 4))) .cse2 .cse3))))) [2020-07-17 22:33:11,627 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:11,632 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:11,637 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:11,640 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:11,658 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:11,662 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:11,676 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:11,679 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-17 22:33:11,687 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:33:11,699 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:11,703 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:12,012 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:12,024 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:12,029 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:12,032 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-17 22:33:12,038 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:12,042 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:12,049 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:12,052 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:12,055 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:12,059 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-17 22:33:12,067 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:33:12,069 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-17 22:33:12,075 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-17 22:33:12,444 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:12,456 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:12,462 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:12,466 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-17 22:33:12,478 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:12,484 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:12,493 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:12,498 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:12,504 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:12,511 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-17 22:33:12,524 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:33:12,527 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-17 22:33:12,538 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-17 22:33:13,077 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:13,090 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:13,098 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:13,107 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:13,113 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:13,123 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:13,126 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:33:13,137 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:13,395 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:13,406 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:13,412 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,416 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:13,424 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:13,430 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:13,440 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,454 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,461 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:33:13,468 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:13,491 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:13,501 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:13,507 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,511 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:13,522 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:13,528 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:13,537 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,552 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,557 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:33:13,566 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:13,576 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-17 22:33:13,587 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:13,603 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:13,647 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,658 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:13,668 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:13,672 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:13,680 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,692 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,695 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:33:13,701 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:13,713 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:13,721 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:13,724 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,727 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:13,735 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:13,739 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:13,746 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,754 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,757 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:33:13,761 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:13,773 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:13,782 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:13,786 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,789 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:13,795 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:13,798 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:13,804 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,812 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,814 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:33:13,820 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:13,831 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:13,840 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:13,843 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,847 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:13,856 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:13,860 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:13,866 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,875 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,877 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:33:13,882 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:13,894 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:13,903 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:13,907 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,910 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:13,917 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:13,921 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:13,928 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,937 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,941 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:33:13,946 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:13,958 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:13,968 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:13,972 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:13,976 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:13,983 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 22:33:13,987 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 22:33:13,993 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:14,003 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 22:33:14,005 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-17 22:33:14,010 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-17 22:33:14,150 INFO L263 TraceCheckUtils]: 0: Hoare triple {1512#true} call ULTIMATE.init(); {1512#true} is VALID [2020-07-17 22:33:14,150 INFO L280 TraceCheckUtils]: 1: Hoare triple {1512#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1512#true} is VALID [2020-07-17 22:33:14,150 INFO L280 TraceCheckUtils]: 2: Hoare triple {1512#true} assume true; {1512#true} is VALID [2020-07-17 22:33:14,151 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1512#true} {1512#true} #98#return; {1512#true} is VALID [2020-07-17 22:33:14,151 INFO L263 TraceCheckUtils]: 4: Hoare triple {1512#true} call #t~ret11 := main(); {1512#true} is VALID [2020-07-17 22:33:14,152 INFO L280 TraceCheckUtils]: 5: Hoare triple {1512#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {1583#(< |#StackHeapBarrier| |main_~#s~0.base|)} is VALID [2020-07-17 22:33:14,152 INFO L263 TraceCheckUtils]: 6: Hoare triple {1583#(< |#StackHeapBarrier| |main_~#s~0.base|)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {1512#true} is VALID [2020-07-17 22:33:14,153 INFO L280 TraceCheckUtils]: 7: Hoare triple {1512#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1590#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:33:14,155 INFO L280 TraceCheckUtils]: 8: Hoare triple {1590#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1594#(and (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (< dll_create_~new_head~0.base |#StackHeapBarrier|) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} is VALID [2020-07-17 22:33:14,156 INFO L280 TraceCheckUtils]: 9: Hoare triple {1594#(and (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (< dll_create_~new_head~0.base |#StackHeapBarrier|) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1594#(and (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (< dll_create_~new_head~0.base |#StackHeapBarrier|) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} is VALID [2020-07-17 22:33:14,159 INFO L280 TraceCheckUtils]: 10: Hoare triple {1594#(and (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (< dll_create_~new_head~0.base |#StackHeapBarrier|) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1601#(and (= 0 dll_create_~new_head~0.offset) (< dll_create_~new_head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 1 (select |#valid| dll_create_~new_head~0.base)) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))))} is VALID [2020-07-17 22:33:14,160 INFO L280 TraceCheckUtils]: 11: Hoare triple {1601#(and (= 0 dll_create_~new_head~0.offset) (< dll_create_~new_head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 1 (select |#valid| dll_create_~new_head~0.base)) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))))} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1601#(and (= 0 dll_create_~new_head~0.offset) (< dll_create_~new_head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 1 (select |#valid| dll_create_~new_head~0.base)) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))))} is VALID [2020-07-17 22:33:14,162 INFO L280 TraceCheckUtils]: 12: Hoare triple {1601#(and (= 0 dll_create_~new_head~0.offset) (< dll_create_~new_head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 1 (select |#valid| dll_create_~new_head~0.base)) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1608#(and (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 8)) (= (select |#valid| dll_create_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 8)))} is VALID [2020-07-17 22:33:14,163 INFO L280 TraceCheckUtils]: 13: Hoare triple {1608#(and (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 8)) (= (select |#valid| dll_create_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 8)))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1612#(and (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 8)) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 8)))} is VALID [2020-07-17 22:33:14,164 INFO L280 TraceCheckUtils]: 14: Hoare triple {1612#(and (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 8)) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 8)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1612#(and (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 8)) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 8)))} is VALID [2020-07-17 22:33:14,167 INFO L280 TraceCheckUtils]: 15: Hoare triple {1612#(and (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 8)) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 8)))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1619#(and (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~head~0.base) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 8)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 8)) (= (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))))} is VALID [2020-07-17 22:33:14,170 INFO L280 TraceCheckUtils]: 16: Hoare triple {1619#(and (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~head~0.base) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 8)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 8)) (= (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1623#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4) 0) (< (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) |#StackHeapBarrier|) (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 8)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 8) dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~new_head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))))} is VALID [2020-07-17 22:33:14,172 INFO L280 TraceCheckUtils]: 17: Hoare triple {1623#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4) 0) (< (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) |#StackHeapBarrier|) (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 8)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 8) dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~new_head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1627#(and (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8))) (< (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 8) dll_create_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 8) dll_create_~head~0.base))} is VALID [2020-07-17 22:33:14,174 INFO L280 TraceCheckUtils]: 18: Hoare triple {1627#(and (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8))) (< (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 8) dll_create_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 8) dll_create_~head~0.base))} assume !(~len > 0); {1627#(and (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8))) (< (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 8) dll_create_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 8) dll_create_~head~0.base))} is VALID [2020-07-17 22:33:14,178 INFO L280 TraceCheckUtils]: 19: Hoare triple {1627#(and (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8))) (< (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 8) dll_create_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 8) dll_create_~head~0.base))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1634#(and (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 4)) (= |dll_create_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 8)) (< (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)) |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 4)) (not (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))))} is VALID [2020-07-17 22:33:14,180 INFO L280 TraceCheckUtils]: 20: Hoare triple {1634#(and (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 4)) (= |dll_create_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 8)) (< (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)) |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 4)) (not (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))))} assume true; {1634#(and (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 4)) (= |dll_create_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 8)) (< (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)) |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 4)) (not (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))))} is VALID [2020-07-17 22:33:14,185 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1634#(and (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 4)) (= |dll_create_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 8)) (< (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)) |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 4)) (not (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))))} {1583#(< |#StackHeapBarrier| |main_~#s~0.base|)} #92#return; {1641#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 8))) (= (select (select |#memory_$Pointer$.offset| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4)) 0) (<= (+ (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4)) 2) |main_~#s~0.base|) (= |main_#t~ret8.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4))) 4)) (= (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 8)) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4))) 8) |main_#t~ret8.offset|) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4)) |main_#t~ret8.base|)))} is VALID [2020-07-17 22:33:14,187 INFO L280 TraceCheckUtils]: 22: Hoare triple {1641#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 8))) (= (select (select |#memory_$Pointer$.offset| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4)) 0) (<= (+ (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4)) 2) |main_~#s~0.base|) (= |main_#t~ret8.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4))) 4)) (= (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 8)) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4))) 8) |main_#t~ret8.offset|) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4)) |main_#t~ret8.base|)))} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {1645#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) 2) |main_~#s~0.base|) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 8)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 4)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) 0))} is VALID [2020-07-17 22:33:14,189 INFO L280 TraceCheckUtils]: 23: Hoare triple {1645#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) 2) |main_~#s~0.base|) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 8)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 4)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) 0))} assume !!(~i~0 >= 0); {1645#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) 2) |main_~#s~0.base|) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 8)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 4)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) 0))} is VALID [2020-07-17 22:33:14,191 INFO L263 TraceCheckUtils]: 24: Hoare triple {1645#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) 2) |main_~#s~0.base|) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 8)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 4)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) 0))} call dll_remove_first(~#s~0.base, ~#s~0.offset); {1652#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:14,193 INFO L280 TraceCheckUtils]: 25: Hoare triple {1652#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1656#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} is VALID [2020-07-17 22:33:14,195 INFO L280 TraceCheckUtils]: 26: Hoare triple {1656#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1660#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.base) (= (store |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base (store (select |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base) (+ dll_remove_first_~temp~1.offset 8) 0)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base (store (select |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base) (+ dll_remove_first_~temp~1.offset 8) 0))) (= dll_remove_first_~temp~1.offset (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} is VALID [2020-07-17 22:33:14,197 INFO L280 TraceCheckUtils]: 27: Hoare triple {1660#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.base) (= (store |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base (store (select |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base) (+ dll_remove_first_~temp~1.offset 8) 0)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base (store (select |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base) (+ dll_remove_first_~temp~1.offset 8) 0))) (= dll_remove_first_~temp~1.offset (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {1664#(and (= (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) |#memory_$Pointer$.base|) (= (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) |#memory_$Pointer$.offset|))} is VALID [2020-07-17 22:33:14,199 INFO L280 TraceCheckUtils]: 28: Hoare triple {1664#(and (= (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) |#memory_$Pointer$.base|) (= (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) |#memory_$Pointer$.offset|))} assume true; {1664#(and (= (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) |#memory_$Pointer$.base|) (= (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) |#memory_$Pointer$.offset|))} is VALID [2020-07-17 22:33:14,335 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1664#(and (= (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) |#memory_$Pointer$.base|) (= (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) |#memory_$Pointer$.offset|))} {1645#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) 2) |main_~#s~0.base|) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 8)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 4)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) 0))} #94#return; {1671#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 8)) (<= (+ (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 2) |main_~#s~0.base|) (exists ((v_arrayElimIndex_5 Int) (v_arrayElimCell_18 Int)) (and (or (= 4 v_arrayElimIndex_5) (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (or (not (= v_arrayElimIndex_5 |main_~#s~0.offset|)) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5) 8))) (or (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18)) (= 0 v_arrayElimCell_18)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) v_arrayElimIndex_5)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) v_arrayElimCell_18)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4))) (or (and (= |main_~#s~0.base| v_arrayElimCell_18) (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4)) 0)))))} is VALID [2020-07-17 22:33:14,339 INFO L280 TraceCheckUtils]: 30: Hoare triple {1671#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 8)) (<= (+ (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 2) |main_~#s~0.base|) (exists ((v_arrayElimIndex_5 Int) (v_arrayElimCell_18 Int)) (and (or (= 4 v_arrayElimIndex_5) (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (or (not (= v_arrayElimIndex_5 |main_~#s~0.offset|)) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5) 8))) (or (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18)) (= 0 v_arrayElimCell_18)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) v_arrayElimIndex_5)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) v_arrayElimCell_18)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4))) (or (and (= |main_~#s~0.base| v_arrayElimCell_18) (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4)) 0)))))} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {1671#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 8)) (<= (+ (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 2) |main_~#s~0.base|) (exists ((v_arrayElimIndex_5 Int) (v_arrayElimCell_18 Int)) (and (or (= 4 v_arrayElimIndex_5) (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (or (not (= v_arrayElimIndex_5 |main_~#s~0.offset|)) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5) 8))) (or (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18)) (= 0 v_arrayElimCell_18)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) v_arrayElimIndex_5)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) v_arrayElimCell_18)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4))) (or (and (= |main_~#s~0.base| v_arrayElimCell_18) (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4)) 0)))))} is VALID [2020-07-17 22:33:14,343 INFO L280 TraceCheckUtils]: 31: Hoare triple {1671#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 8)) (<= (+ (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 2) |main_~#s~0.base|) (exists ((v_arrayElimIndex_5 Int) (v_arrayElimCell_18 Int)) (and (or (= 4 v_arrayElimIndex_5) (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (or (not (= v_arrayElimIndex_5 |main_~#s~0.offset|)) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5) 8))) (or (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18)) (= 0 v_arrayElimCell_18)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) v_arrayElimIndex_5)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) v_arrayElimCell_18)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4))) (or (and (= |main_~#s~0.base| v_arrayElimCell_18) (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4)) 0)))))} assume !!(~i~0 >= 0); {1671#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 8)) (<= (+ (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 2) |main_~#s~0.base|) (exists ((v_arrayElimIndex_5 Int) (v_arrayElimCell_18 Int)) (and (or (= 4 v_arrayElimIndex_5) (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (or (not (= v_arrayElimIndex_5 |main_~#s~0.offset|)) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5) 8))) (or (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18)) (= 0 v_arrayElimCell_18)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) v_arrayElimIndex_5)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) v_arrayElimCell_18)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4))) (or (and (= |main_~#s~0.base| v_arrayElimCell_18) (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4)) 0)))))} is VALID [2020-07-17 22:33:14,348 INFO L263 TraceCheckUtils]: 32: Hoare triple {1671#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 8)) (<= (+ (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 2) |main_~#s~0.base|) (exists ((v_arrayElimIndex_5 Int) (v_arrayElimCell_18 Int)) (and (or (= 4 v_arrayElimIndex_5) (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (or (not (= v_arrayElimIndex_5 |main_~#s~0.offset|)) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5) 8))) (or (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18)) (= 0 v_arrayElimCell_18)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) v_arrayElimIndex_5)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) v_arrayElimCell_18)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4))) (or (and (= |main_~#s~0.base| v_arrayElimCell_18) (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4)) 0)))))} call dll_remove_first(~#s~0.base, ~#s~0.offset); {1652#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:14,352 INFO L280 TraceCheckUtils]: 33: Hoare triple {1652#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1684#(and (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) dll_remove_first_~temp~1.base) (= dll_remove_first_~temp~1.offset (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))))} is VALID [2020-07-17 22:33:14,354 INFO L280 TraceCheckUtils]: 34: Hoare triple {1684#(and (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) dll_remove_first_~temp~1.base) (= dll_remove_first_~temp~1.offset (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))))} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1688#(or (not (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))))} is VALID [2020-07-17 22:33:14,354 INFO L280 TraceCheckUtils]: 35: Hoare triple {1688#(or (not (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {1688#(or (not (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))))} is VALID [2020-07-17 22:33:14,355 INFO L280 TraceCheckUtils]: 36: Hoare triple {1688#(or (not (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))))} assume true; {1688#(or (not (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))))} is VALID [2020-07-17 22:33:14,360 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1688#(or (not (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))))} {1671#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 8)) (<= (+ (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 2) |main_~#s~0.base|) (exists ((v_arrayElimIndex_5 Int) (v_arrayElimCell_18 Int)) (and (or (= 4 v_arrayElimIndex_5) (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (or (not (= v_arrayElimIndex_5 |main_~#s~0.offset|)) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5) 8))) (or (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18)) (= 0 v_arrayElimCell_18)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) v_arrayElimIndex_5)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) v_arrayElimCell_18)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4))) (or (and (= |main_~#s~0.base| v_arrayElimCell_18) (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4)) 0)))))} #94#return; {1513#false} is VALID [2020-07-17 22:33:14,360 INFO L280 TraceCheckUtils]: 38: Hoare triple {1513#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {1513#false} is VALID [2020-07-17 22:33:14,360 INFO L280 TraceCheckUtils]: 39: Hoare triple {1513#false} assume !(~i~0 >= 0); {1513#false} is VALID [2020-07-17 22:33:14,360 INFO L280 TraceCheckUtils]: 40: Hoare triple {1513#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {1513#false} is VALID [2020-07-17 22:33:14,361 INFO L280 TraceCheckUtils]: 41: Hoare triple {1513#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1513#false} is VALID [2020-07-17 22:33:14,361 INFO L280 TraceCheckUtils]: 42: Hoare triple {1513#false} assume !false; {1513#false} is VALID [2020-07-17 22:33:14,381 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:33:14,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:33:14,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 44 [2020-07-17 22:33:14,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542296348] [2020-07-17 22:33:14,384 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2020-07-17 22:33:14,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:33:14,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2020-07-17 22:33:16,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 81 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:16,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2020-07-17 22:33:16,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:33:16,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-07-17 22:33:16,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1788, Unknown=0, NotChecked=0, Total=1892 [2020-07-17 22:33:16,628 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 44 states. [2020-07-17 22:33:20,159 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2020-07-17 22:33:20,656 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2020-07-17 22:33:21,064 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2020-07-17 22:33:21,531 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2020-07-17 22:33:23,116 WARN L193 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2020-07-17 22:33:26,791 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 48 [2020-07-17 22:33:27,449 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2020-07-17 22:33:31,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:31,875 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2020-07-17 22:33:31,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-07-17 22:33:31,875 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2020-07-17 22:33:31,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:33:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-17 22:33:31,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 103 transitions. [2020-07-17 22:33:31,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-17 22:33:31,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 103 transitions. [2020-07-17 22:33:31,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 103 transitions. [2020-07-17 22:33:32,623 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:32,629 INFO L225 Difference]: With dead ends: 89 [2020-07-17 22:33:32,629 INFO L226 Difference]: Without dead ends: 75 [2020-07-17 22:33:32,632 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=291, Invalid=4679, Unknown=0, NotChecked=0, Total=4970 [2020-07-17 22:33:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-17 22:33:32,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 56. [2020-07-17 22:33:32,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:33:32,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 56 states. [2020-07-17 22:33:32,735 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 56 states. [2020-07-17 22:33:32,735 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 56 states. [2020-07-17 22:33:32,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:32,742 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2020-07-17 22:33:32,742 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2020-07-17 22:33:32,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:32,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:32,743 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 75 states. [2020-07-17 22:33:32,743 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 75 states. [2020-07-17 22:33:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:32,748 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2020-07-17 22:33:32,749 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2020-07-17 22:33:32,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:32,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:32,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:33:32,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:33:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-17 22:33:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2020-07-17 22:33:32,754 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 43 [2020-07-17 22:33:32,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:33:32,754 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2020-07-17 22:33:32,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 44 states. [2020-07-17 22:33:32,755 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2020-07-17 22:33:32,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-17 22:33:32,757 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:33:32,757 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:33:32,957 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:33:32,958 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:33:32,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:33:32,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1394437068, now seen corresponding path program 3 times [2020-07-17 22:33:32,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:33:32,960 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916860609] [2020-07-17 22:33:32,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:33:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:33,046 INFO L280 TraceCheckUtils]: 0: Hoare triple {2151#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2115#true} is VALID [2020-07-17 22:33:33,046 INFO L280 TraceCheckUtils]: 1: Hoare triple {2115#true} assume true; {2115#true} is VALID [2020-07-17 22:33:33,046 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2115#true} {2115#true} #98#return; {2115#true} is VALID [2020-07-17 22:33:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:33,187 INFO L280 TraceCheckUtils]: 0: Hoare triple {2152#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {2153#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,188 INFO L280 TraceCheckUtils]: 1: Hoare triple {2153#(= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2153#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,189 INFO L280 TraceCheckUtils]: 2: Hoare triple {2153#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2153#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,190 INFO L280 TraceCheckUtils]: 3: Hoare triple {2153#(= dll_create_~len |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2153#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,191 INFO L280 TraceCheckUtils]: 4: Hoare triple {2153#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {2153#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,193 INFO L280 TraceCheckUtils]: 5: Hoare triple {2153#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,193 INFO L280 TraceCheckUtils]: 6: Hoare triple {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,194 INFO L280 TraceCheckUtils]: 7: Hoare triple {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,195 INFO L280 TraceCheckUtils]: 8: Hoare triple {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,196 INFO L280 TraceCheckUtils]: 9: Hoare triple {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,198 INFO L280 TraceCheckUtils]: 10: Hoare triple {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2155#(<= (+ dll_create_~len 2) |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,200 INFO L280 TraceCheckUtils]: 11: Hoare triple {2155#(<= (+ dll_create_~len 2) |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,209 INFO L280 TraceCheckUtils]: 12: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,211 INFO L280 TraceCheckUtils]: 13: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,212 INFO L280 TraceCheckUtils]: 14: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,212 INFO L280 TraceCheckUtils]: 15: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,213 INFO L280 TraceCheckUtils]: 16: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} assume !(~len > 0); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,214 INFO L280 TraceCheckUtils]: 17: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,215 INFO L280 TraceCheckUtils]: 18: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} assume true; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,217 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2156#(<= 3 |dll_create_#in~len|)} {2120#(<= main_~len~0 2)} #92#return; {2116#false} is VALID [2020-07-17 22:33:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:33,252 INFO L280 TraceCheckUtils]: 0: Hoare triple {2157#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2115#true} is VALID [2020-07-17 22:33:33,253 INFO L280 TraceCheckUtils]: 1: Hoare triple {2115#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2115#true} is VALID [2020-07-17 22:33:33,253 INFO L280 TraceCheckUtils]: 2: Hoare triple {2115#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2115#true} is VALID [2020-07-17 22:33:33,253 INFO L280 TraceCheckUtils]: 3: Hoare triple {2115#true} assume true; {2115#true} is VALID [2020-07-17 22:33:33,254 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2115#true} {2116#false} #94#return; {2116#false} is VALID [2020-07-17 22:33:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:33,266 INFO L280 TraceCheckUtils]: 0: Hoare triple {2157#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2115#true} is VALID [2020-07-17 22:33:33,266 INFO L280 TraceCheckUtils]: 1: Hoare triple {2115#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2115#true} is VALID [2020-07-17 22:33:33,267 INFO L280 TraceCheckUtils]: 2: Hoare triple {2115#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2115#true} is VALID [2020-07-17 22:33:33,267 INFO L280 TraceCheckUtils]: 3: Hoare triple {2115#true} assume true; {2115#true} is VALID [2020-07-17 22:33:33,268 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2115#true} {2116#false} #94#return; {2116#false} is VALID [2020-07-17 22:33:33,269 INFO L263 TraceCheckUtils]: 0: Hoare triple {2115#true} call ULTIMATE.init(); {2151#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:33:33,270 INFO L280 TraceCheckUtils]: 1: Hoare triple {2151#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2115#true} is VALID [2020-07-17 22:33:33,270 INFO L280 TraceCheckUtils]: 2: Hoare triple {2115#true} assume true; {2115#true} is VALID [2020-07-17 22:33:33,270 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2115#true} {2115#true} #98#return; {2115#true} is VALID [2020-07-17 22:33:33,271 INFO L263 TraceCheckUtils]: 4: Hoare triple {2115#true} call #t~ret11 := main(); {2115#true} is VALID [2020-07-17 22:33:33,272 INFO L280 TraceCheckUtils]: 5: Hoare triple {2115#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {2120#(<= main_~len~0 2)} is VALID [2020-07-17 22:33:33,274 INFO L263 TraceCheckUtils]: 6: Hoare triple {2120#(<= main_~len~0 2)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {2152#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:33,276 INFO L280 TraceCheckUtils]: 7: Hoare triple {2152#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {2153#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,277 INFO L280 TraceCheckUtils]: 8: Hoare triple {2153#(= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2153#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,278 INFO L280 TraceCheckUtils]: 9: Hoare triple {2153#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2153#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,279 INFO L280 TraceCheckUtils]: 10: Hoare triple {2153#(= dll_create_~len |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2153#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,280 INFO L280 TraceCheckUtils]: 11: Hoare triple {2153#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {2153#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,281 INFO L280 TraceCheckUtils]: 12: Hoare triple {2153#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,282 INFO L280 TraceCheckUtils]: 13: Hoare triple {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,283 INFO L280 TraceCheckUtils]: 14: Hoare triple {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,284 INFO L280 TraceCheckUtils]: 15: Hoare triple {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,285 INFO L280 TraceCheckUtils]: 16: Hoare triple {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,286 INFO L280 TraceCheckUtils]: 17: Hoare triple {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2155#(<= (+ dll_create_~len 2) |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,289 INFO L280 TraceCheckUtils]: 18: Hoare triple {2155#(<= (+ dll_create_~len 2) |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,290 INFO L280 TraceCheckUtils]: 19: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,290 INFO L280 TraceCheckUtils]: 20: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,291 INFO L280 TraceCheckUtils]: 21: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,292 INFO L280 TraceCheckUtils]: 22: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,293 INFO L280 TraceCheckUtils]: 23: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} assume !(~len > 0); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,294 INFO L280 TraceCheckUtils]: 24: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,295 INFO L280 TraceCheckUtils]: 25: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} assume true; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:33,297 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2156#(<= 3 |dll_create_#in~len|)} {2120#(<= main_~len~0 2)} #92#return; {2116#false} is VALID [2020-07-17 22:33:33,298 INFO L280 TraceCheckUtils]: 27: Hoare triple {2116#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {2116#false} is VALID [2020-07-17 22:33:33,298 INFO L280 TraceCheckUtils]: 28: Hoare triple {2116#false} assume !!(~i~0 >= 0); {2116#false} is VALID [2020-07-17 22:33:33,298 INFO L263 TraceCheckUtils]: 29: Hoare triple {2116#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {2157#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:33,299 INFO L280 TraceCheckUtils]: 30: Hoare triple {2157#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2115#true} is VALID [2020-07-17 22:33:33,299 INFO L280 TraceCheckUtils]: 31: Hoare triple {2115#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2115#true} is VALID [2020-07-17 22:33:33,299 INFO L280 TraceCheckUtils]: 32: Hoare triple {2115#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2115#true} is VALID [2020-07-17 22:33:33,300 INFO L280 TraceCheckUtils]: 33: Hoare triple {2115#true} assume true; {2115#true} is VALID [2020-07-17 22:33:33,300 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2115#true} {2116#false} #94#return; {2116#false} is VALID [2020-07-17 22:33:33,300 INFO L280 TraceCheckUtils]: 35: Hoare triple {2116#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {2116#false} is VALID [2020-07-17 22:33:33,301 INFO L280 TraceCheckUtils]: 36: Hoare triple {2116#false} assume !!(~i~0 >= 0); {2116#false} is VALID [2020-07-17 22:33:33,301 INFO L263 TraceCheckUtils]: 37: Hoare triple {2116#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {2157#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:33,301 INFO L280 TraceCheckUtils]: 38: Hoare triple {2157#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2115#true} is VALID [2020-07-17 22:33:33,302 INFO L280 TraceCheckUtils]: 39: Hoare triple {2115#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2115#true} is VALID [2020-07-17 22:33:33,302 INFO L280 TraceCheckUtils]: 40: Hoare triple {2115#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2115#true} is VALID [2020-07-17 22:33:33,302 INFO L280 TraceCheckUtils]: 41: Hoare triple {2115#true} assume true; {2115#true} is VALID [2020-07-17 22:33:33,303 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2115#true} {2116#false} #94#return; {2116#false} is VALID [2020-07-17 22:33:33,303 INFO L280 TraceCheckUtils]: 43: Hoare triple {2116#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {2116#false} is VALID [2020-07-17 22:33:33,303 INFO L280 TraceCheckUtils]: 44: Hoare triple {2116#false} assume !(~i~0 >= 0); {2116#false} is VALID [2020-07-17 22:33:33,304 INFO L280 TraceCheckUtils]: 45: Hoare triple {2116#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {2116#false} is VALID [2020-07-17 22:33:33,304 INFO L280 TraceCheckUtils]: 46: Hoare triple {2116#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2116#false} is VALID [2020-07-17 22:33:33,304 INFO L280 TraceCheckUtils]: 47: Hoare triple {2116#false} assume !false; {2116#false} is VALID [2020-07-17 22:33:33,309 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-17 22:33:33,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916860609] [2020-07-17 22:33:33,310 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892925777] [2020-07-17 22:33:33,310 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:33:34,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-17 22:33:34,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:33:34,553 INFO L264 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:33:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:34,583 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:33:34,701 INFO L263 TraceCheckUtils]: 0: Hoare triple {2115#true} call ULTIMATE.init(); {2115#true} is VALID [2020-07-17 22:33:34,701 INFO L280 TraceCheckUtils]: 1: Hoare triple {2115#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2115#true} is VALID [2020-07-17 22:33:34,701 INFO L280 TraceCheckUtils]: 2: Hoare triple {2115#true} assume true; {2115#true} is VALID [2020-07-17 22:33:34,702 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2115#true} {2115#true} #98#return; {2115#true} is VALID [2020-07-17 22:33:34,702 INFO L263 TraceCheckUtils]: 4: Hoare triple {2115#true} call #t~ret11 := main(); {2115#true} is VALID [2020-07-17 22:33:34,703 INFO L280 TraceCheckUtils]: 5: Hoare triple {2115#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {2120#(<= main_~len~0 2)} is VALID [2020-07-17 22:33:34,703 INFO L263 TraceCheckUtils]: 6: Hoare triple {2120#(<= main_~len~0 2)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {2115#true} is VALID [2020-07-17 22:33:34,703 INFO L280 TraceCheckUtils]: 7: Hoare triple {2115#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {2182#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:34,704 INFO L280 TraceCheckUtils]: 8: Hoare triple {2182#(<= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2182#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:34,704 INFO L280 TraceCheckUtils]: 9: Hoare triple {2182#(<= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2182#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:34,705 INFO L280 TraceCheckUtils]: 10: Hoare triple {2182#(<= dll_create_~len |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2182#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:34,705 INFO L280 TraceCheckUtils]: 11: Hoare triple {2182#(<= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {2182#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:34,706 INFO L280 TraceCheckUtils]: 12: Hoare triple {2182#(<= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-17 22:33:34,706 INFO L280 TraceCheckUtils]: 13: Hoare triple {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-17 22:33:34,707 INFO L280 TraceCheckUtils]: 14: Hoare triple {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-17 22:33:34,707 INFO L280 TraceCheckUtils]: 15: Hoare triple {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-17 22:33:34,708 INFO L280 TraceCheckUtils]: 16: Hoare triple {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-17 22:33:34,709 INFO L280 TraceCheckUtils]: 17: Hoare triple {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2155#(<= (+ dll_create_~len 2) |dll_create_#in~len|)} is VALID [2020-07-17 22:33:34,710 INFO L280 TraceCheckUtils]: 18: Hoare triple {2155#(<= (+ dll_create_~len 2) |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:34,714 INFO L280 TraceCheckUtils]: 19: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:34,715 INFO L280 TraceCheckUtils]: 20: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:34,715 INFO L280 TraceCheckUtils]: 21: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:34,716 INFO L280 TraceCheckUtils]: 22: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:34,716 INFO L280 TraceCheckUtils]: 23: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} assume !(~len > 0); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:34,717 INFO L280 TraceCheckUtils]: 24: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:34,717 INFO L280 TraceCheckUtils]: 25: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} assume true; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-17 22:33:34,718 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2156#(<= 3 |dll_create_#in~len|)} {2120#(<= main_~len~0 2)} #92#return; {2116#false} is VALID [2020-07-17 22:33:34,719 INFO L280 TraceCheckUtils]: 27: Hoare triple {2116#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {2116#false} is VALID [2020-07-17 22:33:34,719 INFO L280 TraceCheckUtils]: 28: Hoare triple {2116#false} assume !!(~i~0 >= 0); {2116#false} is VALID [2020-07-17 22:33:34,719 INFO L263 TraceCheckUtils]: 29: Hoare triple {2116#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {2116#false} is VALID [2020-07-17 22:33:34,719 INFO L280 TraceCheckUtils]: 30: Hoare triple {2116#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2116#false} is VALID [2020-07-17 22:33:34,719 INFO L280 TraceCheckUtils]: 31: Hoare triple {2116#false} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2116#false} is VALID [2020-07-17 22:33:34,719 INFO L280 TraceCheckUtils]: 32: Hoare triple {2116#false} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2116#false} is VALID [2020-07-17 22:33:34,719 INFO L280 TraceCheckUtils]: 33: Hoare triple {2116#false} assume true; {2116#false} is VALID [2020-07-17 22:33:34,720 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2116#false} {2116#false} #94#return; {2116#false} is VALID [2020-07-17 22:33:34,720 INFO L280 TraceCheckUtils]: 35: Hoare triple {2116#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {2116#false} is VALID [2020-07-17 22:33:34,720 INFO L280 TraceCheckUtils]: 36: Hoare triple {2116#false} assume !!(~i~0 >= 0); {2116#false} is VALID [2020-07-17 22:33:34,720 INFO L263 TraceCheckUtils]: 37: Hoare triple {2116#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {2116#false} is VALID [2020-07-17 22:33:34,720 INFO L280 TraceCheckUtils]: 38: Hoare triple {2116#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2116#false} is VALID [2020-07-17 22:33:34,721 INFO L280 TraceCheckUtils]: 39: Hoare triple {2116#false} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2116#false} is VALID [2020-07-17 22:33:34,721 INFO L280 TraceCheckUtils]: 40: Hoare triple {2116#false} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2116#false} is VALID [2020-07-17 22:33:34,721 INFO L280 TraceCheckUtils]: 41: Hoare triple {2116#false} assume true; {2116#false} is VALID [2020-07-17 22:33:34,722 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2116#false} {2116#false} #94#return; {2116#false} is VALID [2020-07-17 22:33:34,722 INFO L280 TraceCheckUtils]: 43: Hoare triple {2116#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {2116#false} is VALID [2020-07-17 22:33:34,722 INFO L280 TraceCheckUtils]: 44: Hoare triple {2116#false} assume !(~i~0 >= 0); {2116#false} is VALID [2020-07-17 22:33:34,722 INFO L280 TraceCheckUtils]: 45: Hoare triple {2116#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {2116#false} is VALID [2020-07-17 22:33:34,723 INFO L280 TraceCheckUtils]: 46: Hoare triple {2116#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2116#false} is VALID [2020-07-17 22:33:34,723 INFO L280 TraceCheckUtils]: 47: Hoare triple {2116#false} assume !false; {2116#false} is VALID [2020-07-17 22:33:34,725 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-17 22:33:34,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:33:34,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2020-07-17 22:33:34,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680785273] [2020-07-17 22:33:34,726 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2020-07-17 22:33:34,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:33:34,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:33:34,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:34,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:33:34,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:33:34,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:33:34,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:33:34,826 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 11 states. [2020-07-17 22:33:35,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:35,716 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2020-07-17 22:33:35,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:33:35,716 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2020-07-17 22:33:35,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:33:35,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:33:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2020-07-17 22:33:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:33:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2020-07-17 22:33:35,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 63 transitions. [2020-07-17 22:33:35,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:35,835 INFO L225 Difference]: With dead ends: 73 [2020-07-17 22:33:35,835 INFO L226 Difference]: Without dead ends: 45 [2020-07-17 22:33:35,836 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:33:35,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-17 22:33:35,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-17 22:33:35,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:33:35,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2020-07-17 22:33:35,929 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2020-07-17 22:33:35,929 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2020-07-17 22:33:35,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:35,931 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-07-17 22:33:35,932 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2020-07-17 22:33:35,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:35,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:35,932 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2020-07-17 22:33:35,932 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2020-07-17 22:33:35,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:35,935 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-07-17 22:33:35,935 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2020-07-17 22:33:35,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:35,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:35,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:33:35,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:33:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-17 22:33:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2020-07-17 22:33:35,938 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 48 [2020-07-17 22:33:35,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:33:35,938 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2020-07-17 22:33:35,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:33:35,938 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2020-07-17 22:33:35,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-17 22:33:35,939 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:33:35,939 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:33:36,152 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:33:36,153 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:33:36,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:33:36,154 INFO L82 PathProgramCache]: Analyzing trace with hash 2096610473, now seen corresponding path program 1 times [2020-07-17 22:33:36,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:33:36,154 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356577483] [2020-07-17 22:33:36,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:33:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:36,240 INFO L280 TraceCheckUtils]: 0: Hoare triple {2600#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2561#true} is VALID [2020-07-17 22:33:36,241 INFO L280 TraceCheckUtils]: 1: Hoare triple {2561#true} assume true; {2561#true} is VALID [2020-07-17 22:33:36,241 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2561#true} {2561#true} #98#return; {2561#true} is VALID [2020-07-17 22:33:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:36,276 INFO L280 TraceCheckUtils]: 0: Hoare triple {2601#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {2561#true} is VALID [2020-07-17 22:33:36,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {2561#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2561#true} is VALID [2020-07-17 22:33:36,277 INFO L280 TraceCheckUtils]: 2: Hoare triple {2561#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2561#true} is VALID [2020-07-17 22:33:36,277 INFO L280 TraceCheckUtils]: 3: Hoare triple {2561#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2561#true} is VALID [2020-07-17 22:33:36,277 INFO L280 TraceCheckUtils]: 4: Hoare triple {2561#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {2561#true} is VALID [2020-07-17 22:33:36,277 INFO L280 TraceCheckUtils]: 5: Hoare triple {2561#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2561#true} is VALID [2020-07-17 22:33:36,278 INFO L280 TraceCheckUtils]: 6: Hoare triple {2561#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2561#true} is VALID [2020-07-17 22:33:36,278 INFO L280 TraceCheckUtils]: 7: Hoare triple {2561#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2561#true} is VALID [2020-07-17 22:33:36,278 INFO L280 TraceCheckUtils]: 8: Hoare triple {2561#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2561#true} is VALID [2020-07-17 22:33:36,278 INFO L280 TraceCheckUtils]: 9: Hoare triple {2561#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {2561#true} is VALID [2020-07-17 22:33:36,278 INFO L280 TraceCheckUtils]: 10: Hoare triple {2561#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2561#true} is VALID [2020-07-17 22:33:36,279 INFO L280 TraceCheckUtils]: 11: Hoare triple {2561#true} assume !(~len > 0); {2561#true} is VALID [2020-07-17 22:33:36,279 INFO L280 TraceCheckUtils]: 12: Hoare triple {2561#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2561#true} is VALID [2020-07-17 22:33:36,279 INFO L280 TraceCheckUtils]: 13: Hoare triple {2561#true} assume true; {2561#true} is VALID [2020-07-17 22:33:36,281 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2561#true} {2566#(<= main_~len~0 2)} #92#return; {2566#(<= main_~len~0 2)} is VALID [2020-07-17 22:33:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:36,308 INFO L280 TraceCheckUtils]: 0: Hoare triple {2602#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2561#true} is VALID [2020-07-17 22:33:36,308 INFO L280 TraceCheckUtils]: 1: Hoare triple {2561#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2561#true} is VALID [2020-07-17 22:33:36,308 INFO L280 TraceCheckUtils]: 2: Hoare triple {2561#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2561#true} is VALID [2020-07-17 22:33:36,308 INFO L280 TraceCheckUtils]: 3: Hoare triple {2561#true} assume true; {2561#true} is VALID [2020-07-17 22:33:36,310 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2561#true} {2582#(<= main_~i~0 1)} #94#return; {2582#(<= main_~i~0 1)} is VALID [2020-07-17 22:33:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:36,316 INFO L280 TraceCheckUtils]: 0: Hoare triple {2602#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2561#true} is VALID [2020-07-17 22:33:36,317 INFO L280 TraceCheckUtils]: 1: Hoare triple {2561#true} assume !(~temp~1.base != 0 || ~temp~1.offset != 0); {2561#true} is VALID [2020-07-17 22:33:36,317 INFO L280 TraceCheckUtils]: 2: Hoare triple {2561#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2561#true} is VALID [2020-07-17 22:33:36,317 INFO L280 TraceCheckUtils]: 3: Hoare triple {2561#true} assume true; {2561#true} is VALID [2020-07-17 22:33:36,319 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2561#true} {2588#(<= main_~i~0 0)} #94#return; {2588#(<= main_~i~0 0)} is VALID [2020-07-17 22:33:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:36,327 INFO L280 TraceCheckUtils]: 0: Hoare triple {2602#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2561#true} is VALID [2020-07-17 22:33:36,327 INFO L280 TraceCheckUtils]: 1: Hoare triple {2561#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2561#true} is VALID [2020-07-17 22:33:36,327 INFO L280 TraceCheckUtils]: 2: Hoare triple {2561#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2561#true} is VALID [2020-07-17 22:33:36,327 INFO L280 TraceCheckUtils]: 3: Hoare triple {2561#true} assume true; {2561#true} is VALID [2020-07-17 22:33:36,328 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2561#true} {2562#false} #94#return; {2562#false} is VALID [2020-07-17 22:33:36,329 INFO L263 TraceCheckUtils]: 0: Hoare triple {2561#true} call ULTIMATE.init(); {2600#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:33:36,329 INFO L280 TraceCheckUtils]: 1: Hoare triple {2600#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2561#true} is VALID [2020-07-17 22:33:36,329 INFO L280 TraceCheckUtils]: 2: Hoare triple {2561#true} assume true; {2561#true} is VALID [2020-07-17 22:33:36,330 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2561#true} {2561#true} #98#return; {2561#true} is VALID [2020-07-17 22:33:36,330 INFO L263 TraceCheckUtils]: 4: Hoare triple {2561#true} call #t~ret11 := main(); {2561#true} is VALID [2020-07-17 22:33:36,332 INFO L280 TraceCheckUtils]: 5: Hoare triple {2561#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {2566#(<= main_~len~0 2)} is VALID [2020-07-17 22:33:36,334 INFO L263 TraceCheckUtils]: 6: Hoare triple {2566#(<= main_~len~0 2)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {2601#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:36,334 INFO L280 TraceCheckUtils]: 7: Hoare triple {2601#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {2561#true} is VALID [2020-07-17 22:33:36,335 INFO L280 TraceCheckUtils]: 8: Hoare triple {2561#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2561#true} is VALID [2020-07-17 22:33:36,335 INFO L280 TraceCheckUtils]: 9: Hoare triple {2561#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2561#true} is VALID [2020-07-17 22:33:36,335 INFO L280 TraceCheckUtils]: 10: Hoare triple {2561#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2561#true} is VALID [2020-07-17 22:33:36,335 INFO L280 TraceCheckUtils]: 11: Hoare triple {2561#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {2561#true} is VALID [2020-07-17 22:33:36,335 INFO L280 TraceCheckUtils]: 12: Hoare triple {2561#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2561#true} is VALID [2020-07-17 22:33:36,336 INFO L280 TraceCheckUtils]: 13: Hoare triple {2561#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2561#true} is VALID [2020-07-17 22:33:36,336 INFO L280 TraceCheckUtils]: 14: Hoare triple {2561#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2561#true} is VALID [2020-07-17 22:33:36,336 INFO L280 TraceCheckUtils]: 15: Hoare triple {2561#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2561#true} is VALID [2020-07-17 22:33:36,336 INFO L280 TraceCheckUtils]: 16: Hoare triple {2561#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {2561#true} is VALID [2020-07-17 22:33:36,336 INFO L280 TraceCheckUtils]: 17: Hoare triple {2561#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2561#true} is VALID [2020-07-17 22:33:36,337 INFO L280 TraceCheckUtils]: 18: Hoare triple {2561#true} assume !(~len > 0); {2561#true} is VALID [2020-07-17 22:33:36,337 INFO L280 TraceCheckUtils]: 19: Hoare triple {2561#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2561#true} is VALID [2020-07-17 22:33:36,337 INFO L280 TraceCheckUtils]: 20: Hoare triple {2561#true} assume true; {2561#true} is VALID [2020-07-17 22:33:36,339 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2561#true} {2566#(<= main_~len~0 2)} #92#return; {2566#(<= main_~len~0 2)} is VALID [2020-07-17 22:33:36,341 INFO L280 TraceCheckUtils]: 22: Hoare triple {2566#(<= main_~len~0 2)} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {2582#(<= main_~i~0 1)} is VALID [2020-07-17 22:33:36,341 INFO L280 TraceCheckUtils]: 23: Hoare triple {2582#(<= main_~i~0 1)} assume !!(~i~0 >= 0); {2582#(<= main_~i~0 1)} is VALID [2020-07-17 22:33:36,343 INFO L263 TraceCheckUtils]: 24: Hoare triple {2582#(<= main_~i~0 1)} call dll_remove_first(~#s~0.base, ~#s~0.offset); {2602#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:36,344 INFO L280 TraceCheckUtils]: 25: Hoare triple {2602#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2561#true} is VALID [2020-07-17 22:33:36,344 INFO L280 TraceCheckUtils]: 26: Hoare triple {2561#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2561#true} is VALID [2020-07-17 22:33:36,344 INFO L280 TraceCheckUtils]: 27: Hoare triple {2561#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2561#true} is VALID [2020-07-17 22:33:36,344 INFO L280 TraceCheckUtils]: 28: Hoare triple {2561#true} assume true; {2561#true} is VALID [2020-07-17 22:33:36,345 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2561#true} {2582#(<= main_~i~0 1)} #94#return; {2582#(<= main_~i~0 1)} is VALID [2020-07-17 22:33:36,347 INFO L280 TraceCheckUtils]: 30: Hoare triple {2582#(<= main_~i~0 1)} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {2588#(<= main_~i~0 0)} is VALID [2020-07-17 22:33:36,347 INFO L280 TraceCheckUtils]: 31: Hoare triple {2588#(<= main_~i~0 0)} assume !!(~i~0 >= 0); {2588#(<= main_~i~0 0)} is VALID [2020-07-17 22:33:36,349 INFO L263 TraceCheckUtils]: 32: Hoare triple {2588#(<= main_~i~0 0)} call dll_remove_first(~#s~0.base, ~#s~0.offset); {2602#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:36,349 INFO L280 TraceCheckUtils]: 33: Hoare triple {2602#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2561#true} is VALID [2020-07-17 22:33:36,350 INFO L280 TraceCheckUtils]: 34: Hoare triple {2561#true} assume !(~temp~1.base != 0 || ~temp~1.offset != 0); {2561#true} is VALID [2020-07-17 22:33:36,350 INFO L280 TraceCheckUtils]: 35: Hoare triple {2561#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2561#true} is VALID [2020-07-17 22:33:36,350 INFO L280 TraceCheckUtils]: 36: Hoare triple {2561#true} assume true; {2561#true} is VALID [2020-07-17 22:33:36,351 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2561#true} {2588#(<= main_~i~0 0)} #94#return; {2588#(<= main_~i~0 0)} is VALID [2020-07-17 22:33:36,352 INFO L280 TraceCheckUtils]: 38: Hoare triple {2588#(<= main_~i~0 0)} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {2594#(<= (+ main_~i~0 1) 0)} is VALID [2020-07-17 22:33:36,353 INFO L280 TraceCheckUtils]: 39: Hoare triple {2594#(<= (+ main_~i~0 1) 0)} assume !!(~i~0 >= 0); {2562#false} is VALID [2020-07-17 22:33:36,354 INFO L263 TraceCheckUtils]: 40: Hoare triple {2562#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {2602#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:36,354 INFO L280 TraceCheckUtils]: 41: Hoare triple {2602#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2561#true} is VALID [2020-07-17 22:33:36,354 INFO L280 TraceCheckUtils]: 42: Hoare triple {2561#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2561#true} is VALID [2020-07-17 22:33:36,355 INFO L280 TraceCheckUtils]: 43: Hoare triple {2561#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2561#true} is VALID [2020-07-17 22:33:36,355 INFO L280 TraceCheckUtils]: 44: Hoare triple {2561#true} assume true; {2561#true} is VALID [2020-07-17 22:33:36,355 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2561#true} {2562#false} #94#return; {2562#false} is VALID [2020-07-17 22:33:36,355 INFO L280 TraceCheckUtils]: 46: Hoare triple {2562#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {2562#false} is VALID [2020-07-17 22:33:36,356 INFO L280 TraceCheckUtils]: 47: Hoare triple {2562#false} assume !(~i~0 >= 0); {2562#false} is VALID [2020-07-17 22:33:36,356 INFO L280 TraceCheckUtils]: 48: Hoare triple {2562#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {2562#false} is VALID [2020-07-17 22:33:36,356 INFO L280 TraceCheckUtils]: 49: Hoare triple {2562#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2562#false} is VALID [2020-07-17 22:33:36,356 INFO L280 TraceCheckUtils]: 50: Hoare triple {2562#false} assume !false; {2562#false} is VALID [2020-07-17 22:33:36,362 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-17 22:33:36,363 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356577483] [2020-07-17 22:33:36,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:33:36,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-17 22:33:36,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259620409] [2020-07-17 22:33:36,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2020-07-17 22:33:36,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:33:36,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:33:36,446 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:36,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:33:36,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:33:36,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:33:36,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:33:36,448 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 9 states. [2020-07-17 22:33:37,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:37,155 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2020-07-17 22:33:37,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:33:37,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2020-07-17 22:33:37,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:33:37,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:33:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2020-07-17 22:33:37,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:33:37,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2020-07-17 22:33:37,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2020-07-17 22:33:37,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:37,290 INFO L225 Difference]: With dead ends: 53 [2020-07-17 22:33:37,290 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:33:37,291 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:33:37,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:33:37,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:33:37,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:33:37,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:33:37,292 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:33:37,292 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:33:37,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:37,293 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:33:37,293 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:33:37,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:37,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:37,296 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:33:37,296 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:33:37,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:37,296 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:33:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:33:37,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:37,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:37,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:33:37,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:33:37,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:33:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:33:37,298 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2020-07-17 22:33:37,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:33:37,299 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:33:37,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:33:37,299 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:33:37,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:37,300 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 22:33:37,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:33:37,684 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 42 [2020-07-17 22:33:38,039 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 92 [2020-07-17 22:33:38,244 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 47 [2020-07-17 22:33:38,331 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:33:38,332 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-17 22:33:38,332 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:33:38,332 INFO L271 CegarLoopResult]: At program point myexitENTRY(lines 561 563) the Hoare annotation is: true [2020-07-17 22:33:38,332 INFO L268 CegarLoopResult]: For program point myexitEXIT(lines 561 563) no Hoare annotation was computed. [2020-07-17 22:33:38,332 INFO L271 CegarLoopResult]: At program point L562(line 562) the Hoare annotation is: true [2020-07-17 22:33:38,332 INFO L268 CegarLoopResult]: For program point L578-1(lines 578 580) no Hoare annotation was computed. [2020-07-17 22:33:38,333 INFO L264 CegarLoopResult]: At program point dll_createENTRY(lines 574 591) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 22:33:38,333 INFO L264 CegarLoopResult]: At program point L576-2(lines 576 589) the Hoare annotation is: (let ((.cse10 (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base)) (.cse12 (select |#memory_$Pointer$.base| dll_create_~new_head~0.base)) (.cse13 (+ dll_create_~new_head~0.offset 4)) (.cse9 (select |#memory_$Pointer$.offset| dll_create_~head~0.base)) (.cse7 (select |#memory_$Pointer$.base| dll_create_~head~0.base))) (let ((.cse0 (<= (+ dll_create_~len 2) |dll_create_#in~len|)) (.cse3 (select .cse7 4)) (.cse5 (= 0 (select .cse9 4))) (.cse1 (= 0 dll_create_~head~0.offset)) (.cse2 (select .cse12 .cse13)) (.cse4 (= 0 dll_create_~new_head~0.offset)) (.cse6 (= 0 (select .cse10 .cse13)))) (or (and .cse0 (<= 3 |dll_create_#in~len|)) (and (= |#valid| |old(#valid)|) (= dll_create_~len |dll_create_#in~len|) .cse1 (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 dll_create_~head~0.base) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= 0 (select |old(#valid)| .cse2)) (= (select (select |#memory_$Pointer$.offset| .cse2) 4) 0) (= 0 (select (select |#memory_$Pointer$.base| .cse3) 4)) (= 0 (select (select |#memory_$Pointer$.offset| .cse3) 4)) .cse4 .cse5 .cse1 .cse0 .cse6 (= 0 (select (select |#memory_$Pointer$.base| .cse2) 4)) (= 0 (select |old(#valid)| .cse3))) (let ((.cse8 (+ dll_create_~len 1)) (.cse11 (+ dll_create_~new_head~0.offset 8))) (and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= .cse3 0) (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) .cse5 .cse1 (= 0 (select .cse7 8)) (<= .cse8 |dll_create_#in~len|) (= .cse2 0) (= 0 (select .cse9 8)) .cse4 (< dll_create_~head~0.base |#StackHeapBarrier|) (< dll_create_~new_head~0.base |#StackHeapBarrier|) .cse6 (= (select |#valid| dll_create_~head~0.base) 1) (= 0 (select .cse10 .cse11)) (= 1 (select |#valid| dll_create_~new_head~0.base)) (<= |dll_create_#in~len| .cse8) (= 0 (select .cse12 .cse11))))))) [2020-07-17 22:33:38,333 INFO L268 CegarLoopResult]: For program point L576-3(lines 576 589) no Hoare annotation was computed. [2020-07-17 22:33:38,333 INFO L268 CegarLoopResult]: For program point dll_createFINAL(lines 574 591) no Hoare annotation was computed. [2020-07-17 22:33:38,334 INFO L271 CegarLoopResult]: At program point L579(line 579) the Hoare annotation is: true [2020-07-17 22:33:38,334 INFO L268 CegarLoopResult]: For program point dll_createEXIT(lines 574 591) no Hoare annotation was computed. [2020-07-17 22:33:38,334 INFO L268 CegarLoopResult]: For program point L584(lines 584 586) no Hoare annotation was computed. [2020-07-17 22:33:38,334 INFO L268 CegarLoopResult]: For program point L584-2(lines 584 586) no Hoare annotation was computed. [2020-07-17 22:33:38,334 INFO L268 CegarLoopResult]: For program point L578(lines 578 580) no Hoare annotation was computed. [2020-07-17 22:33:38,334 INFO L268 CegarLoopResult]: For program point __bswap_32ENTRY(lines 63 67) no Hoare annotation was computed. [2020-07-17 22:33:38,334 INFO L268 CegarLoopResult]: For program point __bswap_32FINAL(lines 63 67) no Hoare annotation was computed. [2020-07-17 22:33:38,334 INFO L268 CegarLoopResult]: For program point __bswap_32EXIT(lines 63 67) no Hoare annotation was computed. [2020-07-17 22:33:38,335 INFO L268 CegarLoopResult]: For program point __bswap_64ENTRY(lines 68 72) no Hoare annotation was computed. [2020-07-17 22:33:38,335 INFO L268 CegarLoopResult]: For program point __bswap_64FINAL(lines 68 72) no Hoare annotation was computed. [2020-07-17 22:33:38,335 INFO L268 CegarLoopResult]: For program point __bswap_64EXIT(lines 68 72) no Hoare annotation was computed. [2020-07-17 22:33:38,335 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:33:38,335 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:33:38,335 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:33:38,335 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:33:38,336 INFO L264 CegarLoopResult]: At program point L609(lines 600 614) the Hoare annotation is: false [2020-07-17 22:33:38,336 INFO L268 CegarLoopResult]: For program point L608(lines 608 610) no Hoare annotation was computed. [2020-07-17 22:33:38,336 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 612) no Hoare annotation was computed. [2020-07-17 22:33:38,336 INFO L264 CegarLoopResult]: At program point L606(line 606) the Hoare annotation is: (let ((.cse6 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse0 (= 0 (select (select |#memory_$Pointer$.offset| .cse6) 4))) (.cse1 (<= main_~len~0 2)) (.cse2 (< |#StackHeapBarrier| |main_~#s~0.base|)) (.cse3 (select (select |#memory_$Pointer$.base| .cse6) 4)) (.cse4 (<= 2 main_~len~0)) (.cse5 (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))) (or (and (<= main_~i~0 0) .cse0 .cse1 (<= 0 main_~i~0) .cse2 (= .cse3 0) .cse4 .cse5) (and (not (= .cse3 |main_~#s~0.base|)) .cse0 .cse1 .cse2 (= 0 (select (select |#memory_$Pointer$.offset| .cse3) 4)) (= 0 (select (select |#memory_$Pointer$.base| .cse3) 4)) .cse4 (<= main_~i~0 1) .cse5 (<= 1 main_~i~0))))) [2020-07-17 22:33:38,336 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 600 614) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 22:33:38,336 INFO L268 CegarLoopResult]: For program point L606-1(lines 605 607) no Hoare annotation was computed. [2020-07-17 22:33:38,337 INFO L264 CegarLoopResult]: At program point L603(line 603) the Hoare annotation is: (and (<= main_~len~0 2) (< |#StackHeapBarrier| |main_~#s~0.base|) (<= 2 main_~len~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select |#valid| |main_~#s~0.base|) 1) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 22:33:38,337 INFO L264 CegarLoopResult]: At program point L605-2(lines 605 607) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse5 (= 0 (select (select |#memory_$Pointer$.offset| .cse0) 4))) (.cse1 (<= main_~len~0 2)) (.cse2 (< |#StackHeapBarrier| |main_~#s~0.base|)) (.cse6 (select (select |#memory_$Pointer$.base| .cse0) 4)) (.cse3 (<= 2 main_~len~0)) (.cse4 (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))) (or (and (= 0 .cse0) .cse1 .cse2 .cse3 (<= (+ main_~i~0 1) 0) .cse4) (and (<= main_~i~0 0) .cse5 .cse1 (<= 0 main_~i~0) .cse2 (= .cse6 0) .cse3 .cse4) (and (not (= .cse6 |main_~#s~0.base|)) .cse5 .cse1 .cse2 (= 0 (select (select |#memory_$Pointer$.offset| .cse6) 4)) (= 0 (select (select |#memory_$Pointer$.base| .cse6) 4)) .cse3 (<= main_~i~0 1) .cse4 (<= 1 main_~i~0))))) [2020-07-17 22:33:38,337 INFO L268 CegarLoopResult]: For program point L603-1(line 603) no Hoare annotation was computed. [2020-07-17 22:33:38,337 INFO L268 CegarLoopResult]: For program point L605-3(lines 605 607) no Hoare annotation was computed. [2020-07-17 22:33:38,337 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 600 614) no Hoare annotation was computed. [2020-07-17 22:33:38,337 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 600 614) no Hoare annotation was computed. [2020-07-17 22:33:38,338 INFO L268 CegarLoopResult]: For program point node_createENTRY(lines 564 573) no Hoare annotation was computed. [2020-07-17 22:33:38,338 INFO L268 CegarLoopResult]: For program point node_createFINAL(lines 564 573) no Hoare annotation was computed. [2020-07-17 22:33:38,338 INFO L268 CegarLoopResult]: For program point L567(line 567) no Hoare annotation was computed. [2020-07-17 22:33:38,338 INFO L268 CegarLoopResult]: For program point L566(lines 566 568) no Hoare annotation was computed. [2020-07-17 22:33:38,338 INFO L268 CegarLoopResult]: For program point node_createEXIT(lines 564 573) no Hoare annotation was computed. [2020-07-17 22:33:38,338 INFO L268 CegarLoopResult]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2020-07-17 22:33:38,338 INFO L268 CegarLoopResult]: For program point L594-2(lines 594 596) no Hoare annotation was computed. [2020-07-17 22:33:38,338 INFO L268 CegarLoopResult]: For program point dll_remove_firstFINAL(lines 592 599) no Hoare annotation was computed. [2020-07-17 22:33:38,339 INFO L268 CegarLoopResult]: For program point dll_remove_firstEXIT(lines 592 599) no Hoare annotation was computed. [2020-07-17 22:33:38,339 INFO L264 CegarLoopResult]: At program point dll_remove_firstENTRY(lines 592 599) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 22:33:38,339 INFO L268 CegarLoopResult]: For program point L594(lines 594 596) no Hoare annotation was computed. [2020-07-17 22:33:38,344 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:33:38,351 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-17 22:33:38,353 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-17 22:33:38,354 WARN L170 areAnnotationChecker]: node_createENTRY has no Hoare annotation [2020-07-17 22:33:38,354 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2020-07-17 22:33:38,354 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:33:38,354 WARN L170 areAnnotationChecker]: L576-3 has no Hoare annotation [2020-07-17 22:33:38,354 WARN L170 areAnnotationChecker]: L576-3 has no Hoare annotation [2020-07-17 22:33:38,354 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-17 22:33:38,355 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-17 22:33:38,355 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:33:38,355 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-17 22:33:38,356 WARN L170 areAnnotationChecker]: L603-1 has no Hoare annotation [2020-07-17 22:33:38,357 WARN L170 areAnnotationChecker]: L566 has no Hoare annotation [2020-07-17 22:33:38,357 WARN L170 areAnnotationChecker]: L566 has no Hoare annotation [2020-07-17 22:33:38,357 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2020-07-17 22:33:38,357 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2020-07-17 22:33:38,357 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:33:38,357 WARN L170 areAnnotationChecker]: L576-3 has no Hoare annotation [2020-07-17 22:33:38,357 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-17 22:33:38,357 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-17 22:33:38,357 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:33:38,357 WARN L170 areAnnotationChecker]: L603-1 has no Hoare annotation [2020-07-17 22:33:38,357 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2020-07-17 22:33:38,358 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2020-07-17 22:33:38,358 WARN L170 areAnnotationChecker]: L566-1 has no Hoare annotation [2020-07-17 22:33:38,358 WARN L170 areAnnotationChecker]: L594-2 has no Hoare annotation [2020-07-17 22:33:38,358 WARN L170 areAnnotationChecker]: dll_createFINAL has no Hoare annotation [2020-07-17 22:33:38,358 WARN L170 areAnnotationChecker]: L578-1 has no Hoare annotation [2020-07-17 22:33:38,358 WARN L170 areAnnotationChecker]: L578-1 has no Hoare annotation [2020-07-17 22:33:38,358 WARN L170 areAnnotationChecker]: L605-3 has no Hoare annotation [2020-07-17 22:33:38,358 WARN L170 areAnnotationChecker]: L605-3 has no Hoare annotation [2020-07-17 22:33:38,360 WARN L170 areAnnotationChecker]: node_createFINAL has no Hoare annotation [2020-07-17 22:33:38,360 WARN L170 areAnnotationChecker]: dll_remove_firstFINAL has no Hoare annotation [2020-07-17 22:33:38,360 WARN L170 areAnnotationChecker]: dll_createEXIT has no Hoare annotation [2020-07-17 22:33:38,360 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2020-07-17 22:33:38,360 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2020-07-17 22:33:38,360 WARN L170 areAnnotationChecker]: L605-3 has no Hoare annotation [2020-07-17 22:33:38,360 WARN L170 areAnnotationChecker]: L606-1 has no Hoare annotation [2020-07-17 22:33:38,363 WARN L170 areAnnotationChecker]: dll_remove_firstEXIT has no Hoare annotation [2020-07-17 22:33:38,363 WARN L170 areAnnotationChecker]: L584-2 has no Hoare annotation [2020-07-17 22:33:38,363 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2020-07-17 22:33:38,363 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2020-07-17 22:33:38,363 WARN L170 areAnnotationChecker]: L606-1 has no Hoare annotation [2020-07-17 22:33:38,363 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-17 22:33:38,364 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:33:38,364 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:33:38,364 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:33:38,364 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:33:38,374 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,376 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,376 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,376 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,376 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,376 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,377 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,377 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,377 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,377 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,377 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,378 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,378 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,378 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,379 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,379 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,379 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,380 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,380 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,380 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,381 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,381 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,381 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,382 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,383 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-17 22:33:38,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-17 22:33:38,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-17 22:33:38,385 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-17 22:33:38,385 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,385 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,385 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,386 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,386 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,386 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,386 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,387 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,387 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,387 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,387 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,388 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,388 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,388 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,388 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,389 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,389 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,389 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,389 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,390 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-17 22:33:38,390 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-17 22:33:38,390 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,391 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,391 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,394 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,394 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,394 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,394 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,395 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,395 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,395 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,396 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,396 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,396 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,396 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,397 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,397 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,397 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,397 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,398 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,398 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,398 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,398 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,399 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,399 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,399 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,400 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,400 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,400 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-17 22:33:38,400 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-17 22:33:38,401 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,401 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,401 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-17 22:33:38,401 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-17 22:33:38,402 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,402 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,402 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,402 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,402 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,403 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,403 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,403 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,404 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,404 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,404 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,404 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,404 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,405 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,405 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,405 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,406 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,406 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,406 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,406 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-17 22:33:38,407 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-17 22:33:38,407 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,407 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,407 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,410 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,410 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,411 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,411 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,411 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,411 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,412 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,412 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,412 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,413 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,413 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,413 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,413 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,414 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,414 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,414 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,414 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,415 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,415 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,415 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-17 22:33:38,415 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,416 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,416 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,416 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-17 22:33:38,416 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-17 22:33:38,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,420 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,420 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,421 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,421 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,421 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,421 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,422 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,422 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,422 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,422 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,423 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,423 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,423 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,424 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,424 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,424 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,424 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,425 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,425 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,425 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,425 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-17 22:33:38,425 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-17 22:33:38,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-17 22:33:38,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:33:38 BoogieIcfgContainer [2020-07-17 22:33:38,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:33:38,434 INFO L168 Benchmark]: Toolchain (without parser) took 60980.47 ms. Allocated memory was 135.8 MB in the beginning and 576.7 MB in the end (delta: 440.9 MB). Free memory was 99.6 MB in the beginning and 277.2 MB in the end (delta: -177.7 MB). Peak memory consumption was 263.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:33:38,434 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 135.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:33:38,435 INFO L168 Benchmark]: CACSL2BoogieTranslator took 719.69 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 99.2 MB in the beginning and 164.3 MB in the end (delta: -65.2 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:33:38,436 INFO L168 Benchmark]: Boogie Preprocessor took 101.37 ms. Allocated memory is still 199.8 MB. Free memory was 164.3 MB in the beginning and 160.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:33:38,436 INFO L168 Benchmark]: RCFGBuilder took 841.49 ms. Allocated memory is still 199.8 MB. Free memory was 160.9 MB in the beginning and 103.0 MB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:33:38,437 INFO L168 Benchmark]: TraceAbstraction took 59310.96 ms. Allocated memory was 199.8 MB in the beginning and 576.7 MB in the end (delta: 377.0 MB). Free memory was 102.3 MB in the beginning and 277.2 MB in the end (delta: -175.0 MB). Peak memory consumption was 202.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:33:38,439 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 135.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 719.69 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 99.2 MB in the beginning and 164.3 MB in the end (delta: -65.2 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 101.37 ms. Allocated memory is still 199.8 MB. Free memory was 164.3 MB in the beginning and 160.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 841.49 ms. Allocated memory is still 199.8 MB. Free memory was 160.9 MB in the beginning and 103.0 MB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 59310.96 ms. Allocated memory was 199.8 MB in the beginning and 576.7 MB in the end (delta: 377.0 MB). Free memory was 102.3 MB in the beginning and 277.2 MB in the end (delta: -175.0 MB). Peak memory consumption was 202.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 612]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 576]: Loop Invariant [2020-07-17 22:33:38,453 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,454 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,454 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,454 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,454 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,454 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,455 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,455 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,455 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,455 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,456 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,456 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,456 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,456 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,456 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,457 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,457 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,457 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,458 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,458 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,458 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,458 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,459 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,459 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,459 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-17 22:33:38,459 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-17 22:33:38,459 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,460 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,460 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-17 22:33:38,460 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-17 22:33:38,460 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,460 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,460 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,463 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,463 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,463 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,463 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,464 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,464 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,464 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-17 22:33:38,464 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-17 22:33:38,464 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,465 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,465 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,466 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,466 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,466 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,466 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,466 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,467 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,467 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,467 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,467 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,468 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,468 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,468 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,468 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,469 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,469 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,469 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,469 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,470 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,470 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,470 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,471 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,471 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,471 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,471 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,472 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-17 22:33:38,472 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-17 22:33:38,472 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,472 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,472 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-17 22:33:38,472 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-17 22:33:38,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,474 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,474 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,474 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,474 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,474 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,475 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,475 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,475 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,475 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,475 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,476 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,476 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,476 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,476 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-17 22:33:38,476 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-17 22:33:38,477 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,477 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,477 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((len + 2 <= \old(len) && 3 <= \old(len)) || (((((((\valid == \old(\valid) && len == \old(len)) && 0 == head) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 == head) && \old(unknown-#length-unknown) == unknown-#length-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || ((((((((((0 == \old(\valid)[#memory_$Pointer$[new_head][new_head + 4]] && #memory_$Pointer$[#memory_$Pointer$[new_head][new_head + 4]][4] == 0) && 0 == #memory_$Pointer$[#memory_$Pointer$[head][4]][4]) && 0 == #memory_$Pointer$[#memory_$Pointer$[head][4]][4]) && 0 == new_head) && 0 == #memory_$Pointer$[head][4]) && 0 == head) && len + 2 <= \old(len)) && 0 == #memory_$Pointer$[new_head][new_head + 4]) && 0 == #memory_$Pointer$[#memory_$Pointer$[new_head][new_head + 4]][4]) && 0 == \old(\valid)[#memory_$Pointer$[head][4]])) || (((((((((((((((((0 == \old(\valid)[head] && #memory_$Pointer$[head][4] == 0) && 0 == \old(\valid)[new_head]) && 0 == #memory_$Pointer$[head][4]) && 0 == head) && 0 == #memory_$Pointer$[head][8]) && len + 1 <= \old(len)) && #memory_$Pointer$[new_head][new_head + 4] == 0) && 0 == #memory_$Pointer$[head][8]) && 0 == new_head) && head < unknown-#StackHeapBarrier-unknown) && new_head < unknown-#StackHeapBarrier-unknown) && 0 == #memory_$Pointer$[new_head][new_head + 4]) && \valid[head] == 1) && 0 == #memory_$Pointer$[new_head][new_head + 8]) && 1 == \valid[new_head]) && \old(len) <= len + 1) && 0 == #memory_$Pointer$[new_head][new_head + 8]) - InvariantResult [Line: 605]: Loop Invariant [2020-07-17 22:33:38,478 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,478 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,478 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,479 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,479 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,479 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,479 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,479 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,480 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,480 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,480 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,480 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,481 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,481 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,481 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,481 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,482 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,482 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,482 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,482 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-17 22:33:38,482 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,483 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,483 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,483 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-17 22:33:38,483 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,483 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,483 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,484 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,484 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,484 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,484 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,484 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-17 22:33:38,485 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,485 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,485 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,485 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,485 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,485 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,486 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,486 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,487 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,487 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,487 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,487 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,487 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,488 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,488 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,488 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,488 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,488 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,489 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,489 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,489 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,489 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,490 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,490 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-17 22:33:38,490 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-17 22:33:38,490 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,490 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-17 22:33:38,491 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,491 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,491 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,491 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-17 22:33:38,491 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,491 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,492 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,492 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,492 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,492 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,492 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,492 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-17 22:33:38,493 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,493 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,493 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,493 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,493 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,494 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-17 22:33:38,494 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((0 == #memory_$Pointer$[s][s] && len <= 2) && unknown-#StackHeapBarrier-unknown < s) && 2 <= len) && i + 1 <= 0) && #memory_$Pointer$[s][s] == 0) || (((((((i <= 0 && 0 == #memory_$Pointer$[#memory_$Pointer$[s][s]][4]) && len <= 2) && 0 <= i) && unknown-#StackHeapBarrier-unknown < s) && #memory_$Pointer$[#memory_$Pointer$[s][s]][4] == 0) && 2 <= len) && #memory_$Pointer$[s][s] == 0)) || (((((((((!(#memory_$Pointer$[#memory_$Pointer$[s][s]][4] == s) && 0 == #memory_$Pointer$[#memory_$Pointer$[s][s]][4]) && len <= 2) && unknown-#StackHeapBarrier-unknown < s) && 0 == #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][4]][4]) && 0 == #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][4]][4]) && 2 <= len) && i <= 1) && #memory_$Pointer$[s][s] == 0) && 1 <= i) - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 58.1s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 21.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 227 SDtfs, 212 SDslu, 1072 SDs, 0 SdLazy, 2071 SolverSat, 146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 173 SyntacticMatches, 2 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 40 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 23 PreInvPairs, 32 NumberOfFragments, 593 HoareAnnotationTreeSize, 23 FomulaSimplifications, 44 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 1074 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 30.6s InterpolantComputationTime, 430 NumberOfCodeBlocks, 430 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 417 ConstructedInterpolants, 3 QuantifiedInterpolants, 197195 SizeOfPredicates, 33 NumberOfNonLiveVariables, 761 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 89/150 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...