./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/heap-manipulation/dll_of_dll_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/dll_of_dll_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30912d79507d112674315a135c457bdb2fa6a53f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/dll_of_dll_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30912d79507d112674315a135c457bdb2fa6a53f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: enhanced interpolant automaton in iteration 36 broken: counterexample of length 142 not accepted (original is ok) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 04:46:42,083 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 04:46:42,084 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 04:46:42,094 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 04:46:42,094 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 04:46:42,095 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 04:46:42,096 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 04:46:42,097 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 04:46:42,099 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 04:46:42,100 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 04:46:42,101 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 04:46:42,101 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 04:46:42,102 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 04:46:42,103 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 04:46:42,103 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 04:46:42,104 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 04:46:42,104 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 04:46:42,106 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 04:46:42,108 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 04:46:42,109 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 04:46:42,110 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 04:46:42,111 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 04:46:42,113 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 04:46:42,113 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 04:46:42,113 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 04:46:42,114 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 04:46:42,115 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 04:46:42,115 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 04:46:42,116 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 04:46:42,117 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 04:46:42,117 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 04:46:42,117 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 04:46:42,117 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 04:46:42,118 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 04:46:42,119 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 04:46:42,120 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 04:46:42,120 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-10-27 04:46:42,131 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 04:46:42,131 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 04:46:42,132 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 04:46:42,132 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 04:46:42,132 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 04:46:42,132 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 04:46:42,132 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 04:46:42,132 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 04:46:42,133 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 04:46:42,133 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 04:46:42,133 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 04:46:42,133 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 04:46:42,134 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 04:46:42,134 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 04:46:42,134 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 04:46:42,135 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 04:46:42,135 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 04:46:42,136 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 04:46:42,136 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 04:46:42,136 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-27 04:46:42,136 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-27 04:46:42,136 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-27 04:46:42,136 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 04:46:42,136 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 04:46:42,137 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 04:46:42,137 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 04:46:42,137 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 04:46:42,137 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 04:46:42,137 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:46:42,137 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 04:46:42,137 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 04:46:42,138 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 04:46:42,138 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 04:46:42,138 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 04:46:42,138 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 30912d79507d112674315a135c457bdb2fa6a53f [2018-10-27 04:46:42,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 04:46:42,187 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 04:46:42,190 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 04:46:42,192 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 04:46:42,192 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 04:46:42,193 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/../../sv-benchmarks/c/heap-manipulation/dll_of_dll_true-unreach-call_true-valid-memsafety.i [2018-10-27 04:46:42,242 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/data/e1f573986/c080856b9c0745af9861f266fd569d0d/FLAGb2c6252a4 [2018-10-27 04:46:42,686 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 04:46:42,687 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/sv-benchmarks/c/heap-manipulation/dll_of_dll_true-unreach-call_true-valid-memsafety.i [2018-10-27 04:46:42,698 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/data/e1f573986/c080856b9c0745af9861f266fd569d0d/FLAGb2c6252a4 [2018-10-27 04:46:42,709 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/data/e1f573986/c080856b9c0745af9861f266fd569d0d [2018-10-27 04:46:42,712 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 04:46:42,713 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 04:46:42,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 04:46:42,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 04:46:42,717 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 04:46:42,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:46:42" (1/1) ... [2018-10-27 04:46:42,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b6fa80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:42, skipping insertion in model container [2018-10-27 04:46:42,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:46:42" (1/1) ... [2018-10-27 04:46:42,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 04:46:42,763 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 04:46:43,017 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:46:43,024 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 04:46:43,067 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:46:43,122 INFO L193 MainTranslator]: Completed translation [2018-10-27 04:46:43,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:43 WrapperNode [2018-10-27 04:46:43,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 04:46:43,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 04:46:43,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 04:46:43,123 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 04:46:43,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:43" (1/1) ... [2018-10-27 04:46:43,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:43" (1/1) ... [2018-10-27 04:46:43,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 04:46:43,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 04:46:43,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 04:46:43,278 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 04:46:43,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:43" (1/1) ... [2018-10-27 04:46:43,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:43" (1/1) ... [2018-10-27 04:46:43,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:43" (1/1) ... [2018-10-27 04:46:43,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:43" (1/1) ... [2018-10-27 04:46:43,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:43" (1/1) ... [2018-10-27 04:46:43,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:43" (1/1) ... [2018-10-27 04:46:43,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:43" (1/1) ... [2018-10-27 04:46:43,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 04:46:43,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 04:46:43,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 04:46:43,359 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 04:46:43,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:46:43,422 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_init [2018-10-27 04:46:43,422 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_init [2018-10-27 04:46:43,422 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy_nested_lists [2018-10-27 04:46:43,422 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy_nested_lists [2018-10-27 04:46:43,423 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy_master [2018-10-27 04:46:43,423 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy_master [2018-10-27 04:46:43,423 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-10-27 04:46:43,423 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-10-27 04:46:43,423 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2018-10-27 04:46:43,423 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2018-10-27 04:46:43,423 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_slave [2018-10-27 04:46:43,423 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_slave [2018-10-27 04:46:43,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 04:46:43,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 04:46:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_or_die_slave [2018-10-27 04:46:43,424 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_or_die_slave [2018-10-27 04:46:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_master [2018-10-27 04:46:43,424 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_master [2018-10-27 04:46:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2018-10-27 04:46:43,424 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2018-10-27 04:46:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 04:46:43,424 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 04:46:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-10-27 04:46:43,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-10-27 04:46:43,425 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_full [2018-10-27 04:46:43,425 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_full [2018-10-27 04:46:43,425 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy_slave [2018-10-27 04:46:43,425 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy_slave [2018-10-27 04:46:43,425 INFO L130 BoogieDeclarations]: Found specification of procedure dll_reinit_nested_lists [2018-10-27 04:46:43,425 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_reinit_nested_lists [2018-10-27 04:46:43,425 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_dangling [2018-10-27 04:46:43,425 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_dangling [2018-10-27 04:46:43,425 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2018-10-27 04:46:43,426 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2018-10-27 04:46:43,426 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_or_die_master [2018-10-27 04:46:43,426 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_or_die_master [2018-10-27 04:46:43,426 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2018-10-27 04:46:43,427 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2018-10-27 04:46:43,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 04:46:43,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 04:46:45,554 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 04:46:45,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:46:45 BoogieIcfgContainer [2018-10-27 04:46:45,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 04:46:45,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 04:46:45,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 04:46:45,558 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 04:46:45,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 04:46:42" (1/3) ... [2018-10-27 04:46:45,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58009638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:46:45, skipping insertion in model container [2018-10-27 04:46:45,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:43" (2/3) ... [2018-10-27 04:46:45,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58009638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:46:45, skipping insertion in model container [2018-10-27 04:46:45,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:46:45" (3/3) ... [2018-10-27 04:46:45,562 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_of_dll_true-unreach-call_true-valid-memsafety.i [2018-10-27 04:46:45,570 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 04:46:45,577 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 97 error locations. [2018-10-27 04:46:45,592 INFO L257 AbstractCegarLoop]: Starting to check reachability of 97 error locations. [2018-10-27 04:46:45,615 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 04:46:45,615 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-27 04:46:45,615 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 04:46:45,615 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 04:46:45,616 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 04:46:45,616 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 04:46:45,616 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 04:46:45,616 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 04:46:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states. [2018-10-27 04:46:45,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-27 04:46:45,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:45,654 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:45,658 INFO L424 AbstractCegarLoop]: === Iteration 1 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:45,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:45,666 INFO L82 PathProgramCache]: Analyzing trace with hash -55455711, now seen corresponding path program 1 times [2018-10-27 04:46:45,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:45,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:45,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:45,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:45,726 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:45,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:45,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:45,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 04:46:45,876 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:45,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:46:45,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:46:45,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:46:45,898 INFO L87 Difference]: Start difference. First operand 373 states. Second operand 3 states. [2018-10-27 04:46:46,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:46,410 INFO L93 Difference]: Finished difference Result 370 states and 400 transitions. [2018-10-27 04:46:46,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:46:46,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-10-27 04:46:46,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:46,423 INFO L225 Difference]: With dead ends: 370 [2018-10-27 04:46:46,423 INFO L226 Difference]: Without dead ends: 352 [2018-10-27 04:46:46,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:46:46,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-10-27 04:46:46,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2018-10-27 04:46:46,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-10-27 04:46:46,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 369 transitions. [2018-10-27 04:46:46,476 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 369 transitions. Word has length 9 [2018-10-27 04:46:46,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:46,477 INFO L481 AbstractCegarLoop]: Abstraction has 352 states and 369 transitions. [2018-10-27 04:46:46,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:46:46,477 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 369 transitions. [2018-10-27 04:46:46,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-27 04:46:46,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:46,478 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:46,481 INFO L424 AbstractCegarLoop]: === Iteration 2 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:46,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:46,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1719126921, now seen corresponding path program 1 times [2018-10-27 04:46:46,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:46,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:46,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:46,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:46,483 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:46,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:46,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:46,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 04:46:46,556 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:46,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:46:46,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:46:46,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:46:46,558 INFO L87 Difference]: Start difference. First operand 352 states and 369 transitions. Second operand 3 states. [2018-10-27 04:46:46,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:46,792 INFO L93 Difference]: Finished difference Result 351 states and 368 transitions. [2018-10-27 04:46:46,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:46:46,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-27 04:46:46,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:46,796 INFO L225 Difference]: With dead ends: 351 [2018-10-27 04:46:46,797 INFO L226 Difference]: Without dead ends: 351 [2018-10-27 04:46:46,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:46:46,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-27 04:46:46,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2018-10-27 04:46:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-10-27 04:46:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 368 transitions. [2018-10-27 04:46:46,815 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 368 transitions. Word has length 10 [2018-10-27 04:46:46,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:46,815 INFO L481 AbstractCegarLoop]: Abstraction has 351 states and 368 transitions. [2018-10-27 04:46:46,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:46:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 368 transitions. [2018-10-27 04:46:46,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 04:46:46,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:46,816 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:46,819 INFO L424 AbstractCegarLoop]: === Iteration 3 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:46,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:46,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1926432963, now seen corresponding path program 1 times [2018-10-27 04:46:46,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:46,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:46,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:46,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:46,826 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:46,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:46,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:46,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:46:46,900 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:46,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:46:46,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:46:46,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:46:46,900 INFO L87 Difference]: Start difference. First operand 351 states and 368 transitions. Second operand 4 states. [2018-10-27 04:46:47,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:47,293 INFO L93 Difference]: Finished difference Result 348 states and 365 transitions. [2018-10-27 04:46:47,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:46:47,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-10-27 04:46:47,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:47,296 INFO L225 Difference]: With dead ends: 348 [2018-10-27 04:46:47,296 INFO L226 Difference]: Without dead ends: 348 [2018-10-27 04:46:47,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:46:47,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-10-27 04:46:47,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2018-10-27 04:46:47,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-27 04:46:47,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 365 transitions. [2018-10-27 04:46:47,313 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 365 transitions. Word has length 20 [2018-10-27 04:46:47,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:47,313 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 365 transitions. [2018-10-27 04:46:47,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:46:47,313 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 365 transitions. [2018-10-27 04:46:47,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 04:46:47,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:47,314 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:47,317 INFO L424 AbstractCegarLoop]: === Iteration 4 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:47,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:47,317 INFO L82 PathProgramCache]: Analyzing trace with hash -69437544, now seen corresponding path program 1 times [2018-10-27 04:46:47,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:47,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:47,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:47,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:47,319 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:47,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:47,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:46:47,408 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:47,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:46:47,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:46:47,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:46:47,409 INFO L87 Difference]: Start difference. First operand 348 states and 365 transitions. Second operand 4 states. [2018-10-27 04:46:47,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:47,626 INFO L93 Difference]: Finished difference Result 346 states and 363 transitions. [2018-10-27 04:46:47,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:46:47,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-10-27 04:46:47,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:47,631 INFO L225 Difference]: With dead ends: 346 [2018-10-27 04:46:47,631 INFO L226 Difference]: Without dead ends: 346 [2018-10-27 04:46:47,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:46:47,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-10-27 04:46:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2018-10-27 04:46:47,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-27 04:46:47,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 363 transitions. [2018-10-27 04:46:47,644 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 363 transitions. Word has length 20 [2018-10-27 04:46:47,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:47,644 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 363 transitions. [2018-10-27 04:46:47,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:46:47,644 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 363 transitions. [2018-10-27 04:46:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 04:46:47,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:47,645 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:47,648 INFO L424 AbstractCegarLoop]: === Iteration 5 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:47,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:47,649 INFO L82 PathProgramCache]: Analyzing trace with hash -410119659, now seen corresponding path program 1 times [2018-10-27 04:46:47,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:47,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:47,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:47,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:47,650 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:47,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:47,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:46:47,753 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:47,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:46:47,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:46:47,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:46:47,754 INFO L87 Difference]: Start difference. First operand 346 states and 363 transitions. Second operand 4 states. [2018-10-27 04:46:47,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:47,913 INFO L93 Difference]: Finished difference Result 345 states and 362 transitions. [2018-10-27 04:46:47,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:46:47,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-10-27 04:46:47,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:47,915 INFO L225 Difference]: With dead ends: 345 [2018-10-27 04:46:47,915 INFO L226 Difference]: Without dead ends: 345 [2018-10-27 04:46:47,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:46:47,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-10-27 04:46:47,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2018-10-27 04:46:47,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-10-27 04:46:47,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 362 transitions. [2018-10-27 04:46:47,925 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 362 transitions. Word has length 21 [2018-10-27 04:46:47,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:47,925 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 362 transitions. [2018-10-27 04:46:47,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:46:47,925 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 362 transitions. [2018-10-27 04:46:47,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 04:46:47,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:47,928 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:47,930 INFO L424 AbstractCegarLoop]: === Iteration 6 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:47,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:47,930 INFO L82 PathProgramCache]: Analyzing trace with hash 2142403863, now seen corresponding path program 1 times [2018-10-27 04:46:47,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:47,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:47,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:47,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:47,932 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:48,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:48,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:46:48,036 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:48,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:46:48,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:46:48,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:46:48,036 INFO L87 Difference]: Start difference. First operand 345 states and 362 transitions. Second operand 5 states. [2018-10-27 04:46:48,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:48,203 INFO L93 Difference]: Finished difference Result 377 states and 402 transitions. [2018-10-27 04:46:48,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:46:48,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-10-27 04:46:48,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:48,209 INFO L225 Difference]: With dead ends: 377 [2018-10-27 04:46:48,210 INFO L226 Difference]: Without dead ends: 377 [2018-10-27 04:46:48,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:46:48,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-10-27 04:46:48,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 368. [2018-10-27 04:46:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-27 04:46:48,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 395 transitions. [2018-10-27 04:46:48,221 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 395 transitions. Word has length 21 [2018-10-27 04:46:48,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:48,221 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 395 transitions. [2018-10-27 04:46:48,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:46:48,222 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 395 transitions. [2018-10-27 04:46:48,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 04:46:48,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:48,223 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:48,225 INFO L424 AbstractCegarLoop]: === Iteration 7 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:48,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:48,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1012019223, now seen corresponding path program 1 times [2018-10-27 04:46:48,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:48,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:48,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:48,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:48,227 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:48,555 WARN L179 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-10-27 04:46:48,715 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 04:46:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:48,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:48,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:46:48,716 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:48,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:46:48,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:46:48,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:46:48,717 INFO L87 Difference]: Start difference. First operand 368 states and 395 transitions. Second operand 4 states. [2018-10-27 04:46:49,025 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-27 04:46:49,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:49,814 INFO L93 Difference]: Finished difference Result 367 states and 394 transitions. [2018-10-27 04:46:49,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:46:49,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-10-27 04:46:49,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:49,817 INFO L225 Difference]: With dead ends: 367 [2018-10-27 04:46:49,817 INFO L226 Difference]: Without dead ends: 367 [2018-10-27 04:46:49,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:46:49,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-27 04:46:49,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2018-10-27 04:46:49,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-27 04:46:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 394 transitions. [2018-10-27 04:46:49,830 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 394 transitions. Word has length 23 [2018-10-27 04:46:49,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:49,831 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 394 transitions. [2018-10-27 04:46:49,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:46:49,831 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 394 transitions. [2018-10-27 04:46:49,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 04:46:49,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:49,832 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:49,838 INFO L424 AbstractCegarLoop]: === Iteration 8 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:49,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:49,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1887884825, now seen corresponding path program 1 times [2018-10-27 04:46:49,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:49,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:49,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:49,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:49,840 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:50,207 WARN L179 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-10-27 04:46:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:50,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:50,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:46:50,421 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:50,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:46:50,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:46:50,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:46:50,421 INFO L87 Difference]: Start difference. First operand 367 states and 394 transitions. Second operand 5 states. [2018-10-27 04:46:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:50,727 INFO L93 Difference]: Finished difference Result 366 states and 393 transitions. [2018-10-27 04:46:50,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:46:50,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-10-27 04:46:50,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:50,729 INFO L225 Difference]: With dead ends: 366 [2018-10-27 04:46:50,729 INFO L226 Difference]: Without dead ends: 366 [2018-10-27 04:46:50,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:46:50,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-10-27 04:46:50,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2018-10-27 04:46:50,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-27 04:46:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 393 transitions. [2018-10-27 04:46:50,737 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 393 transitions. Word has length 25 [2018-10-27 04:46:50,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:50,738 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 393 transitions. [2018-10-27 04:46:50,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:46:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 393 transitions. [2018-10-27 04:46:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-27 04:46:50,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:50,740 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:50,741 INFO L424 AbstractCegarLoop]: === Iteration 9 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:50,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:50,741 INFO L82 PathProgramCache]: Analyzing trace with hash -2017844820, now seen corresponding path program 1 times [2018-10-27 04:46:50,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:50,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:50,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:50,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:50,748 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:51,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:51,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:51,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-27 04:46:51,076 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:51,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:46:51,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:46:51,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:46:51,077 INFO L87 Difference]: Start difference. First operand 366 states and 393 transitions. Second operand 11 states. [2018-10-27 04:46:52,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:52,741 INFO L93 Difference]: Finished difference Result 428 states and 464 transitions. [2018-10-27 04:46:52,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 04:46:52,742 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-10-27 04:46:52,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:52,743 INFO L225 Difference]: With dead ends: 428 [2018-10-27 04:46:52,743 INFO L226 Difference]: Without dead ends: 428 [2018-10-27 04:46:52,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2018-10-27 04:46:52,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-10-27 04:46:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 373. [2018-10-27 04:46:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-27 04:46:52,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 402 transitions. [2018-10-27 04:46:52,754 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 402 transitions. Word has length 29 [2018-10-27 04:46:52,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:52,754 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 402 transitions. [2018-10-27 04:46:52,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:46:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 402 transitions. [2018-10-27 04:46:52,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-27 04:46:52,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:52,755 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:52,755 INFO L424 AbstractCegarLoop]: === Iteration 10 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:52,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:52,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1871320087, now seen corresponding path program 1 times [2018-10-27 04:46:52,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:52,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:52,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:52,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:52,763 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:52,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:52,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-27 04:46:52,915 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:52,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:46:52,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:46:52,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:46:52,916 INFO L87 Difference]: Start difference. First operand 373 states and 402 transitions. Second operand 11 states. [2018-10-27 04:46:56,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:56,660 INFO L93 Difference]: Finished difference Result 430 states and 470 transitions. [2018-10-27 04:46:56,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 04:46:56,661 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-10-27 04:46:56,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:56,663 INFO L225 Difference]: With dead ends: 430 [2018-10-27 04:46:56,663 INFO L226 Difference]: Without dead ends: 430 [2018-10-27 04:46:56,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:46:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-27 04:46:56,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 381. [2018-10-27 04:46:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-27 04:46:56,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 413 transitions. [2018-10-27 04:46:56,673 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 413 transitions. Word has length 30 [2018-10-27 04:46:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:56,673 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 413 transitions. [2018-10-27 04:46:56,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:46:56,674 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 413 transitions. [2018-10-27 04:46:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 04:46:56,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:56,676 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:56,677 INFO L424 AbstractCegarLoop]: === Iteration 11 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:56,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:56,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2118619378, now seen corresponding path program 1 times [2018-10-27 04:46:56,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:56,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:56,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:56,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:56,679 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:56,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:56,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 04:46:56,912 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:56,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:46:56,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:46:56,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:46:56,913 INFO L87 Difference]: Start difference. First operand 381 states and 413 transitions. Second operand 8 states. [2018-10-27 04:46:57,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:57,509 INFO L93 Difference]: Finished difference Result 380 states and 412 transitions. [2018-10-27 04:46:57,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:46:57,510 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-10-27 04:46:57,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:57,511 INFO L225 Difference]: With dead ends: 380 [2018-10-27 04:46:57,511 INFO L226 Difference]: Without dead ends: 380 [2018-10-27 04:46:57,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:46:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-27 04:46:57,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-10-27 04:46:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-27 04:46:57,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 412 transitions. [2018-10-27 04:46:57,518 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 412 transitions. Word has length 31 [2018-10-27 04:46:57,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:57,518 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 412 transitions. [2018-10-27 04:46:57,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:46:57,518 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 412 transitions. [2018-10-27 04:46:57,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 04:46:57,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:57,519 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:57,520 INFO L424 AbstractCegarLoop]: === Iteration 12 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:57,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:57,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1252691207, now seen corresponding path program 1 times [2018-10-27 04:46:57,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:57,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:57,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:57,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:57,521 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:57,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:57,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:57,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 04:46:57,821 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:57,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:46:57,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:46:57,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:46:57,821 INFO L87 Difference]: Start difference. First operand 380 states and 412 transitions. Second operand 8 states. [2018-10-27 04:46:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:58,284 INFO L93 Difference]: Finished difference Result 380 states and 413 transitions. [2018-10-27 04:46:58,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:46:58,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-10-27 04:46:58,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:58,285 INFO L225 Difference]: With dead ends: 380 [2018-10-27 04:46:58,286 INFO L226 Difference]: Without dead ends: 380 [2018-10-27 04:46:58,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:46:58,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-27 04:46:58,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 379. [2018-10-27 04:46:58,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-27 04:46:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 411 transitions. [2018-10-27 04:46:58,295 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 411 transitions. Word has length 32 [2018-10-27 04:46:58,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:58,295 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 411 transitions. [2018-10-27 04:46:58,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:46:58,295 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 411 transitions. [2018-10-27 04:46:58,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-27 04:46:58,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:58,296 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:58,297 INFO L424 AbstractCegarLoop]: === Iteration 13 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:58,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:58,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1245404677, now seen corresponding path program 1 times [2018-10-27 04:46:58,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:58,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:58,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:58,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:58,307 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:59,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:59,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:59,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-10-27 04:46:59,067 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:59,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 04:46:59,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 04:46:59,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:46:59,068 INFO L87 Difference]: Start difference. First operand 379 states and 411 transitions. Second operand 17 states. [2018-10-27 04:46:59,767 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-10-27 04:47:00,519 WARN L179 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-10-27 04:47:01,280 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-10-27 04:47:04,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:04,297 INFO L93 Difference]: Finished difference Result 441 states and 482 transitions. [2018-10-27 04:47:04,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 04:47:04,298 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-10-27 04:47:04,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:04,301 INFO L225 Difference]: With dead ends: 441 [2018-10-27 04:47:04,301 INFO L226 Difference]: Without dead ends: 441 [2018-10-27 04:47:04,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2018-10-27 04:47:04,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-10-27 04:47:04,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 390. [2018-10-27 04:47:04,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-10-27 04:47:04,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 428 transitions. [2018-10-27 04:47:04,311 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 428 transitions. Word has length 34 [2018-10-27 04:47:04,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:04,311 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 428 transitions. [2018-10-27 04:47:04,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 04:47:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 428 transitions. [2018-10-27 04:47:04,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-27 04:47:04,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:04,312 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:04,313 INFO L424 AbstractCegarLoop]: === Iteration 14 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:04,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:04,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2096607431, now seen corresponding path program 1 times [2018-10-27 04:47:04,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:04,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:04,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:04,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:04,322 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:04,626 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 04:47:04,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 04:47:04,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:04,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:47:04,629 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:04,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:47:04,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:47:04,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:47:04,629 INFO L87 Difference]: Start difference. First operand 390 states and 428 transitions. Second operand 4 states. [2018-10-27 04:47:05,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:05,021 INFO L93 Difference]: Finished difference Result 389 states and 427 transitions. [2018-10-27 04:47:05,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:47:05,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-10-27 04:47:05,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:05,023 INFO L225 Difference]: With dead ends: 389 [2018-10-27 04:47:05,023 INFO L226 Difference]: Without dead ends: 389 [2018-10-27 04:47:05,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:47:05,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-10-27 04:47:05,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2018-10-27 04:47:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-10-27 04:47:05,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 427 transitions. [2018-10-27 04:47:05,033 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 427 transitions. Word has length 49 [2018-10-27 04:47:05,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:05,033 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 427 transitions. [2018-10-27 04:47:05,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:47:05,033 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 427 transitions. [2018-10-27 04:47:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-27 04:47:05,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:05,034 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:05,035 INFO L424 AbstractCegarLoop]: === Iteration 15 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:05,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:05,035 INFO L82 PathProgramCache]: Analyzing trace with hash 500093225, now seen corresponding path program 1 times [2018-10-27 04:47:05,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:05,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:05,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:05,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:05,036 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:05,361 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-10-27 04:47:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 04:47:05,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:05,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:47:05,372 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:05,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:47:05,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:47:05,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:47:05,373 INFO L87 Difference]: Start difference. First operand 389 states and 427 transitions. Second operand 4 states. [2018-10-27 04:47:05,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:05,523 INFO L93 Difference]: Finished difference Result 388 states and 426 transitions. [2018-10-27 04:47:05,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:47:05,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-10-27 04:47:05,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:05,525 INFO L225 Difference]: With dead ends: 388 [2018-10-27 04:47:05,525 INFO L226 Difference]: Without dead ends: 388 [2018-10-27 04:47:05,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:47:05,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-10-27 04:47:05,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2018-10-27 04:47:05,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-10-27 04:47:05,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 426 transitions. [2018-10-27 04:47:05,534 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 426 transitions. Word has length 51 [2018-10-27 04:47:05,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:05,534 INFO L481 AbstractCegarLoop]: Abstraction has 388 states and 426 transitions. [2018-10-27 04:47:05,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:47:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 426 transitions. [2018-10-27 04:47:05,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-27 04:47:05,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:05,535 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:05,536 INFO L424 AbstractCegarLoop]: === Iteration 16 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:05,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:05,536 INFO L82 PathProgramCache]: Analyzing trace with hash 185734759, now seen corresponding path program 1 times [2018-10-27 04:47:05,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:05,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:05,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:05,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:05,537 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:05,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 04:47:05,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:05,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-27 04:47:05,800 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:05,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:47:05,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:47:05,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:47:05,801 INFO L87 Difference]: Start difference. First operand 388 states and 426 transitions. Second operand 11 states. [2018-10-27 04:47:06,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:06,925 INFO L93 Difference]: Finished difference Result 430 states and 473 transitions. [2018-10-27 04:47:06,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 04:47:06,926 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-10-27 04:47:06,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:06,927 INFO L225 Difference]: With dead ends: 430 [2018-10-27 04:47:06,927 INFO L226 Difference]: Without dead ends: 430 [2018-10-27 04:47:06,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-10-27 04:47:06,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-27 04:47:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 387. [2018-10-27 04:47:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-27 04:47:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 425 transitions. [2018-10-27 04:47:06,934 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 425 transitions. Word has length 55 [2018-10-27 04:47:06,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:06,934 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 425 transitions. [2018-10-27 04:47:06,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:47:06,934 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 425 transitions. [2018-10-27 04:47:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-27 04:47:06,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:06,943 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:06,943 INFO L424 AbstractCegarLoop]: === Iteration 17 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:06,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:06,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1462810884, now seen corresponding path program 1 times [2018-10-27 04:47:06,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:06,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:06,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:06,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:06,944 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:07,138 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 04:47:07,290 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 04:47:07,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 04:47:07,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:07,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-27 04:47:07,466 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:07,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:47:07,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:47:07,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:47:07,466 INFO L87 Difference]: Start difference. First operand 387 states and 425 transitions. Second operand 11 states. [2018-10-27 04:47:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:08,753 INFO L93 Difference]: Finished difference Result 447 states and 492 transitions. [2018-10-27 04:47:08,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 04:47:08,754 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-10-27 04:47:08,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:08,755 INFO L225 Difference]: With dead ends: 447 [2018-10-27 04:47:08,755 INFO L226 Difference]: Without dead ends: 447 [2018-10-27 04:47:08,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:47:08,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-10-27 04:47:08,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 403. [2018-10-27 04:47:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-27 04:47:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 449 transitions. [2018-10-27 04:47:08,762 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 449 transitions. Word has length 56 [2018-10-27 04:47:08,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:08,762 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 449 transitions. [2018-10-27 04:47:08,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:47:08,770 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 449 transitions. [2018-10-27 04:47:08,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-27 04:47:08,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:08,771 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:08,772 INFO L424 AbstractCegarLoop]: === Iteration 18 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:08,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:08,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1897502199, now seen corresponding path program 1 times [2018-10-27 04:47:08,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:08,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:08,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:08,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:08,773 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:08,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 04:47:08,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:08,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 04:47:08,966 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:08,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:47:08,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:47:08,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:47:08,967 INFO L87 Difference]: Start difference. First operand 403 states and 449 transitions. Second operand 9 states. [2018-10-27 04:47:09,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:09,285 INFO L93 Difference]: Finished difference Result 402 states and 447 transitions. [2018-10-27 04:47:09,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:47:09,286 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-10-27 04:47:09,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:09,287 INFO L225 Difference]: With dead ends: 402 [2018-10-27 04:47:09,287 INFO L226 Difference]: Without dead ends: 402 [2018-10-27 04:47:09,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:47:09,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-10-27 04:47:09,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2018-10-27 04:47:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-10-27 04:47:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 447 transitions. [2018-10-27 04:47:09,295 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 447 transitions. Word has length 57 [2018-10-27 04:47:09,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:09,295 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 447 transitions. [2018-10-27 04:47:09,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:47:09,295 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 447 transitions. [2018-10-27 04:47:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-27 04:47:09,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:09,296 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:09,296 INFO L424 AbstractCegarLoop]: === Iteration 19 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:09,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:09,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1306974630, now seen corresponding path program 1 times [2018-10-27 04:47:09,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:09,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:09,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:09,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:09,299 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:09,603 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-27 04:47:09,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 04:47:09,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:09,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 04:47:09,683 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:09,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:47:09,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:47:09,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:47:09,684 INFO L87 Difference]: Start difference. First operand 402 states and 447 transitions. Second operand 8 states. [2018-10-27 04:47:09,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:09,927 INFO L93 Difference]: Finished difference Result 403 states and 447 transitions. [2018-10-27 04:47:09,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:47:09,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-10-27 04:47:09,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:09,930 INFO L225 Difference]: With dead ends: 403 [2018-10-27 04:47:09,930 INFO L226 Difference]: Without dead ends: 403 [2018-10-27 04:47:09,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:47:09,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-27 04:47:09,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2018-10-27 04:47:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-10-27 04:47:09,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 445 transitions. [2018-10-27 04:47:09,937 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 445 transitions. Word has length 58 [2018-10-27 04:47:09,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:09,937 INFO L481 AbstractCegarLoop]: Abstraction has 401 states and 445 transitions. [2018-10-27 04:47:09,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:47:09,938 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 445 transitions. [2018-10-27 04:47:09,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-27 04:47:09,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:09,938 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:09,939 INFO L424 AbstractCegarLoop]: === Iteration 20 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:09,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:09,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1872190056, now seen corresponding path program 1 times [2018-10-27 04:47:09,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:09,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:09,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:09,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:09,940 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:10,191 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-27 04:47:10,543 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-27 04:47:10,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 04:47:10,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:10,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-27 04:47:10,840 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:10,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 04:47:10,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 04:47:10,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-10-27 04:47:10,841 INFO L87 Difference]: Start difference. First operand 401 states and 445 transitions. Second operand 16 states. [2018-10-27 04:47:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:13,576 INFO L93 Difference]: Finished difference Result 452 states and 499 transitions. [2018-10-27 04:47:13,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 04:47:13,581 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-10-27 04:47:13,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:13,582 INFO L225 Difference]: With dead ends: 452 [2018-10-27 04:47:13,583 INFO L226 Difference]: Without dead ends: 452 [2018-10-27 04:47:13,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2018-10-27 04:47:13,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-10-27 04:47:13,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 399. [2018-10-27 04:47:13,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-27 04:47:13,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 440 transitions. [2018-10-27 04:47:13,588 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 440 transitions. Word has length 60 [2018-10-27 04:47:13,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:13,588 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 440 transitions. [2018-10-27 04:47:13,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 04:47:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 440 transitions. [2018-10-27 04:47:13,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-27 04:47:13,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:13,589 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:13,589 INFO L424 AbstractCegarLoop]: === Iteration 21 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:13,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:13,589 INFO L82 PathProgramCache]: Analyzing trace with hash -2091643788, now seen corresponding path program 1 times [2018-10-27 04:47:13,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:13,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:13,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:13,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:13,600 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 04:47:13,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:13,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:47:13,833 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:13,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:47:13,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:47:13,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:47:13,833 INFO L87 Difference]: Start difference. First operand 399 states and 440 transitions. Second operand 6 states. [2018-10-27 04:47:13,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:13,986 INFO L93 Difference]: Finished difference Result 398 states and 438 transitions. [2018-10-27 04:47:13,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:47:13,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-10-27 04:47:13,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:13,988 INFO L225 Difference]: With dead ends: 398 [2018-10-27 04:47:13,988 INFO L226 Difference]: Without dead ends: 398 [2018-10-27 04:47:13,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:47:13,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-10-27 04:47:13,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2018-10-27 04:47:13,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-10-27 04:47:13,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 438 transitions. [2018-10-27 04:47:13,995 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 438 transitions. Word has length 61 [2018-10-27 04:47:13,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:13,995 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 438 transitions. [2018-10-27 04:47:13,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:47:13,995 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 438 transitions. [2018-10-27 04:47:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-27 04:47:13,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:13,996 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:13,996 INFO L424 AbstractCegarLoop]: === Iteration 22 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:13,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:13,997 INFO L82 PathProgramCache]: Analyzing trace with hash -416447318, now seen corresponding path program 1 times [2018-10-27 04:47:13,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:13,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:13,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:13,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:14,006 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 04:47:14,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:14,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-27 04:47:14,233 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:14,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 04:47:14,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 04:47:14,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:47:14,234 INFO L87 Difference]: Start difference. First operand 398 states and 438 transitions. Second operand 12 states. [2018-10-27 04:47:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:15,590 INFO L93 Difference]: Finished difference Result 436 states and 480 transitions. [2018-10-27 04:47:15,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 04:47:15,592 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-10-27 04:47:15,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:15,593 INFO L225 Difference]: With dead ends: 436 [2018-10-27 04:47:15,593 INFO L226 Difference]: Without dead ends: 436 [2018-10-27 04:47:15,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-10-27 04:47:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-10-27 04:47:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 398. [2018-10-27 04:47:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-10-27 04:47:15,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 437 transitions. [2018-10-27 04:47:15,602 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 437 transitions. Word has length 62 [2018-10-27 04:47:15,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:15,603 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 437 transitions. [2018-10-27 04:47:15,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 04:47:15,603 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 437 transitions. [2018-10-27 04:47:15,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-27 04:47:15,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:15,604 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:15,604 INFO L424 AbstractCegarLoop]: === Iteration 23 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:15,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:15,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1513210834, now seen corresponding path program 1 times [2018-10-27 04:47:15,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:15,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:15,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:15,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:15,605 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:47:16,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:16,031 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:16,031 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2018-10-27 04:47:16,033 INFO L202 CegarAbsIntRunner]: [31], [33], [35], [37], [39], [41], [50], [86], [88], [90], [150], [151], [175], [178], [181], [184], [390], [395], [397], [399], [401], [403], [405], [406], [591], [596], [598], [600], [602], [604], [606], [608], [610], [611], [615], [617], [619], [620], [621], [623], [625], [634], [636], [638], [640], [641], [685], [687], [691], [692], [693], [695], [696], [697], [701], [715], [717], [718], [749], [750], [751], [753], [754] [2018-10-27 04:47:16,076 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:16,077 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:17,021 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:17,023 INFO L272 AbstractInterpreter]: Visited 63 different actions 210 times. Never merged. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 40 variables. [2018-10-27 04:47:17,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:17,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:17,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:17,036 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:17,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:17,046 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:17,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:18,162 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:18,163 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:18,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:47:18,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:18,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-27 04:47:18,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:18,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:18,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-10-27 04:47:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:47:18,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:20,263 WARN L179 SmtUtils]: Spent 1.81 s on a formula simplification that was a NOOP. DAG size: 25 [2018-10-27 04:47:20,290 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-10-27 04:47:28,962 WARN L179 SmtUtils]: Spent 6.07 s on a formula simplification that was a NOOP. DAG size: 25 [2018-10-27 04:47:31,046 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 25 [2018-10-27 04:47:31,320 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:31,320 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:31,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-10-27 04:47:31,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-10-27 04:47:31,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:31,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:7 [2018-10-27 04:47:31,458 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:31,458 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:31,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2018-10-27 04:47:31,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-10-27 04:47:31,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,472 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:31,472 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:31,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-10-27 04:47:31,473 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,479 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-10-27 04:47:31,570 INFO L477 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 [2018-10-27 04:47:31,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:31,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-10-27 04:47:31,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-10-27 04:47:31,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:53 [2018-10-27 04:47:31,663 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:31,663 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:31,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-10-27 04:47:31,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,717 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:31,718 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:31,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-10-27 04:47:31,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,730 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:31,730 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:47:31,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-10-27 04:47:31,731 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:31,737 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:49, output treesize:7 [2018-10-27 04:47:31,774 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:47:31,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:31,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 37 [2018-10-27 04:47:31,791 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:31,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-27 04:47:31,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-27 04:47:31,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1298, Unknown=2, NotChecked=0, Total=1406 [2018-10-27 04:47:31,792 INFO L87 Difference]: Start difference. First operand 398 states and 437 transitions. Second operand 26 states. [2018-10-27 04:47:35,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:35,053 INFO L93 Difference]: Finished difference Result 440 states and 484 transitions. [2018-10-27 04:47:35,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 04:47:35,054 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 84 [2018-10-27 04:47:35,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:35,056 INFO L225 Difference]: With dead ends: 440 [2018-10-27 04:47:35,056 INFO L226 Difference]: Without dead ends: 440 [2018-10-27 04:47:35,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 144 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=238, Invalid=2016, Unknown=2, NotChecked=0, Total=2256 [2018-10-27 04:47:35,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-10-27 04:47:35,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 397. [2018-10-27 04:47:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-10-27 04:47:35,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 436 transitions. [2018-10-27 04:47:35,074 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 436 transitions. Word has length 84 [2018-10-27 04:47:35,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:35,074 INFO L481 AbstractCegarLoop]: Abstraction has 397 states and 436 transitions. [2018-10-27 04:47:35,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-27 04:47:35,075 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 436 transitions. [2018-10-27 04:47:35,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-27 04:47:35,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:35,075 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:35,076 INFO L424 AbstractCegarLoop]: === Iteration 24 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:35,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:35,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1792382389, now seen corresponding path program 1 times [2018-10-27 04:47:35,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:35,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:35,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:35,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:35,078 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:35,318 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2018-10-27 04:47:35,475 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 04:47:35,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:35,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:47:35,475 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:35,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:47:35,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:47:35,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:47:35,476 INFO L87 Difference]: Start difference. First operand 397 states and 436 transitions. Second operand 5 states. [2018-10-27 04:47:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:35,502 INFO L93 Difference]: Finished difference Result 389 states and 415 transitions. [2018-10-27 04:47:35,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:47:35,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2018-10-27 04:47:35,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:35,505 INFO L225 Difference]: With dead ends: 389 [2018-10-27 04:47:35,505 INFO L226 Difference]: Without dead ends: 389 [2018-10-27 04:47:35,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:47:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-10-27 04:47:35,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 387. [2018-10-27 04:47:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-27 04:47:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 415 transitions. [2018-10-27 04:47:35,511 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 415 transitions. Word has length 86 [2018-10-27 04:47:35,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:35,512 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 415 transitions. [2018-10-27 04:47:35,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:47:35,512 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 415 transitions. [2018-10-27 04:47:35,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-27 04:47:35,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:35,513 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:35,513 INFO L424 AbstractCegarLoop]: === Iteration 25 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:35,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:35,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1571140042, now seen corresponding path program 1 times [2018-10-27 04:47:35,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:35,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:35,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:35,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:35,514 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 04:47:36,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:36,313 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:36,313 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 89 with the following transitions: [2018-10-27 04:47:36,314 INFO L202 CegarAbsIntRunner]: [31], [33], [35], [37], [39], [41], [50], [86], [88], [90], [150], [151], [175], [178], [181], [184], [390], [395], [397], [399], [401], [403], [405], [406], [591], [596], [598], [600], [602], [604], [606], [608], [610], [611], [615], [617], [619], [621], [623], [625], [628], [629], [634], [636], [638], [640], [641], [685], [687], [691], [692], [693], [695], [696], [697], [701], [715], [717], [718], [749], [750], [751], [753], [754] [2018-10-27 04:47:36,317 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:36,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:36,921 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:36,921 INFO L272 AbstractInterpreter]: Visited 64 different actions 214 times. Never merged. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 40 variables. [2018-10-27 04:47:36,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:36,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:36,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:36,943 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:36,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:36,952 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:37,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:37,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:47:37,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:37,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:37,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:47:37,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:47:37,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:47:37,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:37,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:37,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:37,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-10-27 04:47:37,504 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:37,505 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:37,506 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:37,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2018-10-27 04:47:37,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:37,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-10-27 04:47:37,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-10-27 04:47:37,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 19 [2018-10-27 04:47:37,532 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:37,539 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:37,550 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:37,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:37,572 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:40, output treesize:32 [2018-10-27 04:47:37,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 04:47:37,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-10-27 04:47:37,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:37,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:37,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:37,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:24 [2018-10-27 04:47:37,741 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 04:47:37,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:48:34,439 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 45 [2018-10-27 04:48:47,229 WARN L179 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-27 04:48:47,503 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:48:47,505 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:48:47,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 69 [2018-10-27 04:48:47,531 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:48:47,532 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:48:47,536 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:48:47,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 112 [2018-10-27 04:48:47,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:47,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:47,548 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:48:47,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 64 [2018-10-27 04:48:47,573 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:48:47,574 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:48:47,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 75 [2018-10-27 04:48:47,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:47,583 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:47,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 64 [2018-10-27 04:48:47,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:48:47,622 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:47,745 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 04:48:47,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-10-27 04:48:47,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-10-27 04:48:47,754 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:47,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-10-27 04:48:47,770 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:47,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-10-27 04:48:47,781 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:47,791 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:48:47,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2018-10-27 04:48:47,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:48:47,800 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:47,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2018-10-27 04:48:47,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:48:47,827 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:47,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2018-10-27 04:48:47,835 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:47,850 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:48:47,924 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:48:47,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 74 [2018-10-27 04:48:47,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 68 [2018-10-27 04:48:48,069 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2018-10-27 04:48:48,070 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 04:48:48,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2018-10-27 04:48:48,073 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:48,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-10-27 04:48:48,077 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:48,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2018-10-27 04:48:48,148 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:48,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-10-27 04:48:48,152 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:48,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 32 [2018-10-27 04:48:48,215 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 3 xjuncts. [2018-10-27 04:48:48,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 38 [2018-10-27 04:48:48,228 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 3 xjuncts. [2018-10-27 04:48:48,265 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:48:48,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 58 [2018-10-27 04:48:48,794 WARN L179 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-10-27 04:48:48,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2018-10-27 04:48:48,801 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:48,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:48:48,804 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:48,827 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:48:49,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-10-27 04:48:49,162 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-10-27 04:48:49,164 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-10-27 04:48:49,167 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-10-27 04:48:49,243 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-10-27 04:48:49,245 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-10-27 04:48:49,253 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-10-27 04:48:49,372 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 54 [2018-10-27 04:48:49,527 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 04:48:49,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2018-10-27 04:48:49,529 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-10-27 04:48:49,532 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-10-27 04:48:49,536 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 30 [2018-10-27 04:48:49,582 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:49,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2018-10-27 04:48:49,597 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:49,625 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:48:49,677 INFO L267 ElimStorePlain]: Start of recursive call 17: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-27 04:48:49,711 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:48:49,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:48:49,735 INFO L202 ElimStorePlain]: Needed 40 recursive calls to eliminate 8 variables, input treesize:61, output treesize:7 [2018-10-27 04:48:49,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-10-27 04:48:49,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:48:49,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:49,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 57 [2018-10-27 04:48:49,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 58 [2018-10-27 04:48:49,987 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 102 [2018-10-27 04:48:49,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2018-10-27 04:48:49,994 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:50,000 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2018-10-27 04:48:50,001 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:50,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 33 [2018-10-27 04:48:50,171 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:50,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 28 [2018-10-27 04:48:50,184 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:50,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 44 [2018-10-27 04:48:50,359 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-10-27 04:48:50,365 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2018-10-27 04:48:50,365 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:50,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-10-27 04:48:50,487 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:50,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-10-27 04:48:50,494 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:48:50,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-10-27 04:48:50,581 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:50,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-10-27 04:48:50,585 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:50,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-10-27 04:48:50,654 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:50,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 32 [2018-10-27 04:48:50,663 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:50,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 36 [2018-10-27 04:48:50,737 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-10-27 04:48:50,918 INFO L303 Elim1Store]: Index analysis took 180 ms [2018-10-27 04:48:51,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 41 [2018-10-27 04:48:51,172 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-10-27 04:48:51,832 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, 7 dim-1 vars, End of recursive call: 7 dim-0 vars, and 12 xjuncts. [2018-10-27 04:48:51,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-10-27 04:48:51,999 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:52,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-10-27 04:48:52,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:48:52,184 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:52,191 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2018-10-27 04:48:52,191 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:48:52,207 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-10-27 04:48:52,416 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 39 [2018-10-27 04:48:52,417 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:48:52,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-10-27 04:48:52,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:48:52,639 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:52,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2018-10-27 04:48:52,648 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:48:52,664 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-10-27 04:48:52,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 51 [2018-10-27 04:48:52,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-10-27 04:48:52,980 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:52,983 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-10-27 04:48:52,983 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:52,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-10-27 04:48:52,988 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:53,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2018-10-27 04:48:53,037 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:48:53,044 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2018-10-27 04:48:53,044 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:48:53,090 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-10-27 04:48:53,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 61 [2018-10-27 04:48:53,559 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 101 [2018-10-27 04:48:53,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 36 [2018-10-27 04:48:53,571 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:53,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 31 [2018-10-27 04:48:53,583 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:53,767 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2018-10-27 04:48:53,767 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:53,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 47 [2018-10-27 04:48:53,784 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-10-27 04:48:53,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-10-27 04:48:53,997 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:54,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-10-27 04:48:54,001 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:54,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 39 [2018-10-27 04:48:54,197 INFO L267 ElimStorePlain]: Start of recursive call 41: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-10-27 04:48:54,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 44 [2018-10-27 04:48:54,212 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-10-27 04:48:54,385 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2018-10-27 04:48:54,385 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:54,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2018-10-27 04:48:54,392 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:54,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-10-27 04:48:54,526 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:54,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-10-27 04:48:54,533 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:48:54,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-10-27 04:48:54,651 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:54,740 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, 7 dim-1 vars, End of recursive call: 7 dim-0 vars, and 12 xjuncts. [2018-10-27 04:48:55,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47 [2018-10-27 04:48:55,158 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2018-10-27 04:48:55,159 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:55,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 57 [2018-10-27 04:48:55,175 INFO L267 ElimStorePlain]: Start of recursive call 50: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-10-27 04:48:55,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 52 [2018-10-27 04:48:55,191 INFO L267 ElimStorePlain]: Start of recursive call 51: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-10-27 04:48:55,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 40 [2018-10-27 04:48:55,330 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:48:55,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-10-27 04:48:55,332 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:55,428 INFO L267 ElimStorePlain]: Start of recursive call 48: 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-10-27 04:48:55,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-10-27 04:48:55,889 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:55,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-10-27 04:48:55,892 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:55,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-10-27 04:48:55,894 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:55,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2018-10-27 04:48:55,897 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:56,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 61 [2018-10-27 04:48:56,582 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 100 [2018-10-27 04:48:56,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2018-10-27 04:48:56,594 INFO L267 ElimStorePlain]: Start of recursive call 59: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-10-27 04:48:56,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2018-10-27 04:48:56,606 INFO L267 ElimStorePlain]: Start of recursive call 60: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-10-27 04:48:56,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-10-27 04:48:56,826 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:56,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-10-27 04:48:56,829 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:57,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-10-27 04:48:57,003 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:57,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-10-27 04:48:57,007 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:57,191 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2018-10-27 04:48:57,191 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:57,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2018-10-27 04:48:57,352 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:57,360 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2018-10-27 04:48:57,360 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:57,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 36 [2018-10-27 04:48:57,504 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:57,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 31 [2018-10-27 04:48:57,540 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:57,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-10-27 04:48:57,655 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:57,746 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-0 vars, 7 dim-1 vars, End of recursive call: 7 dim-0 vars, and 12 xjuncts. [2018-10-27 04:48:58,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2018-10-27 04:48:58,299 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:58,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-10-27 04:48:58,301 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:58,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-10-27 04:48:58,318 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:58,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2018-10-27 04:48:58,320 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:58,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2018-10-27 04:48:58,323 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:58,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-10-27 04:48:58,325 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:58,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-10-27 04:48:58,327 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:58,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-10-27 04:48:58,913 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:58,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-10-27 04:48:58,916 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:58,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-10-27 04:48:58,918 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:58,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-10-27 04:48:58,920 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:58,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-10-27 04:48:58,922 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:59,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 61 [2018-10-27 04:48:59,658 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 100 [2018-10-27 04:48:59,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-27 04:48:59,666 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:59,669 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-10-27 04:48:59,669 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:59,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-10-27 04:48:59,671 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:59,848 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2018-10-27 04:48:59,848 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:59,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2018-10-27 04:48:59,858 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:00,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2018-10-27 04:49:00,048 INFO L267 ElimStorePlain]: Start of recursive call 89: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-10-27 04:49:00,203 INFO L303 Elim1Store]: Index analysis took 154 ms [2018-10-27 04:49:00,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2018-10-27 04:49:00,239 INFO L267 ElimStorePlain]: Start of recursive call 90: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-10-27 04:49:00,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-10-27 04:49:00,388 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:00,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-10-27 04:49:00,391 INFO L267 ElimStorePlain]: Start of recursive call 92: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:00,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-10-27 04:49:00,521 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:00,649 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2018-10-27 04:49:00,650 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:00,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 36 [2018-10-27 04:49:00,812 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:00,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 31 [2018-10-27 04:49:00,823 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:00,919 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-0 vars, 7 dim-1 vars, End of recursive call: 7 dim-0 vars, and 12 xjuncts. [2018-10-27 04:49:01,535 INFO L267 ElimStorePlain]: Start of recursive call 4: 13 dim-1 vars, End of recursive call: 54 dim-0 vars, and 52 xjuncts. [2018-10-27 04:49:01,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 35 [2018-10-27 04:49:01,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-10-27 04:49:01,573 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:01,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 35 [2018-10-27 04:49:01,619 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2018-10-27 04:49:01,619 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:01,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 40 [2018-10-27 04:49:01,635 INFO L267 ElimStorePlain]: Start of recursive call 101: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-10-27 04:49:01,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 45 [2018-10-27 04:49:01,649 INFO L267 ElimStorePlain]: Start of recursive call 102: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-10-27 04:49:01,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-10-27 04:49:01,750 INFO L267 ElimStorePlain]: Start of recursive call 103: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:01,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-10-27 04:49:01,751 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:01,819 INFO L267 ElimStorePlain]: Start of recursive call 99: 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-10-27 04:49:01,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2018-10-27 04:49:01,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:49:01,903 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:01,909 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2018-10-27 04:49:01,909 INFO L267 ElimStorePlain]: Start of recursive call 107: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:01,922 INFO L267 ElimStorePlain]: Start of recursive call 105: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-10-27 04:49:02,028 INFO L267 ElimStorePlain]: Start of recursive call 97: 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 12 xjuncts. [2018-10-27 04:49:02,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2018-10-27 04:49:02,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-10-27 04:49:02,186 INFO L267 ElimStorePlain]: Start of recursive call 109: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:02,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-10-27 04:49:02,340 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:02,354 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2018-10-27 04:49:02,355 INFO L267 ElimStorePlain]: Start of recursive call 111: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:02,386 INFO L267 ElimStorePlain]: Start of recursive call 108: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 04:49:03,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 63 dim-0 vars, and 62 xjuncts. [2018-10-27 04:49:03,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 154 dim-0 vars, and 62 xjuncts. [2018-10-27 04:49:03,952 INFO L202 ElimStorePlain]: Needed 111 recursive calls to eliminate 6 variables, input treesize:46, output treesize:1580 [2018-10-27 04:49:04,827 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 802 DAG size of output: 57 [2018-10-27 04:49:05,305 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2018-10-27 04:49:05,307 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:05,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-10-27 04:49:05,332 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:05,334 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:05,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2018-10-27 04:49:05,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:05,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:05,357 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:05,359 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:05,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 49 [2018-10-27 04:49:05,384 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:05,386 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:05,388 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:05,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 39 [2018-10-27 04:49:05,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:05,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:05,448 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:05,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-10-27 04:49:05,473 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:05,475 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:05,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2018-10-27 04:49:05,480 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:05,494 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:05,496 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:05,498 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:05,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 49 [2018-10-27 04:49:05,544 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:05,544 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:05,547 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:05,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 39 [2018-10-27 04:49:05,552 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:05,572 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:05,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:05,599 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 13 variables, input treesize:119, output treesize:7 [2018-10-27 04:49:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 15 refuted. 2 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 04:49:07,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:49:07,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 48 [2018-10-27 04:49:07,779 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:49:07,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-27 04:49:07,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-27 04:49:07,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2168, Unknown=35, NotChecked=0, Total=2352 [2018-10-27 04:49:07,780 INFO L87 Difference]: Start difference. First operand 387 states and 415 transitions. Second operand 33 states. [2018-10-27 04:49:16,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:16,883 INFO L93 Difference]: Finished difference Result 434 states and 466 transitions. [2018-10-27 04:49:16,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-27 04:49:16,884 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 88 [2018-10-27 04:49:16,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:16,885 INFO L225 Difference]: With dead ends: 434 [2018-10-27 04:49:16,886 INFO L226 Difference]: Without dead ends: 434 [2018-10-27 04:49:16,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 141 SyntacticMatches, 15 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 78.5s TimeCoverageRelationStatistics Valid=452, Invalid=4621, Unknown=39, NotChecked=0, Total=5112 [2018-10-27 04:49:16,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-10-27 04:49:16,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 386. [2018-10-27 04:49:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-27 04:49:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 414 transitions. [2018-10-27 04:49:16,894 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 414 transitions. Word has length 88 [2018-10-27 04:49:16,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:16,894 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 414 transitions. [2018-10-27 04:49:16,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-27 04:49:16,894 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 414 transitions. [2018-10-27 04:49:16,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-27 04:49:16,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:16,895 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:49:16,896 INFO L424 AbstractCegarLoop]: === Iteration 26 === [dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:49:16,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:16,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1460700384, now seen corresponding path program 1 times [2018-10-27 04:49:16,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:49:16,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:49:16,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:16,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:49:16,897 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:49:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 04:49:17,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:49:17,641 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:49:17,641 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2018-10-27 04:49:17,642 INFO L202 CegarAbsIntRunner]: [31], [33], [35], [37], [39], [41], [50], [86], [88], [90], [150], [151], [175], [178], [181], [184], [390], [395], [397], [399], [401], [403], [405], [406], [591], [596], [598], [600], [602], [604], [606], [608], [610], [611], [615], [617], [619], [621], [623], [625], [628], [630], [631], [634], [636], [638], [640], [641], [685], [687], [691], [692], [693], [695], [696], [697], [701], [715], [717], [718], [749], [750], [751], [753], [754] [2018-10-27 04:49:17,644 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:49:17,644 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:49:18,172 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:49:18,173 INFO L272 AbstractInterpreter]: Visited 65 different actions 218 times. Never merged. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 40 variables. [2018-10-27 04:49:18,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:18,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:49:18,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:49:18,218 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:49:18,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:18,228 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:49:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:18,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:18,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:49:18,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:49:18,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-10-27 04:49:18,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:49:18,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:49:18,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:49:18,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:49:18,445 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,447 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,453 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-10-27 04:49:18,699 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:18,700 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:18,703 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:18,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-10-27 04:49:18,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 04:49:18,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-10-27 04:49:18,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-10-27 04:49:18,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 19 [2018-10-27 04:49:18,746 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:18,755 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:18,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:18,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-10-27 04:49:18,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-10-27 04:49:18,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 19 [2018-10-27 04:49:18,800 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:18,808 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:18,820 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:18,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,849 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 12 variables, input treesize:70, output treesize:17 [2018-10-27 04:49:18,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 04:49:18,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-27 04:49:18,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:49:18,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 04:49:18,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,908 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:18,911 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-10-27 04:49:18,962 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 04:49:18,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:49:19,605 WARN L179 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 04:49:19,636 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-27 04:49:21,667 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_dll_insert_slave_~dll.base_BEFORE_CALL_11 Int) (v_dll_insert_slave_~dll.offset_BEFORE_CALL_9 Int)) (or (exists ((|v_alloc_or_die_slave_write~$Pointer$_#value.offset_49| Int) (|v_alloc_or_die_slave_write~$Pointer$_#value.offset_48| Int) (|v_alloc_or_die_slave_#Ultimate.alloc_#res.base_33| Int) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_53| Int) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_54| Int)) (and (= 0 (select |c_old(#valid)| |v_alloc_or_die_slave_#Ultimate.alloc_#res.base_33|)) (< (+ (select (select (store |c_old(#memory_$Pointer$.offset)| |v_alloc_or_die_slave_#Ultimate.alloc_#res.base_33| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_alloc_or_die_slave_#Ultimate.alloc_#res.base_33|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_54| |v_alloc_or_die_slave_write~$Pointer$_#value.offset_48|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_53| |v_alloc_or_die_slave_write~$Pointer$_#value.offset_49|)) v_dll_insert_slave_~dll.base_BEFORE_CALL_11) v_dll_insert_slave_~dll.offset_BEFORE_CALL_9) 4) 0))) (< (+ (select (select |c_#memory_$Pointer$.offset| v_dll_insert_slave_~dll.base_BEFORE_CALL_11) v_dll_insert_slave_~dll.offset_BEFORE_CALL_9) 7) (select |c_#length| (select (select |c_#memory_$Pointer$.base| v_dll_insert_slave_~dll.base_BEFORE_CALL_11) v_dll_insert_slave_~dll.offset_BEFORE_CALL_9))) (exists ((|v_alloc_or_die_slave_#Ultimate.alloc_~size_31| Int) (v_prenex_189 Int) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_51| Int) (v_prenex_187 Int) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_52| Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int)) (and (= (select |c_old(#valid)| v_prenex_187) 0) (<= (select (store |c_old(#length)| v_prenex_187 |v_alloc_or_die_slave_#Ultimate.alloc_~size_31|) (select (select (store |c_old(#memory_$Pointer$.base)| v_prenex_187 (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_187) v_prenex_189 |v_alloc_or_die_slave_write~$Pointer$_#value.base_52|) v_prenex_188 |v_alloc_or_die_slave_write~$Pointer$_#value.base_51|)) v_dll_insert_slave_~dll.base_BEFORE_CALL_11) v_dll_insert_slave_~dll.offset_BEFORE_CALL_9)) (+ (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_187 (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_187) v_prenex_189 v_prenex_186) v_prenex_188 v_prenex_185)) v_dll_insert_slave_~dll.base_BEFORE_CALL_11) v_dll_insert_slave_~dll.offset_BEFORE_CALL_9) 7)))))) (forall ((v_prenex_190 Int) (v_prenex_191 Int)) (or (exists ((v_prenex_204 Int) (v_prenex_202 Int) (v_prenex_203 Int) (v_prenex_201 Int) (v_prenex_198 Int) (v_prenex_199 Int) (v_prenex_196 Int) (v_prenex_193 Int)) (and (<= (select (store |c_old(#length)| v_prenex_201 v_prenex_198) (select (select (store |c_old(#memory_$Pointer$.base)| v_prenex_201 (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_201) v_prenex_199 v_prenex_196) v_prenex_202 v_prenex_193)) v_prenex_190) v_prenex_191)) (+ (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_201 (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_201) v_prenex_199 v_prenex_204) v_prenex_202 v_prenex_203)) v_prenex_190) v_prenex_191) 7)) (= (select |c_old(#valid)| v_prenex_201) 0))) (exists ((v_prenex_200 Int) (v_prenex_197 Int) (v_prenex_194 Int) (v_prenex_195 Int) (v_prenex_192 Int)) (and (< (+ (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_200 (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_200) v_prenex_197 v_prenex_194) v_prenex_195 v_prenex_192)) v_prenex_190) v_prenex_191) 4) 0) (= 0 (select |c_old(#valid)| v_prenex_200)))) (<= 0 (+ (select (select |c_#memory_$Pointer$.offset| v_prenex_190) v_prenex_191) 4))))) is different from false [2018-10-27 04:49:21,677 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-27 04:49:21,688 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-27 04:49:23,710 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_205 Int) (v_prenex_190 Int) (v_prenex_206 Int) (v_prenex_191 Int)) (or (exists ((v_prenex_204 Int) (v_prenex_202 Int) (v_prenex_203 Int) (v_prenex_201 Int) (v_prenex_198 Int) (v_prenex_199 Int) (v_prenex_196 Int) (v_prenex_193 Int)) (and (<= (select (store |c_old(#length)| v_prenex_201 v_prenex_198) (select (select (store |c_old(#memory_$Pointer$.base)| v_prenex_201 (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_201) v_prenex_199 v_prenex_196) v_prenex_202 v_prenex_193)) v_prenex_190) v_prenex_191)) (+ (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_201 (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_201) v_prenex_199 v_prenex_204) v_prenex_202 v_prenex_203)) v_prenex_190) v_prenex_191) 7)) (= (select |c_old(#valid)| v_prenex_201) 0))) (exists ((v_prenex_200 Int) (v_prenex_197 Int) (v_prenex_194 Int) (v_prenex_195 Int) (v_prenex_192 Int)) (and (< (+ (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_200 (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_200) v_prenex_197 v_prenex_194) v_prenex_195 v_prenex_192)) v_prenex_190) v_prenex_191) 4) 0) (= 0 (select |c_old(#valid)| v_prenex_200)))) (<= 0 (+ (select (select (store |c_alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.offset| |c_alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |c_alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.offset| |c_alloc_or_die_slave_write~$Pointer$_#ptr.base|) v_prenex_205 v_prenex_206)) v_prenex_190) v_prenex_191) 4)))) (forall ((|alloc_or_die_slave_write~$Pointer$_#ptr.offset| Int) (|alloc_or_die_slave_write~$Pointer$_#value.base| Int) (v_dll_insert_slave_~dll.base_BEFORE_CALL_11 Int) (v_dll_insert_slave_~dll.offset_BEFORE_CALL_9 Int) (|alloc_or_die_slave_write~$Pointer$_#value.offset| Int)) (or (exists ((|v_alloc_or_die_slave_write~$Pointer$_#value.offset_49| Int) (|v_alloc_or_die_slave_write~$Pointer$_#value.offset_48| Int) (|v_alloc_or_die_slave_#Ultimate.alloc_#res.base_33| Int) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_53| Int) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_54| Int)) (and (= 0 (select |c_old(#valid)| |v_alloc_or_die_slave_#Ultimate.alloc_#res.base_33|)) (< (+ (select (select (store |c_old(#memory_$Pointer$.offset)| |v_alloc_or_die_slave_#Ultimate.alloc_#res.base_33| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_alloc_or_die_slave_#Ultimate.alloc_#res.base_33|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_54| |v_alloc_or_die_slave_write~$Pointer$_#value.offset_48|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_53| |v_alloc_or_die_slave_write~$Pointer$_#value.offset_49|)) v_dll_insert_slave_~dll.base_BEFORE_CALL_11) v_dll_insert_slave_~dll.offset_BEFORE_CALL_9) 4) 0))) (exists ((|v_alloc_or_die_slave_#Ultimate.alloc_~size_31| Int) (v_prenex_189 Int) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_51| Int) (v_prenex_187 Int) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_52| Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int)) (and (= (select |c_old(#valid)| v_prenex_187) 0) (<= (select (store |c_old(#length)| v_prenex_187 |v_alloc_or_die_slave_#Ultimate.alloc_~size_31|) (select (select (store |c_old(#memory_$Pointer$.base)| v_prenex_187 (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_187) v_prenex_189 |v_alloc_or_die_slave_write~$Pointer$_#value.base_52|) v_prenex_188 |v_alloc_or_die_slave_write~$Pointer$_#value.base_51|)) v_dll_insert_slave_~dll.base_BEFORE_CALL_11) v_dll_insert_slave_~dll.offset_BEFORE_CALL_9)) (+ (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_187 (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_187) v_prenex_189 v_prenex_186) v_prenex_188 v_prenex_185)) v_dll_insert_slave_~dll.base_BEFORE_CALL_11) v_dll_insert_slave_~dll.offset_BEFORE_CALL_9) 7)))) (< (+ (select (select (store |c_alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.offset| |c_alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |c_alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.offset| |c_alloc_or_die_slave_write~$Pointer$_#ptr.base|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.offset|)) v_dll_insert_slave_~dll.base_BEFORE_CALL_11) v_dll_insert_slave_~dll.offset_BEFORE_CALL_9) 7) (select |c_#length| (select (select (store |c_alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base| |c_alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |c_alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base| |c_alloc_or_die_slave_write~$Pointer$_#ptr.base|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) v_dll_insert_slave_~dll.base_BEFORE_CALL_11) v_dll_insert_slave_~dll.offset_BEFORE_CALL_9)))))) is different from false [2018-10-27 04:49:23,723 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-27 04:49:23,734 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-27 04:49:25,766 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((|alloc_or_die_slave_write~$Pointer$_#ptr.offset| Int) (v_subst_5 Int) (|alloc_or_die_slave_write~$Pointer$_#value.base| Int) (v_subst_4 Int) (v_subst_3 Int) (v_dll_insert_slave_~dll.base_BEFORE_CALL_11 Int) (v_dll_insert_slave_~dll.offset_BEFORE_CALL_9 Int) (|alloc_or_die_slave_write~$Pointer$_#value.offset| Int)) (or (exists ((|v_alloc_or_die_slave_write~$Pointer$_#value.offset_49| Int) (|v_alloc_or_die_slave_write~$Pointer$_#value.offset_48| Int) (|v_alloc_or_die_slave_#Ultimate.alloc_#res.base_33| Int) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_53| Int) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_54| Int)) (and (= 0 (select |c_old(#valid)| |v_alloc_or_die_slave_#Ultimate.alloc_#res.base_33|)) (< (+ (select (select (store |c_old(#memory_$Pointer$.offset)| |v_alloc_or_die_slave_#Ultimate.alloc_#res.base_33| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_alloc_or_die_slave_#Ultimate.alloc_#res.base_33|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_54| |v_alloc_or_die_slave_write~$Pointer$_#value.offset_48|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_53| |v_alloc_or_die_slave_write~$Pointer$_#value.offset_49|)) v_dll_insert_slave_~dll.base_BEFORE_CALL_11) v_dll_insert_slave_~dll.offset_BEFORE_CALL_9) 4) 0))) (exists ((|v_alloc_or_die_slave_#Ultimate.alloc_~size_31| Int) (v_prenex_189 Int) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_51| Int) (v_prenex_187 Int) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_52| Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int)) (and (= (select |c_old(#valid)| v_prenex_187) 0) (<= (select (store |c_old(#length)| v_prenex_187 |v_alloc_or_die_slave_#Ultimate.alloc_~size_31|) (select (select (store |c_old(#memory_$Pointer$.base)| v_prenex_187 (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_187) v_prenex_189 |v_alloc_or_die_slave_write~$Pointer$_#value.base_52|) v_prenex_188 |v_alloc_or_die_slave_write~$Pointer$_#value.base_51|)) v_dll_insert_slave_~dll.base_BEFORE_CALL_11) v_dll_insert_slave_~dll.offset_BEFORE_CALL_9)) (+ (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_187 (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_187) v_prenex_189 v_prenex_186) v_prenex_188 v_prenex_185)) v_dll_insert_slave_~dll.base_BEFORE_CALL_11) v_dll_insert_slave_~dll.offset_BEFORE_CALL_9) 7)))) (< (+ (select (select (let ((.cse0 (store |c_alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.offset| |c_alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |c_alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.offset| |c_alloc_or_die_slave_write~$Pointer$_#ptr.base|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.offset|)))) (store .cse0 c_alloc_or_die_slave_~ptr~0.base (store (select .cse0 c_alloc_or_die_slave_~ptr~0.base) v_subst_3 v_subst_4))) v_dll_insert_slave_~dll.base_BEFORE_CALL_11) v_dll_insert_slave_~dll.offset_BEFORE_CALL_9) 7) (select |c_#length| (select (select (let ((.cse1 (store |c_alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base| |c_alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |c_alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base| |c_alloc_or_die_slave_write~$Pointer$_#ptr.base|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)))) (store .cse1 c_alloc_or_die_slave_~ptr~0.base (store (select .cse1 c_alloc_or_die_slave_~ptr~0.base) v_subst_3 v_subst_5))) v_dll_insert_slave_~dll.base_BEFORE_CALL_11) v_dll_insert_slave_~dll.offset_BEFORE_CALL_9))))) (forall ((v_prenex_205 Int) (v_prenex_208 Int) (v_prenex_206 Int) (v_prenex_190 Int) (v_prenex_207 Int) (v_prenex_191 Int)) (or (exists ((v_prenex_204 Int) (v_prenex_202 Int) (v_prenex_203 Int) (v_prenex_201 Int) (v_prenex_198 Int) (v_prenex_199 Int) (v_prenex_196 Int) (v_prenex_193 Int)) (and (<= (select (store |c_old(#length)| v_prenex_201 v_prenex_198) (select (select (store |c_old(#memory_$Pointer$.base)| v_prenex_201 (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_201) v_prenex_199 v_prenex_196) v_prenex_202 v_prenex_193)) v_prenex_190) v_prenex_191)) (+ (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_201 (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_201) v_prenex_199 v_prenex_204) v_prenex_202 v_prenex_203)) v_prenex_190) v_prenex_191) 7)) (= (select |c_old(#valid)| v_prenex_201) 0))) (exists ((v_prenex_200 Int) (v_prenex_197 Int) (v_prenex_194 Int) (v_prenex_195 Int) (v_prenex_192 Int)) (and (< (+ (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_200 (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_200) v_prenex_197 v_prenex_194) v_prenex_195 v_prenex_192)) v_prenex_190) v_prenex_191) 4) 0) (= 0 (select |c_old(#valid)| v_prenex_200)))) (<= 0 (+ (select (select (let ((.cse2 (store |c_alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.offset| |c_alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |c_alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.offset| |c_alloc_or_die_slave_write~$Pointer$_#ptr.base|) v_prenex_207 v_prenex_208)))) (store .cse2 c_alloc_or_die_slave_~ptr~0.base (store (select .cse2 c_alloc_or_die_slave_~ptr~0.base) v_prenex_205 v_prenex_206))) v_prenex_190) v_prenex_191) 4))))) is different from false [2018-10-27 04:49:25,775 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-27 04:49:25,786 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-27 04:49:27,812 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((|alloc_or_die_slave_write~$Pointer$_#ptr.offset| Int) (v_subst_5 Int) (|alloc_or_die_slave_write~$Pointer$_#value.base| Int) (v_subst_4 Int) (v_subst_3 Int) (v_dll_insert_slave_~dll.base_BEFORE_CALL_11 Int) (v_dll_insert_slave_~dll.offset_BEFORE_CALL_9 Int) (|alloc_or_die_slave_write~$Pointer$_#value.offset| Int)) (or (exists ((|v_alloc_or_die_slave_write~$Pointer$_#value.offset_49| Int) (|v_alloc_or_die_slave_write~$Pointer$_#value.offset_48| Int) (|v_alloc_or_die_slave_#Ultimate.alloc_#res.base_33| Int) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_53| Int) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_54| Int)) (and (= 0 (select |c_old(#valid)| |v_alloc_or_die_slave_#Ultimate.alloc_#res.base_33|)) (< (+ (select (select (store |c_old(#memory_$Pointer$.offset)| |v_alloc_or_die_slave_#Ultimate.alloc_#res.base_33| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_alloc_or_die_slave_#Ultimate.alloc_#res.base_33|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_54| |v_alloc_or_die_slave_write~$Pointer$_#value.offset_48|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_53| |v_alloc_or_die_slave_write~$Pointer$_#value.offset_49|)) v_dll_insert_slave_~dll.base_BEFORE_CALL_11) v_dll_insert_slave_~dll.offset_BEFORE_CALL_9) 4) 0))) (< (+ (select (select (store |c_#memory_$Pointer$.offset| c_alloc_or_die_slave_~ptr~0.base (store (store (select |c_#memory_$Pointer$.offset| c_alloc_or_die_slave_~ptr~0.base) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.offset|) v_subst_3 v_subst_4)) v_dll_insert_slave_~dll.base_BEFORE_CALL_11) v_dll_insert_slave_~dll.offset_BEFORE_CALL_9) 7) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_alloc_or_die_slave_~ptr~0.base (store (store (select |c_#memory_$Pointer$.base| c_alloc_or_die_slave_~ptr~0.base) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|) v_subst_3 v_subst_5)) v_dll_insert_slave_~dll.base_BEFORE_CALL_11) v_dll_insert_slave_~dll.offset_BEFORE_CALL_9))) (exists ((|v_alloc_or_die_slave_#Ultimate.alloc_~size_31| Int) (v_prenex_189 Int) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_51| Int) (v_prenex_187 Int) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_52| Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int)) (and (= (select |c_old(#valid)| v_prenex_187) 0) (<= (select (store |c_old(#length)| v_prenex_187 |v_alloc_or_die_slave_#Ultimate.alloc_~size_31|) (select (select (store |c_old(#memory_$Pointer$.base)| v_prenex_187 (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_187) v_prenex_189 |v_alloc_or_die_slave_write~$Pointer$_#value.base_52|) v_prenex_188 |v_alloc_or_die_slave_write~$Pointer$_#value.base_51|)) v_dll_insert_slave_~dll.base_BEFORE_CALL_11) v_dll_insert_slave_~dll.offset_BEFORE_CALL_9)) (+ (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_187 (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_187) v_prenex_189 v_prenex_186) v_prenex_188 v_prenex_185)) v_dll_insert_slave_~dll.base_BEFORE_CALL_11) v_dll_insert_slave_~dll.offset_BEFORE_CALL_9) 7)))))) (forall ((v_prenex_205 Int) (v_prenex_208 Int) (v_prenex_206 Int) (v_prenex_190 Int) (v_prenex_207 Int) (v_prenex_191 Int)) (or (exists ((v_prenex_204 Int) (v_prenex_202 Int) (v_prenex_203 Int) (v_prenex_201 Int) (v_prenex_198 Int) (v_prenex_199 Int) (v_prenex_196 Int) (v_prenex_193 Int)) (and (<= (select (store |c_old(#length)| v_prenex_201 v_prenex_198) (select (select (store |c_old(#memory_$Pointer$.base)| v_prenex_201 (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_201) v_prenex_199 v_prenex_196) v_prenex_202 v_prenex_193)) v_prenex_190) v_prenex_191)) (+ (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_201 (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_201) v_prenex_199 v_prenex_204) v_prenex_202 v_prenex_203)) v_prenex_190) v_prenex_191) 7)) (= (select |c_old(#valid)| v_prenex_201) 0))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| c_alloc_or_die_slave_~ptr~0.base (store (store (select |c_#memory_$Pointer$.offset| c_alloc_or_die_slave_~ptr~0.base) v_prenex_207 v_prenex_208) v_prenex_205 v_prenex_206)) v_prenex_190) v_prenex_191) 4)) (exists ((v_prenex_200 Int) (v_prenex_197 Int) (v_prenex_194 Int) (v_prenex_195 Int) (v_prenex_192 Int)) (and (< (+ (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_200 (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_200) v_prenex_197 v_prenex_194) v_prenex_195 v_prenex_192)) v_prenex_190) v_prenex_191) 4) 0) (= 0 (select |c_old(#valid)| v_prenex_200))))))) is different from false [2018-10-27 04:49:27,821 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-27 04:49:27,828 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-10-27 04:49:34,019 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 153 [2018-10-27 04:49:34,502 WARN L179 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 04:49:35,642 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:35,643 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:35,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-10-27 04:49:35,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:35,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-10-27 04:49:35,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:35,689 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:35,689 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:35,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 85 [2018-10-27 04:49:35,690 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:35,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 86 [2018-10-27 04:49:35,693 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:35,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 88 [2018-10-27 04:49:35,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-10-27 04:49:35,741 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:35,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 76 [2018-10-27 04:49:35,751 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:35,770 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:49:35,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 55 [2018-10-27 04:49:35,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:49:35,848 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:35,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-10-27 04:49:35,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-10-27 04:49:35,890 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:35,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-10-27 04:49:35,903 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:35,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-10-27 04:49:35,949 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:35,956 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:35,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-10-27 04:49:35,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-10-27 04:49:35,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2018-10-27 04:49:35,980 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:35,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:49:35,982 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:35,994 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:49:36,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:36,016 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,028 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:49:36,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 58 [2018-10-27 04:49:36,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-10-27 04:49:36,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:49:36,063 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2018-10-27 04:49:36,070 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:36,087 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:49:36,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 49 [2018-10-27 04:49:36,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-10-27 04:49:36,220 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-10-27 04:49:36,223 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-10-27 04:49:36,225 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2018-10-27 04:49:36,270 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:36,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2018-10-27 04:49:36,276 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:36,306 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:49:36,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-10-27 04:49:36,376 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-10-27 04:49:36,378 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-10-27 04:49:36,381 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-10-27 04:49:36,572 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-10-27 04:49:36,574 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-10-27 04:49:36,576 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,639 INFO L267 ElimStorePlain]: Start of recursive call 20: 8 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-27 04:49:36,671 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:49:36,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2018-10-27 04:49:36,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:49:36,695 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2018-10-27 04:49:36,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-10-27 04:49:36,720 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-10-27 04:49:36,733 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-10-27 04:49:36,745 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,753 INFO L267 ElimStorePlain]: Start of recursive call 38: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:36,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-10-27 04:49:36,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-10-27 04:49:36,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:49:36,769 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-10-27 04:49:36,781 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:36,790 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:49:36,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:36,812 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,824 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:49:36,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 42 [2018-10-27 04:49:36,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-10-27 04:49:36,841 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-10-27 04:49:36,874 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 32 [2018-10-27 04:49:36,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-10-27 04:49:36,942 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-10-27 04:49:36,945 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-10-27 04:49:36,947 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:36,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-10-27 04:49:36,982 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:36,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-10-27 04:49:36,989 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:37,009 INFO L267 ElimStorePlain]: Start of recursive call 50: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:49:37,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 43 [2018-10-27 04:49:37,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-10-27 04:49:37,107 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:37,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-10-27 04:49:37,111 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:37,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2018-10-27 04:49:37,213 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 3 xjuncts. [2018-10-27 04:49:37,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2018-10-27 04:49:37,225 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 3 xjuncts. [2018-10-27 04:49:37,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2018-10-27 04:49:37,294 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:37,316 INFO L267 ElimStorePlain]: Start of recursive call 56: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:49:37,464 INFO L267 ElimStorePlain]: Start of recursive call 47: 8 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-27 04:49:37,522 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:49:37,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2018-10-27 04:49:37,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:49:37,545 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:37,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 42 [2018-10-27 04:49:37,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-10-27 04:49:37,577 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:37,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-10-27 04:49:37,609 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:37,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-10-27 04:49:37,642 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:37,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-27 04:49:37,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:49:37,680 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:37,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-10-27 04:49:37,687 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:37,697 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:49:37,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-10-27 04:49:37,730 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:37,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 48 [2018-10-27 04:49:37,937 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 85 [2018-10-27 04:49:37,943 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2018-10-27 04:49:37,943 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:37,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2018-10-27 04:49:37,950 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:38,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 20 [2018-10-27 04:49:38,092 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:38,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 20 [2018-10-27 04:49:38,105 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:38,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 31 [2018-10-27 04:49:38,204 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 8 xjuncts. [2018-10-27 04:49:38,212 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2018-10-27 04:49:38,213 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:38,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2018-10-27 04:49:38,277 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2018-10-27 04:49:38,284 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:38,333 INFO L267 ElimStorePlain]: Start of recursive call 72: 7 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:49:38,361 INFO L267 ElimStorePlain]: Start of recursive call 64: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:49:38,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-10-27 04:49:38,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-10-27 04:49:38,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-10-27 04:49:38,382 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:38,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:49:38,385 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,396 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:49:38,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:38,416 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,430 INFO L267 ElimStorePlain]: Start of recursive call 81: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:49:38,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2018-10-27 04:49:38,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2018-10-27 04:49:38,444 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:38,454 INFO L267 ElimStorePlain]: Start of recursive call 86: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,478 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:49:38,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2018-10-27 04:49:38,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:49:38,624 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 46 [2018-10-27 04:49:38,655 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:38,657 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:38,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 53 [2018-10-27 04:49:38,771 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2018-10-27 04:49:38,772 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:49:38,772 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-10-27 04:49:38,777 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,818 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:38,820 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:38,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2018-10-27 04:49:38,827 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 3 xjuncts. [2018-10-27 04:49:38,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2018-10-27 04:49:38,855 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:38,873 INFO L267 ElimStorePlain]: Start of recursive call 91: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-10-27 04:49:38,897 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-10-27 04:49:38,915 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 36 [2018-10-27 04:49:38,993 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:49:38,994 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 26 [2018-10-27 04:49:39,003 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-10-27 04:49:39,024 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,032 INFO L267 ElimStorePlain]: Start of recursive call 98: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,060 INFO L267 ElimStorePlain]: Start of recursive call 90: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-10-27 04:49:39,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:39,066 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-10-27 04:49:39,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:49:39,083 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,089 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-10-27 04:49:39,090 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,095 INFO L267 ElimStorePlain]: Start of recursive call 104: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,099 INFO L267 ElimStorePlain]: Start of recursive call 102: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2018-10-27 04:49:39,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-10-27 04:49:39,108 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,120 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:39,122 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:39,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-10-27 04:49:39,123 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-10-27 04:49:39,133 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,141 INFO L267 ElimStorePlain]: Start of recursive call 107: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,160 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:49:39,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2018-10-27 04:49:39,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:49:39,189 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-10-27 04:49:39,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:39,205 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-10-27 04:49:39,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:49:39,222 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,228 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-10-27 04:49:39,228 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,235 INFO L267 ElimStorePlain]: Start of recursive call 115: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,237 INFO L267 ElimStorePlain]: Start of recursive call 113: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,246 INFO L267 ElimStorePlain]: Start of recursive call 111: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-10-27 04:49:39,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:49:39,275 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-10-27 04:49:39,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-10-27 04:49:39,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-10-27 04:49:39,306 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,308 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:49:39,309 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,315 INFO L267 ElimStorePlain]: Start of recursive call 121: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:39,323 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,328 INFO L267 ElimStorePlain]: Start of recursive call 120: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,338 INFO L267 ElimStorePlain]: Start of recursive call 118: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2018-10-27 04:49:39,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:49:39,361 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-10-27 04:49:39,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-10-27 04:49:39,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-10-27 04:49:39,396 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,400 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:49:39,400 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,406 INFO L267 ElimStorePlain]: Start of recursive call 128: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:39,415 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,421 INFO L267 ElimStorePlain]: Start of recursive call 127: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2018-10-27 04:49:39,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-10-27 04:49:39,431 INFO L267 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-10-27 04:49:39,444 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,455 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:39,457 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:39,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-10-27 04:49:39,458 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,467 INFO L267 ElimStorePlain]: Start of recursive call 132: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 46 [2018-10-27 04:49:39,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2018-10-27 04:49:39,497 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:49:39,497 INFO L267 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-10-27 04:49:39,505 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,515 INFO L267 ElimStorePlain]: Start of recursive call 137: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-10-27 04:49:39,565 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 42 [2018-10-27 04:49:39,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-10-27 04:49:39,676 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-10-27 04:49:39,680 INFO L267 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,682 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:49:39,682 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2018-10-27 04:49:39,714 INFO L267 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,728 INFO L267 ElimStorePlain]: Start of recursive call 141: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,767 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:39,768 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:39,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-10-27 04:49:39,769 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,785 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:39,787 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:39,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-10-27 04:49:39,788 INFO L267 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-10-27 04:49:39,836 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:49:39,836 INFO L267 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-10-27 04:49:39,843 INFO L267 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,852 INFO L267 ElimStorePlain]: Start of recursive call 148: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,892 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:39,894 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:39,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 50 [2018-10-27 04:49:39,973 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:39,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-10-27 04:49:39,975 INFO L267 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,978 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:39,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-10-27 04:49:39,979 INFO L267 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,982 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:49:39,982 INFO L267 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 04:49:40,022 INFO L267 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,039 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:40,042 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:40,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 28 [2018-10-27 04:49:40,050 INFO L267 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 3 xjuncts. [2018-10-27 04:49:40,067 INFO L267 ElimStorePlain]: Start of recursive call 151: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:49:40,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-10-27 04:49:40,103 INFO L267 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2018-10-27 04:49:40,107 INFO L267 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-10-27 04:49:40,137 INFO L267 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-10-27 04:49:40,141 INFO L267 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,160 INFO L267 ElimStorePlain]: Start of recursive call 136: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:49:40,185 INFO L267 ElimStorePlain]: Start of recursive call 125: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:49:40,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-10-27 04:49:40,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:49:40,301 INFO L267 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2018-10-27 04:49:40,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-10-27 04:49:40,321 INFO L267 ElimStorePlain]: Start of recursive call 164: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-10-27 04:49:40,332 INFO L267 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,363 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:40,365 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:40,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-10-27 04:49:40,371 INFO L267 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,378 INFO L267 ElimStorePlain]: Start of recursive call 163: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:40,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-10-27 04:49:40,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:49:40,383 INFO L267 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-10-27 04:49:40,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:49:40,400 INFO L267 ElimStorePlain]: Start of recursive call 170: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,406 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-10-27 04:49:40,406 INFO L267 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:40,414 INFO L267 ElimStorePlain]: Start of recursive call 169: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:49:40,429 INFO L267 ElimStorePlain]: Start of recursive call 167: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:49:40,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 46 [2018-10-27 04:49:40,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 45 [2018-10-27 04:49:40,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-10-27 04:49:40,510 INFO L267 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:40,517 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-10-27 04:49:40,518 INFO L267 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:40,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 04:49:40,560 INFO L267 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,583 INFO L267 ElimStorePlain]: Start of recursive call 173: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:49:40,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-10-27 04:49:40,626 INFO L267 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-10-27 04:49:40,629 INFO L267 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2018-10-27 04:49:40,633 INFO L267 ElimStorePlain]: Start of recursive call 179: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,663 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:40,664 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:49:40,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-10-27 04:49:40,666 INFO L267 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-10-27 04:49:40,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:49:40,704 INFO L267 ElimStorePlain]: Start of recursive call 182: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-10-27 04:49:40,712 INFO L267 ElimStorePlain]: Start of recursive call 183: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:40,722 INFO L267 ElimStorePlain]: Start of recursive call 181: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:49:40,849 INFO L267 ElimStorePlain]: Start of recursive call 172: 8 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-27 04:49:40,877 INFO L267 ElimStorePlain]: Start of recursive call 161: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:49:40,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:40,988 INFO L202 ElimStorePlain]: Needed 183 recursive calls to eliminate 22 variables, input treesize:154, output treesize:7 [2018-10-27 04:49:40,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 72 [2018-10-27 04:49:41,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:49:41,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:41,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 123 [2018-10-27 04:49:41,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 103 [2018-10-27 04:49:41,055 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:41,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 117 [2018-10-27 04:49:41,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 65 [2018-10-27 04:49:41,271 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:41,280 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 103 [2018-10-27 04:49:41,281 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:41,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 103 [2018-10-27 04:49:41,363 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:41,432 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-10-27 04:49:41,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 99 treesize of output 124 [2018-10-27 04:49:41,910 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 117 [2018-10-27 04:49:41,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 99 [2018-10-27 04:49:41,928 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:41,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 61 [2018-10-27 04:49:41,944 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:42,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 69 [2018-10-27 04:49:42,225 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-10-27 04:49:42,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 107 [2018-10-27 04:49:42,262 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-10-27 04:49:42,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 97 [2018-10-27 04:49:42,534 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:42,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 90 [2018-10-27 04:49:42,752 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:42,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 95 [2018-10-27 04:49:42,756 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:42,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2018-10-27 04:49:42,970 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:42,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 93 [2018-10-27 04:49:42,975 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:43,192 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 91 [2018-10-27 04:49:43,193 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:43,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 53 [2018-10-27 04:49:43,202 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:43,393 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 95 [2018-10-27 04:49:43,393 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:43,542 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, 7 dim-1 vars, End of recursive call: 7 dim-0 vars, and 12 xjuncts. [2018-10-27 04:49:43,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 111 [2018-10-27 04:49:44,315 WARN L179 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-10-27 04:49:44,447 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2018-10-27 04:49:44,448 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:44,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:49:44,467 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:44,526 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-10-27 04:49:45,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 104 [2018-10-27 04:49:45,027 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:45,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 101 [2018-10-27 04:49:45,030 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:45,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 142 [2018-10-27 04:49:45,034 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:45,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 102 [2018-10-27 04:49:45,037 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:45,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 108 [2018-10-27 04:49:45,558 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2018-10-27 04:49:45,558 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:45,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:49:45,561 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:45,586 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-10-27 04:49:46,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 96 [2018-10-27 04:49:46,174 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2018-10-27 04:49:46,177 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 136 [2018-10-27 04:49:46,179 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 95 [2018-10-27 04:49:46,182 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 100 [2018-10-27 04:49:46,730 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:46,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 141 [2018-10-27 04:49:46,740 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:46,748 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 101 [2018-10-27 04:49:46,749 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:46,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 103 [2018-10-27 04:49:46,759 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:47,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 102 treesize of output 127 [2018-10-27 04:49:47,697 WARN L179 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 116 [2018-10-27 04:49:47,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 64 [2018-10-27 04:49:47,714 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:47,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 102 [2018-10-27 04:49:47,733 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:48,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 110 [2018-10-27 04:49:48,051 INFO L267 ElimStorePlain]: Start of recursive call 44: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-10-27 04:49:48,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 72 [2018-10-27 04:49:48,072 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-10-27 04:49:48,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 100 [2018-10-27 04:49:48,378 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:48,644 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 94 [2018-10-27 04:49:48,644 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:48,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 56 [2018-10-27 04:49:48,654 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:48,889 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 98 [2018-10-27 04:49:48,889 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:49,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 96 [2018-10-27 04:49:49,111 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:49,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-10-27 04:49:49,115 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:49,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 90 [2018-10-27 04:49:49,314 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:49,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 97 [2018-10-27 04:49:49,324 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:49,484 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, 7 dim-1 vars, End of recursive call: 7 dim-0 vars, and 12 xjuncts. [2018-10-27 04:49:50,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 97 [2018-10-27 04:49:50,243 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:50,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 89 [2018-10-27 04:49:50,246 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:50,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 92 [2018-10-27 04:49:50,249 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:50,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-10-27 04:49:50,251 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:50,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2018-10-27 04:49:50,255 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:50,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 102 treesize of output 127 [2018-10-27 04:49:51,218 WARN L179 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 116 [2018-10-27 04:49:51,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 105 [2018-10-27 04:49:51,234 INFO L267 ElimStorePlain]: Start of recursive call 60: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-10-27 04:49:51,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 67 [2018-10-27 04:49:51,249 INFO L267 ElimStorePlain]: Start of recursive call 61: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-10-27 04:49:51,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-10-27 04:49:51,602 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:51,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 96 [2018-10-27 04:49:51,606 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:51,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 93 [2018-10-27 04:49:51,903 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:51,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2018-10-27 04:49:51,906 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 64 [2018-10-27 04:49:52,192 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:52,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 102 [2018-10-27 04:49:52,209 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:52,472 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 98 [2018-10-27 04:49:52,473 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:52,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 56 [2018-10-27 04:49:52,714 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:52,723 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 94 [2018-10-27 04:49:52,723 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:52,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 100 [2018-10-27 04:49:52,910 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,067 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-0 vars, 7 dim-1 vars, End of recursive call: 7 dim-0 vars, and 12 xjuncts. [2018-10-27 04:49:53,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 102 treesize of output 127 [2018-10-27 04:49:54,358 WARN L179 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 120 [2018-10-27 04:49:54,367 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 102 [2018-10-27 04:49:54,368 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:54,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 101 [2018-10-27 04:49:54,378 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:54,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 145 treesize of output 139 [2018-10-27 04:49:54,390 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:54,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 67 [2018-10-27 04:49:54,717 INFO L267 ElimStorePlain]: Start of recursive call 76: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-10-27 04:49:54,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 105 [2018-10-27 04:49:54,734 INFO L267 ElimStorePlain]: Start of recursive call 77: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-10-27 04:49:55,099 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 98 [2018-10-27 04:49:55,100 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:55,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 60 [2018-10-27 04:49:55,110 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:55,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 100 [2018-10-27 04:49:55,442 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:55,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 64 [2018-10-27 04:49:55,750 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:55,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 102 [2018-10-27 04:49:55,782 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:56,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-10-27 04:49:56,025 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:56,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 96 [2018-10-27 04:49:56,031 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:56,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 97 [2018-10-27 04:49:56,249 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:56,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 90 [2018-10-27 04:49:56,253 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:56,410 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-0 vars, 7 dim-1 vars, End of recursive call: 7 dim-0 vars, and 12 xjuncts. [2018-10-27 04:49:57,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 111 [2018-10-27 04:49:57,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 116 [2018-10-27 04:49:57,514 INFO L267 ElimStorePlain]: Start of recursive call 88: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-10-27 04:49:57,523 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 101 [2018-10-27 04:49:57,523 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:57,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 154 [2018-10-27 04:49:57,547 INFO L267 ElimStorePlain]: Start of recursive call 90: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-10-27 04:49:57,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 93 [2018-10-27 04:49:57,783 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:57,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 104 [2018-10-27 04:49:57,793 INFO L267 ElimStorePlain]: Start of recursive call 92: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:57,943 INFO L267 ElimStorePlain]: Start of recursive call 87: 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-10-27 04:49:59,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 13 dim-1 vars, End of recursive call: 54 dim-0 vars, and 52 xjuncts. [2018-10-27 04:49:59,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 64 treesize of output 68 [2018-10-27 04:49:59,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 68 [2018-10-27 04:49:59,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2018-10-27 04:49:59,403 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:59,411 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 99 [2018-10-27 04:49:59,411 INFO L267 ElimStorePlain]: Start of recursive call 96: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:59,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 61 [2018-10-27 04:49:59,419 INFO L267 ElimStorePlain]: Start of recursive call 97: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:59,500 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 58 [2018-10-27 04:49:59,501 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:59,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 73 [2018-10-27 04:49:59,518 INFO L267 ElimStorePlain]: Start of recursive call 99: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-10-27 04:49:59,619 INFO L267 ElimStorePlain]: Start of recursive call 94: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-10-27 04:49:59,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66 [2018-10-27 04:49:59,760 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2018-10-27 04:49:59,760 INFO L267 ElimStorePlain]: Start of recursive call 101: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:59,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:49:59,763 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:59,783 INFO L267 ElimStorePlain]: Start of recursive call 100: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-10-27 04:49:59,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 93 [2018-10-27 04:49:59,910 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:59,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-10-27 04:49:59,912 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:59,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-10-27 04:49:59,915 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:00,048 INFO L267 ElimStorePlain]: Start of recursive call 93: 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 11 xjuncts. [2018-10-27 04:50:00,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 61 [2018-10-27 04:50:00,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2018-10-27 04:50:00,059 INFO L267 ElimStorePlain]: Start of recursive call 107: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:00,084 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 53 [2018-10-27 04:50:00,085 INFO L267 ElimStorePlain]: Start of recursive call 108: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:50:00,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-10-27 04:50:00,109 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:00,135 INFO L267 ElimStorePlain]: Start of recursive call 106: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 04:50:01,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 62 dim-0 vars, and 61 xjuncts. [2018-10-27 04:50:03,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 76 [2018-10-27 04:50:03,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:03,925 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:03,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-10-27 04:50:03,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-10-27 04:50:03,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:03,977 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:03,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:03,981 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:03,990 INFO L267 ElimStorePlain]: Start of recursive call 113: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:04,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:04,000 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,006 INFO L267 ElimStorePlain]: Start of recursive call 112: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:04,017 INFO L267 ElimStorePlain]: Start of recursive call 110: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:04,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 79 [2018-10-27 04:50:04,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:04,071 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-10-27 04:50:04,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2018-10-27 04:50:04,126 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2018-10-27 04:50:04,178 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2018-10-27 04:50:04,401 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-10-27 04:50:04,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:04,404 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:04,408 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,420 INFO L267 ElimStorePlain]: Start of recursive call 122: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:04,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2018-10-27 04:50:04,466 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2018-10-27 04:50:04,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2018-10-27 04:50:04,560 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:04,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 58 [2018-10-27 04:50:04,570 INFO L267 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:04,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2018-10-27 04:50:04,577 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:04,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-10-27 04:50:04,631 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-10-27 04:50:04,637 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,655 INFO L267 ElimStorePlain]: Start of recursive call 126: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:04,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2018-10-27 04:50:04,692 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 64 [2018-10-27 04:50:04,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:04,754 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,764 INFO L267 ElimStorePlain]: Start of recursive call 133: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:04,781 INFO L267 ElimStorePlain]: Start of recursive call 119: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:04,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-10-27 04:50:04,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:04,787 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 04:50:04,795 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,797 INFO L267 ElimStorePlain]: Start of recursive call 135: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-10-27 04:50:04,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-10-27 04:50:04,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:04,821 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:04,825 INFO L267 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,835 INFO L267 ElimStorePlain]: Start of recursive call 139: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:04,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:04,847 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,856 INFO L267 ElimStorePlain]: Start of recursive call 138: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:04,876 INFO L267 ElimStorePlain]: Start of recursive call 117: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:04,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 77 [2018-10-27 04:50:04,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:04,906 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 53 treesize of output 55 [2018-10-27 04:50:04,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 50 [2018-10-27 04:50:04,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-10-27 04:50:04,969 INFO L267 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:04,975 INFO L267 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:04,987 INFO L267 ElimStorePlain]: Start of recursive call 146: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-10-27 04:50:05,005 INFO L267 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-10-27 04:50:05,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-10-27 04:50:05,047 INFO L267 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-27 04:50:05,051 INFO L267 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,062 INFO L267 ElimStorePlain]: Start of recursive call 150: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,073 INFO L267 ElimStorePlain]: Start of recursive call 145: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 91 [2018-10-27 04:50:05,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 73 [2018-10-27 04:50:05,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-10-27 04:50:05,124 INFO L267 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-27 04:50:05,129 INFO L267 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,142 INFO L267 ElimStorePlain]: Start of recursive call 154: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2018-10-27 04:50:05,240 INFO L267 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 73 [2018-10-27 04:50:05,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-27 04:50:05,309 INFO L267 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-10-27 04:50:05,312 INFO L267 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,323 INFO L267 ElimStorePlain]: Start of recursive call 158: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 70 [2018-10-27 04:50:05,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-10-27 04:50:05,538 INFO L267 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-27 04:50:05,542 INFO L267 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,554 INFO L267 ElimStorePlain]: Start of recursive call 161: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,562 INFO L267 ElimStorePlain]: Start of recursive call 153: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-10-27 04:50:05,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-27 04:50:05,574 INFO L267 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,582 INFO L267 ElimStorePlain]: Start of recursive call 164: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,598 INFO L267 ElimStorePlain]: Start of recursive call 143: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:05,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2018-10-27 04:50:05,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:05,625 INFO L267 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-10-27 04:50:05,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-27 04:50:05,644 INFO L267 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,650 INFO L267 ElimStorePlain]: Start of recursive call 168: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,656 INFO L267 ElimStorePlain]: Start of recursive call 166: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2018-10-27 04:50:05,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:05,680 INFO L267 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 33 [2018-10-27 04:50:05,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-10-27 04:50:05,699 INFO L267 ElimStorePlain]: Start of recursive call 173: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-10-27 04:50:05,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2018-10-27 04:50:05,727 INFO L267 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:05,729 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:05,729 INFO L267 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,737 INFO L267 ElimStorePlain]: Start of recursive call 174: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:05,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-10-27 04:50:05,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2018-10-27 04:50:05,766 INFO L267 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:05,769 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:05,769 INFO L267 ElimStorePlain]: Start of recursive call 179: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,776 INFO L267 ElimStorePlain]: Start of recursive call 177: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:05,784 INFO L267 ElimStorePlain]: Start of recursive call 172: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:05,792 INFO L267 ElimStorePlain]: Start of recursive call 170: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:05,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 76 [2018-10-27 04:50:05,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:05,823 INFO L267 ElimStorePlain]: Start of recursive call 181: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-10-27 04:50:05,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-10-27 04:50:05,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:05,872 INFO L267 ElimStorePlain]: Start of recursive call 184: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:05,876 INFO L267 ElimStorePlain]: Start of recursive call 185: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,886 INFO L267 ElimStorePlain]: Start of recursive call 183: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:05,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:05,899 INFO L267 ElimStorePlain]: Start of recursive call 186: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,908 INFO L267 ElimStorePlain]: Start of recursive call 182: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:05,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-10-27 04:50:05,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 73 [2018-10-27 04:50:05,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:05,952 INFO L267 ElimStorePlain]: Start of recursive call 189: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:05,957 INFO L267 ElimStorePlain]: Start of recursive call 190: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:05,975 INFO L267 ElimStorePlain]: Start of recursive call 188: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:06,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-10-27 04:50:06,037 INFO L267 ElimStorePlain]: Start of recursive call 191: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2018-10-27 04:50:06,094 INFO L267 ElimStorePlain]: Start of recursive call 192: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 67 [2018-10-27 04:50:06,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:06,184 INFO L267 ElimStorePlain]: Start of recursive call 194: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,198 INFO L267 ElimStorePlain]: Start of recursive call 193: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:06,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-27 04:50:06,243 INFO L267 ElimStorePlain]: Start of recursive call 195: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-10-27 04:50:06,248 INFO L267 ElimStorePlain]: Start of recursive call 196: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,283 INFO L267 ElimStorePlain]: Start of recursive call 187: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:06,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-10-27 04:50:06,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-10-27 04:50:06,293 INFO L267 ElimStorePlain]: Start of recursive call 198: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-10-27 04:50:06,308 INFO L267 ElimStorePlain]: Start of recursive call 199: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-27 04:50:06,323 INFO L267 ElimStorePlain]: Start of recursive call 200: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,328 INFO L267 ElimStorePlain]: Start of recursive call 197: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,347 INFO L267 ElimStorePlain]: Start of recursive call 180: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:06,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 76 [2018-10-27 04:50:06,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:06,379 INFO L267 ElimStorePlain]: Start of recursive call 202: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-10-27 04:50:06,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-10-27 04:50:06,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:06,430 INFO L267 ElimStorePlain]: Start of recursive call 205: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:06,434 INFO L267 ElimStorePlain]: Start of recursive call 206: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,445 INFO L267 ElimStorePlain]: Start of recursive call 204: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:06,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:06,457 INFO L267 ElimStorePlain]: Start of recursive call 207: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,466 INFO L267 ElimStorePlain]: Start of recursive call 203: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:06,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-10-27 04:50:06,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2018-10-27 04:50:06,484 INFO L267 ElimStorePlain]: Start of recursive call 209: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 64 [2018-10-27 04:50:06,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:06,572 INFO L267 ElimStorePlain]: Start of recursive call 211: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,583 INFO L267 ElimStorePlain]: Start of recursive call 210: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:06,629 INFO L267 ElimStorePlain]: Start of recursive call 208: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:06,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-10-27 04:50:06,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 04:50:06,635 INFO L267 ElimStorePlain]: Start of recursive call 213: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:06,641 INFO L267 ElimStorePlain]: Start of recursive call 214: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,645 INFO L267 ElimStorePlain]: Start of recursive call 212: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,664 INFO L267 ElimStorePlain]: Start of recursive call 201: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:06,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2018-10-27 04:50:06,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:06,691 INFO L267 ElimStorePlain]: Start of recursive call 216: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-10-27 04:50:06,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2018-10-27 04:50:06,717 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:06,718 INFO L267 ElimStorePlain]: Start of recursive call 219: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-27 04:50:06,722 INFO L267 ElimStorePlain]: Start of recursive call 220: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,726 INFO L267 ElimStorePlain]: Start of recursive call 218: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:06,731 INFO L267 ElimStorePlain]: Start of recursive call 221: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,735 INFO L267 ElimStorePlain]: Start of recursive call 217: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,741 INFO L267 ElimStorePlain]: Start of recursive call 215: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-10-27 04:50:06,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:06,763 INFO L267 ElimStorePlain]: Start of recursive call 223: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-10-27 04:50:06,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-10-27 04:50:06,781 INFO L267 ElimStorePlain]: Start of recursive call 225: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-10-27 04:50:06,791 INFO L267 ElimStorePlain]: Start of recursive call 226: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-27 04:50:06,800 INFO L267 ElimStorePlain]: Start of recursive call 227: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,803 INFO L267 ElimStorePlain]: Start of recursive call 224: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,807 INFO L267 ElimStorePlain]: Start of recursive call 222: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 75 [2018-10-27 04:50:06,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:06,839 INFO L267 ElimStorePlain]: Start of recursive call 229: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-10-27 04:50:06,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-10-27 04:50:06,874 INFO L267 ElimStorePlain]: Start of recursive call 231: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-10-27 04:50:06,888 INFO L267 ElimStorePlain]: Start of recursive call 232: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-27 04:50:06,903 INFO L267 ElimStorePlain]: Start of recursive call 233: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,909 INFO L267 ElimStorePlain]: Start of recursive call 230: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-10-27 04:50:06,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-10-27 04:50:06,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-10-27 04:50:06,939 INFO L267 ElimStorePlain]: Start of recursive call 236: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:06,941 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:06,941 INFO L267 ElimStorePlain]: Start of recursive call 237: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,952 INFO L267 ElimStorePlain]: Start of recursive call 235: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:06,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:06,965 INFO L267 ElimStorePlain]: Start of recursive call 238: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:06,974 INFO L267 ElimStorePlain]: Start of recursive call 234: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:06,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-10-27 04:50:07,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 85 [2018-10-27 04:50:07,119 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2018-10-27 04:50:07,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 46 [2018-10-27 04:50:07,133 INFO L267 ElimStorePlain]: Start of recursive call 241: End of recursive call: and 4 xjuncts. [2018-10-27 04:50:07,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 63 [2018-10-27 04:50:07,148 INFO L267 ElimStorePlain]: Start of recursive call 242: End of recursive call: and 4 xjuncts. [2018-10-27 04:50:07,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-10-27 04:50:07,226 INFO L267 ElimStorePlain]: Start of recursive call 243: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:07,238 INFO L267 ElimStorePlain]: Start of recursive call 240: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:07,289 INFO L267 ElimStorePlain]: Start of recursive call 239: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:07,308 INFO L267 ElimStorePlain]: Start of recursive call 228: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:07,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-10-27 04:50:07,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:07,342 INFO L267 ElimStorePlain]: Start of recursive call 245: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:07,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 27 [2018-10-27 04:50:07,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-10-27 04:50:07,360 INFO L267 ElimStorePlain]: Start of recursive call 247: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:07,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2018-10-27 04:50:07,376 INFO L267 ElimStorePlain]: Start of recursive call 248: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:07,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-10-27 04:50:07,386 INFO L267 ElimStorePlain]: Start of recursive call 249: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:07,393 INFO L267 ElimStorePlain]: Start of recursive call 246: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:07,402 INFO L267 ElimStorePlain]: Start of recursive call 244: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:07,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2018-10-27 04:50:07,768 WARN L179 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2018-10-27 04:50:07,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:07,770 INFO L267 ElimStorePlain]: Start of recursive call 251: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:07,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-10-27 04:50:07,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-10-27 04:50:07,792 INFO L267 ElimStorePlain]: Start of recursive call 253: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:07,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-10-27 04:50:07,804 INFO L267 ElimStorePlain]: Start of recursive call 254: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:07,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-27 04:50:07,814 INFO L267 ElimStorePlain]: Start of recursive call 255: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:07,818 INFO L267 ElimStorePlain]: Start of recursive call 252: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:07,826 INFO L267 ElimStorePlain]: Start of recursive call 250: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:07,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 103 [2018-10-27 04:50:07,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:07,871 INFO L267 ElimStorePlain]: Start of recursive call 257: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:07,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2018-10-27 04:50:07,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-10-27 04:50:07,894 INFO L267 ElimStorePlain]: Start of recursive call 259: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:07,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:07,901 INFO L267 ElimStorePlain]: Start of recursive call 260: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:07,904 INFO L267 ElimStorePlain]: Start of recursive call 258: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:07,910 INFO L267 ElimStorePlain]: Start of recursive call 256: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:07,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 76 [2018-10-27 04:50:07,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:07,945 INFO L267 ElimStorePlain]: Start of recursive call 262: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:07,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2018-10-27 04:50:07,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-10-27 04:50:07,967 INFO L267 ElimStorePlain]: Start of recursive call 264: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:07,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:07,983 INFO L267 ElimStorePlain]: Start of recursive call 265: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:07,987 INFO L267 ElimStorePlain]: Start of recursive call 263: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:07,993 INFO L267 ElimStorePlain]: Start of recursive call 261: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:07,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 107 [2018-10-27 04:50:08,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:08,046 INFO L267 ElimStorePlain]: Start of recursive call 267: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2018-10-27 04:50:08,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:08,070 INFO L267 ElimStorePlain]: Start of recursive call 269: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-10-27 04:50:08,082 INFO L267 ElimStorePlain]: Start of recursive call 270: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,085 INFO L267 ElimStorePlain]: Start of recursive call 268: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,093 INFO L267 ElimStorePlain]: Start of recursive call 266: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 72 [2018-10-27 04:50:08,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:08,123 INFO L267 ElimStorePlain]: Start of recursive call 272: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-10-27 04:50:08,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-10-27 04:50:08,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:08,172 INFO L267 ElimStorePlain]: Start of recursive call 275: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,180 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-10-27 04:50:08,180 INFO L267 ElimStorePlain]: Start of recursive call 276: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:08,196 INFO L267 ElimStorePlain]: Start of recursive call 274: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:50:08,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:08,224 INFO L267 ElimStorePlain]: Start of recursive call 277: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,241 INFO L267 ElimStorePlain]: Start of recursive call 273: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:08,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 81 [2018-10-27 04:50:08,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 76 [2018-10-27 04:50:08,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:08,284 INFO L267 ElimStorePlain]: Start of recursive call 280: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,292 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-10-27 04:50:08,293 INFO L267 ElimStorePlain]: Start of recursive call 281: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:08,329 INFO L267 ElimStorePlain]: Start of recursive call 279: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:50:08,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2018-10-27 04:50:08,385 INFO L267 ElimStorePlain]: Start of recursive call 282: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-10-27 04:50:08,429 INFO L267 ElimStorePlain]: Start of recursive call 283: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-10-27 04:50:08,433 INFO L267 ElimStorePlain]: Start of recursive call 284: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-10-27 04:50:08,435 INFO L267 ElimStorePlain]: Start of recursive call 285: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-10-27 04:50:08,473 INFO L267 ElimStorePlain]: Start of recursive call 286: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-10-27 04:50:08,477 INFO L267 ElimStorePlain]: Start of recursive call 287: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-10-27 04:50:08,480 INFO L267 ElimStorePlain]: Start of recursive call 288: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 68 [2018-10-27 04:50:08,575 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2018-10-27 04:50:08,575 INFO L267 ElimStorePlain]: Start of recursive call 290: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2018-10-27 04:50:08,577 INFO L267 ElimStorePlain]: Start of recursive call 291: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-10-27 04:50:08,581 INFO L267 ElimStorePlain]: Start of recursive call 292: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,622 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2018-10-27 04:50:08,622 INFO L267 ElimStorePlain]: Start of recursive call 293: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:08,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2018-10-27 04:50:08,629 INFO L267 ElimStorePlain]: Start of recursive call 294: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:08,651 INFO L267 ElimStorePlain]: Start of recursive call 289: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:08,672 INFO L267 ElimStorePlain]: Start of recursive call 278: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:08,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-10-27 04:50:08,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 04:50:08,677 INFO L267 ElimStorePlain]: Start of recursive call 296: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:08,684 INFO L267 ElimStorePlain]: Start of recursive call 297: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,687 INFO L267 ElimStorePlain]: Start of recursive call 295: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,716 INFO L267 ElimStorePlain]: Start of recursive call 271: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:50:08,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 72 [2018-10-27 04:50:08,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:08,745 INFO L267 ElimStorePlain]: Start of recursive call 299: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-10-27 04:50:08,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-10-27 04:50:08,776 INFO L267 ElimStorePlain]: Start of recursive call 301: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-10-27 04:50:08,790 INFO L267 ElimStorePlain]: Start of recursive call 302: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-27 04:50:08,805 INFO L267 ElimStorePlain]: Start of recursive call 303: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,811 INFO L267 ElimStorePlain]: Start of recursive call 300: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 53 treesize of output 55 [2018-10-27 04:50:08,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-10-27 04:50:08,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-27 04:50:08,844 INFO L267 ElimStorePlain]: Start of recursive call 306: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:08,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2018-10-27 04:50:08,854 INFO L267 ElimStorePlain]: Start of recursive call 307: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:08,878 INFO L267 ElimStorePlain]: Start of recursive call 305: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:50:08,938 INFO L267 ElimStorePlain]: Start of recursive call 304: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:08,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 91 [2018-10-27 04:50:08,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-10-27 04:50:08,959 INFO L267 ElimStorePlain]: Start of recursive call 309: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 73 [2018-10-27 04:50:09,180 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-10-27 04:50:09,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:09,182 INFO L267 ElimStorePlain]: Start of recursive call 311: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-10-27 04:50:09,193 INFO L267 ElimStorePlain]: Start of recursive call 312: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:09,216 INFO L267 ElimStorePlain]: Start of recursive call 310: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:50:09,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 83 [2018-10-27 04:50:09,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 41 [2018-10-27 04:50:09,484 INFO L267 ElimStorePlain]: Start of recursive call 314: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:09,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 58 [2018-10-27 04:50:09,495 INFO L267 ElimStorePlain]: Start of recursive call 315: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:09,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-10-27 04:50:09,552 INFO L267 ElimStorePlain]: Start of recursive call 316: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,578 INFO L267 ElimStorePlain]: Start of recursive call 313: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:09,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 83 [2018-10-27 04:50:09,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 58 [2018-10-27 04:50:09,773 INFO L267 ElimStorePlain]: Start of recursive call 318: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:09,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 41 [2018-10-27 04:50:09,783 INFO L267 ElimStorePlain]: Start of recursive call 319: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:09,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-10-27 04:50:09,841 INFO L267 ElimStorePlain]: Start of recursive call 320: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:09,867 INFO L267 ElimStorePlain]: Start of recursive call 317: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:09,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 80 [2018-10-27 04:50:10,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 48 [2018-10-27 04:50:10,013 INFO L267 ElimStorePlain]: Start of recursive call 322: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-10-27 04:50:10,018 INFO L267 ElimStorePlain]: Start of recursive call 323: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2018-10-27 04:50:10,023 INFO L267 ElimStorePlain]: Start of recursive call 324: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 55 [2018-10-27 04:50:10,079 INFO L267 ElimStorePlain]: Start of recursive call 325: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:10,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 38 [2018-10-27 04:50:10,089 INFO L267 ElimStorePlain]: Start of recursive call 326: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:10,115 INFO L267 ElimStorePlain]: Start of recursive call 321: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:10,249 INFO L267 ElimStorePlain]: Start of recursive call 308: 13 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:10,280 INFO L267 ElimStorePlain]: Start of recursive call 298: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:50:10,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 103 [2018-10-27 04:50:10,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:10,326 INFO L267 ElimStorePlain]: Start of recursive call 328: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 51 [2018-10-27 04:50:10,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-10-27 04:50:10,355 INFO L267 ElimStorePlain]: Start of recursive call 330: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-10-27 04:50:10,374 INFO L267 ElimStorePlain]: Start of recursive call 331: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-10-27 04:50:10,388 INFO L267 ElimStorePlain]: Start of recursive call 332: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,392 INFO L267 ElimStorePlain]: Start of recursive call 329: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,398 INFO L267 ElimStorePlain]: Start of recursive call 327: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-10-27 04:50:10,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:10,420 INFO L267 ElimStorePlain]: Start of recursive call 334: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-10-27 04:50:10,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:10,434 INFO L267 ElimStorePlain]: Start of recursive call 336: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-10-27 04:50:10,440 INFO L267 ElimStorePlain]: Start of recursive call 337: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,443 INFO L267 ElimStorePlain]: Start of recursive call 335: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,448 INFO L267 ElimStorePlain]: Start of recursive call 333: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 78 [2018-10-27 04:50:10,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:10,518 INFO L267 ElimStorePlain]: Start of recursive call 339: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-10-27 04:50:10,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-10-27 04:50:10,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:10,569 INFO L267 ElimStorePlain]: Start of recursive call 342: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:10,575 INFO L267 ElimStorePlain]: Start of recursive call 343: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,586 INFO L267 ElimStorePlain]: Start of recursive call 341: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:10,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:10,598 INFO L267 ElimStorePlain]: Start of recursive call 344: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,607 INFO L267 ElimStorePlain]: Start of recursive call 340: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:10,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-10-27 04:50:10,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:10,615 INFO L267 ElimStorePlain]: Start of recursive call 346: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 04:50:10,625 INFO L267 ElimStorePlain]: Start of recursive call 347: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,629 INFO L267 ElimStorePlain]: Start of recursive call 345: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-10-27 04:50:10,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 79 [2018-10-27 04:50:10,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-10-27 04:50:10,697 INFO L267 ElimStorePlain]: Start of recursive call 350: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,710 INFO L267 ElimStorePlain]: Start of recursive call 349: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:10,763 INFO L267 ElimStorePlain]: Start of recursive call 348: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:10,784 INFO L267 ElimStorePlain]: Start of recursive call 338: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:10,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 73 [2018-10-27 04:50:10,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:10,814 INFO L267 ElimStorePlain]: Start of recursive call 352: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 91 [2018-10-27 04:50:10,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 76 [2018-10-27 04:50:10,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:10,913 INFO L267 ElimStorePlain]: Start of recursive call 355: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:10,933 INFO L267 ElimStorePlain]: Start of recursive call 354: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:11,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 64 [2018-10-27 04:50:11,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:11,085 INFO L267 ElimStorePlain]: Start of recursive call 357: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,097 INFO L267 ElimStorePlain]: Start of recursive call 356: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:11,177 INFO L267 ElimStorePlain]: Start of recursive call 353: 13 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:11,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-10-27 04:50:11,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-27 04:50:11,189 INFO L267 ElimStorePlain]: Start of recursive call 359: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,197 INFO L267 ElimStorePlain]: Start of recursive call 358: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 53 treesize of output 55 [2018-10-27 04:50:11,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 50 [2018-10-27 04:50:11,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:11,233 INFO L267 ElimStorePlain]: Start of recursive call 362: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:11,236 INFO L267 ElimStorePlain]: Start of recursive call 363: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,251 INFO L267 ElimStorePlain]: Start of recursive call 361: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:11,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-10-27 04:50:11,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:11,297 INFO L267 ElimStorePlain]: Start of recursive call 365: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:11,301 INFO L267 ElimStorePlain]: Start of recursive call 366: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,312 INFO L267 ElimStorePlain]: Start of recursive call 364: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:11,336 INFO L267 ElimStorePlain]: Start of recursive call 360: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:11,354 INFO L267 ElimStorePlain]: Start of recursive call 351: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:11,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-10-27 04:50:11,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:11,384 INFO L267 ElimStorePlain]: Start of recursive call 368: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-10-27 04:50:11,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-27 04:50:11,405 INFO L267 ElimStorePlain]: Start of recursive call 370: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,410 INFO L267 ElimStorePlain]: Start of recursive call 369: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,417 INFO L267 ElimStorePlain]: Start of recursive call 367: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 79 [2018-10-27 04:50:11,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:11,453 INFO L267 ElimStorePlain]: Start of recursive call 372: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2018-10-27 04:50:11,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-10-27 04:50:11,476 INFO L267 ElimStorePlain]: Start of recursive call 374: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:11,490 INFO L267 ElimStorePlain]: Start of recursive call 375: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,495 INFO L267 ElimStorePlain]: Start of recursive call 373: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,501 INFO L267 ElimStorePlain]: Start of recursive call 371: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 78 [2018-10-27 04:50:11,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:11,534 INFO L267 ElimStorePlain]: Start of recursive call 377: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-10-27 04:50:11,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-10-27 04:50:11,570 INFO L267 ElimStorePlain]: Start of recursive call 379: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-27 04:50:11,589 INFO L267 ElimStorePlain]: Start of recursive call 380: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,597 INFO L267 ElimStorePlain]: Start of recursive call 378: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-10-27 04:50:11,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:11,605 INFO L267 ElimStorePlain]: Start of recursive call 382: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-10-27 04:50:11,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:11,634 INFO L267 ElimStorePlain]: Start of recursive call 384: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:11,639 INFO L267 ElimStorePlain]: Start of recursive call 385: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,650 INFO L267 ElimStorePlain]: Start of recursive call 383: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:11,659 INFO L267 ElimStorePlain]: Start of recursive call 381: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:11,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-10-27 04:50:11,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2018-10-27 04:50:11,677 INFO L267 ElimStorePlain]: Start of recursive call 387: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2018-10-27 04:50:11,729 INFO L267 ElimStorePlain]: Start of recursive call 388: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-10-27 04:50:11,768 INFO L267 ElimStorePlain]: Start of recursive call 389: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 76 [2018-10-27 04:50:11,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-10-27 04:50:11,854 INFO L267 ElimStorePlain]: Start of recursive call 391: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,866 INFO L267 ElimStorePlain]: Start of recursive call 390: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:11,900 INFO L267 ElimStorePlain]: Start of recursive call 386: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:11,921 INFO L267 ElimStorePlain]: Start of recursive call 376: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:11,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 75 [2018-10-27 04:50:11,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:11,952 INFO L267 ElimStorePlain]: Start of recursive call 393: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-10-27 04:50:11,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 04:50:11,983 INFO L267 ElimStorePlain]: Start of recursive call 395: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:11,989 INFO L267 ElimStorePlain]: Start of recursive call 396: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:11,992 INFO L267 ElimStorePlain]: Start of recursive call 394: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 81 [2018-10-27 04:50:12,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 76 [2018-10-27 04:50:12,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:12,034 INFO L267 ElimStorePlain]: Start of recursive call 399: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:12,039 INFO L267 ElimStorePlain]: Start of recursive call 400: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,058 INFO L267 ElimStorePlain]: Start of recursive call 398: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:12,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 70 [2018-10-27 04:50:12,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:12,131 INFO L267 ElimStorePlain]: Start of recursive call 402: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,143 INFO L267 ElimStorePlain]: Start of recursive call 401: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:12,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-10-27 04:50:12,177 INFO L267 ElimStorePlain]: Start of recursive call 403: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-10-27 04:50:12,182 INFO L267 ElimStorePlain]: Start of recursive call 404: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,210 INFO L267 ElimStorePlain]: Start of recursive call 397: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:12,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-10-27 04:50:12,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:12,216 INFO L267 ElimStorePlain]: Start of recursive call 406: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-10-27 04:50:12,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:12,243 INFO L267 ElimStorePlain]: Start of recursive call 408: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:12,246 INFO L267 ElimStorePlain]: Start of recursive call 409: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,256 INFO L267 ElimStorePlain]: Start of recursive call 407: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:12,264 INFO L267 ElimStorePlain]: Start of recursive call 405: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:12,283 INFO L267 ElimStorePlain]: Start of recursive call 392: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:12,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2018-10-27 04:50:12,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:12,313 INFO L267 ElimStorePlain]: Start of recursive call 411: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-10-27 04:50:12,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-10-27 04:50:12,333 INFO L267 ElimStorePlain]: Start of recursive call 413: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-10-27 04:50:12,343 INFO L267 ElimStorePlain]: Start of recursive call 414: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-27 04:50:12,353 INFO L267 ElimStorePlain]: Start of recursive call 415: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,357 INFO L267 ElimStorePlain]: Start of recursive call 412: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,364 INFO L267 ElimStorePlain]: Start of recursive call 410: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2018-10-27 04:50:12,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:12,392 INFO L267 ElimStorePlain]: Start of recursive call 417: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 27 [2018-10-27 04:50:12,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-10-27 04:50:12,412 INFO L267 ElimStorePlain]: Start of recursive call 419: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-10-27 04:50:12,423 INFO L267 ElimStorePlain]: Start of recursive call 420: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-27 04:50:12,431 INFO L267 ElimStorePlain]: Start of recursive call 421: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,434 INFO L267 ElimStorePlain]: Start of recursive call 418: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,440 INFO L267 ElimStorePlain]: Start of recursive call 416: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 82 [2018-10-27 04:50:12,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:12,478 INFO L267 ElimStorePlain]: Start of recursive call 423: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2018-10-27 04:50:12,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:12,500 INFO L267 ElimStorePlain]: Start of recursive call 425: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 04:50:12,511 INFO L267 ElimStorePlain]: Start of recursive call 426: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,515 INFO L267 ElimStorePlain]: Start of recursive call 424: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,522 INFO L267 ElimStorePlain]: Start of recursive call 422: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2018-10-27 04:50:12,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:12,566 INFO L267 ElimStorePlain]: Start of recursive call 428: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-10-27 04:50:12,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-10-27 04:50:12,584 INFO L267 ElimStorePlain]: Start of recursive call 430: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:12,591 INFO L267 ElimStorePlain]: Start of recursive call 431: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,595 INFO L267 ElimStorePlain]: Start of recursive call 429: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,601 INFO L267 ElimStorePlain]: Start of recursive call 427: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2018-10-27 04:50:12,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:12,628 INFO L267 ElimStorePlain]: Start of recursive call 433: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 27 [2018-10-27 04:50:12,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-27 04:50:12,648 INFO L267 ElimStorePlain]: Start of recursive call 435: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,654 INFO L267 ElimStorePlain]: Start of recursive call 434: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,660 INFO L267 ElimStorePlain]: Start of recursive call 432: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 81 [2018-10-27 04:50:12,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:12,700 INFO L267 ElimStorePlain]: Start of recursive call 437: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2018-10-27 04:50:12,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-10-27 04:50:12,726 INFO L267 ElimStorePlain]: Start of recursive call 439: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-10-27 04:50:12,739 INFO L267 ElimStorePlain]: Start of recursive call 440: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:12,751 INFO L267 ElimStorePlain]: Start of recursive call 441: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,755 INFO L267 ElimStorePlain]: Start of recursive call 438: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,762 INFO L267 ElimStorePlain]: Start of recursive call 436: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 75 [2018-10-27 04:50:12,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:12,795 INFO L267 ElimStorePlain]: Start of recursive call 443: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 53 treesize of output 55 [2018-10-27 04:50:12,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-10-27 04:50:12,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-27 04:50:12,855 INFO L267 ElimStorePlain]: Start of recursive call 446: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-10-27 04:50:12,862 INFO L267 ElimStorePlain]: Start of recursive call 447: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:12,875 INFO L267 ElimStorePlain]: Start of recursive call 445: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:12,904 INFO L267 ElimStorePlain]: Start of recursive call 444: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:12,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 91 [2018-10-27 04:50:12,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2018-10-27 04:50:12,928 INFO L267 ElimStorePlain]: Start of recursive call 449: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 66 [2018-10-27 04:50:13,040 INFO L267 ElimStorePlain]: Start of recursive call 450: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2018-10-27 04:50:13,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:13,167 INFO L267 ElimStorePlain]: Start of recursive call 452: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:13,172 INFO L267 ElimStorePlain]: Start of recursive call 453: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,185 INFO L267 ElimStorePlain]: Start of recursive call 451: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:13,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 73 [2018-10-27 04:50:13,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-10-27 04:50:13,324 INFO L267 ElimStorePlain]: Start of recursive call 455: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-27 04:50:13,329 INFO L267 ElimStorePlain]: Start of recursive call 456: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,346 INFO L267 ElimStorePlain]: Start of recursive call 454: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:13,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 79 [2018-10-27 04:50:13,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-10-27 04:50:13,585 INFO L267 ElimStorePlain]: Start of recursive call 458: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,598 INFO L267 ElimStorePlain]: Start of recursive call 457: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:13,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-10-27 04:50:13,729 INFO L267 ElimStorePlain]: Start of recursive call 459: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-10-27 04:50:13,734 INFO L267 ElimStorePlain]: Start of recursive call 460: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 76 [2018-10-27 04:50:13,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-10-27 04:50:13,913 INFO L267 ElimStorePlain]: Start of recursive call 462: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,925 INFO L267 ElimStorePlain]: Start of recursive call 461: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:13,944 INFO L267 ElimStorePlain]: Start of recursive call 448: 13 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:13,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-10-27 04:50:13,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-10-27 04:50:13,954 INFO L267 ElimStorePlain]: Start of recursive call 464: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-27 04:50:13,970 INFO L267 ElimStorePlain]: Start of recursive call 465: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,976 INFO L267 ElimStorePlain]: Start of recursive call 463: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:13,996 INFO L267 ElimStorePlain]: Start of recursive call 442: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:14,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-10-27 04:50:14,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:14,043 INFO L267 ElimStorePlain]: Start of recursive call 467: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-10-27 04:50:14,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-27 04:50:14,083 INFO L267 ElimStorePlain]: Start of recursive call 469: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,089 INFO L267 ElimStorePlain]: Start of recursive call 468: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,097 INFO L267 ElimStorePlain]: Start of recursive call 466: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2018-10-27 04:50:14,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:14,126 INFO L267 ElimStorePlain]: Start of recursive call 471: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-10-27 04:50:14,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-27 04:50:14,145 INFO L267 ElimStorePlain]: Start of recursive call 473: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,150 INFO L267 ElimStorePlain]: Start of recursive call 472: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,156 INFO L267 ElimStorePlain]: Start of recursive call 470: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 81 [2018-10-27 04:50:14,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:14,194 INFO L267 ElimStorePlain]: Start of recursive call 475: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2018-10-27 04:50:14,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:14,212 INFO L267 ElimStorePlain]: Start of recursive call 477: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 04:50:14,221 INFO L267 ElimStorePlain]: Start of recursive call 478: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,224 INFO L267 ElimStorePlain]: Start of recursive call 476: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,231 INFO L267 ElimStorePlain]: Start of recursive call 474: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 80 [2018-10-27 04:50:14,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:14,263 INFO L267 ElimStorePlain]: Start of recursive call 480: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-10-27 04:50:14,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 66 [2018-10-27 04:50:14,306 INFO L267 ElimStorePlain]: Start of recursive call 482: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 70 [2018-10-27 04:50:14,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-10-27 04:50:14,364 INFO L267 ElimStorePlain]: Start of recursive call 484: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-27 04:50:14,369 INFO L267 ElimStorePlain]: Start of recursive call 485: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,380 INFO L267 ElimStorePlain]: Start of recursive call 483: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,408 INFO L267 ElimStorePlain]: Start of recursive call 481: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-10-27 04:50:14,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-10-27 04:50:14,420 INFO L267 ElimStorePlain]: Start of recursive call 487: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-10-27 04:50:14,438 INFO L267 ElimStorePlain]: Start of recursive call 488: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-27 04:50:14,452 INFO L267 ElimStorePlain]: Start of recursive call 489: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,458 INFO L267 ElimStorePlain]: Start of recursive call 486: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-10-27 04:50:14,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:14,466 INFO L267 ElimStorePlain]: Start of recursive call 491: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-10-27 04:50:14,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-10-27 04:50:14,495 INFO L267 ElimStorePlain]: Start of recursive call 493: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:14,499 INFO L267 ElimStorePlain]: Start of recursive call 494: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,509 INFO L267 ElimStorePlain]: Start of recursive call 492: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,515 INFO L267 ElimStorePlain]: Start of recursive call 490: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,532 INFO L267 ElimStorePlain]: Start of recursive call 479: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:14,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 106 [2018-10-27 04:50:14,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:14,581 INFO L267 ElimStorePlain]: Start of recursive call 496: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2018-10-27 04:50:14,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-10-27 04:50:14,604 INFO L267 ElimStorePlain]: Start of recursive call 498: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:14,610 INFO L267 ElimStorePlain]: Start of recursive call 499: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,613 INFO L267 ElimStorePlain]: Start of recursive call 497: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,620 INFO L267 ElimStorePlain]: Start of recursive call 495: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 76 [2018-10-27 04:50:14,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:14,652 INFO L267 ElimStorePlain]: Start of recursive call 501: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-10-27 04:50:14,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:14,685 INFO L267 ElimStorePlain]: Start of recursive call 503: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 04:50:14,695 INFO L267 ElimStorePlain]: Start of recursive call 504: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,699 INFO L267 ElimStorePlain]: Start of recursive call 502: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-10-27 04:50:14,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-10-27 04:50:14,740 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:14,741 INFO L267 ElimStorePlain]: Start of recursive call 507: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-10-27 04:50:14,749 INFO L267 ElimStorePlain]: Start of recursive call 508: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:14,765 INFO L267 ElimStorePlain]: Start of recursive call 506: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:14,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-10-27 04:50:14,826 INFO L267 ElimStorePlain]: Start of recursive call 509: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 76 [2018-10-27 04:50:14,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2018-10-27 04:50:14,993 INFO L267 ElimStorePlain]: Start of recursive call 511: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:14,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-10-27 04:50:14,998 INFO L267 ElimStorePlain]: Start of recursive call 512: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2018-10-27 04:50:15,043 INFO L267 ElimStorePlain]: Start of recursive call 513: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:15,065 INFO L267 ElimStorePlain]: Start of recursive call 510: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:15,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 67 [2018-10-27 04:50:15,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-10-27 04:50:15,144 INFO L267 ElimStorePlain]: Start of recursive call 515: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:15,147 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:15,147 INFO L267 ElimStorePlain]: Start of recursive call 516: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,164 INFO L267 ElimStorePlain]: Start of recursive call 514: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:15,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-10-27 04:50:15,210 INFO L267 ElimStorePlain]: Start of recursive call 517: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-10-27 04:50:15,248 INFO L267 ElimStorePlain]: Start of recursive call 518: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-10-27 04:50:15,287 INFO L267 ElimStorePlain]: Start of recursive call 519: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 68 [2018-10-27 04:50:15,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2018-10-27 04:50:15,386 INFO L267 ElimStorePlain]: Start of recursive call 521: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2018-10-27 04:50:15,390 INFO L267 ElimStorePlain]: Start of recursive call 522: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,393 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:15,393 INFO L267 ElimStorePlain]: Start of recursive call 523: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-10-27 04:50:15,424 INFO L267 ElimStorePlain]: Start of recursive call 524: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:15,433 INFO L267 ElimStorePlain]: Start of recursive call 520: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:15,443 INFO L267 ElimStorePlain]: Start of recursive call 505: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:15,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-10-27 04:50:15,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:15,503 INFO L267 ElimStorePlain]: Start of recursive call 526: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-10-27 04:50:15,619 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:15,619 INFO L267 ElimStorePlain]: Start of recursive call 528: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-10-27 04:50:15,628 INFO L267 ElimStorePlain]: Start of recursive call 529: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:15,639 INFO L267 ElimStorePlain]: Start of recursive call 527: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:15,647 INFO L267 ElimStorePlain]: Start of recursive call 525: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:15,666 INFO L267 ElimStorePlain]: Start of recursive call 500: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:15,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 77 [2018-10-27 04:50:15,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:15,699 INFO L267 ElimStorePlain]: Start of recursive call 531: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 49 treesize of output 51 [2018-10-27 04:50:15,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 46 [2018-10-27 04:50:15,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:15,742 INFO L267 ElimStorePlain]: Start of recursive call 534: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:15,745 INFO L267 ElimStorePlain]: Start of recursive call 535: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,758 INFO L267 ElimStorePlain]: Start of recursive call 533: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:15,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-10-27 04:50:15,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:15,809 INFO L267 ElimStorePlain]: Start of recursive call 537: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:15,813 INFO L267 ElimStorePlain]: Start of recursive call 538: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,823 INFO L267 ElimStorePlain]: Start of recursive call 536: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:15,840 INFO L267 ElimStorePlain]: Start of recursive call 532: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:15,851 INFO L267 ElimStorePlain]: Start of recursive call 530: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:15,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-10-27 04:50:15,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:15,889 INFO L267 ElimStorePlain]: Start of recursive call 540: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 27 [2018-10-27 04:50:15,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-10-27 04:50:15,911 INFO L267 ElimStorePlain]: Start of recursive call 542: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-27 04:50:15,921 INFO L267 ElimStorePlain]: Start of recursive call 543: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,924 INFO L267 ElimStorePlain]: Start of recursive call 541: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,931 INFO L267 ElimStorePlain]: Start of recursive call 539: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 77 [2018-10-27 04:50:15,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:15,959 INFO L267 ElimStorePlain]: Start of recursive call 545: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:15,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 53 treesize of output 55 [2018-10-27 04:50:15,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 50 [2018-10-27 04:50:16,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:16,015 INFO L267 ElimStorePlain]: Start of recursive call 548: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-10-27 04:50:16,019 INFO L267 ElimStorePlain]: Start of recursive call 549: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,032 INFO L267 ElimStorePlain]: Start of recursive call 547: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-10-27 04:50:16,049 INFO L267 ElimStorePlain]: Start of recursive call 550: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-10-27 04:50:16,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-27 04:50:16,089 INFO L267 ElimStorePlain]: Start of recursive call 552: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-10-27 04:50:16,093 INFO L267 ElimStorePlain]: Start of recursive call 553: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,105 INFO L267 ElimStorePlain]: Start of recursive call 551: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,114 INFO L267 ElimStorePlain]: Start of recursive call 546: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-10-27 04:50:16,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-27 04:50:16,126 INFO L267 ElimStorePlain]: Start of recursive call 555: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,134 INFO L267 ElimStorePlain]: Start of recursive call 554: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 91 [2018-10-27 04:50:16,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 73 [2018-10-27 04:50:16,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-10-27 04:50:16,181 INFO L267 ElimStorePlain]: Start of recursive call 558: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:16,184 INFO L267 ElimStorePlain]: Start of recursive call 559: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,200 INFO L267 ElimStorePlain]: Start of recursive call 557: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 73 [2018-10-27 04:50:16,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:16,322 INFO L267 ElimStorePlain]: Start of recursive call 561: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-10-27 04:50:16,325 INFO L267 ElimStorePlain]: Start of recursive call 562: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,338 INFO L267 ElimStorePlain]: Start of recursive call 560: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-10-27 04:50:16,434 INFO L267 ElimStorePlain]: Start of recursive call 563: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 73 [2018-10-27 04:50:16,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-10-27 04:50:16,538 INFO L267 ElimStorePlain]: Start of recursive call 565: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-27 04:50:16,543 INFO L267 ElimStorePlain]: Start of recursive call 566: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,558 INFO L267 ElimStorePlain]: Start of recursive call 564: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 70 [2018-10-27 04:50:16,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-27 04:50:16,652 INFO L267 ElimStorePlain]: Start of recursive call 568: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-10-27 04:50:16,657 INFO L267 ElimStorePlain]: Start of recursive call 569: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,668 INFO L267 ElimStorePlain]: Start of recursive call 567: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,711 INFO L267 ElimStorePlain]: Start of recursive call 556: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,727 INFO L267 ElimStorePlain]: Start of recursive call 544: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:16,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-10-27 04:50:16,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:16,746 INFO L267 ElimStorePlain]: Start of recursive call 571: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-10-27 04:50:16,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-10-27 04:50:16,762 INFO L267 ElimStorePlain]: Start of recursive call 573: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-10-27 04:50:16,772 INFO L267 ElimStorePlain]: Start of recursive call 574: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,784 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2018-10-27 04:50:16,785 INFO L267 ElimStorePlain]: Start of recursive call 575: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:16,791 INFO L267 ElimStorePlain]: Start of recursive call 572: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:16,799 INFO L267 ElimStorePlain]: Start of recursive call 570: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:16,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 76 [2018-10-27 04:50:16,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:16,829 INFO L267 ElimStorePlain]: Start of recursive call 577: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-10-27 04:50:16,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 76 [2018-10-27 04:50:16,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-10-27 04:50:16,902 INFO L267 ElimStorePlain]: Start of recursive call 580: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:16,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:16,905 INFO L267 ElimStorePlain]: Start of recursive call 581: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,922 INFO L267 ElimStorePlain]: Start of recursive call 579: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:16,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2018-10-27 04:50:16,970 INFO L267 ElimStorePlain]: Start of recursive call 582: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2018-10-27 04:50:17,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:17,019 INFO L267 ElimStorePlain]: Start of recursive call 584: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-10-27 04:50:17,029 INFO L267 ElimStorePlain]: Start of recursive call 585: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:17,038 INFO L267 ElimStorePlain]: Start of recursive call 583: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 74 [2018-10-27 04:50:17,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-10-27 04:50:17,138 INFO L267 ElimStorePlain]: Start of recursive call 587: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,141 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:17,141 INFO L267 ElimStorePlain]: Start of recursive call 588: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-10-27 04:50:17,144 INFO L267 ElimStorePlain]: Start of recursive call 589: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 55 [2018-10-27 04:50:17,178 INFO L267 ElimStorePlain]: Start of recursive call 590: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:17,191 INFO L267 ElimStorePlain]: Start of recursive call 586: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-10-27 04:50:17,232 INFO L267 ElimStorePlain]: Start of recursive call 591: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,249 INFO L267 ElimStorePlain]: Start of recursive call 578: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-10-27 04:50:17,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:17,255 INFO L267 ElimStorePlain]: Start of recursive call 593: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-10-27 04:50:17,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:17,282 INFO L267 ElimStorePlain]: Start of recursive call 595: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-10-27 04:50:17,290 INFO L267 ElimStorePlain]: Start of recursive call 596: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:17,298 INFO L267 ElimStorePlain]: Start of recursive call 594: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,304 INFO L267 ElimStorePlain]: Start of recursive call 592: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-10-27 04:50:17,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-10-27 04:50:17,314 INFO L267 ElimStorePlain]: Start of recursive call 598: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-10-27 04:50:17,330 INFO L267 ElimStorePlain]: Start of recursive call 599: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-27 04:50:17,345 INFO L267 ElimStorePlain]: Start of recursive call 600: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,351 INFO L267 ElimStorePlain]: Start of recursive call 597: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,366 INFO L267 ElimStorePlain]: Start of recursive call 576: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:17,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2018-10-27 04:50:17,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:17,397 INFO L267 ElimStorePlain]: Start of recursive call 602: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-10-27 04:50:17,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-10-27 04:50:17,414 INFO L267 ElimStorePlain]: Start of recursive call 604: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:17,421 INFO L267 ElimStorePlain]: Start of recursive call 605: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,425 INFO L267 ElimStorePlain]: Start of recursive call 603: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,432 INFO L267 ElimStorePlain]: Start of recursive call 601: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-10-27 04:50:17,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:17,454 INFO L267 ElimStorePlain]: Start of recursive call 607: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 33 [2018-10-27 04:50:17,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-10-27 04:50:17,489 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2018-10-27 04:50:17,490 INFO L267 ElimStorePlain]: Start of recursive call 610: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:17,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:17,493 INFO L267 ElimStorePlain]: Start of recursive call 611: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,501 INFO L267 ElimStorePlain]: Start of recursive call 609: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2018-10-27 04:50:17,544 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-10-27 04:50:17,544 INFO L267 ElimStorePlain]: Start of recursive call 613: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:17,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 04:50:17,547 INFO L267 ElimStorePlain]: Start of recursive call 614: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,551 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:17,551 INFO L267 ElimStorePlain]: Start of recursive call 615: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,575 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2018-10-27 04:50:17,575 INFO L267 ElimStorePlain]: Start of recursive call 616: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:17,584 INFO L267 ElimStorePlain]: Start of recursive call 612: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,590 INFO L267 ElimStorePlain]: Start of recursive call 608: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,595 INFO L267 ElimStorePlain]: Start of recursive call 606: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2018-10-27 04:50:17,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:17,616 INFO L267 ElimStorePlain]: Start of recursive call 618: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 51 [2018-10-27 04:50:17,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-10-27 04:50:17,643 INFO L267 ElimStorePlain]: Start of recursive call 620: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-10-27 04:50:17,662 INFO L267 ElimStorePlain]: Start of recursive call 621: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-10-27 04:50:17,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2018-10-27 04:50:17,709 INFO L267 ElimStorePlain]: Start of recursive call 623: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:17,712 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:17,713 INFO L267 ElimStorePlain]: Start of recursive call 624: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,721 INFO L267 ElimStorePlain]: Start of recursive call 622: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:17,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 49 [2018-10-27 04:50:17,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-10-27 04:50:17,787 INFO L267 ElimStorePlain]: Start of recursive call 626: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-27 04:50:17,791 INFO L267 ElimStorePlain]: Start of recursive call 627: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,793 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:17,794 INFO L267 ElimStorePlain]: Start of recursive call 628: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2018-10-27 04:50:17,821 INFO L267 ElimStorePlain]: Start of recursive call 629: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:17,832 INFO L267 ElimStorePlain]: Start of recursive call 625: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:17,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-10-27 04:50:17,851 INFO L267 ElimStorePlain]: Start of recursive call 630: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-10-27 04:50:17,854 INFO L267 ElimStorePlain]: Start of recursive call 631: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,863 INFO L267 ElimStorePlain]: Start of recursive call 619: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:17,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-10-27 04:50:17,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:17,871 INFO L267 ElimStorePlain]: Start of recursive call 633: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-10-27 04:50:17,880 INFO L267 ElimStorePlain]: Start of recursive call 634: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,884 INFO L267 ElimStorePlain]: Start of recursive call 632: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-10-27 04:50:17,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:17,892 INFO L267 ElimStorePlain]: Start of recursive call 636: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:17,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2018-10-27 04:50:18,054 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-27 04:50:18,056 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:18,056 INFO L267 ElimStorePlain]: Start of recursive call 638: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2018-10-27 04:50:18,064 INFO L267 ElimStorePlain]: Start of recursive call 639: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:18,071 INFO L267 ElimStorePlain]: Start of recursive call 637: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:18,077 INFO L267 ElimStorePlain]: Start of recursive call 635: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:18,093 INFO L267 ElimStorePlain]: Start of recursive call 617: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:18,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-10-27 04:50:18,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:18,124 INFO L267 ElimStorePlain]: Start of recursive call 641: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 33 [2018-10-27 04:50:18,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-10-27 04:50:18,161 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:18,161 INFO L267 ElimStorePlain]: Start of recursive call 644: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-10-27 04:50:18,168 INFO L267 ElimStorePlain]: Start of recursive call 645: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,173 INFO L267 ElimStorePlain]: Start of recursive call 643: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,177 INFO L267 ElimStorePlain]: Start of recursive call 642: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,185 INFO L267 ElimStorePlain]: Start of recursive call 640: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 80 [2018-10-27 04:50:18,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:18,218 INFO L267 ElimStorePlain]: Start of recursive call 647: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-10-27 04:50:18,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2018-10-27 04:50:18,262 INFO L267 ElimStorePlain]: Start of recursive call 649: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 67 [2018-10-27 04:50:18,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-10-27 04:50:18,347 INFO L267 ElimStorePlain]: Start of recursive call 651: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:18,352 INFO L267 ElimStorePlain]: Start of recursive call 652: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,367 INFO L267 ElimStorePlain]: Start of recursive call 650: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 70 [2018-10-27 04:50:18,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-27 04:50:18,434 INFO L267 ElimStorePlain]: Start of recursive call 654: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-10-27 04:50:18,439 INFO L267 ElimStorePlain]: Start of recursive call 655: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,451 INFO L267 ElimStorePlain]: Start of recursive call 653: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,480 INFO L267 ElimStorePlain]: Start of recursive call 648: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-10-27 04:50:18,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 04:50:18,487 INFO L267 ElimStorePlain]: Start of recursive call 657: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:18,494 INFO L267 ElimStorePlain]: Start of recursive call 658: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,498 INFO L267 ElimStorePlain]: Start of recursive call 656: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-10-27 04:50:18,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:18,505 INFO L267 ElimStorePlain]: Start of recursive call 660: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-10-27 04:50:18,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:18,534 INFO L267 ElimStorePlain]: Start of recursive call 662: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-10-27 04:50:18,539 INFO L267 ElimStorePlain]: Start of recursive call 663: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,549 INFO L267 ElimStorePlain]: Start of recursive call 661: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,555 INFO L267 ElimStorePlain]: Start of recursive call 659: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,573 INFO L267 ElimStorePlain]: Start of recursive call 646: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:18,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 80 [2018-10-27 04:50:18,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:18,618 INFO L267 ElimStorePlain]: Start of recursive call 665: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-10-27 04:50:18,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:18,650 INFO L267 ElimStorePlain]: Start of recursive call 667: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 04:50:18,660 INFO L267 ElimStorePlain]: Start of recursive call 668: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,663 INFO L267 ElimStorePlain]: Start of recursive call 666: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-10-27 04:50:18,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:18,671 INFO L267 ElimStorePlain]: Start of recursive call 670: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-10-27 04:50:18,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-10-27 04:50:18,698 INFO L267 ElimStorePlain]: Start of recursive call 672: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:18,703 INFO L267 ElimStorePlain]: Start of recursive call 673: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,712 INFO L267 ElimStorePlain]: Start of recursive call 671: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,718 INFO L267 ElimStorePlain]: Start of recursive call 669: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 81 [2018-10-27 04:50:18,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2018-10-27 04:50:18,732 INFO L267 ElimStorePlain]: Start of recursive call 675: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2018-10-27 04:50:18,759 INFO L267 ElimStorePlain]: Start of recursive call 676: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2018-10-27 04:50:18,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-10-27 04:50:18,797 INFO L267 ElimStorePlain]: Start of recursive call 678: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:18,801 INFO L267 ElimStorePlain]: Start of recursive call 679: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,813 INFO L267 ElimStorePlain]: Start of recursive call 677: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 67 [2018-10-27 04:50:18,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:18,852 INFO L267 ElimStorePlain]: Start of recursive call 681: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-10-27 04:50:18,857 INFO L267 ElimStorePlain]: Start of recursive call 682: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,870 INFO L267 ElimStorePlain]: Start of recursive call 680: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-10-27 04:50:18,884 INFO L267 ElimStorePlain]: Start of recursive call 683: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,893 INFO L267 ElimStorePlain]: Start of recursive call 674: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,910 INFO L267 ElimStorePlain]: Start of recursive call 664: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:18,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2018-10-27 04:50:18,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:18,939 INFO L267 ElimStorePlain]: Start of recursive call 685: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 33 [2018-10-27 04:50:18,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-10-27 04:50:18,973 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:18,974 INFO L267 ElimStorePlain]: Start of recursive call 688: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-27 04:50:18,979 INFO L267 ElimStorePlain]: Start of recursive call 689: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,987 INFO L267 ElimStorePlain]: Start of recursive call 687: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:18,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-10-27 04:50:18,996 INFO L267 ElimStorePlain]: Start of recursive call 690: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-10-27 04:50:19,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-27 04:50:19,019 INFO L267 ElimStorePlain]: Start of recursive call 692: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,023 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:19,023 INFO L267 ElimStorePlain]: Start of recursive call 693: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,027 INFO L267 ElimStorePlain]: Start of recursive call 691: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,030 INFO L267 ElimStorePlain]: Start of recursive call 686: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,036 INFO L267 ElimStorePlain]: Start of recursive call 684: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 58 [2018-10-27 04:50:19,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:19,066 INFO L267 ElimStorePlain]: Start of recursive call 695: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 33 [2018-10-27 04:50:19,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-10-27 04:50:19,089 INFO L267 ElimStorePlain]: Start of recursive call 697: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-10-27 04:50:19,112 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:19,112 INFO L267 ElimStorePlain]: Start of recursive call 699: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-27 04:50:19,117 INFO L267 ElimStorePlain]: Start of recursive call 700: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,122 INFO L267 ElimStorePlain]: Start of recursive call 698: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2018-10-27 04:50:19,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2018-10-27 04:50:19,166 INFO L267 ElimStorePlain]: Start of recursive call 702: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:19,169 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:19,169 INFO L267 ElimStorePlain]: Start of recursive call 703: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-10-27 04:50:19,179 INFO L267 ElimStorePlain]: Start of recursive call 704: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:19,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-27 04:50:19,205 INFO L267 ElimStorePlain]: Start of recursive call 705: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,208 INFO L267 ElimStorePlain]: Start of recursive call 701: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,211 INFO L267 ElimStorePlain]: Start of recursive call 696: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,218 INFO L267 ElimStorePlain]: Start of recursive call 694: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 85 [2018-10-27 04:50:19,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:19,260 INFO L267 ElimStorePlain]: Start of recursive call 707: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2018-10-27 04:50:19,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:19,281 INFO L267 ElimStorePlain]: Start of recursive call 709: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 04:50:19,290 INFO L267 ElimStorePlain]: Start of recursive call 710: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,293 INFO L267 ElimStorePlain]: Start of recursive call 708: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,301 INFO L267 ElimStorePlain]: Start of recursive call 706: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 76 [2018-10-27 04:50:19,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:19,340 INFO L267 ElimStorePlain]: Start of recursive call 712: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-10-27 04:50:19,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-10-27 04:50:19,376 INFO L267 ElimStorePlain]: Start of recursive call 714: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-10-27 04:50:19,394 INFO L267 ElimStorePlain]: Start of recursive call 715: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-27 04:50:19,409 INFO L267 ElimStorePlain]: Start of recursive call 716: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,416 INFO L267 ElimStorePlain]: Start of recursive call 713: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 53 treesize of output 55 [2018-10-27 04:50:19,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 52 [2018-10-27 04:50:19,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2018-10-27 04:50:19,492 INFO L267 ElimStorePlain]: Start of recursive call 719: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-10-27 04:50:19,496 INFO L267 ElimStorePlain]: Start of recursive call 720: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-10-27 04:50:19,500 INFO L267 ElimStorePlain]: Start of recursive call 721: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 42 [2018-10-27 04:50:19,552 INFO L267 ElimStorePlain]: Start of recursive call 722: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:19,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2018-10-27 04:50:19,561 INFO L267 ElimStorePlain]: Start of recursive call 723: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:19,583 INFO L267 ElimStorePlain]: Start of recursive call 718: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:19,612 INFO L267 ElimStorePlain]: Start of recursive call 717: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:19,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 91 [2018-10-27 04:50:19,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2018-10-27 04:50:19,635 INFO L267 ElimStorePlain]: Start of recursive call 725: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 76 [2018-10-27 04:50:19,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:19,770 INFO L267 ElimStorePlain]: Start of recursive call 727: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:19,777 INFO L267 ElimStorePlain]: Start of recursive call 728: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:19,964 INFO L267 ElimStorePlain]: Start of recursive call 726: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:20,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 81 [2018-10-27 04:50:20,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-10-27 04:50:20,176 INFO L267 ElimStorePlain]: Start of recursive call 730: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:20,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-10-27 04:50:20,182 INFO L267 ElimStorePlain]: Start of recursive call 731: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:20,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2018-10-27 04:50:20,236 INFO L267 ElimStorePlain]: Start of recursive call 732: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:20,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 58 [2018-10-27 04:50:20,246 INFO L267 ElimStorePlain]: Start of recursive call 733: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:20,266 INFO L267 ElimStorePlain]: Start of recursive call 729: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:20,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 81 [2018-10-27 04:50:20,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-10-27 04:50:20,491 INFO L267 ElimStorePlain]: Start of recursive call 735: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:20,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-10-27 04:50:20,498 INFO L267 ElimStorePlain]: Start of recursive call 736: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:20,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2018-10-27 04:50:20,554 INFO L267 ElimStorePlain]: Start of recursive call 737: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:20,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 58 [2018-10-27 04:50:20,565 INFO L267 ElimStorePlain]: Start of recursive call 738: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:20,592 INFO L267 ElimStorePlain]: Start of recursive call 734: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:20,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 78 [2018-10-27 04:50:20,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2018-10-27 04:50:20,925 INFO L267 ElimStorePlain]: Start of recursive call 740: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:20,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 38 [2018-10-27 04:50:20,935 INFO L267 ElimStorePlain]: Start of recursive call 741: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:20,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-10-27 04:50:20,985 INFO L267 ElimStorePlain]: Start of recursive call 742: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:20,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-27 04:50:20,990 INFO L267 ElimStorePlain]: Start of recursive call 743: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,007 INFO L267 ElimStorePlain]: Start of recursive call 739: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:21,019 INFO L267 ElimStorePlain]: Start of recursive call 724: 13 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:21,038 INFO L267 ElimStorePlain]: Start of recursive call 711: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:21,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2018-10-27 04:50:21,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:21,060 INFO L267 ElimStorePlain]: Start of recursive call 745: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2018-10-27 04:50:21,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-10-27 04:50:21,096 INFO L267 ElimStorePlain]: Start of recursive call 747: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 46 [2018-10-27 04:50:21,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2018-10-27 04:50:21,191 INFO L267 ElimStorePlain]: Start of recursive call 749: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:21,193 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:21,193 INFO L267 ElimStorePlain]: Start of recursive call 750: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,205 INFO L267 ElimStorePlain]: Start of recursive call 748: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:21,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2018-10-27 04:50:21,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2018-10-27 04:50:21,367 INFO L267 ElimStorePlain]: Start of recursive call 752: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:21,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 38 [2018-10-27 04:50:21,378 INFO L267 ElimStorePlain]: Start of recursive call 753: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:21,410 INFO L267 ElimStorePlain]: Start of recursive call 751: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:21,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-10-27 04:50:21,516 INFO L267 ElimStorePlain]: Start of recursive call 754: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-10-27 04:50:21,521 INFO L267 ElimStorePlain]: Start of recursive call 755: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 55 [2018-10-27 04:50:21,629 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:21,630 INFO L267 ElimStorePlain]: Start of recursive call 757: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 21 [2018-10-27 04:50:21,636 INFO L267 ElimStorePlain]: Start of recursive call 758: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 28 [2018-10-27 04:50:21,642 INFO L267 ElimStorePlain]: Start of recursive call 759: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2018-10-27 04:50:21,671 INFO L267 ElimStorePlain]: Start of recursive call 760: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:21,683 INFO L267 ElimStorePlain]: Start of recursive call 756: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:21,711 INFO L267 ElimStorePlain]: Start of recursive call 746: 13 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:21,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 33 treesize of output 37 [2018-10-27 04:50:21,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-10-27 04:50:21,723 INFO L267 ElimStorePlain]: Start of recursive call 762: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-10-27 04:50:21,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2018-10-27 04:50:21,757 INFO L267 ElimStorePlain]: Start of recursive call 764: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:21,760 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:21,760 INFO L267 ElimStorePlain]: Start of recursive call 765: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,769 INFO L267 ElimStorePlain]: Start of recursive call 763: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:21,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2018-10-27 04:50:21,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2018-10-27 04:50:21,808 INFO L267 ElimStorePlain]: Start of recursive call 767: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:21,811 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:21,811 INFO L267 ElimStorePlain]: Start of recursive call 768: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,826 INFO L267 ElimStorePlain]: Start of recursive call 766: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:21,838 INFO L267 ElimStorePlain]: Start of recursive call 761: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:21,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2018-10-27 04:50:21,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-10-27 04:50:21,849 INFO L267 ElimStorePlain]: Start of recursive call 770: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,858 INFO L267 ElimStorePlain]: Start of recursive call 769: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,874 INFO L267 ElimStorePlain]: Start of recursive call 744: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:21,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-10-27 04:50:21,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:21,914 INFO L267 ElimStorePlain]: Start of recursive call 772: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-10-27 04:50:21,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:21,930 INFO L267 ElimStorePlain]: Start of recursive call 774: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-10-27 04:50:21,938 INFO L267 ElimStorePlain]: Start of recursive call 775: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,942 INFO L267 ElimStorePlain]: Start of recursive call 773: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,949 INFO L267 ElimStorePlain]: Start of recursive call 771: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:21,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 76 [2018-10-27 04:50:21,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:21,979 INFO L267 ElimStorePlain]: Start of recursive call 777: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-10-27 04:50:22,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-10-27 04:50:22,034 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-10-27 04:50:22,034 INFO L267 ElimStorePlain]: Start of recursive call 780: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:22,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:22,039 INFO L267 ElimStorePlain]: Start of recursive call 781: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,050 INFO L267 ElimStorePlain]: Start of recursive call 779: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:22,060 INFO L267 ElimStorePlain]: Start of recursive call 782: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,067 INFO L267 ElimStorePlain]: Start of recursive call 778: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 81 [2018-10-27 04:50:22,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2018-10-27 04:50:22,081 INFO L267 ElimStorePlain]: Start of recursive call 784: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 74 [2018-10-27 04:50:22,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-10-27 04:50:22,182 INFO L267 ElimStorePlain]: Start of recursive call 786: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,187 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-10-27 04:50:22,187 INFO L267 ElimStorePlain]: Start of recursive call 787: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,190 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:22,191 INFO L267 ElimStorePlain]: Start of recursive call 788: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,225 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 55 [2018-10-27 04:50:22,225 INFO L267 ElimStorePlain]: Start of recursive call 789: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:22,238 INFO L267 ElimStorePlain]: Start of recursive call 785: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 46 [2018-10-27 04:50:22,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:22,274 INFO L267 ElimStorePlain]: Start of recursive call 791: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,283 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-10-27 04:50:22,284 INFO L267 ElimStorePlain]: Start of recursive call 792: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:22,296 INFO L267 ElimStorePlain]: Start of recursive call 790: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-10-27 04:50:22,311 INFO L267 ElimStorePlain]: Start of recursive call 793: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-10-27 04:50:22,326 INFO L267 ElimStorePlain]: Start of recursive call 794: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,334 INFO L267 ElimStorePlain]: Start of recursive call 783: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-10-27 04:50:22,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 04:50:22,341 INFO L267 ElimStorePlain]: Start of recursive call 796: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:22,349 INFO L267 ElimStorePlain]: Start of recursive call 797: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,352 INFO L267 ElimStorePlain]: Start of recursive call 795: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,367 INFO L267 ElimStorePlain]: Start of recursive call 776: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:22,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 78 [2018-10-27 04:50:22,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:22,401 INFO L267 ElimStorePlain]: Start of recursive call 799: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2018-10-27 04:50:22,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-10-27 04:50:22,423 INFO L267 ElimStorePlain]: Start of recursive call 801: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-10-27 04:50:22,437 INFO L267 ElimStorePlain]: Start of recursive call 802: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:22,450 INFO L267 ElimStorePlain]: Start of recursive call 803: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,452 INFO L267 ElimStorePlain]: Start of recursive call 800: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,459 INFO L267 ElimStorePlain]: Start of recursive call 798: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 79 [2018-10-27 04:50:22,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:22,492 INFO L267 ElimStorePlain]: Start of recursive call 805: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-10-27 04:50:22,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2018-10-27 04:50:22,539 INFO L267 ElimStorePlain]: Start of recursive call 807: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-10-27 04:50:22,590 INFO L267 ElimStorePlain]: Start of recursive call 808: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2018-10-27 04:50:22,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:22,655 INFO L267 ElimStorePlain]: Start of recursive call 810: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:22,660 INFO L267 ElimStorePlain]: Start of recursive call 811: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,673 INFO L267 ElimStorePlain]: Start of recursive call 809: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:22,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-10-27 04:50:22,721 INFO L267 ElimStorePlain]: Start of recursive call 812: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 70 [2018-10-27 04:50:22,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:22,798 INFO L267 ElimStorePlain]: Start of recursive call 814: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:22,801 INFO L267 ElimStorePlain]: Start of recursive call 815: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,820 INFO L267 ElimStorePlain]: Start of recursive call 813: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:22,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 67 [2018-10-27 04:50:22,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:22,923 INFO L267 ElimStorePlain]: Start of recursive call 817: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,934 INFO L267 ElimStorePlain]: Start of recursive call 816: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:22,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-27 04:50:22,980 INFO L267 ElimStorePlain]: Start of recursive call 818: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:22,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-10-27 04:50:22,990 INFO L267 ElimStorePlain]: Start of recursive call 819: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,012 INFO L267 ElimStorePlain]: Start of recursive call 806: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:23,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-10-27 04:50:23,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-10-27 04:50:23,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:23,037 INFO L267 ElimStorePlain]: Start of recursive call 822: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 04:50:23,041 INFO L267 ElimStorePlain]: Start of recursive call 823: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,052 INFO L267 ElimStorePlain]: Start of recursive call 821: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:23,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:23,065 INFO L267 ElimStorePlain]: Start of recursive call 824: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,075 INFO L267 ElimStorePlain]: Start of recursive call 820: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:23,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-10-27 04:50:23,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-10-27 04:50:23,086 INFO L267 ElimStorePlain]: Start of recursive call 826: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-27 04:50:23,103 INFO L267 ElimStorePlain]: Start of recursive call 827: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,111 INFO L267 ElimStorePlain]: Start of recursive call 825: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,132 INFO L267 ElimStorePlain]: Start of recursive call 804: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:23,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 84 [2018-10-27 04:50:23,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:23,177 INFO L267 ElimStorePlain]: Start of recursive call 829: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2018-10-27 04:50:23,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:23,201 INFO L267 ElimStorePlain]: Start of recursive call 831: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 04:50:23,212 INFO L267 ElimStorePlain]: Start of recursive call 832: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,216 INFO L267 ElimStorePlain]: Start of recursive call 830: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,226 INFO L267 ElimStorePlain]: Start of recursive call 828: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-10-27 04:50:23,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:23,262 INFO L267 ElimStorePlain]: Start of recursive call 834: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-10-27 04:50:23,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-10-27 04:50:23,281 INFO L267 ElimStorePlain]: Start of recursive call 836: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:23,287 INFO L267 ElimStorePlain]: Start of recursive call 837: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,291 INFO L267 ElimStorePlain]: Start of recursive call 835: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,299 INFO L267 ElimStorePlain]: Start of recursive call 833: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 73 [2018-10-27 04:50:23,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:23,331 INFO L267 ElimStorePlain]: Start of recursive call 839: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-10-27 04:50:23,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 76 [2018-10-27 04:50:23,410 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-10-27 04:50:23,411 INFO L267 ElimStorePlain]: Start of recursive call 842: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:23,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:23,415 INFO L267 ElimStorePlain]: Start of recursive call 843: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,435 INFO L267 ElimStorePlain]: Start of recursive call 841: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-10-27 04:50:23,486 INFO L267 ElimStorePlain]: Start of recursive call 844: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-10-27 04:50:23,534 INFO L267 ElimStorePlain]: Start of recursive call 845: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-10-27 04:50:23,579 INFO L267 ElimStorePlain]: Start of recursive call 846: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 87 [2018-10-27 04:50:23,938 WARN L179 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 117 [2018-10-27 04:50:23,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2018-10-27 04:50:23,943 INFO L267 ElimStorePlain]: Start of recursive call 848: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:23,947 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:23,947 INFO L267 ElimStorePlain]: Start of recursive call 849: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:24,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-10-27 04:50:24,106 INFO L267 ElimStorePlain]: Start of recursive call 850: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:24,187 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 53 [2018-10-27 04:50:24,187 INFO L267 ElimStorePlain]: Start of recursive call 851: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:24,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 60 [2018-10-27 04:50:24,267 INFO L267 ElimStorePlain]: Start of recursive call 852: End of recursive call: and 4 xjuncts. [2018-10-27 04:50:24,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2018-10-27 04:50:24,341 INFO L267 ElimStorePlain]: Start of recursive call 853: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:24,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 65 [2018-10-27 04:50:24,430 INFO L267 ElimStorePlain]: Start of recursive call 854: End of recursive call: and 8 xjuncts. [2018-10-27 04:50:24,467 INFO L267 ElimStorePlain]: Start of recursive call 847: 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:24,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2018-10-27 04:50:24,509 INFO L267 ElimStorePlain]: Start of recursive call 855: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:24,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2018-10-27 04:50:24,608 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 56 [2018-10-27 04:50:24,609 INFO L267 ElimStorePlain]: Start of recursive call 857: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:24,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-10-27 04:50:24,612 INFO L267 ElimStorePlain]: Start of recursive call 858: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:24,615 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:24,616 INFO L267 ElimStorePlain]: Start of recursive call 859: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:24,649 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2018-10-27 04:50:24,649 INFO L267 ElimStorePlain]: Start of recursive call 860: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:24,664 INFO L267 ElimStorePlain]: Start of recursive call 856: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:24,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 68 [2018-10-27 04:50:24,762 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2018-10-27 04:50:24,762 INFO L267 ElimStorePlain]: Start of recursive call 862: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:24,765 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 04:50:24,765 INFO L267 ElimStorePlain]: Start of recursive call 863: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:24,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-10-27 04:50:24,791 INFO L267 ElimStorePlain]: Start of recursive call 864: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:24,801 INFO L267 ElimStorePlain]: Start of recursive call 861: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:24,810 INFO L267 ElimStorePlain]: Start of recursive call 840: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:24,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-10-27 04:50:24,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:24,815 INFO L267 ElimStorePlain]: Start of recursive call 866: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:24,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 04:50:24,824 INFO L267 ElimStorePlain]: Start of recursive call 867: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:24,828 INFO L267 ElimStorePlain]: Start of recursive call 865: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:24,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-10-27 04:50:24,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 04:50:24,833 INFO L267 ElimStorePlain]: Start of recursive call 869: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:24,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-10-27 04:50:24,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:24,861 INFO L267 ElimStorePlain]: Start of recursive call 871: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:24,868 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-10-27 04:50:24,869 INFO L267 ElimStorePlain]: Start of recursive call 872: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:24,878 INFO L267 ElimStorePlain]: Start of recursive call 870: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:24,883 INFO L267 ElimStorePlain]: Start of recursive call 868: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:24,901 INFO L267 ElimStorePlain]: Start of recursive call 838: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:25,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-10-27 04:50:25,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-27 04:50:25,205 INFO L267 ElimStorePlain]: Start of recursive call 874: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:25,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 32 [2018-10-27 04:50:25,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32 [2018-10-27 04:50:25,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 37 [2018-10-27 04:50:25,271 INFO L267 ElimStorePlain]: Start of recursive call 877: End of recursive call: and 8 xjuncts. [2018-10-27 04:50:25,430 INFO L303 Elim1Store]: Index analysis took 158 ms [2018-10-27 04:50:25,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 39 [2018-10-27 04:50:25,440 INFO L267 ElimStorePlain]: Start of recursive call 878: End of recursive call: and 8 xjuncts. [2018-10-27 04:50:25,447 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2018-10-27 04:50:25,447 INFO L267 ElimStorePlain]: Start of recursive call 879: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:25,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-10-27 04:50:25,526 INFO L267 ElimStorePlain]: Start of recursive call 880: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:25,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2018-10-27 04:50:25,537 INFO L267 ElimStorePlain]: Start of recursive call 881: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:25,578 INFO L267 ElimStorePlain]: Start of recursive call 876: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-27 04:50:25,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-10-27 04:50:25,653 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-10-27 04:50:25,654 INFO L267 ElimStorePlain]: Start of recursive call 883: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:25,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:25,658 INFO L267 ElimStorePlain]: Start of recursive call 884: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:25,674 INFO L267 ElimStorePlain]: Start of recursive call 882: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:50:25,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-10-27 04:50:25,717 INFO L267 ElimStorePlain]: Start of recursive call 885: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:25,749 INFO L267 ElimStorePlain]: Start of recursive call 875: 3 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-27 04:50:25,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2018-10-27 04:50:25,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-10-27 04:50:25,759 INFO L267 ElimStorePlain]: Start of recursive call 887: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:25,776 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2018-10-27 04:50:25,777 INFO L267 ElimStorePlain]: Start of recursive call 888: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:25,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-10-27 04:50:25,791 INFO L267 ElimStorePlain]: Start of recursive call 889: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:25,802 INFO L267 ElimStorePlain]: Start of recursive call 886: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:25,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 51 [2018-10-27 04:50:25,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-10-27 04:50:25,822 INFO L267 ElimStorePlain]: Start of recursive call 891: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:25,888 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-10-27 04:50:25,888 INFO L267 ElimStorePlain]: Start of recursive call 892: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:25,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2018-10-27 04:50:25,987 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-10-27 04:50:25,988 INFO L267 ElimStorePlain]: Start of recursive call 894: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:25,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:50:25,993 INFO L267 ElimStorePlain]: Start of recursive call 895: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:26,008 INFO L267 ElimStorePlain]: Start of recursive call 893: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:50:26,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-10-27 04:50:26,110 INFO L267 ElimStorePlain]: Start of recursive call 896: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:26,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-10-27 04:50:26,115 INFO L267 ElimStorePlain]: Start of recursive call 897: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:26,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-10-27 04:50:26,121 INFO L267 ElimStorePlain]: Start of recursive call 898: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:26,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 55 [2018-10-27 04:50:26,389 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 96 [2018-10-27 04:50:26,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 28 [2018-10-27 04:50:26,401 INFO L267 ElimStorePlain]: Start of recursive call 900: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:26,558 INFO L303 Elim1Store]: Index analysis took 157 ms [2018-10-27 04:50:26,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 30 [2018-10-27 04:50:26,761 INFO L267 ElimStorePlain]: Start of recursive call 901: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:27,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-10-27 04:50:27,060 INFO L267 ElimStorePlain]: Start of recursive call 902: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:27,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-10-27 04:50:27,064 INFO L267 ElimStorePlain]: Start of recursive call 903: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:27,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 41 [2018-10-27 04:50:27,234 INFO L267 ElimStorePlain]: Start of recursive call 904: End of recursive call: and 8 xjuncts. [2018-10-27 04:50:27,242 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2018-10-27 04:50:27,243 INFO L267 ElimStorePlain]: Start of recursive call 905: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:27,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2018-10-27 04:50:27,406 INFO L267 ElimStorePlain]: Start of recursive call 906: End of recursive call: and 8 xjuncts. [2018-10-27 04:50:27,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 36 [2018-10-27 04:50:27,423 INFO L267 ElimStorePlain]: Start of recursive call 907: End of recursive call: and 8 xjuncts. [2018-10-27 04:50:27,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2018-10-27 04:50:27,565 INFO L267 ElimStorePlain]: Start of recursive call 908: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:27,574 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2018-10-27 04:50:27,575 INFO L267 ElimStorePlain]: Start of recursive call 909: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:27,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2018-10-27 04:50:27,677 INFO L267 ElimStorePlain]: Start of recursive call 910: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:27,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2018-10-27 04:50:27,764 INFO L267 ElimStorePlain]: Start of recursive call 911: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:27,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2018-10-27 04:50:27,773 INFO L267 ElimStorePlain]: Start of recursive call 912: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:27,819 INFO L267 ElimStorePlain]: Start of recursive call 899: 7 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-27 04:50:27,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-10-27 04:50:27,951 INFO L267 ElimStorePlain]: Start of recursive call 913: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:28,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 45 [2018-10-27 04:50:28,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-10-27 04:50:28,136 INFO L267 ElimStorePlain]: Start of recursive call 915: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:28,139 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-10-27 04:50:28,140 INFO L267 ElimStorePlain]: Start of recursive call 916: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:28,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-10-27 04:50:28,144 INFO L267 ElimStorePlain]: Start of recursive call 917: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:28,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-10-27 04:50:28,192 INFO L267 ElimStorePlain]: Start of recursive call 918: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:28,201 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-10-27 04:50:28,201 INFO L267 ElimStorePlain]: Start of recursive call 919: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:28,236 INFO L267 ElimStorePlain]: Start of recursive call 914: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:50:28,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 55 [2018-10-27 04:50:28,569 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 96 [2018-10-27 04:50:28,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2018-10-27 04:50:28,582 INFO L267 ElimStorePlain]: Start of recursive call 921: End of recursive call: and 4 xjuncts. [2018-10-27 04:50:28,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 33 [2018-10-27 04:50:28,595 INFO L267 ElimStorePlain]: Start of recursive call 922: End of recursive call: and 4 xjuncts. [2018-10-27 04:50:28,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-10-27 04:50:28,791 INFO L267 ElimStorePlain]: Start of recursive call 923: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:28,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-10-27 04:50:28,796 INFO L267 ElimStorePlain]: Start of recursive call 924: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:28,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 28 [2018-10-27 04:50:28,961 INFO L267 ElimStorePlain]: Start of recursive call 925: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:28,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 30 [2018-10-27 04:50:28,975 INFO L267 ElimStorePlain]: Start of recursive call 926: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:29,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2018-10-27 04:50:29,115 INFO L267 ElimStorePlain]: Start of recursive call 927: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:29,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2018-10-27 04:50:29,124 INFO L267 ElimStorePlain]: Start of recursive call 928: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:29,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2018-10-27 04:50:29,275 INFO L267 ElimStorePlain]: Start of recursive call 929: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:29,359 INFO L267 ElimStorePlain]: Start of recursive call 920: 7 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-27 04:50:29,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2018-10-27 04:50:29,542 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2018-10-27 04:50:29,542 INFO L267 ElimStorePlain]: Start of recursive call 931: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:29,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 39 [2018-10-27 04:50:29,560 INFO L267 ElimStorePlain]: Start of recursive call 932: End of recursive call: and 8 xjuncts. [2018-10-27 04:50:29,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 41 [2018-10-27 04:50:29,577 INFO L267 ElimStorePlain]: Start of recursive call 933: End of recursive call: and 8 xjuncts. [2018-10-27 04:50:29,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-10-27 04:50:29,676 INFO L267 ElimStorePlain]: Start of recursive call 934: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:29,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2018-10-27 04:50:29,685 INFO L267 ElimStorePlain]: Start of recursive call 935: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:29,731 INFO L267 ElimStorePlain]: Start of recursive call 930: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:50:29,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 52 [2018-10-27 04:50:30,020 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2018-10-27 04:50:30,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2018-10-27 04:50:30,033 INFO L267 ElimStorePlain]: Start of recursive call 937: End of recursive call: and 4 xjuncts. [2018-10-27 04:50:30,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2018-10-27 04:50:30,047 INFO L267 ElimStorePlain]: Start of recursive call 938: End of recursive call: and 4 xjuncts. [2018-10-27 04:50:30,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 04:50:30,225 INFO L267 ElimStorePlain]: Start of recursive call 939: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:30,233 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2018-10-27 04:50:30,234 INFO L267 ElimStorePlain]: Start of recursive call 940: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:30,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 04:50:30,379 INFO L267 ElimStorePlain]: Start of recursive call 941: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:30,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-27 04:50:30,384 INFO L267 ElimStorePlain]: Start of recursive call 942: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:30,495 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2018-10-27 04:50:30,495 INFO L267 ElimStorePlain]: Start of recursive call 943: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:30,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-10-27 04:50:30,633 INFO L267 ElimStorePlain]: Start of recursive call 944: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:30,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2018-10-27 04:50:30,644 INFO L267 ElimStorePlain]: Start of recursive call 945: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:30,830 INFO L477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2018-10-27 04:50:30,831 INFO L267 ElimStorePlain]: Start of recursive call 946: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:30,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2018-10-27 04:50:30,847 INFO L267 ElimStorePlain]: Start of recursive call 947: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:30,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 04:50:30,927 INFO L267 ElimStorePlain]: Start of recursive call 948: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:30,964 INFO L267 ElimStorePlain]: Start of recursive call 936: 7 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-27 04:50:31,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-10-27 04:50:31,184 INFO L267 ElimStorePlain]: Start of recursive call 949: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:31,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-10-27 04:50:31,187 INFO L267 ElimStorePlain]: Start of recursive call 950: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:31,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-10-27 04:50:31,191 INFO L267 ElimStorePlain]: Start of recursive call 951: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:31,239 INFO L267 ElimStorePlain]: Start of recursive call 890: 13 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-10-27 04:50:31,296 INFO L267 ElimStorePlain]: Start of recursive call 873: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-10-27 04:50:31,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-2 vars, End of recursive call: 13 dim-0 vars, and 13 xjuncts. [2018-10-27 04:50:31,420 INFO L202 ElimStorePlain]: Needed 951 recursive calls to eliminate 16 variables, input treesize:123, output treesize:163 [2018-10-27 04:50:33,601 WARN L179 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 106 DAG size of output: 55 [2018-10-27 04:50:34,066 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:50:34,067 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:50:34,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-10-27 04:50:34,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:34,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-10-27 04:50:34,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:34,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2018-10-27 04:50:34,109 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:34,113 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:50:34,114 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:50:34,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-10-27 04:50:34,116 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:34,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-10-27 04:50:34,143 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:34,147 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:50:34,149 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:50:34,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-10-27 04:50:34,151 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:34,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:34,166 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 14 variables, input treesize:107, output treesize:7 [2018-10-27 04:50:36,056 WARN L179 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2018-10-27 04:50:37,011 WARN L179 SmtUtils]: Spent 855.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-27 04:50:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 8 not checked. [2018-10-27 04:50:37,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:50:37,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 50 [2018-10-27 04:50:37,094 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:50:37,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-27 04:50:37,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-27 04:50:37,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2023, Unknown=16, NotChecked=372, Total=2550 [2018-10-27 04:50:37,095 INFO L87 Difference]: Start difference. First operand 386 states and 414 transitions. Second operand 31 states. [2018-10-27 04:50:38,387 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2018-10-27 04:50:44,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:44,880 INFO L93 Difference]: Finished difference Result 434 states and 466 transitions. [2018-10-27 04:50:44,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-27 04:50:44,884 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 89 [2018-10-27 04:50:44,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:44,886 INFO L225 Difference]: With dead ends: 434 [2018-10-27 04:50:44,886 INFO L226 Difference]: Without dead ends: 434 WARNING: YOUR LOGFILE WAS TOO LONG, SOME LINES IN THE MIDDLE WERE REMOVED. [2018-10-27 04:54:20,013 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:20,015 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:20,017 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:20,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-10-27 04:54:20,066 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:20,068 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:20,068 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:54:20,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-10-27 04:54:20,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:20,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:20,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-10-27 04:54:20,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-10-27 04:54:20,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-10-27 04:54:20,170 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:20,197 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:20,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:20,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:20,256 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:63, output treesize:9 [2018-10-27 04:54:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 19 not checked. [2018-10-27 04:54:20,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:54:21,190 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2018-10-27 04:54:22,002 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-10-27 04:54:22,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:54:22,006 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:54:22,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:54:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:54:22,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:54:22,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:54:22,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:22,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:54:22,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:22,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:22,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:54:22,187 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |c_old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) is different from true [2018-10-27 04:54:22,536 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_37 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)))) (and (= |c_#length| (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_37 v_prenex_36)) (= (select .cse0 alloc_or_die_slave_~ptr~0.base) (_ bv0 1)) (= (_ bv0 1) (select |c_old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store .cse0 alloc_or_die_slave_~ptr~0.base (_ bv1 1)) v_prenex_37) (_ bv0 1))))) is different from true [2018-10-27 04:54:22,617 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:22,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-10-27 04:54:22,632 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:22,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-10-27 04:54:22,647 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:22,649 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:22,652 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:22,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-10-27 04:54:22,674 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:22,699 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:22,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:22,757 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:22,759 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:22,760 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:22,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 44 [2018-10-27 04:54:22,801 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:22,803 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:22,805 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:22,806 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:22,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2018-10-27 04:54:22,807 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:22,825 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:22,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:22,868 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:52, output treesize:9 [2018-10-27 04:54:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 1 times theorem prover too weak. 6 trivial. 20 not checked. [2018-10-27 04:54:22,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:54:23,567 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2018-10-27 04:54:26,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:54:26,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 27 [2018-10-27 04:54:26,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-27 04:54:26,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-27 04:54:26,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=582, Unknown=13, NotChecked=260, Total=930 [2018-10-27 04:54:26,443 INFO L87 Difference]: Start difference. First operand 398 states and 424 transitions. Second operand 28 states. [2018-10-27 04:54:28,311 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_37 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)))) (and (= |c_#length| (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_37 v_prenex_36)) (= (select .cse0 alloc_or_die_slave_~ptr~0.base) (_ bv0 1)) (= (_ bv0 1) (select |c_old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store .cse0 alloc_or_die_slave_~ptr~0.base (_ bv1 1)) v_prenex_37) (_ bv0 1))))) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_28 (_ BitVec 32)) (v_prenex_29 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (let ((.cse2 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)))) (let ((.cse1 (store .cse2 v_prenex_29 (_ bv1 1)))) (and (= (bvadd (select .cse1 |dll_create_generic_~#dll~0.base|) (_ bv1 1)) (_ bv0 1)) (= |c_#length| (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_29 v_prenex_28) alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select .cse1 alloc_or_die_slave_~ptr~0.base) (_ bv0 1)) (= (_ bv0 1) (select |c_old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select .cse2 v_prenex_29) (_ bv0 1))))))) is different from true [2018-10-27 04:54:33,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:54:33,504 INFO L93 Difference]: Finished difference Result 448 states and 482 transitions. [2018-10-27 04:54:33,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 04:54:33,505 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 109 [2018-10-27 04:54:33,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:54:33,506 INFO L225 Difference]: With dead ends: 448 [2018-10-27 04:54:33,506 INFO L226 Difference]: Without dead ends: 448 [2018-10-27 04:54:33,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 193 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=95, Invalid=727, Unknown=14, NotChecked=354, Total=1190 [2018-10-27 04:54:33,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-10-27 04:54:33,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 400. [2018-10-27 04:54:33,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-10-27 04:54:33,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 426 transitions. [2018-10-27 04:54:33,512 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 426 transitions. Word has length 109 [2018-10-27 04:54:33,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:54:33,513 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 426 transitions. [2018-10-27 04:54:33,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-27 04:54:33,513 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 426 transitions. [2018-10-27 04:54:33,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-27 04:54:33,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:54:33,514 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:54:33,517 INFO L424 AbstractCegarLoop]: === Iteration 33 === [dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:54:33,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:54:33,518 INFO L82 PathProgramCache]: Analyzing trace with hash 556216158, now seen corresponding path program 1 times [2018-10-27 04:54:33,518 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:54:33,518 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/cvc4nyu Starting monitored process 41 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:54:33,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:54:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:54:34,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:54:34,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:54:34,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:34,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:34,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:54:34,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:54:34,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:34,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:34,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-10-27 04:54:34,488 WARN L854 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |c_#valid| (store |c_old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))) is different from true [2018-10-27 04:54:34,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:54:34,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:34,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:34,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-10-27 04:54:35,044 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:35,046 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:35,048 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:35,053 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:35,055 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:35,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 71 [2018-10-27 04:54:35,167 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2018-10-27 04:54:35,184 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:35,186 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:35,192 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:35,195 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:35,198 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:35,200 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:35,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 77 [2018-10-27 04:54:35,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 74 [2018-10-27 04:54:35,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 62 [2018-10-27 04:54:35,222 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:35,244 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:35,271 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:35,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:35,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:54:35,322 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2018-10-27 04:54:35,517 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:35,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-10-27 04:54:35,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:35,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-27 04:54:35,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:50 [2018-10-27 04:54:35,694 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2018-10-27 04:54:35,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:54:36,389 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2018-10-27 04:54:36,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-10-27 04:54:36,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:54:36,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-10-27 04:54:36,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:108 [2018-10-27 04:54:37,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:54:37,017 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:54:37,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:54:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:54:37,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:54:37,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:54:37,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:37,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:37,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:54:37,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:54:37,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:37,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:37,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-27 04:54:38,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:54:38,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:54:38,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:38,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:38,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:38,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:25 [2018-10-27 04:54:39,800 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_232| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_230| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_232| |v_alloc_or_die_slave_write~$Pointer$_#value.base_230|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))))) is different from true [2018-10-27 04:54:40,154 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_232| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_230| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_232| |v_alloc_or_die_slave_write~$Pointer$_#value.base_230|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|) c_dll_insert_slave_~next~0.base) (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)))) is different from true [2018-10-27 04:54:40,158 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)))) is different from true [2018-10-27 04:54:40,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-10-27 04:54:40,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-10-27 04:54:40,173 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:54:40,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:54:40,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:54:40,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:37 [2018-10-27 04:54:40,328 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_generic_ULTIMATE.dealloc_~addr.base (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv1 1)))) (let ((.cse0 (store .cse1 v_arrayElimCell_39 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 |alloc_or_die_slave_write~$Pointer$_#ptr.base|)) (= (_ bv0 1) (select |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base)) (= |c_#valid| (store (store .cse0 |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv0 1))) (= (select .cse1 v_arrayElimCell_39) (_ bv0 1)))))) is different from true [2018-10-27 04:54:40,376 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:40,378 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:40,381 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:40,387 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:40,388 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:40,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 69 [2018-10-27 04:54:40,495 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2018-10-27 04:54:40,508 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:40,510 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:40,512 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:40,518 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:40,520 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:40,522 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:40,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 85 [2018-10-27 04:54:40,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 80 [2018-10-27 04:54:40,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 66 [2018-10-27 04:54:40,551 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:40,572 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:40,598 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:40,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:40,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:54:40,650 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2018-10-27 04:54:41,027 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2018-10-27 04:54:41,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:54:41,884 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-10-27 04:54:42,480 WARN L179 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2018-10-27 04:54:42,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:54:42,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 40] total 61 [2018-10-27 04:54:42,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-27 04:54:42,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-27 04:54:42,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=3422, Unknown=26, NotChecked=610, Total=4290 [2018-10-27 04:54:42,843 INFO L87 Difference]: Start difference. First operand 400 states and 426 transitions. Second operand 62 states. [2018-10-27 04:54:47,717 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2018-10-27 04:54:49,078 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2018-10-27 04:54:50,681 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2018-10-27 04:55:02,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:55:02,955 INFO L93 Difference]: Finished difference Result 491 states and 539 transitions. [2018-10-27 04:55:02,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-27 04:55:02,956 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 110 [2018-10-27 04:55:02,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:55:02,958 INFO L225 Difference]: With dead ends: 491 [2018-10-27 04:55:02,958 INFO L226 Difference]: Without dead ends: 491 [2018-10-27 04:55:02,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 161 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2519 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=484, Invalid=7134, Unknown=58, NotChecked=880, Total=8556 [2018-10-27 04:55:02,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-10-27 04:55:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 435. [2018-10-27 04:55:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-10-27 04:55:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 480 transitions. [2018-10-27 04:55:02,968 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 480 transitions. Word has length 110 [2018-10-27 04:55:02,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:55:02,968 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 480 transitions. [2018-10-27 04:55:02,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-27 04:55:02,968 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 480 transitions. [2018-10-27 04:55:02,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-27 04:55:02,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:55:02,969 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:55:02,970 INFO L424 AbstractCegarLoop]: === Iteration 34 === [dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:55:02,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:55:02,977 INFO L82 PathProgramCache]: Analyzing trace with hash 62831805, now seen corresponding path program 1 times [2018-10-27 04:55:02,977 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:55:02,977 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/cvc4nyu Starting monitored process 43 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:55:03,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:55:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:55:03,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:55:03,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:55:03,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:03,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:55:03,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:03,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:55:03,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:55:03,825 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_master_#Ultimate.alloc_#res.base| (_ BitVec 32)) (|alloc_or_die_master_#Ultimate.alloc_~size| (_ BitVec 32))) (and (= (select |c_old(#valid)| |alloc_or_die_master_#Ultimate.alloc_#res.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |alloc_or_die_master_#Ultimate.alloc_#res.base| |alloc_or_die_master_#Ultimate.alloc_~size|)))) is different from true [2018-10-27 04:55:03,831 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:03,832 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:03,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:55:03,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:03,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-27 04:55:03,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:03,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:55:03,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-10-27 04:55:03,941 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |c_old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) is different from true [2018-10-27 04:55:03,951 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= (select (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| |c_dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) is different from true [2018-10-27 04:55:03,991 WARN L854 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| alloc_or_die_slave_~ptr~0.base (_ bv8 32)))) is different from true [2018-10-27 04:55:03,999 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|) (_ bv0 1)) (= |c_#length| (store (store (store |c_old(#length)| |c_dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) alloc_or_die_slave_~ptr~0.base (_ bv8 32))))) is different from true [2018-10-27 04:55:04,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:55:04,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:04,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-10-27 04:55:04,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:27, output treesize:26 [2018-10-27 04:55:04,025 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_generic_ULTIMATE.dealloc_~addr.base (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|) (_ bv0 1)) (= |c_#length| (store (store (store |c_old(#length)| dll_create_generic_ULTIMATE.dealloc_~addr.base |dll_create_generic_#Ultimate.alloc_~size|) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) alloc_or_die_slave_~ptr~0.base (_ bv8 32))) (= (_ bv0 1) (select |c_#valid| dll_create_generic_ULTIMATE.dealloc_~addr.base)))) is different from true [2018-10-27 04:55:04,057 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:04,058 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:04,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:55:04,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:04,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 24 [2018-10-27 04:55:04,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 30 [2018-10-27 04:55:04,130 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:04,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 22 treesize of output 49 [2018-10-27 04:55:04,165 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 16 xjuncts. [2018-10-27 04:55:04,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:55:04,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-10-27 04:55:04,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 17 treesize of output 28 [2018-10-27 04:55:04,451 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-10-27 04:55:04,496 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:55:04,585 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-27 04:55:04,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 7 xjuncts. [2018-10-27 04:55:04,706 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:41, output treesize:126 [2018-10-27 04:55:04,954 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:04,955 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:04,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-10-27 04:55:04,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:05,033 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:05,034 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:05,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-10-27 04:55:05,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:05,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:55:05,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:86, output treesize:38 [2018-10-27 04:55:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2018-10-27 04:55:05,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:55:05,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-10-27 04:55:05,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:06,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-10-27 04:55:06,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:06,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-27 04:55:06,062 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:06,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-10-27 04:55:06,113 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:82, output treesize:64 [2018-10-27 04:55:10,446 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-27 04:55:10,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:55:10,449 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:55:10,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:55:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:55:10,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:55:10,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:55:10,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:10,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:55:10,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:10,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:55:10,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-10-27 04:55:10,844 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:10,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-10-27 04:55:10,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:10,866 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:10,868 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:10,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-27 04:55:10,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:10,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:55:10,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-10-27 04:55:11,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:55:11,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:55:11,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:11,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:55:11,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:55:11,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:25 [2018-10-27 04:55:13,017 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_alloc_or_die_slave_write~$Pointer$_#value.base_257| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_259| (_ BitVec 32))) (and (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= (store |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_259| |v_alloc_or_die_slave_write~$Pointer$_#value.base_257|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |c_#memory_$Pointer$.base|) (= |c_#length| (store |c_old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv8 32))))) is different from true [2018-10-27 04:55:13,367 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_alloc_or_die_slave_write~$Pointer$_#value.base_257| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_259| (_ BitVec 32))) (and (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= (select (select (store |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_259| |v_alloc_or_die_slave_write~$Pointer$_#value.base_257|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|) c_dll_insert_slave_~next~0.base) (= |c_#length| (store |c_old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv8 32))))) is different from true [2018-10-27 04:55:13,371 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv8 32))))) is different from true [2018-10-27 04:55:13,378 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:13,380 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:13,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-10-27 04:55:13,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:13,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-10-27 04:55:13,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 04:55:13,403 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:55:13,417 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:55:13,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-27 04:55:13,433 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:46, output treesize:30 [2018-10-27 04:55:13,613 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_generic_ULTIMATE.dealloc_~addr.base (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_arrayElimCell_42 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (not (= |alloc_or_die_slave_write~$Pointer$_#ptr.base| dll_create_generic_ULTIMATE.dealloc_~addr.base)) (= (_ bv0 1) (select |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base)) (= (_ bv0 1) (select (store |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv1 1)) v_arrayElimCell_42)) (= |c_#length| (store (store (store |c_old(#length)| dll_create_generic_ULTIMATE.dealloc_~addr.base |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_42 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv8 32))))) is different from true [2018-10-27 04:55:13,695 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:13,699 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:13,703 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:13,703 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:55:13,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-10-27 04:55:13,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:13,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-10-27 04:55:13,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-10-27 04:55:13,801 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:13,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 45 [2018-10-27 04:55:13,826 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-10-27 04:55:13,909 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:55:13,957 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:55:14,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 04:55:14,117 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:57, output treesize:58 [2018-10-27 04:55:14,515 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2018-10-27 04:55:14,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:55:15,511 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-27 04:55:15,834 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-10-27 04:55:16,397 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-10-27 04:55:16,607 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:55:16,607 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:55:16,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-10-27 04:55:16,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:16,685 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:55:16,686 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:55:16,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-10-27 04:55:16,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:16,763 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:55:16,764 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:55:16,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-10-27 04:55:16,765 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:16,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-10-27 04:55:16,825 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:109, output treesize:76 [2018-10-27 04:55:24,659 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 04:55:24,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:55:24,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 41] total 54 [2018-10-27 04:55:24,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-27 04:55:24,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-27 04:55:24,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2385, Unknown=23, NotChecked=1070, Total=3660 [2018-10-27 04:55:24,680 INFO L87 Difference]: Start difference. First operand 435 states and 480 transitions. Second operand 55 states. [2018-10-27 04:55:29,557 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2018-10-27 04:55:30,623 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2018-10-27 04:55:31,056 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2018-10-27 04:55:31,779 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2018-10-27 04:55:32,729 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2018-10-27 04:55:33,374 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2018-10-27 04:55:34,054 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2018-10-27 04:55:35,962 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-10-27 04:55:36,729 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-10-27 04:55:38,261 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((dll_create_generic_ULTIMATE.dealloc_~addr.base (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_arrayElimCell_42 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (not (= |alloc_or_die_slave_write~$Pointer$_#ptr.base| dll_create_generic_ULTIMATE.dealloc_~addr.base)) (= (_ bv0 1) (select |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base)) (= (_ bv0 1) (select (store |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv1 1)) v_arrayElimCell_42)) (= |c_#length| (store (store (store |c_old(#length)| dll_create_generic_ULTIMATE.dealloc_~addr.base |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_42 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv8 32))))) (exists ((dll_create_generic_ULTIMATE.dealloc_~addr.base (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|) (_ bv0 1)) (= |c_#length| (store (store (store |c_old(#length)| dll_create_generic_ULTIMATE.dealloc_~addr.base |dll_create_generic_#Ultimate.alloc_~size|) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) alloc_or_die_slave_~ptr~0.base (_ bv8 32))) (= (_ bv0 1) (select |c_#valid| dll_create_generic_ULTIMATE.dealloc_~addr.base))))) is different from true [2018-10-27 04:55:38,473 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2018-10-27 04:55:39,288 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2018-10-27 04:55:52,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:55:52,341 INFO L93 Difference]: Finished difference Result 490 states and 543 transitions. [2018-10-27 04:55:52,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-27 04:55:52,342 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 111 [2018-10-27 04:55:52,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:55:52,344 INFO L225 Difference]: With dead ends: 490 [2018-10-27 04:55:52,345 INFO L226 Difference]: Without dead ends: 490 [2018-10-27 04:55:52,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 171 SyntacticMatches, 6 SemanticMatches, 88 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=386, Invalid=5770, Unknown=50, NotChecked=1804, Total=8010 [2018-10-27 04:55:52,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-10-27 04:55:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 436. [2018-10-27 04:55:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-10-27 04:55:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 481 transitions. [2018-10-27 04:55:52,355 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 481 transitions. Word has length 111 [2018-10-27 04:55:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:55:52,355 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 481 transitions. [2018-10-27 04:55:52,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-27 04:55:52,355 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 481 transitions. [2018-10-27 04:55:52,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-27 04:55:52,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:55:52,356 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:55:52,357 INFO L424 AbstractCegarLoop]: === Iteration 35 === [dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:55:52,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:55:52,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1327978442, now seen corresponding path program 1 times [2018-10-27 04:55:52,358 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:55:52,360 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/cvc4nyu Starting monitored process 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:55:52,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:55:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:55:53,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:55:53,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:55:53,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:53,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:55:53,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:55:53,371 WARN L854 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |c_#valid| (store |c_old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))) is different from true [2018-10-27 04:55:53,684 WARN L854 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1)))) is different from true [2018-10-27 04:55:53,773 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_generic_ULTIMATE.dealloc_~addr.base (_ BitVec 32)) (v_prenex_71 (_ BitVec 32)) (v_prenex_72 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv1 1)))) (let ((.cse0 (store .cse1 v_prenex_71 (_ bv1 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base)) (= (_ bv0 1) (select .cse0 alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select .cse1 v_prenex_71)) (= |c_#valid| (store (store (store .cse0 alloc_or_die_slave_~ptr~0.base (_ bv1 1)) v_prenex_72 (_ bv1 1)) dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv0 1))))))) is different from true [2018-10-27 04:55:53,808 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:53,810 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:53,813 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:53,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 59 [2018-10-27 04:55:53,860 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:53,861 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:53,862 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:55:53,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 71 [2018-10-27 04:55:53,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 68 [2018-10-27 04:55:53,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 56 [2018-10-27 04:55:53,886 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:53,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 54 [2018-10-27 04:55:53,896 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 04:55:53,948 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:55:53,982 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:55:54,018 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:55:54,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:55:54,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-10-27 04:55:54,101 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:50, output treesize:72 [2018-10-27 04:55:54,286 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 10 proven. 10 refuted. 2 times theorem prover too weak. 20 trivial. 53 not checked. [2018-10-27 04:55:54,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:55:54,793 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-10-27 04:55:55,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:55:55,127 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:55:55,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:55:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:55:55,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:55:55,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:55:55,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:55,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:55:55,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:55:55,362 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) is different from true [2018-10-27 04:55:55,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:55:55,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:55:55,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:55:55,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:55:55,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:55:55,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-10-27 04:55:56,625 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_alloc_or_die_slave_write~$Pointer$_#value.base_288| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_290| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_290| |v_alloc_or_die_slave_write~$Pointer$_#value.base_288|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |c_#memory_$Pointer$.base|) (= |c_#valid| (store |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)))) is different from true [2018-10-27 04:55:56,911 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_alloc_or_die_slave_write~$Pointer$_#value.base_288| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_290| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= (select (select (store |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_290| |v_alloc_or_die_slave_write~$Pointer$_#value.base_288|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|) c_dll_insert_slave_~next~0.base))) is different from true [2018-10-27 04:55:56,917 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_alloc_or_die_slave_write~$Pointer$_#value.base_288| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_290| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= (select (select (store |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_290| |v_alloc_or_die_slave_write~$Pointer$_#value.base_288|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|) |c_dll_insert_slave_write~$Pointer$_#ptr.base|) (= |c_#valid| (store |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)))) is different from true [2018-10-27 04:55:57,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-10-27 04:55:57,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-10-27 04:55:57,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:55:57,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:55:57,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:55:57,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:73, output treesize:43 [2018-10-27 04:55:57,541 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_generic_ULTIMATE.dealloc_~addr.base (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv1 1)))) (let ((.cse0 (store (store .cse1 alloc_or_die_slave_~ptr~0.base (_ bv1 1)) v_arrayElimCell_45 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 |alloc_or_die_slave_write~$Pointer$_#ptr.base|)) (= |c_#valid| (store (store .cse0 |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv0 1))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base)) (= (_ bv0 1) (select .cse1 alloc_or_die_slave_~ptr~0.base)))))) is different from true [2018-10-27 04:55:57,585 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:57,587 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:57,589 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:57,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 60 [2018-10-27 04:55:57,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-10-27 04:55:57,705 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:57,711 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:57,719 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:57,719 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:55:57,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 69 [2018-10-27 04:55:57,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 60 [2018-10-27 04:55:57,740 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:55:57,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 58 [2018-10-27 04:55:57,751 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 04:55:57,810 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:55:57,896 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:55:57,937 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:55:57,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:55:58,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-10-27 04:55:58,035 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:53, output treesize:76 [2018-10-27 04:55:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 29 proven. 13 refuted. 2 times theorem prover too weak. 3 trivial. 48 not checked. [2018-10-27 04:55:58,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:55:59,041 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 04:55:59,773 WARN L179 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2018-10-27 04:56:00,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:56:00,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 37] total 49 [2018-10-27 04:56:00,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-27 04:56:00,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-27 04:56:00,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1701, Unknown=96, NotChecked=728, Total=2652 [2018-10-27 04:56:00,122 INFO L87 Difference]: Start difference. First operand 436 states and 481 transitions. Second operand 50 states. [2018-10-27 04:56:02,772 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2018-10-27 04:56:04,259 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2018-10-27 04:56:07,769 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2018-10-27 04:56:08,562 WARN L179 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2018-10-27 04:56:09,524 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2018-10-27 04:56:10,048 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2018-10-27 04:56:11,050 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2018-10-27 04:56:11,553 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2018-10-27 04:56:14,816 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((dll_create_generic_ULTIMATE.dealloc_~addr.base (_ BitVec 32)) (v_prenex_71 (_ BitVec 32)) (v_prenex_72 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv1 1)))) (let ((.cse0 (store .cse1 v_prenex_71 (_ bv1 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base)) (= (_ bv0 1) (select .cse0 alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select .cse1 v_prenex_71)) (= |c_#valid| (store (store (store .cse0 alloc_or_die_slave_~ptr~0.base (_ bv1 1)) v_prenex_72 (_ bv1 1)) dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv0 1))))))) (exists ((dll_create_generic_ULTIMATE.dealloc_~addr.base (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (let ((.cse3 (store |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv1 1)))) (let ((.cse2 (store (store .cse3 alloc_or_die_slave_~ptr~0.base (_ bv1 1)) v_arrayElimCell_45 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse2 |alloc_or_die_slave_write~$Pointer$_#ptr.base|)) (= |c_#valid| (store (store .cse2 |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv0 1))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base)) (= (_ bv0 1) (select .cse3 alloc_or_die_slave_~ptr~0.base))))))) is different from true [2018-10-27 04:56:25,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:56:25,557 INFO L93 Difference]: Finished difference Result 523 states and 589 transitions. [2018-10-27 04:56:25,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-27 04:56:25,558 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 140 [2018-10-27 04:56:25,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:56:25,560 INFO L225 Difference]: With dead ends: 523 [2018-10-27 04:56:25,560 INFO L226 Difference]: Without dead ends: 523 [2018-10-27 04:56:25,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 230 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=386, Invalid=4950, Unknown=250, NotChecked=1386, Total=6972 [2018-10-27 04:56:25,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-10-27 04:56:25,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 451. [2018-10-27 04:56:25,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-10-27 04:56:25,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 502 transitions. [2018-10-27 04:56:25,573 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 502 transitions. Word has length 140 [2018-10-27 04:56:25,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:56:25,574 INFO L481 AbstractCegarLoop]: Abstraction has 451 states and 502 transitions. [2018-10-27 04:56:25,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-27 04:56:25,574 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 502 transitions. [2018-10-27 04:56:25,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-27 04:56:25,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:56:25,577 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:56:25,577 INFO L424 AbstractCegarLoop]: === Iteration 36 === [dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:56:25,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:56:25,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1782341345, now seen corresponding path program 1 times [2018-10-27 04:56:25,582 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:56:25,582 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/cvc4nyu Starting monitored process 47 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:56:25,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:56:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:56:26,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:56:26,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:56:26,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:56:26,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:56:26,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:56:26,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:56:26,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:56:27,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:56:27,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:56:27,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:56:27,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:56:27,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:56:27,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:35 [2018-10-27 04:56:27,862 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |c_#length| (store |c_old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) is different from true [2018-10-27 04:56:28,128 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|) c_dll_insert_slave_~next~0.base) (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) is different from true [2018-10-27 04:56:28,133 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) is different from true [2018-10-27 04:56:28,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2018-10-27 04:56:28,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-10-27 04:56:28,148 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:56:28,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:56:28,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-10-27 04:56:28,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:65, output treesize:49 [2018-10-27 04:56:28,199 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)))) (let ((.cse1 (store .cse0 v_arrayElimCell_48 (_ bv1 1)))) (and (= (select .cse0 v_arrayElimCell_48) (_ bv0 1)) (= |c_#length| (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79)) (= (_ bv0 1) (select |c_old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select .cse1 |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |c_#valid| (store .cse1 |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))))))) is different from true [2018-10-27 04:56:28,271 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |c_#length| (store |c_old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|)))) is different from true [2018-10-27 04:56:28,286 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)))) (let ((.cse1 (store .cse0 v_arrayElimCell_48 (_ bv1 1)))) (and (= (select .cse0 v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store .cse1 |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |c_old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select .cse1 |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |c_#length| (store (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80)))))) is different from true [2018-10-27 04:56:28,407 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-10-27 04:56:28,424 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:28,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2018-10-27 04:56:28,452 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:28,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2018-10-27 04:56:28,499 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:28,504 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:28,507 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:28,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2018-10-27 04:56:28,563 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:28,566 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:28,570 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:28,572 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:28,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 68 [2018-10-27 04:56:28,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:56:28,663 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:56:28,691 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:56:28,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:56:28,787 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:28,790 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:28,792 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:28,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 57 [2018-10-27 04:56:28,846 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:28,848 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:28,849 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:56:28,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 63 [2018-10-27 04:56:28,912 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:28,914 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:28,916 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:28,919 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:28,921 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:28,923 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:28,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-10-27 04:56:28,924 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:56:28,962 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:56:28,993 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:56:29,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:56:29,066 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 10 variables, input treesize:69, output treesize:11 [2018-10-27 04:56:29,241 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 54 not checked. [2018-10-27 04:56:29,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:56:30,395 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-10-27 04:56:30,711 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-10-27 04:56:31,724 WARN L179 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2018-10-27 04:56:41,852 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-10-27 04:56:41,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:56:41,855 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_816f5e7a-e6bf-4bb3-b922-d0af24062e40/bin-2019/utaipan/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:56:41,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:56:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:56:42,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:56:42,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:56:42,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:56:42,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:56:42,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:56:42,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:56:42,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:56:42,310 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |c_old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) is different from true [2018-10-27 04:56:43,386 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |c_old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) is different from true [2018-10-27 04:56:43,505 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)))) (let ((.cse0 (store .cse1 v_prenex_90 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |c_old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select .cse1 v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store .cse0 |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |c_#length| (store (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91)))))) is different from true [2018-10-27 04:56:43,762 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-10-27 04:56:43,770 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:43,772 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:43,774 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:43,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 55 [2018-10-27 04:56:43,824 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:43,826 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:43,827 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:43,829 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:43,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 63 [2018-10-27 04:56:43,884 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:43,886 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:43,888 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:43,890 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:56:43,891 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:56:43,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 41 [2018-10-27 04:56:43,892 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:56:43,932 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:56:43,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:56:44,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2018-10-27 04:56:44,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2018-10-27 04:56:44,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2018-10-27 04:56:44,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 68 [2018-10-27 04:56:44,143 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:56:44,185 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:56:44,213 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:56:44,234 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:56:44,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:56:44,303 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 10 variables, input treesize:69, output treesize:11 [2018-10-27 04:56:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 0 refuted. 1 times theorem prover too weak. 32 trivial. 46 not checked. [2018-10-27 04:56:44,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:56:45,057 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-10-27 04:56:52,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:56:52,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 18] total 45 [2018-10-27 04:56:52,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-27 04:56:52,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-27 04:56:52,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1433, Unknown=32, NotChecked=756, Total=2352 [2018-10-27 04:56:52,565 INFO L87 Difference]: Start difference. First operand 451 states and 502 transitions. Second operand 46 states. [2018-10-27 04:56:56,248 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2018-10-27 04:56:57,428 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2018-10-27 04:56:58,070 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2018-10-27 04:56:59,047 WARN L179 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2018-10-27 04:57:02,394 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2018-10-27 04:57:03,696 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2018-10-27 04:57:14,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:57:14,714 INFO L93 Difference]: Finished difference Result 497 states and 554 transitions. [2018-10-27 04:57:14,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-27 04:57:14,715 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 141 [2018-10-27 04:57:14,715 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2018-10-27 04:57:14,715 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 141 [2018-10-27 04:57:14,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:57:14,726 FATAL L832 BasicCegarLoop]: -- [2018-10-27 04:57:14,726 FATAL L833 BasicCegarLoop]: enhanced interpolant automaton broken: counterexample not accepted [2018-10-27 04:57:14,726 FATAL L834 BasicCegarLoop]: word: [2018-10-27 04:57:14,726 FATAL L836 BasicCegarLoop]: call ULTIMATE.init(); [2018-10-27 04:57:14,727 FATAL L836 BasicCegarLoop]: #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; [2018-10-27 04:57:14,727 FATAL L836 BasicCegarLoop]: assume true; [2018-10-27 04:57:14,727 FATAL L836 BasicCegarLoop]: #749#return; [2018-10-27 04:57:14,727 FATAL L836 BasicCegarLoop]: call #t~ret46 := main(); [2018-10-27 04:57:14,727 FATAL L836 BasicCegarLoop]: call #t~ret45.base, #t~ret45.offset := dll_create_master(); [2018-10-27 04:57:14,727 FATAL L836 BasicCegarLoop]: call #t~ret20.base, #t~ret20.offset := dll_create_generic(#funAddr~dll_insert_master.base, #funAddr~dll_insert_master.offset); [2018-10-27 04:57:14,727 FATAL L836 BasicCegarLoop]: ~insert_fnc.base, ~insert_fnc.offset := #in~insert_fnc.base, #in~insert_fnc.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#dll~0.base, ~#dll~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~#dll~0.base, ~#dll~0.offset, 4bv32; [2018-10-27 04:57:14,728 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,728 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-10-27 04:57:14,728 FATAL L836 BasicCegarLoop]: call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset); [2018-10-27 04:57:14,728 FATAL L836 BasicCegarLoop]: #~9.base, #~9.offset := #in~9.base, #in~9.offset; [2018-10-27 04:57:14,728 FATAL L836 BasicCegarLoop]: assume #in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset; [2018-10-27 04:57:14,728 FATAL L836 BasicCegarLoop]: call dll_insert_master(#~9.base, #~9.offset); [2018-10-27 04:57:14,728 FATAL L836 BasicCegarLoop]: ~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset; [2018-10-27 04:57:14,728 FATAL L836 BasicCegarLoop]: call #t~ret17.base, #t~ret17.offset := alloc_or_die_master(); [2018-10-27 04:57:14,728 FATAL L836 BasicCegarLoop]: #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~1.base, ~ptr~1.offset := #t~malloc3.base, #t~malloc3.offset; [2018-10-27 04:57:14,728 FATAL L836 BasicCegarLoop]: assume !(~ptr~1.base == 0bv32 && ~ptr~1.offset == 0bv32); [2018-10-27 04:57:14,729 FATAL L836 BasicCegarLoop]: write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 0bv32), 4bv32; [2018-10-27 04:57:14,729 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,729 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 4bv32), 4bv32; [2018-10-27 04:57:14,729 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,729 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 8bv32), 4bv32; [2018-10-27 04:57:14,729 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,729 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~1.base, ~ptr~1.offset; [2018-10-27 04:57:14,729 FATAL L836 BasicCegarLoop]: assume true; [2018-10-27 04:57:14,729 FATAL L836 BasicCegarLoop]: #691#return; [2018-10-27 04:57:14,729 FATAL L836 BasicCegarLoop]: ~item~1.base, ~item~1.offset := #t~ret17.base, #t~ret17.offset;havoc #t~ret17.base, #t~ret17.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32; [2018-10-27 04:57:14,730 FATAL L836 BasicCegarLoop]: assume #valid[read~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,730 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem18.base, #t~mem18.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~3.base, ~next~3.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~3.base, ~next~3.offset, ~item~1.base, ~bvadd32(~item~1.offset, 0bv32), 4bv32; [2018-10-27 04:57:14,730 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,742 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-10-27 04:57:14,742 FATAL L836 BasicCegarLoop]: assume !(~next~3.base != 0bv32 || ~next~3.offset != 0bv32); [2018-10-27 04:57:14,742 FATAL L836 BasicCegarLoop]: call #t~ret19.base, #t~ret19.offset := dll_create_slave(); [2018-10-27 04:57:14,743 FATAL L836 BasicCegarLoop]: call #t~ret11.base, #t~ret11.offset := dll_create_generic(#funAddr~dll_insert_slave.base, #funAddr~dll_insert_slave.offset); [2018-10-27 04:57:14,743 FATAL L836 BasicCegarLoop]: ~insert_fnc.base, ~insert_fnc.offset := #in~insert_fnc.base, #in~insert_fnc.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#dll~0.base, ~#dll~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~#dll~0.base, ~#dll~0.offset, 4bv32; [2018-10-27 04:57:14,743 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,743 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-10-27 04:57:14,743 FATAL L836 BasicCegarLoop]: call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset); [2018-10-27 04:57:14,743 FATAL L836 BasicCegarLoop]: #~9.base, #~9.offset := #in~9.base, #in~9.offset; [2018-10-27 04:57:14,743 FATAL L836 BasicCegarLoop]: assume !(#in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset); [2018-10-27 04:57:14,743 FATAL L836 BasicCegarLoop]: call dll_insert_slave(#~9.base, #~9.offset); [2018-10-27 04:57:14,743 FATAL L836 BasicCegarLoop]: ~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset; [2018-10-27 04:57:14,743 FATAL L836 BasicCegarLoop]: call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave(); [2018-10-27 04:57:14,743 FATAL L836 BasicCegarLoop]: #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset; [2018-10-27 04:57:14,744 FATAL L836 BasicCegarLoop]: assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32); [2018-10-27 04:57:14,744 FATAL L836 BasicCegarLoop]: write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32; [2018-10-27 04:57:14,744 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,744 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32; [2018-10-27 04:57:14,744 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,744 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; [2018-10-27 04:57:14,744 FATAL L836 BasicCegarLoop]: assume true; [2018-10-27 04:57:14,744 FATAL L836 BasicCegarLoop]: #753#return; [2018-10-27 04:57:14,745 FATAL L836 BasicCegarLoop]: ~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32; [2018-10-27 04:57:14,745 FATAL L836 BasicCegarLoop]: assume #valid[read~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,745 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32; [2018-10-27 04:57:14,745 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,745 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-10-27 04:57:14,745 FATAL L836 BasicCegarLoop]: assume !(~next~0.base != 0bv32 || ~next~0.offset != 0bv32); [2018-10-27 04:57:14,745 FATAL L836 BasicCegarLoop]: write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32; [2018-10-27 04:57:14,745 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,746 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-10-27 04:57:14,746 FATAL L836 BasicCegarLoop]: assume true; [2018-10-27 04:57:14,746 FATAL L836 BasicCegarLoop]: #717#return; [2018-10-27 04:57:14,746 FATAL L836 BasicCegarLoop]: assume true; [2018-10-27 04:57:14,746 FATAL L836 BasicCegarLoop]: #695#return; [2018-10-27 04:57:14,746 FATAL L836 BasicCegarLoop]: call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset); [2018-10-27 04:57:14,746 FATAL L836 BasicCegarLoop]: #~9.base, #~9.offset := #in~9.base, #in~9.offset; [2018-10-27 04:57:14,746 FATAL L836 BasicCegarLoop]: assume !(#in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset); [2018-10-27 04:57:14,746 FATAL L836 BasicCegarLoop]: call dll_insert_slave(#~9.base, #~9.offset); [2018-10-27 04:57:14,746 FATAL L836 BasicCegarLoop]: ~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset; [2018-10-27 04:57:14,746 FATAL L836 BasicCegarLoop]: call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave(); [2018-10-27 04:57:14,747 FATAL L836 BasicCegarLoop]: #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset; [2018-10-27 04:57:14,747 FATAL L836 BasicCegarLoop]: assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32); [2018-10-27 04:57:14,747 FATAL L836 BasicCegarLoop]: write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32; [2018-10-27 04:57:14,747 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,747 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32; [2018-10-27 04:57:14,747 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,747 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; [2018-10-27 04:57:14,747 FATAL L836 BasicCegarLoop]: assume true; [2018-10-27 04:57:14,747 FATAL L836 BasicCegarLoop]: #753#return; [2018-10-27 04:57:14,747 FATAL L836 BasicCegarLoop]: ~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32; [2018-10-27 04:57:14,747 FATAL L836 BasicCegarLoop]: assume #valid[read~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,747 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32; [2018-10-27 04:57:14,748 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,748 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-10-27 04:57:14,748 FATAL L836 BasicCegarLoop]: assume ~next~0.base != 0bv32 || ~next~0.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~next~0.base, ~bvadd32(~next~0.offset, 4bv32), 4bv32; [2018-10-27 04:57:14,748 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,748 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-10-27 04:57:14,748 FATAL L836 BasicCegarLoop]: write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32; [2018-10-27 04:57:14,748 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,748 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-10-27 04:57:14,748 FATAL L836 BasicCegarLoop]: assume true; [2018-10-27 04:57:14,748 FATAL L836 BasicCegarLoop]: #717#return; [2018-10-27 04:57:14,749 FATAL L836 BasicCegarLoop]: assume true; [2018-10-27 04:57:14,749 FATAL L836 BasicCegarLoop]: #697#return; [2018-10-27 04:57:14,749 FATAL L836 BasicCegarLoop]: assume true; [2018-10-27 04:57:14,749 FATAL L836 BasicCegarLoop]: assume !!(#t~nondet8 != 0bv32);havoc #t~nondet8; [2018-10-27 04:57:14,749 FATAL L836 BasicCegarLoop]: call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset); [2018-10-27 04:57:14,749 FATAL L836 BasicCegarLoop]: #~9.base, #~9.offset := #in~9.base, #in~9.offset; [2018-10-27 04:57:14,749 FATAL L836 BasicCegarLoop]: assume !(#in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset); [2018-10-27 04:57:14,749 FATAL L836 BasicCegarLoop]: call dll_insert_slave(#~9.base, #~9.offset); [2018-10-27 04:57:14,749 FATAL L836 BasicCegarLoop]: ~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset; [2018-10-27 04:57:14,749 FATAL L836 BasicCegarLoop]: call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave(); [2018-10-27 04:57:14,750 FATAL L836 BasicCegarLoop]: #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset; [2018-10-27 04:57:14,750 FATAL L836 BasicCegarLoop]: assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32); [2018-10-27 04:57:14,750 FATAL L836 BasicCegarLoop]: write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32; [2018-10-27 04:57:14,750 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,750 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32; [2018-10-27 04:57:14,750 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,750 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; [2018-10-27 04:57:14,750 FATAL L836 BasicCegarLoop]: assume true; [2018-10-27 04:57:14,750 FATAL L836 BasicCegarLoop]: #753#return; [2018-10-27 04:57:14,750 FATAL L836 BasicCegarLoop]: ~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32; [2018-10-27 04:57:14,750 FATAL L836 BasicCegarLoop]: assume #valid[read~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,750 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32; [2018-10-27 04:57:14,750 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,751 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-10-27 04:57:14,751 FATAL L836 BasicCegarLoop]: assume ~next~0.base != 0bv32 || ~next~0.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~next~0.base, ~bvadd32(~next~0.offset, 4bv32), 4bv32; [2018-10-27 04:57:14,751 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,751 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-10-27 04:57:14,751 FATAL L836 BasicCegarLoop]: write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32; [2018-10-27 04:57:14,762 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,762 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-10-27 04:57:14,762 FATAL L836 BasicCegarLoop]: assume true; [2018-10-27 04:57:14,762 FATAL L836 BasicCegarLoop]: #717#return; [2018-10-27 04:57:14,762 FATAL L836 BasicCegarLoop]: assume true; [2018-10-27 04:57:14,763 FATAL L836 BasicCegarLoop]: #699#return; [2018-10-27 04:57:14,763 FATAL L836 BasicCegarLoop]: assume true; [2018-10-27 04:57:14,763 FATAL L836 BasicCegarLoop]: assume !(#t~nondet8 != 0bv32);havoc #t~nondet8; [2018-10-27 04:57:14,763 FATAL L836 BasicCegarLoop]: assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~#dll~0.base, ~#dll~0.offset, 4bv32; [2018-10-27 04:57:14,763 FATAL L836 BasicCegarLoop]: assume #valid[read~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,763 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem10.base, #t~mem10.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;#res.base, #res.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~#dll~0.base, ~#dll~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;havoc ~#dll~0.base, ~#dll~0.offset; [2018-10-27 04:57:14,763 FATAL L836 BasicCegarLoop]: assume true; [2018-10-27 04:57:14,764 FATAL L836 BasicCegarLoop]: #685#return; [2018-10-27 04:57:14,764 FATAL L836 BasicCegarLoop]: #res.base, #res.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset; [2018-10-27 04:57:14,764 FATAL L836 BasicCegarLoop]: assume true; [2018-10-27 04:57:14,764 FATAL L836 BasicCegarLoop]: #693#return; [2018-10-27 04:57:14,764 FATAL L836 BasicCegarLoop]: write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := #t~ret19.base, #t~ret19.offset, ~item~1.base, ~bvadd32(~item~1.offset, 8bv32), 4bv32; [2018-10-27 04:57:14,764 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-10-27 04:57:14,764 FATAL L836 BasicCegarLoop]: assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset)); [2018-10-27 04:57:14,764 FATAL L838 BasicCegarLoop]: original automaton: [2018-10-27 04:57:14,764 FATAL L839 BasicCegarLoop]: NestedWordAutomaton nwa = ( callAlphabet = {"call dll_destroy_nested_lists(~dll~1.base, ~dll~1.offset);" "call inspect_dangling(~dll~1.base, ~dll~1.offset);" "call dll_reinit_nested_lists(~dll~1.base, ~dll~1.offset);" "call inspect_init(~dll~1.base, ~dll~1.offset);" "call dll_destroy_master(~dll~1.base, ~dll~1.offset);" "call dll_insert_master(#~9.base, #~9.offset);" "call dll_insert_slave(#~9.base, #~9.offset);" "call inspect_base(~dll.base, ~dll.offset);" "call fail();" "call fail();" "call fail();" "call fail();" "call fail();" "call fail();" "call fail();" "call inspect_base(~dll.base, ~dll.offset);" "call fail();" "call fail();" "call fail();" "call fail();" "call fail();" "call fail();" "call ULTIMATE.init();" "call #t~ret11.base, #t~ret11.offset := dll_create_generic(#funAddr~dll_insert_slave.base, #funAddr~dll_insert_slave.offset);" "call #t~ret46 := main();" "call #t~ret20.base, #t~ret20.offset := dll_create_generic(#funAddr~dll_insert_master.base, #funAddr~dll_insert_master.offset);" "call dll_destroy_slave(#t~mem13.base, #t~mem13.offset);" "call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave();" "call inspect_base(~dll.base, ~dll.offset);" "call #t~ret17.base, #t~ret17.offset := alloc_or_die_master();" "call fail();" "call #t~ret19.base, #t~ret19.offset := dll_create_slave();" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "call #t~ret45.base, #t~ret45.offset := dll_create_master();" "call inspect_full(~dll~1.base, ~dll~1.offset);" }, internalAlphabet = {"SUMMARY for call #t~ret11.base, #t~ret11.offset := dll_create_generic(#funAddr~dll_insert_slave.base, #funAddr~dll_insert_slave.offset); srcloc: dll_create_slaveENTRY" "#res.base, #res.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;" "assume true;" "SUMMARY for call #t~ret20.base, #t~ret20.offset := dll_create_generic(#funAddr~dll_insert_master.base, #funAddr~dll_insert_master.offset); srcloc: dll_create_masterENTRY" "#res.base, #res.offset := #t~ret20.base, #t~ret20.offset;havoc #t~ret20.base, #t~ret20.offset;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem13.base, #t~mem13.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "SUMMARY for call dll_destroy_slave(#t~mem13.base, #t~mem13.offset); srcloc: L599" "havoc #t~mem13.base, #t~mem13.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem14.base, #t~mem14.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;" "assume !true;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "SUMMARY for call #t~ret17.base, #t~ret17.offset := alloc_or_die_master(); srcloc: L620" "~item~1.base, ~item~1.offset := #t~ret17.base, #t~ret17.offset;havoc #t~ret17.base, #t~ret17.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem18.base, #t~mem18.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~3.base, ~next~3.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~3.base, ~next~3.offset, ~item~1.base, ~bvadd32(~item~1.offset, 0bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume ~next~3.base != 0bv32 || ~next~3.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~1.base, ~item~1.offset, ~next~3.base, ~bvadd32(~next~3.offset, 4bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume !(~next~3.base != 0bv32 || ~next~3.offset != 0bv32);" "SUMMARY for call #t~ret19.base, #t~ret19.offset := dll_create_slave(); srcloc: L623-2" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := #t~ret19.base, #t~ret19.offset, ~item~1.base, ~bvadd32(~item~1.offset, 8bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;havoc #t~ret19.base, #t~ret19.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~1.base, ~item~1.offset, ~dll.base, ~dll.offset, 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem16.base, #t~mem16.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~2.base, ~next~2.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;" "assume !(~dll.offset == 0bv32);" "assume ~dll.offset == 0bv32;" "assume !(~dll.base == 0bv32 || #valid[~dll.base] == 1bv1);" "assume ~dll.base == 0bv32 || #valid[~dll.base] == 1bv1;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~dll.base, ~dll.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;~dll.base, ~dll.offset := ~next~2.base, ~next~2.offset;" "assume !true;" "assume true;" "~insert_fnc.base, ~insert_fnc.offset := #in~insert_fnc.base, #in~insert_fnc.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#dll~0.base, ~#dll~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~#dll~0.base, ~#dll~0.offset, 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "SUMMARY for call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset); srcloc: L578" "SUMMARY for call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset); srcloc: L578-1" "assume true;" "assume !(#t~nondet8 != 0bv32);havoc #t~nondet8;" "assume !!(#t~nondet8 != 0bv32);havoc #t~nondet8;" "SUMMARY for call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset); srcloc: L581" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~#dll~0.base, ~#dll~0.offset, 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem10.base, #t~mem10.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;#res.base, #res.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~#dll~0.base, ~#dll~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;havoc ~#dll~0.base, ~#dll~0.offset;" "assume true;" "SUMMARY for call #t~ret45.base, #t~ret45.offset := dll_create_master(); srcloc: mainENTRY" "~dll~1.base, ~dll~1.offset := #t~ret45.base, #t~ret45.offset;havoc #t~ret45.base, #t~ret45.offset;" "SUMMARY for call inspect_full(~dll~1.base, ~dll~1.offset); srcloc: L673" "SUMMARY for call dll_destroy_nested_lists(~dll~1.base, ~dll~1.offset); srcloc: L673-1" "SUMMARY for call inspect_dangling(~dll~1.base, ~dll~1.offset); srcloc: L674" "SUMMARY for call dll_reinit_nested_lists(~dll~1.base, ~dll~1.offset); srcloc: L675" "SUMMARY for call inspect_init(~dll~1.base, ~dll~1.offset); srcloc: L676" "SUMMARY for call dll_destroy_master(~dll~1.base, ~dll~1.offset); srcloc: L677" "#res := 0bv32;" "assume #valid == old(#valid);" "assume !(#valid == old(#valid));" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem12.base, #t~mem12.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~1.base, ~next~1.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;" "assume !(~dll.offset == 0bv32);" "assume ~dll.offset == 0bv32;" "assume !(~dll.base == 0bv32 || #valid[~dll.base] == 1bv1);" "assume ~dll.base == 0bv32 || #valid[~dll.base] == 1bv1;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~dll.base, ~dll.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;~dll.base, ~dll.offset := ~next~1.base, ~next~1.offset;" "assume !true;" "assume true;" "assume false;" "assume true;" "#NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem15.base, #t~mem15.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset;" "assume !true;" "assume true;" "#~9.base, #~9.offset := #in~9.base, #in~9.offset;" "assume #in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset;" "SUMMARY for call dll_insert_master(#~9.base, #~9.offset); srcloc: L-1-1" "assume !(#in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset);" "SUMMARY for call dll_insert_slave(#~9.base, #~9.offset); srcloc: L-1-3" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "SUMMARY for call inspect_base(~dll.base, ~dll.offset); srcloc: L666" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem44.base, #t~mem44.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume !(#t~mem44.base == 0bv32 && #t~mem44.offset == 0bv32);havoc #t~mem44.base, #t~mem44.offset;" "SUMMARY for call fail(); srcloc: L668-2" "assume !!(#t~mem44.base == 0bv32 && #t~mem44.offset == 0bv32);havoc #t~mem44.base, #t~mem44.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem43.base, #t~mem43.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset;" "assume !true;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "assume true;" "assume ~dll.base == 0bv32 && ~dll.offset == 0bv32;" "SUMMARY for call fail(); srcloc: L634-2" "assume !(~dll.base == 0bv32 && ~dll.offset == 0bv32);" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem21.base, #t~mem21.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem21.base == 0bv32 && #t~mem21.offset == 0bv32;havoc #t~mem21.base, #t~mem21.offset;" "SUMMARY for call fail(); srcloc: L635-1" "assume !(#t~mem21.base == 0bv32 && #t~mem21.offset == 0bv32);havoc #t~mem21.base, #t~mem21.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem22.base, #t~mem22.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume !(#t~mem22.base == 0bv32 && #t~mem22.offset == 0bv32);havoc #t~mem22.base, #t~mem22.offset;" "SUMMARY for call fail(); srcloc: L636-1" "assume !!(#t~mem22.base == 0bv32 && #t~mem22.offset == 0bv32);havoc #t~mem22.base, #t~mem22.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem23.base, #t~mem23.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem25.base, #t~mem25.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem25.base == 0bv32 && #t~mem25.offset == 0bv32;havoc #t~mem25.base, #t~mem25.offset;" "SUMMARY for call fail(); srcloc: L638-2" "assume !(#t~mem25.base == 0bv32 && #t~mem25.offset == 0bv32);havoc #t~mem25.base, #t~mem25.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem26.base, #t~mem26.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem26.base, ~bvadd32(#t~mem26.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem27.base, #t~mem27.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem27.base == 0bv32 && #t~mem27.offset == 0bv32;havoc #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;" "SUMMARY for call fail(); srcloc: L639-1" "assume !(#t~mem27.base == 0bv32 && #t~mem27.offset == 0bv32);havoc #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem28.base, #t~mem28.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem28.base, ~bvadd32(#t~mem28.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem29.base, #t~mem29.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume !(#t~mem29.base == ~dll.base && #t~mem29.offset == ~dll.offset);havoc #t~mem29.base, #t~mem29.offset;havoc #t~mem28.base, #t~mem28.offset;" "SUMMARY for call fail(); srcloc: L640-1" "assume !!(#t~mem29.base == ~dll.base && #t~mem29.offset == ~dll.offset);havoc #t~mem29.base, #t~mem29.offset;havoc #t~mem28.base, #t~mem28.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem24.base, #t~mem24.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem24.base, #t~mem24.offset;havoc #t~mem24.base, #t~mem24.offset;" "assume !true;" "assume true;" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset;" "assume ~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32;assume false;" "assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32);" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "SUMMARY for call inspect_base(~dll.base, ~dll.offset); srcloc: L645" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem31.base, #t~mem31.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~pos~0.base, ~pos~0.offset := #t~mem31.base, #t~mem31.offset;havoc #t~mem31.base, #t~mem31.offset;" "assume true;" "assume ~pos~0.base == 0bv32 && ~pos~0.offset == 0bv32;" "SUMMARY for call fail(); srcloc: L648-2" "assume !(~pos~0.base == 0bv32 && ~pos~0.offset == 0bv32);" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem32.base, #t~mem32.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem32.base == 0bv32 && #t~mem32.offset == 0bv32;havoc #t~mem32.base, #t~mem32.offset;" "SUMMARY for call fail(); srcloc: L649-1" "assume !(#t~mem32.base == 0bv32 && #t~mem32.offset == 0bv32);havoc #t~mem32.base, #t~mem32.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem33.base, #t~mem33.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume !(#t~mem33.base == 0bv32 && #t~mem33.offset == 0bv32);havoc #t~mem33.base, #t~mem33.offset;" "SUMMARY for call fail(); srcloc: L650-1" "assume !!(#t~mem33.base == 0bv32 && #t~mem33.offset == 0bv32);havoc #t~mem33.base, #t~mem33.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem34.base, #t~mem34.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~pos~0.base, ~pos~0.offset := #t~mem34.base, #t~mem34.offset;havoc #t~mem34.base, #t~mem34.offset;" "assume true;" "assume !(~pos~0.base != 0bv32 || ~pos~0.offset != 0bv32);" "assume !!(~pos~0.base != 0bv32 || ~pos~0.offset != 0bv32);" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem36.base, #t~mem36.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem36.base == 0bv32 && #t~mem36.offset == 0bv32;havoc #t~mem36.base, #t~mem36.offset;" "SUMMARY for call fail(); srcloc: L652-2" "assume !(#t~mem36.base == 0bv32 && #t~mem36.offset == 0bv32);havoc #t~mem36.base, #t~mem36.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem37.base, #t~mem37.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem37.base, ~bvadd32(#t~mem37.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem38.base, #t~mem38.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem38.base == 0bv32 && #t~mem38.offset == 0bv32;havoc #t~mem38.base, #t~mem38.offset;havoc #t~mem37.base, #t~mem37.offset;" "SUMMARY for call fail(); srcloc: L653-1" "assume !(#t~mem38.base == 0bv32 && #t~mem38.offset == 0bv32);havoc #t~mem38.base, #t~mem38.offset;havoc #t~mem37.base, #t~mem37.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem39.base, #t~mem39.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem39.base, ~bvadd32(#t~mem39.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem40.base, #t~mem40.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume !(#t~mem40.base == ~pos~0.base && #t~mem40.offset == ~pos~0.offset);havoc #t~mem40.base, #t~mem40.offset;havoc #t~mem39.base, #t~mem39.offset;" "SUMMARY for call fail(); srcloc: L654-1" "assume !!(#t~mem40.base == ~pos~0.base && #t~mem40.offset == ~pos~0.offset);havoc #t~mem40.base, #t~mem40.offset;havoc #t~mem39.base, #t~mem39.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem35.base, #t~mem35.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~pos~0.base, ~pos~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem30.base, #t~mem30.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem30.base, #t~mem30.offset;havoc #t~mem30.base, #t~mem30.offset;" "assume !true;" "assume true;" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~1.base, ~ptr~1.offset := #t~malloc3.base, #t~malloc3.offset;" "assume ~ptr~1.base == 0bv32 && ~ptr~1.offset == 0bv32;assume false;" "assume !(~ptr~1.base == 0bv32 && ~ptr~1.offset == 0bv32);" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 0bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 4bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 8bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~1.base, ~ptr~1.offset;" "assume true;" "SUMMARY for call ULTIMATE.init(); srcloc: ULTIMATE.startENTRY" "SUMMARY for call #t~ret46 := main(); srcloc: L-1" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "SUMMARY for call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave(); srcloc: L568" "~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume ~next~0.base != 0bv32 || ~next~0.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~next~0.base, ~bvadd32(~next~0.offset, 4bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume !(~next~0.base != 0bv32 || ~next~0.offset != 0bv32);" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "SUMMARY for call inspect_base(~dll.base, ~dll.offset); srcloc: L660" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem42.base, #t~mem42.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem42.base == 0bv32 && #t~mem42.offset == 0bv32;havoc #t~mem42.base, #t~mem42.offset;" "SUMMARY for call fail(); srcloc: L662-2" "assume !(#t~mem42.base == 0bv32 && #t~mem42.offset == 0bv32);havoc #t~mem42.base, #t~mem42.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem41.base, #t~mem41.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem41.base, #t~mem41.offset;havoc #t~mem41.base, #t~mem41.offset;" "assume !true;" "assume true;" }, returnAlphabet = {"#705#return;" "#707#return;" "#709#return;" "#711#return;" "#713#return;" "#715#return;" "#717#return;" "#719#return;" "#721#return;" "#723#return;" "#725#return;" "#727#return;" "#729#return;" "#731#return;" "#733#return;" "#735#return;" "#737#return;" "#739#return;" "#741#return;" "#743#return;" "#745#return;" "#747#return;" "#749#return;" "#685#return;" "#751#return;" "#687#return;" "#689#return;" "#753#return;" "#755#return;" "#691#return;" "#757#return;" "#693#return;" "#695#return;" "#697#return;" "#699#return;" "#701#return;" "#703#return;" }, states = {"39360#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39236#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "39300#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) (_ bv1 1)) |#valid|) (= (_ bv1 1) (select |#valid| |dll_insert_slave_#in~dll.base|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|))))" "39367#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base))" "39176#(and (= (_ bv12 32) (select |#length| |alloc_or_die_master_#res.base|)) (= (bvadd (select |#valid| |alloc_or_die_master_#res.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |alloc_or_die_master_#res.offset|))" "39817#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))))" "39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))" "39371#(and (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|))" "39183#(and (= (_ bv12 32) (select |#length| |dll_insert_master_#t~ret17.base|)) (= (_ bv0 32) |dll_insert_master_#t~ret17.offset|) (= (_ bv1 1) (select |#valid| |dll_insert_master_#t~ret17.base|)))" "39314#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "39378#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39444#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)))" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39769#(and (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|) (_ bv0 1)) (= |#length| (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)))" "39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39262#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| |alloc_or_die_slave_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)) (= |#valid| (store |old(#valid)| |alloc_or_die_slave_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#res.base|)))" "39776#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))" "39332#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39269#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |#valid| (store |old(#valid)| |dll_insert_slave_#t~ret4.base| (_ bv1 1))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_#t~ret4.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_insert_slave_#t~ret4.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "39273#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "39786#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "39339#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39916#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))))" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "39346#(and (= alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (= |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "39416#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)))))" "39353#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39098#true" "39226#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))" "39546#(and (= (_ bv0 32) dll_insert_master_~item~1.offset) (= (bvadd (select |#length| dll_insert_master_~item~1.base) (_ bv4294967284 32)) (_ bv0 32)))" "39099#false" "39293#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_insert_slave_write~$Pointer$_#value.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (bvadd (select |#valid| |dll_insert_slave_write~$Pointer$_#ptr.base|) (_ bv1 1)) (_ bv0 1)) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)))" "39677#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "39550#(and (= (bvadd |dll_insert_master_write~$Pointer$_#sizeOfWrittenType| (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv8 32) |dll_insert_master_write~$Pointer$_#ptr.offset|) (= (bvadd (select |#length| |dll_insert_master_write~$Pointer$_#ptr.base|) (_ bv4294967284 32)) (_ bv0 32)))" }, initialStates = {"39098#true" }, finalStates = {"39099#false" }, callTransitions = { ("39236#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave();" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39314#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "call #t~ret19.base, #t~ret19.offset := dll_create_slave();" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39769#(and (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|) (_ bv0 1)) (= |#length| (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)))" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call dll_insert_slave(#~9.base, #~9.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39776#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))" "call dll_insert_slave(#~9.base, #~9.offset);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39332#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave();" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave();" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "call #t~ret11.base, #t~ret11.offset := dll_create_generic(#funAddr~dll_insert_slave.base, #funAddr~dll_insert_slave.offset);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "call dll_insert_slave(#~9.base, #~9.offset);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39786#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave();" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39416#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)))))" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39098#true" "call #t~ret17.base, #t~ret17.offset := alloc_or_die_master();" "39098#true") ("39098#true" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39098#true") ("39098#true" "call dll_insert_master(#~9.base, #~9.offset);" "39098#true") ("39098#true" "call ULTIMATE.init();" "39098#true") ("39098#true" "call #t~ret45.base, #t~ret45.offset := dll_create_master();" "39098#true") ("39098#true" "call #t~ret46 := main();" "39098#true") ("39098#true" "call #t~ret20.base, #t~ret20.offset := dll_create_generic(#funAddr~dll_insert_master.base, #funAddr~dll_insert_master.offset);" "39098#true") ("39226#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))" "call dll_insert_slave(#~9.base, #~9.offset);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39677#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") }, internalTransitions = { ("39360#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume true;" "39360#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39300#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) (_ bv1 1)) |#valid|) (= (_ bv1 1) (select |#valid| |dll_insert_slave_#in~dll.base|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|))))" "assume true;" "39300#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) (_ bv1 1)) |#valid|) (= (_ bv1 1) (select |#valid| |dll_insert_slave_#in~dll.base|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|))))") ("39367#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base))" "~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "39371#(and (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|))") ("39176#(and (= (_ bv12 32) (select |#length| |alloc_or_die_master_#res.base|)) (= (bvadd (select |#valid| |alloc_or_die_master_#res.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |alloc_or_die_master_#res.offset|))" "assume true;" "39176#(and (= (_ bv12 32) (select |#length| |alloc_or_die_master_#res.base|)) (= (bvadd (select |#valid| |alloc_or_die_master_#res.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |alloc_or_die_master_#res.offset|))") ("39817#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))))" "~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32;" "39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset;" "39262#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| |alloc_or_die_slave_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)) (= |#valid| (store |old(#valid)| |alloc_or_die_slave_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#res.base|)))") ("39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32);" "39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32;" "39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))" "assume true;" "39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))") ("39371#(and (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39371#(and (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|))") ("39371#(and (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32;" "39378#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39183#(and (= (_ bv12 32) (select |#length| |dll_insert_master_#t~ret17.base|)) (= (_ bv0 32) |dll_insert_master_#t~ret17.offset|) (= (_ bv1 1) (select |#valid| |dll_insert_master_#t~ret17.base|)))" "~item~1.base, ~item~1.offset := #t~ret17.base, #t~ret17.offset;havoc #t~ret17.base, #t~ret17.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39378#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39378#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39378#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume ~next~0.base != 0bv32 || ~next~0.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~next~0.base, ~bvadd32(~next~0.offset, 4bv32), 4bv32;" "39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39378#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39378#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume !(~next~3.base != 0bv32 || ~next~3.offset != 0bv32);" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem18.base, #t~mem18.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~3.base, ~next~3.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~3.base, ~next~3.offset, ~item~1.base, ~bvadd32(~item~1.offset, 0bv32), 4bv32;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume true;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32);" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume ~next~0.base != 0bv32 || ~next~0.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~next~0.base, ~bvadd32(~next~0.offset, 4bv32), 4bv32;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume true;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume true;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39444#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)))" "assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32);" "39444#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)))") ("39444#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset;" "39339#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39332#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#~9.base, #~9.offset := #in~9.base, #in~9.offset;" "39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume true;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32);" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume ~next~0.base != 0bv32 || ~next~0.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~next~0.base, ~bvadd32(~next~0.offset, 4bv32), 4bv32;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume true;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume true;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume !(~next~0.base != 0bv32 || ~next~0.offset != 0bv32);" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset);" "39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "assume true;" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))") ("39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "assume true;" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))") ("39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "#res.base, #res.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))") ("39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "assume true;" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))") ("39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "assume !(#t~nondet8 != 0bv32);havoc #t~nondet8;" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))") ("39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~#dll~0.base, ~#dll~0.offset, 4bv32;" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))") ("39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))") ("39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem10.base, #t~mem10.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;#res.base, #res.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~#dll~0.base, ~#dll~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;havoc ~#dll~0.base, ~#dll~0.offset;" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume true;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume ~next~0.base != 0bv32 || ~next~0.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~next~0.base, ~bvadd32(~next~0.offset, 4bv32), 4bv32;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume true;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume true;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "assume true;" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))") ("39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "assume true;" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))") ("39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "#res.base, #res.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))") ("39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "assume true;" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))") ("39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "assume !(#t~nondet8 != 0bv32);havoc #t~nondet8;" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))") ("39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~#dll~0.base, ~#dll~0.offset, 4bv32;" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))") ("39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))") ("39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem10.base, #t~mem10.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;#res.base, #res.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~#dll~0.base, ~#dll~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;havoc ~#dll~0.base, ~#dll~0.offset;" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))") ("39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume true;" "39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume true;" "39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32;" "39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39262#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| |alloc_or_die_slave_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)) (= |#valid| (store |old(#valid)| |alloc_or_die_slave_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#res.base|)))" "assume true;" "39262#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| |alloc_or_die_slave_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)) (= |#valid| (store |old(#valid)| |alloc_or_die_slave_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#res.base|)))") ("39776#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))" "assume !(#in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset);" "39776#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))") ("39269#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |#valid| (store |old(#valid)| |dll_insert_slave_#t~ret4.base| (_ bv1 1))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_#t~ret4.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_insert_slave_#t~ret4.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "39273#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume !(#in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset;" "39444#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset;" "39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "~insert_fnc.base, ~insert_fnc.offset := #in~insert_fnc.base, #in~insert_fnc.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#dll~0.base, ~#dll~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~#dll~0.base, ~#dll~0.offset, 4bv32;" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "~insert_fnc.base, ~insert_fnc.offset := #in~insert_fnc.base, #in~insert_fnc.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#dll~0.base, ~#dll~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~#dll~0.base, ~#dll~0.offset, 4bv32;" "39677#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39236#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39786#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#~9.base, #~9.offset := #in~9.base, #in~9.offset;" "39776#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#~9.base, #~9.offset := #in~9.base, #in~9.offset;" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#~9.base, #~9.offset := #in~9.base, #in~9.offset;" "39226#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))") ("39273#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("39339#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32);" "39339#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39339#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32;" "39346#(and (= alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (= |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("39916#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))))" "~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))") ("39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))") ("39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "assume !(~next~0.base != 0bv32 || ~next~0.offset != 0bv32);" "39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32;" "39293#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_insert_slave_write~$Pointer$_#value.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (bvadd (select |#valid| |dll_insert_slave_write~$Pointer$_#ptr.base|) (_ bv1 1)) (_ bv0 1)) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)))") ("39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32;" "39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~1.base, ~ptr~1.offset;" "39176#(and (= (_ bv12 32) (select |#length| |alloc_or_die_master_#res.base|)) (= (bvadd (select |#valid| |alloc_or_die_master_#res.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |alloc_or_die_master_#res.offset|))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume !(~ptr~1.base == 0bv32 && ~ptr~1.offset == 0bv32);" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 0bv32), 4bv32;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 4bv32), 4bv32;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 8bv32), 4bv32;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39346#(and (= alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (= |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32;" "39353#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39346#(and (= alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (= |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39346#(and (= alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (= |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "assume true;" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))") ("39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "assume !!(#t~nondet8 != 0bv32);havoc #t~nondet8;" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))") ("39416#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)))))" "assume true;" "39416#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)))))") ("39416#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)))))" "assume !!(#t~nondet8 != 0bv32);havoc #t~nondet8;" "39416#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)))))") ("39353#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39353#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39353#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset;" "39360#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39098#true" "assume #in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset;" "39098#true") ("39098#true" "#NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "~insert_fnc.base, ~insert_fnc.offset := #in~insert_fnc.base, #in~insert_fnc.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#dll~0.base, ~#dll~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~#dll~0.base, ~#dll~0.offset, 4bv32;" "39098#true") ("39098#true" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39098#true") ("39098#true" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39098#true") ("39098#true" "#~9.base, #~9.offset := #in~9.base, #in~9.offset;" "39098#true") ("39098#true" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~1.base, ~ptr~1.offset := #t~malloc3.base, #t~malloc3.offset;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39098#true" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39098#true") ("39226#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))" "assume !(#in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset);" "39226#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))") ("39546#(and (= (_ bv0 32) dll_insert_master_~item~1.offset) (= (bvadd (select |#length| dll_insert_master_~item~1.base) (_ bv4294967284 32)) (_ bv0 32)))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := #t~ret19.base, #t~ret19.offset, ~item~1.base, ~bvadd32(~item~1.offset, 8bv32), 4bv32;" "39550#(and (= (bvadd |dll_insert_master_write~$Pointer$_#sizeOfWrittenType| (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv8 32) |dll_insert_master_write~$Pointer$_#ptr.offset|) (= (bvadd (select |#length| |dll_insert_master_write~$Pointer$_#ptr.base|) (_ bv4294967284 32)) (_ bv0 32)))") ("39293#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_insert_slave_write~$Pointer$_#value.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (bvadd (select |#valid| |dll_insert_slave_write~$Pointer$_#ptr.base|) (_ bv1 1)) (_ bv0 1)) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39293#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_insert_slave_write~$Pointer$_#value.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (bvadd (select |#valid| |dll_insert_slave_write~$Pointer$_#ptr.base|) (_ bv1 1)) (_ bv0 1)) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)))") ("39293#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_insert_slave_write~$Pointer$_#value.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (bvadd (select |#valid| |dll_insert_slave_write~$Pointer$_#ptr.base|) (_ bv1 1)) (_ bv0 1)) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39300#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) (_ bv1 1)) |#valid|) (= (_ bv1 1) (select |#valid| |dll_insert_slave_#in~dll.base|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|))))") ("39677#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39677#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))") ("39677#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39677#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))") ("39550#(and (= (bvadd |dll_insert_master_write~$Pointer$_#sizeOfWrittenType| (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv8 32) |dll_insert_master_write~$Pointer$_#ptr.offset|) (= (bvadd (select |#length| |dll_insert_master_write~$Pointer$_#ptr.base|) (_ bv4294967284 32)) (_ bv0 32)))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39550#(and (= (bvadd |dll_insert_master_write~$Pointer$_#sizeOfWrittenType| (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv8 32) |dll_insert_master_write~$Pointer$_#ptr.offset|) (= (bvadd (select |#length| |dll_insert_master_write~$Pointer$_#ptr.base|) (_ bv4294967284 32)) (_ bv0 32)))") ("39550#(and (= (bvadd |dll_insert_master_write~$Pointer$_#sizeOfWrittenType| (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv8 32) |dll_insert_master_write~$Pointer$_#ptr.offset|) (= (bvadd (select |#length| |dll_insert_master_write~$Pointer$_#ptr.base|) (_ bv4294967284 32)) (_ bv0 32)))" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "39099#false") }, returnTransitions = { ("39360#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39332#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#753#return;" "39367#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base))") ("39300#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) (_ bv1 1)) |#valid|) (= (_ bv1 1) (select |#valid| |dll_insert_slave_#in~dll.base|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|))))" "39226#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))" "#717#return;" "39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))") ("39176#(and (= (_ bv12 32) (select |#length| |alloc_or_die_master_#res.base|)) (= (bvadd (select |#valid| |alloc_or_die_master_#res.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |alloc_or_die_master_#res.offset|))" "39098#true" "#691#return;" "39183#(and (= (_ bv12 32) (select |#length| |dll_insert_master_#t~ret17.base|)) (= (_ bv0 32) |dll_insert_master_#t~ret17.offset|) (= (_ bv1 1) (select |#valid| |dll_insert_master_#t~ret17.base|)))") ("39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "#695#return;" "39314#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39776#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))" "#717#return;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "#699#return;" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39786#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#753#return;" "39916#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39776#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))" "#717#return;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#753#return;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#717#return;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39769#(and (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|) (_ bv0 1)) (= |#length| (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)))" "#697#return;" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39786#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#753#return;" "39817#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39677#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "#695#return;" "39769#(and (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|) (_ bv0 1)) (= |#length| (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)))") ("39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "#693#return;" "39546#(and (= (_ bv0 32) dll_insert_master_~item~1.offset) (= (bvadd (select |#length| dll_insert_master_~item~1.base) (_ bv4294967284 32)) (_ bv0 32)))") ("39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#685#return;" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#753#return;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#717#return;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39416#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)))))" "#699#return;" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))") ("39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "#693#return;" "39546#(and (= (_ bv0 32) dll_insert_master_~item~1.offset) (= (bvadd (select |#length| dll_insert_master_~item~1.base) (_ bv4294967284 32)) (_ bv0 32)))") ("39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#685#return;" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))") ("39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39314#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "#697#return;" "39416#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)))))") ("39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#717#return;" "39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39262#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| |alloc_or_die_slave_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)) (= |#valid| (store |old(#valid)| |alloc_or_die_slave_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#res.base|)))" "39236#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#753#return;" "39269#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |#valid| (store |old(#valid)| |dll_insert_slave_#t~ret4.base| (_ bv1 1))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_#t~ret4.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_insert_slave_#t~ret4.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39098#true" "39098#true" "#749#return;" "39098#true") } ); [2018-10-27 04:57:15,044 FATAL L840 BasicCegarLoop]: enhanced automaton: [2018-10-27 04:57:15,045 FATAL L841 BasicCegarLoop]: NestedWordAutomaton nwa = ( callAlphabet = {"call dll_destroy_nested_lists(~dll~1.base, ~dll~1.offset);" "call inspect_dangling(~dll~1.base, ~dll~1.offset);" "call dll_reinit_nested_lists(~dll~1.base, ~dll~1.offset);" "call inspect_init(~dll~1.base, ~dll~1.offset);" "call dll_destroy_master(~dll~1.base, ~dll~1.offset);" "call dll_insert_master(#~9.base, #~9.offset);" "call dll_insert_slave(#~9.base, #~9.offset);" "call inspect_base(~dll.base, ~dll.offset);" "call fail();" "call fail();" "call fail();" "call fail();" "call fail();" "call fail();" "call fail();" "call inspect_base(~dll.base, ~dll.offset);" "call fail();" "call fail();" "call fail();" "call fail();" "call fail();" "call fail();" "call ULTIMATE.init();" "call #t~ret11.base, #t~ret11.offset := dll_create_generic(#funAddr~dll_insert_slave.base, #funAddr~dll_insert_slave.offset);" "call #t~ret46 := main();" "call #t~ret20.base, #t~ret20.offset := dll_create_generic(#funAddr~dll_insert_master.base, #funAddr~dll_insert_master.offset);" "call dll_destroy_slave(#t~mem13.base, #t~mem13.offset);" "call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave();" "call inspect_base(~dll.base, ~dll.offset);" "call #t~ret17.base, #t~ret17.offset := alloc_or_die_master();" "call fail();" "call #t~ret19.base, #t~ret19.offset := dll_create_slave();" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "call #t~ret45.base, #t~ret45.offset := dll_create_master();" "call inspect_full(~dll~1.base, ~dll~1.offset);" }, internalAlphabet = {"SUMMARY for call #t~ret11.base, #t~ret11.offset := dll_create_generic(#funAddr~dll_insert_slave.base, #funAddr~dll_insert_slave.offset); srcloc: dll_create_slaveENTRY" "#res.base, #res.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;" "assume true;" "SUMMARY for call #t~ret20.base, #t~ret20.offset := dll_create_generic(#funAddr~dll_insert_master.base, #funAddr~dll_insert_master.offset); srcloc: dll_create_masterENTRY" "#res.base, #res.offset := #t~ret20.base, #t~ret20.offset;havoc #t~ret20.base, #t~ret20.offset;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem13.base, #t~mem13.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "SUMMARY for call dll_destroy_slave(#t~mem13.base, #t~mem13.offset); srcloc: L599" "havoc #t~mem13.base, #t~mem13.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem14.base, #t~mem14.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;" "assume !true;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "SUMMARY for call #t~ret17.base, #t~ret17.offset := alloc_or_die_master(); srcloc: L620" "~item~1.base, ~item~1.offset := #t~ret17.base, #t~ret17.offset;havoc #t~ret17.base, #t~ret17.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem18.base, #t~mem18.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~3.base, ~next~3.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~3.base, ~next~3.offset, ~item~1.base, ~bvadd32(~item~1.offset, 0bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume ~next~3.base != 0bv32 || ~next~3.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~1.base, ~item~1.offset, ~next~3.base, ~bvadd32(~next~3.offset, 4bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume !(~next~3.base != 0bv32 || ~next~3.offset != 0bv32);" "SUMMARY for call #t~ret19.base, #t~ret19.offset := dll_create_slave(); srcloc: L623-2" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := #t~ret19.base, #t~ret19.offset, ~item~1.base, ~bvadd32(~item~1.offset, 8bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;havoc #t~ret19.base, #t~ret19.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~1.base, ~item~1.offset, ~dll.base, ~dll.offset, 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem16.base, #t~mem16.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~2.base, ~next~2.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;" "assume !(~dll.offset == 0bv32);" "assume ~dll.offset == 0bv32;" "assume !(~dll.base == 0bv32 || #valid[~dll.base] == 1bv1);" "assume ~dll.base == 0bv32 || #valid[~dll.base] == 1bv1;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~dll.base, ~dll.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;~dll.base, ~dll.offset := ~next~2.base, ~next~2.offset;" "assume !true;" "assume true;" "~insert_fnc.base, ~insert_fnc.offset := #in~insert_fnc.base, #in~insert_fnc.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#dll~0.base, ~#dll~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~#dll~0.base, ~#dll~0.offset, 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "SUMMARY for call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset); srcloc: L578" "SUMMARY for call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset); srcloc: L578-1" "assume true;" "assume !(#t~nondet8 != 0bv32);havoc #t~nondet8;" "assume !!(#t~nondet8 != 0bv32);havoc #t~nondet8;" "SUMMARY for call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset); srcloc: L581" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~#dll~0.base, ~#dll~0.offset, 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem10.base, #t~mem10.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;#res.base, #res.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~#dll~0.base, ~#dll~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;havoc ~#dll~0.base, ~#dll~0.offset;" "assume true;" "SUMMARY for call #t~ret45.base, #t~ret45.offset := dll_create_master(); srcloc: mainENTRY" "~dll~1.base, ~dll~1.offset := #t~ret45.base, #t~ret45.offset;havoc #t~ret45.base, #t~ret45.offset;" "SUMMARY for call inspect_full(~dll~1.base, ~dll~1.offset); srcloc: L673" "SUMMARY for call dll_destroy_nested_lists(~dll~1.base, ~dll~1.offset); srcloc: L673-1" "SUMMARY for call inspect_dangling(~dll~1.base, ~dll~1.offset); srcloc: L674" "SUMMARY for call dll_reinit_nested_lists(~dll~1.base, ~dll~1.offset); srcloc: L675" "SUMMARY for call inspect_init(~dll~1.base, ~dll~1.offset); srcloc: L676" "SUMMARY for call dll_destroy_master(~dll~1.base, ~dll~1.offset); srcloc: L677" "#res := 0bv32;" "assume #valid == old(#valid);" "assume !(#valid == old(#valid));" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem12.base, #t~mem12.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~1.base, ~next~1.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;" "assume !(~dll.offset == 0bv32);" "assume ~dll.offset == 0bv32;" "assume !(~dll.base == 0bv32 || #valid[~dll.base] == 1bv1);" "assume ~dll.base == 0bv32 || #valid[~dll.base] == 1bv1;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~dll.base, ~dll.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;~dll.base, ~dll.offset := ~next~1.base, ~next~1.offset;" "assume !true;" "assume true;" "assume false;" "assume true;" "#NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem15.base, #t~mem15.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset;" "assume !true;" "assume true;" "#~9.base, #~9.offset := #in~9.base, #in~9.offset;" "assume #in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset;" "SUMMARY for call dll_insert_master(#~9.base, #~9.offset); srcloc: L-1-1" "assume !(#in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset);" "SUMMARY for call dll_insert_slave(#~9.base, #~9.offset); srcloc: L-1-3" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "SUMMARY for call inspect_base(~dll.base, ~dll.offset); srcloc: L666" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem44.base, #t~mem44.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume !(#t~mem44.base == 0bv32 && #t~mem44.offset == 0bv32);havoc #t~mem44.base, #t~mem44.offset;" "SUMMARY for call fail(); srcloc: L668-2" "assume !!(#t~mem44.base == 0bv32 && #t~mem44.offset == 0bv32);havoc #t~mem44.base, #t~mem44.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem43.base, #t~mem43.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset;" "assume !true;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "assume true;" "assume ~dll.base == 0bv32 && ~dll.offset == 0bv32;" "SUMMARY for call fail(); srcloc: L634-2" "assume !(~dll.base == 0bv32 && ~dll.offset == 0bv32);" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem21.base, #t~mem21.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem21.base == 0bv32 && #t~mem21.offset == 0bv32;havoc #t~mem21.base, #t~mem21.offset;" "SUMMARY for call fail(); srcloc: L635-1" "assume !(#t~mem21.base == 0bv32 && #t~mem21.offset == 0bv32);havoc #t~mem21.base, #t~mem21.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem22.base, #t~mem22.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume !(#t~mem22.base == 0bv32 && #t~mem22.offset == 0bv32);havoc #t~mem22.base, #t~mem22.offset;" "SUMMARY for call fail(); srcloc: L636-1" "assume !!(#t~mem22.base == 0bv32 && #t~mem22.offset == 0bv32);havoc #t~mem22.base, #t~mem22.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem23.base, #t~mem23.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem25.base, #t~mem25.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem25.base == 0bv32 && #t~mem25.offset == 0bv32;havoc #t~mem25.base, #t~mem25.offset;" "SUMMARY for call fail(); srcloc: L638-2" "assume !(#t~mem25.base == 0bv32 && #t~mem25.offset == 0bv32);havoc #t~mem25.base, #t~mem25.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem26.base, #t~mem26.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem26.base, ~bvadd32(#t~mem26.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem27.base, #t~mem27.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem27.base == 0bv32 && #t~mem27.offset == 0bv32;havoc #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;" "SUMMARY for call fail(); srcloc: L639-1" "assume !(#t~mem27.base == 0bv32 && #t~mem27.offset == 0bv32);havoc #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem28.base, #t~mem28.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem28.base, ~bvadd32(#t~mem28.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem29.base, #t~mem29.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume !(#t~mem29.base == ~dll.base && #t~mem29.offset == ~dll.offset);havoc #t~mem29.base, #t~mem29.offset;havoc #t~mem28.base, #t~mem28.offset;" "SUMMARY for call fail(); srcloc: L640-1" "assume !!(#t~mem29.base == ~dll.base && #t~mem29.offset == ~dll.offset);havoc #t~mem29.base, #t~mem29.offset;havoc #t~mem28.base, #t~mem28.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem24.base, #t~mem24.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem24.base, #t~mem24.offset;havoc #t~mem24.base, #t~mem24.offset;" "assume !true;" "assume true;" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset;" "assume ~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32;assume false;" "assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32);" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "SUMMARY for call inspect_base(~dll.base, ~dll.offset); srcloc: L645" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem31.base, #t~mem31.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~pos~0.base, ~pos~0.offset := #t~mem31.base, #t~mem31.offset;havoc #t~mem31.base, #t~mem31.offset;" "assume true;" "assume ~pos~0.base == 0bv32 && ~pos~0.offset == 0bv32;" "SUMMARY for call fail(); srcloc: L648-2" "assume !(~pos~0.base == 0bv32 && ~pos~0.offset == 0bv32);" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem32.base, #t~mem32.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem32.base == 0bv32 && #t~mem32.offset == 0bv32;havoc #t~mem32.base, #t~mem32.offset;" "SUMMARY for call fail(); srcloc: L649-1" "assume !(#t~mem32.base == 0bv32 && #t~mem32.offset == 0bv32);havoc #t~mem32.base, #t~mem32.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem33.base, #t~mem33.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume !(#t~mem33.base == 0bv32 && #t~mem33.offset == 0bv32);havoc #t~mem33.base, #t~mem33.offset;" "SUMMARY for call fail(); srcloc: L650-1" "assume !!(#t~mem33.base == 0bv32 && #t~mem33.offset == 0bv32);havoc #t~mem33.base, #t~mem33.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem34.base, #t~mem34.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~pos~0.base, ~pos~0.offset := #t~mem34.base, #t~mem34.offset;havoc #t~mem34.base, #t~mem34.offset;" "assume true;" "assume !(~pos~0.base != 0bv32 || ~pos~0.offset != 0bv32);" "assume !!(~pos~0.base != 0bv32 || ~pos~0.offset != 0bv32);" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem36.base, #t~mem36.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem36.base == 0bv32 && #t~mem36.offset == 0bv32;havoc #t~mem36.base, #t~mem36.offset;" "SUMMARY for call fail(); srcloc: L652-2" "assume !(#t~mem36.base == 0bv32 && #t~mem36.offset == 0bv32);havoc #t~mem36.base, #t~mem36.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem37.base, #t~mem37.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem37.base, ~bvadd32(#t~mem37.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem38.base, #t~mem38.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem38.base == 0bv32 && #t~mem38.offset == 0bv32;havoc #t~mem38.base, #t~mem38.offset;havoc #t~mem37.base, #t~mem37.offset;" "SUMMARY for call fail(); srcloc: L653-1" "assume !(#t~mem38.base == 0bv32 && #t~mem38.offset == 0bv32);havoc #t~mem38.base, #t~mem38.offset;havoc #t~mem37.base, #t~mem37.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem39.base, #t~mem39.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem39.base, ~bvadd32(#t~mem39.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem40.base, #t~mem40.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume !(#t~mem40.base == ~pos~0.base && #t~mem40.offset == ~pos~0.offset);havoc #t~mem40.base, #t~mem40.offset;havoc #t~mem39.base, #t~mem39.offset;" "SUMMARY for call fail(); srcloc: L654-1" "assume !!(#t~mem40.base == ~pos~0.base && #t~mem40.offset == ~pos~0.offset);havoc #t~mem40.base, #t~mem40.offset;havoc #t~mem39.base, #t~mem39.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem35.base, #t~mem35.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~pos~0.base, ~pos~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem30.base, #t~mem30.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem30.base, #t~mem30.offset;havoc #t~mem30.base, #t~mem30.offset;" "assume !true;" "assume true;" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~1.base, ~ptr~1.offset := #t~malloc3.base, #t~malloc3.offset;" "assume ~ptr~1.base == 0bv32 && ~ptr~1.offset == 0bv32;assume false;" "assume !(~ptr~1.base == 0bv32 && ~ptr~1.offset == 0bv32);" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 0bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 4bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 8bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~1.base, ~ptr~1.offset;" "assume true;" "SUMMARY for call ULTIMATE.init(); srcloc: ULTIMATE.startENTRY" "SUMMARY for call #t~ret46 := main(); srcloc: L-1" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "SUMMARY for call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave(); srcloc: L568" "~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume ~next~0.base != 0bv32 || ~next~0.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~next~0.base, ~bvadd32(~next~0.offset, 4bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume !(~next~0.base != 0bv32 || ~next~0.offset != 0bv32);" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "SUMMARY for call inspect_base(~dll.base, ~dll.offset); srcloc: L660" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem42.base, #t~mem42.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem42.base == 0bv32 && #t~mem42.offset == 0bv32;havoc #t~mem42.base, #t~mem42.offset;" "SUMMARY for call fail(); srcloc: L662-2" "assume !(#t~mem42.base == 0bv32 && #t~mem42.offset == 0bv32);havoc #t~mem42.base, #t~mem42.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem41.base, #t~mem41.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem41.base, #t~mem41.offset;havoc #t~mem41.base, #t~mem41.offset;" "assume !true;" "assume true;" }, returnAlphabet = {"#705#return;" "#707#return;" "#709#return;" "#711#return;" "#713#return;" "#715#return;" "#717#return;" "#719#return;" "#721#return;" "#723#return;" "#725#return;" "#727#return;" "#729#return;" "#731#return;" "#733#return;" "#735#return;" "#737#return;" "#739#return;" "#741#return;" "#743#return;" "#745#return;" "#747#return;" "#749#return;" "#685#return;" "#751#return;" "#687#return;" "#689#return;" "#753#return;" "#755#return;" "#691#return;" "#757#return;" "#693#return;" "#695#return;" "#697#return;" "#699#return;" "#701#return;" "#703#return;" }, states = {"40066#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "40070#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= |#valid| (store |old(#valid)| |alloc_or_die_slave_#res.base| (_ bv1 1))) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "40074#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| |dll_insert_slave_#t~ret4.base| (_ bv1 1))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base))" "39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))" "40077#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "39183#(and (= (_ bv12 32) (select |#length| |dll_insert_master_#t~ret17.base|)) (= (_ bv0 32) |dll_insert_master_#t~ret17.offset|) (= (_ bv1 1) (select |#valid| |dll_insert_master_#t~ret17.base|)))" "40080#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "39314#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "40083#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "40087#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "40090#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "40093#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (bvadd (select |#valid| |dll_insert_slave_write~$Pointer$_#ptr.base|) (_ bv1 1)) (_ bv0 1)) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "40097#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) (_ bv1 1)) |#valid|) (= (_ bv1 1) (select |#valid| |dll_insert_slave_#in~dll.base|)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "39332#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "40037#(and (= (_ bv12 32) (select |#length| |alloc_or_die_master_#res.base|)) (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)) (= (bvadd (select |#valid| |alloc_or_die_master_#res.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |alloc_or_die_master_#res.offset|))" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "39339#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "39098#true" "40062#(and (= alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (= |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" }, initialStates = {"39098#true" }, finalStates = {}, callTransitions = { ("39314#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "call #t~ret19.base, #t~ret19.offset := dll_create_slave();" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call dll_destroy_slave(#t~mem13.base, #t~mem13.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call #t~ret17.base, #t~ret17.offset := alloc_or_die_master();" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call inspect_base(~dll.base, ~dll.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call #t~ret45.base, #t~ret45.offset := dll_create_master();" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call #t~ret11.base, #t~ret11.offset := dll_create_generic(#funAddr~dll_insert_slave.base, #funAddr~dll_insert_slave.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call #t~ret20.base, #t~ret20.offset := dll_create_generic(#funAddr~dll_insert_master.base, #funAddr~dll_insert_master.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call inspect_base(~dll.base, ~dll.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call inspect_base(~dll.base, ~dll.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call dll_insert_master(#~9.base, #~9.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call dll_insert_slave(#~9.base, #~9.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39332#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave();" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call dll_destroy_nested_lists(~dll~1.base, ~dll~1.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call dll_destroy_slave(#t~mem13.base, #t~mem13.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call inspect_dangling(~dll~1.base, ~dll~1.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call dll_reinit_nested_lists(~dll~1.base, ~dll~1.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call inspect_init(~dll~1.base, ~dll~1.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call dll_destroy_master(~dll~1.base, ~dll~1.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call ULTIMATE.init();" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call #t~ret46 := main();" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call inspect_full(~dll~1.base, ~dll~1.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") }, internalTransitions = { ("40066#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "40066#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("40066#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset;" "40070#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= |#valid| (store |old(#valid)| |alloc_or_die_slave_#res.base| (_ bv1 1))) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("40070#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= |#valid| (store |old(#valid)| |alloc_or_die_slave_#res.base| (_ bv1 1))) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "assume true;" "40070#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= |#valid| (store |old(#valid)| |alloc_or_die_slave_#res.base| (_ bv1 1))) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("40074#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| |dll_insert_slave_#t~ret4.base| (_ bv1 1))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base))" "~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "40077#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))") ("39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))" "assume true;" "39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))") ("40077#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "40080#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))") ("39183#(and (= (_ bv12 32) (select |#length| |dll_insert_master_#t~ret17.base|)) (= (_ bv0 32) |dll_insert_master_#t~ret17.offset|) (= (_ bv1 1) (select |#valid| |dll_insert_master_#t~ret17.base|)))" "~item~1.base, ~item~1.offset := #t~ret17.base, #t~ret17.offset;havoc #t~ret17.base, #t~ret17.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("40080#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32;" "40083#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume !(~next~3.base != 0bv32 || ~next~3.offset != 0bv32);" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem18.base, #t~mem18.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~3.base, ~next~3.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~3.base, ~next~3.offset, ~item~1.base, ~bvadd32(~item~1.offset, 0bv32), 4bv32;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume ~next~3.base != 0bv32 || ~next~3.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~1.base, ~item~1.offset, ~next~3.base, ~bvadd32(~next~3.offset, 4bv32), 4bv32;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("40083#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "40087#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))") ("40083#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "40083#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem37.base, #t~mem37.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem37.base, ~bvadd32(#t~mem37.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem38.base, #t~mem38.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem13.base, #t~mem13.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "havoc #t~mem13.base, #t~mem13.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#t~mem38.base == 0bv32 && #t~mem38.offset == 0bv32);havoc #t~mem38.base, #t~mem38.offset;havoc #t~mem37.base, #t~mem37.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem14.base, #t~mem14.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem39.base, #t~mem39.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem39.base, ~bvadd32(#t~mem39.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem40.base, #t~mem40.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(#t~mem40.base == ~pos~0.base && #t~mem40.offset == ~pos~0.offset);havoc #t~mem40.base, #t~mem40.offset;havoc #t~mem39.base, #t~mem39.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem35.base, #t~mem35.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~pos~0.base, ~pos~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem30.base, #t~mem30.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem30.base, #t~mem30.offset;havoc #t~mem30.base, #t~mem30.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem16.base, #t~mem16.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~2.base, ~next~2.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~1.base, ~ptr~1.offset := #t~malloc3.base, #t~malloc3.offset;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.offset == 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume ~dll.offset == 0bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base == 0bv32 || #valid[~dll.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume ~dll.base == 0bv32 || #valid[~dll.base] == 1bv1;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~dll.base, ~dll.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;~dll.base, ~dll.offset := ~next~2.base, ~next~2.offset;" "39098#true") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~insert_fnc.base, ~insert_fnc.offset := #in~insert_fnc.base, #in~insert_fnc.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#dll~0.base, ~#dll~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~#dll~0.base, ~#dll~0.offset, 4bv32;" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39332#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem12.base, #t~mem12.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~1.base, ~next~1.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.offset == 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume ~dll.offset == 0bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base == 0bv32 || #valid[~dll.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume ~dll.base == 0bv32 || #valid[~dll.base] == 1bv1;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~dll.base, ~dll.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;~dll.base, ~dll.offset := ~next~1.base, ~next~1.offset;" "39098#true") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem42.base, #t~mem42.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];" "39098#true") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#t~mem42.base == 0bv32 && #t~mem42.offset == 0bv32);havoc #t~mem42.base, #t~mem42.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem41.base, #t~mem41.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem41.base, #t~mem41.offset;havoc #t~mem41.base, #t~mem41.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#~9.base, #~9.offset := #in~9.base, #in~9.offset;" "39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem44.base, #t~mem44.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(#t~mem44.base == 0bv32 && #t~mem44.offset == 0bv32);havoc #t~mem44.base, #t~mem44.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem43.base, #t~mem43.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base == 0bv32 && ~dll.offset == 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem21.base, #t~mem21.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#t~mem21.base == 0bv32 && #t~mem21.offset == 0bv32);havoc #t~mem21.base, #t~mem21.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem22.base, #t~mem22.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(#t~mem22.base == 0bv32 && #t~mem22.offset == 0bv32);havoc #t~mem22.base, #t~mem22.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem23.base, #t~mem23.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem25.base, #t~mem25.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#t~mem25.base == 0bv32 && #t~mem25.offset == 0bv32);havoc #t~mem25.base, #t~mem25.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem26.base, #t~mem26.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem26.base, ~bvadd32(#t~mem26.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem27.base, #t~mem27.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#t~mem27.base == 0bv32 && #t~mem27.offset == 0bv32);havoc #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem28.base, #t~mem28.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem28.base, ~bvadd32(#t~mem28.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem29.base, #t~mem29.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(#t~mem29.base == ~dll.base && #t~mem29.offset == ~dll.offset);havoc #t~mem29.base, #t~mem29.offset;havoc #t~mem28.base, #t~mem28.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem24.base, #t~mem24.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem24.base, #t~mem24.offset;havoc #t~mem24.base, #t~mem24.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset;" "39339#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem31.base, #t~mem31.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~pos~0.base, ~pos~0.offset := #t~mem31.base, #t~mem31.offset;havoc #t~mem31.base, #t~mem31.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~pos~0.base == 0bv32 && ~pos~0.offset == 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem32.base, #t~mem32.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#t~mem32.base == 0bv32 && #t~mem32.offset == 0bv32);havoc #t~mem32.base, #t~mem32.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem33.base, #t~mem33.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(#t~mem33.base == 0bv32 && #t~mem33.offset == 0bv32);havoc #t~mem33.base, #t~mem33.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem34.base, #t~mem34.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~pos~0.base, ~pos~0.offset := #t~mem34.base, #t~mem34.offset;havoc #t~mem34.base, #t~mem34.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~pos~0.base != 0bv32 || ~pos~0.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(~pos~0.base != 0bv32 || ~pos~0.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem36.base, #t~mem36.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#t~mem36.base == 0bv32 && #t~mem36.offset == 0bv32);havoc #t~mem36.base, #t~mem36.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("40087#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "assume ~next~0.base != 0bv32 || ~next~0.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~next~0.base, ~bvadd32(~next~0.offset, 4bv32), 4bv32;" "40090#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))") ("40087#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "assume !(~next~0.base != 0bv32 || ~next~0.offset != 0bv32);" "40090#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))") ("39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset;" "39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset);" "39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("40090#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "40090#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))") ("40090#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "40090#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))") ("40090#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32;" "40093#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (bvadd (select |#valid| |dll_insert_slave_write~$Pointer$_#ptr.base|) (_ bv1 1)) (_ bv0 1)) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("40093#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (bvadd (select |#valid| |dll_insert_slave_write~$Pointer$_#ptr.base|) (_ bv1 1)) (_ bv0 1)) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "40093#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (bvadd (select |#valid| |dll_insert_slave_write~$Pointer$_#ptr.base|) (_ bv1 1)) (_ bv0 1)) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("40093#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (bvadd (select |#valid| |dll_insert_slave_write~$Pointer$_#ptr.base|) (_ bv1 1)) (_ bv0 1)) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "40097#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) (_ bv1 1)) |#valid|) (= (_ bv1 1) (select |#valid| |dll_insert_slave_#in~dll.base|)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("40097#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) (_ bv1 1)) |#valid|) (= (_ bv1 1) (select |#valid| |dll_insert_slave_#in~dll.base|)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "assume true;" "40097#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) (_ bv1 1)) |#valid|) (= (_ bv1 1) (select |#valid| |dll_insert_slave_#in~dll.base|)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("40037#(and (= (_ bv12 32) (select |#length| |alloc_or_die_master_#res.base|)) (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)) (= (bvadd (select |#valid| |alloc_or_die_master_#res.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |alloc_or_die_master_#res.offset|))" "assume true;" "40037#(and (= (_ bv12 32) (select |#length| |alloc_or_die_master_#res.base|)) (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)) (= (bvadd (select |#valid| |alloc_or_die_master_#res.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |alloc_or_die_master_#res.offset|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem15.base, #t~mem15.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset;" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume true;" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume true;" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39339#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32);" "39339#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39339#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32;" "40062#(and (= alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (= |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))") ("39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~1.base, ~ptr~1.offset;" "40037#(and (= (_ bv12 32) (select |#length| |alloc_or_die_master_#res.base|)) (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)) (= (bvadd (select |#valid| |alloc_or_die_master_#res.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |alloc_or_die_master_#res.offset|))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume !(~ptr~1.base == 0bv32 && ~ptr~1.offset == 0bv32);" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 0bv32), 4bv32;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 4bv32), 4bv32;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 8bv32), 4bv32;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "assume true;" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))") ("39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "assume !(#t~nondet8 != 0bv32);havoc #t~nondet8;" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))") ("39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "assume !!(#t~nondet8 != 0bv32);havoc #t~nondet8;" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))") ("39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~#dll~0.base, ~#dll~0.offset, 4bv32;" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))") ("39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))") ("39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem10.base, #t~mem10.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;#res.base, #res.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~#dll~0.base, ~#dll~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;havoc ~#dll~0.base, ~#dll~0.offset;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "#res.base, #res.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "#res.base, #res.offset := #t~ret20.base, #t~ret20.offset;havoc #t~ret20.base, #t~ret20.offset;" "39098#true") ("39098#true" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39098#true") ("39098#true" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39098#true") ("39098#true" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39098#true") ("39098#true" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39098#true") ("39098#true" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem12.base, #t~mem12.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~1.base, ~next~1.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "assume !(~dll.offset == 0bv32);" "39098#true") ("39098#true" "assume ~dll.offset == 0bv32;" "39098#true") ("39098#true" "assume !(~dll.base == 0bv32 || #valid[~dll.base] == 1bv1);" "39098#true") ("39098#true" "assume ~dll.base == 0bv32 || #valid[~dll.base] == 1bv1;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~dll.base, ~dll.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;~dll.base, ~dll.offset := ~next~1.base, ~next~1.offset;" "39098#true") ("39098#true" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39098#true") ("39098#true" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "39098#true") ("39098#true" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39098#true") ("39098#true" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39098#true") ("39098#true" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem13.base, #t~mem13.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "havoc #t~mem13.base, #t~mem13.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39098#true") ("39098#true" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39098#true") ("39098#true" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39098#true") ("39098#true" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39098#true") ("39098#true" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem14.base, #t~mem14.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := #t~ret19.base, #t~ret19.offset, ~item~1.base, ~bvadd32(~item~1.offset, 8bv32), 4bv32;" "39098#true") ("39098#true" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "39098#true") ("39098#true" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "39098#true") ("39098#true" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;havoc #t~ret19.base, #t~ret19.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~1.base, ~item~1.offset, ~dll.base, ~dll.offset, 4bv32;" "39098#true") ("39098#true" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "39098#true") ("39098#true" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39098#true") ("39098#true" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "39098#true") ("39098#true" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39098#true") ("39098#true" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39098#true") ("39098#true" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39098#true") ("39098#true" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39098#true") ("39098#true" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39098#true") ("39098#true" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem16.base, #t~mem16.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~2.base, ~next~2.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;" "39098#true") ("39098#true" "assume !(~dll.offset == 0bv32);" "39098#true") ("39098#true" "assume ~dll.offset == 0bv32;" "39098#true") ("39098#true" "assume !(~dll.base == 0bv32 || #valid[~dll.base] == 1bv1);" "39098#true") ("39098#true" "assume ~dll.base == 0bv32 || #valid[~dll.base] == 1bv1;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~dll.base, ~dll.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;~dll.base, ~dll.offset := ~next~2.base, ~next~2.offset;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "assume !(#t~nondet8 != 0bv32);havoc #t~nondet8;" "39098#true") ("39098#true" "assume !!(#t~nondet8 != 0bv32);havoc #t~nondet8;" "39098#true") ("39098#true" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~#dll~0.base, ~#dll~0.offset, 4bv32;" "39098#true") ("39098#true" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39098#true") ("39098#true" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39098#true") ("39098#true" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39098#true") ("39098#true" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem10.base, #t~mem10.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;#res.base, #res.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~#dll~0.base, ~#dll~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;havoc ~#dll~0.base, ~#dll~0.offset;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "~dll~1.base, ~dll~1.offset := #t~ret45.base, #t~ret45.offset;havoc #t~ret45.base, #t~ret45.offset;" "39098#true") ("39098#true" "#res := 0bv32;" "39098#true") ("39098#true" "assume !(#valid == old(#valid));" "39098#true") ("40062#(and (= alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (= |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32;" "40066#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("40062#(and (= alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (= |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "40062#(and (= alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (= |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") }, returnTransitions = { ("40070#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= |#valid| (store |old(#valid)| |alloc_or_die_slave_#res.base| (_ bv1 1))) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "39332#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#753#return;" "40074#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| |dll_insert_slave_#t~ret4.base| (_ bv1 1))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base))") ("39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))" "39314#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "#697#return;" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))") ("39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "#699#return;" "39098#true") ("39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))" "39098#true" "#699#return;" "39098#true") ("39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "#695#return;" "39314#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#689#return;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#755#return;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#735#return;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#719#return;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39098#true" "#705#return;" "39098#true") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39098#true" "#689#return;" "39098#true") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39098#true" "#707#return;" "39098#true") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39098#true" "#709#return;" "39098#true") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39098#true" "#711#return;" "39098#true") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39098#true" "#713#return;" "39098#true") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39098#true" "#703#return;" "39098#true") ("40097#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) (_ bv1 1)) |#valid|) (= (_ bv1 1) (select |#valid| |dll_insert_slave_#in~dll.base|)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#717#return;" "39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))") ("40037#(and (= (_ bv12 32) (select |#length| |alloc_or_die_master_#res.base|)) (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)) (= (bvadd (select |#valid| |alloc_or_die_master_#res.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |alloc_or_die_master_#res.offset|))" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#691#return;" "39183#(and (= (_ bv12 32) (select |#length| |dll_insert_master_#t~ret17.base|)) (= (_ bv0 32) |dll_insert_master_#t~ret17.offset|) (= (_ bv1 1) (select |#valid| |dll_insert_master_#t~ret17.base|)))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "39098#true" "#709#return;" "39098#true") ("39098#true" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "#693#return;" "39098#true") ("39098#true" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#689#return;" "39098#true") ("39098#true" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#685#return;" "39098#true") ("39098#true" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#701#return;" "39098#true") ("39098#true" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#687#return;" "39098#true") ("39098#true" "39098#true" "#705#return;" "39098#true") ("39098#true" "39098#true" "#689#return;" "39098#true") ("39098#true" "39098#true" "#697#return;" "39098#true") ("39098#true" "39098#true" "#713#return;" "39098#true") ("39098#true" "39098#true" "#699#return;" "39098#true") ("39098#true" "39098#true" "#749#return;" "39098#true") ("39098#true" "39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#715#return;" "39098#true") ("39098#true" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "#695#return;" "39098#true") } ); [2018-10-27 04:57:15,779 FATAL L842 BasicCegarLoop]: -- [2018-10-27 04:57:15,780 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: enhanced interpolant automaton in iteration 36 broken: counterexample of length 142 not accepted (original is ok) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.checkEnhancement(BasicCegarLoop.java:817) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:719) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-27 04:57:15,796 INFO L168 Benchmark]: Toolchain (without parser) took 352982.67 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 239.1 MB). Free memory was 945.2 MB in the beginning and 1.0 GB in the end (delta: -93.3 MB). Peak memory consumption was 145.8 MB. Max. memory is 11.5 GB. [2018-10-27 04:57:15,796 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:57:15,796 INFO L168 Benchmark]: CACSL2BoogieTranslator took 563.60 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 911.6 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2018-10-27 04:57:15,797 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.71 ms. Allocated memory is still 1.0 GB. Free memory was 911.6 MB in the beginning and 906.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-27 04:57:15,797 INFO L168 Benchmark]: Boogie Preprocessor took 134.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 906.3 MB in the beginning and 1.2 GB in the end (delta: -257.7 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2018-10-27 04:57:15,797 INFO L168 Benchmark]: RCFGBuilder took 2430.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 102.4 MB). Peak memory consumption was 102.4 MB. Max. memory is 11.5 GB. [2018-10-27 04:57:15,806 INFO L168 Benchmark]: TraceAbstraction took 349783.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 23.1 MB). Peak memory consumption was 82.8 MB. Max. memory is 11.5 GB. [2018-10-27 04:57:15,808 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 563.60 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 911.6 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.71 ms. Allocated memory is still 1.0 GB. Free memory was 911.6 MB in the beginning and 906.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 134.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 906.3 MB in the beginning and 1.2 GB in the end (delta: -257.7 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2430.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 102.4 MB). Peak memory consumption was 102.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 349783.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 23.1 MB). Peak memory consumption was 82.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: enhanced interpolant automaton in iteration 36 broken: counterexample of length 142 not accepted (original is ok) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: enhanced interpolant automaton in iteration 36 broken: counterexample of length 142 not accepted (original is ok): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.checkEnhancement(BasicCegarLoop.java:817) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...