./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 992626749f2e8ca84a93ad6fc64a197d6c8e66b412d995c24cf1e1136a1f2393 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:52:45,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:52:45,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:52:45,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:52:45,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:52:45,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:52:45,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:52:45,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:52:45,899 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:52:45,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:52:45,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:52:45,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:52:45,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:52:45,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:52:45,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:52:45,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:52:45,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:52:45,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:52:45,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:52:45,915 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:52:45,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:52:45,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:52:45,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:52:45,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:52:45,923 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:52:45,923 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:52:45,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:52:45,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:52:45,924 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:52:45,925 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:52:45,925 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:52:45,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:52:45,927 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:52:45,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:52:45,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:52:45,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:52:45,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:52:45,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:52:45,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:52:45,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:52:45,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:52:45,931 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 21:52:45,955 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:52:45,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:52:45,956 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:52:45,956 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:52:45,957 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:52:45,957 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:52:45,958 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:52:45,958 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:52:45,958 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:52:45,958 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:52:45,959 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:52:45,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:52:45,959 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:52:45,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:52:45,959 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:52:45,960 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:52:45,960 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:52:45,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:52:45,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:52:45,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:52:45,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:52:45,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:52:45,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:52:45,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:52:45,961 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:52:45,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:52:45,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:52:45,961 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:52:45,962 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:52:45,962 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:52:45,962 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 992626749f2e8ca84a93ad6fc64a197d6c8e66b412d995c24cf1e1136a1f2393 [2022-02-20 21:52:46,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:52:46,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:52:46,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:52:46,159 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:52:46,159 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:52:46,160 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i [2022-02-20 21:52:46,235 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a87a97b7/6b39c4d9a39046759bd034f121f48a18/FLAGbc7c8a1a7 [2022-02-20 21:52:46,698 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:52:46,698 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i [2022-02-20 21:52:46,740 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a87a97b7/6b39c4d9a39046759bd034f121f48a18/FLAGbc7c8a1a7 [2022-02-20 21:52:46,981 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a87a97b7/6b39c4d9a39046759bd034f121f48a18 [2022-02-20 21:52:46,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:52:46,985 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:52:46,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:52:46,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:52:46,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:52:46,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:52:46" (1/1) ... [2022-02-20 21:52:46,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7acd33d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:46, skipping insertion in model container [2022-02-20 21:52:46,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:52:46" (1/1) ... [2022-02-20 21:52:46,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:52:47,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:52:47,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i[154031,154044] [2022-02-20 21:52:47,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:52:47,760 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:52:47,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i[154031,154044] [2022-02-20 21:52:47,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:52:47,988 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:52:47,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:47 WrapperNode [2022-02-20 21:52:47,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:52:47,991 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:52:47,991 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:52:47,992 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:52:47,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:47" (1/1) ... [2022-02-20 21:52:48,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:47" (1/1) ... [2022-02-20 21:52:48,074 INFO L137 Inliner]: procedures = 90, calls = 193, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 546 [2022-02-20 21:52:48,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:52:48,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:52:48,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:52:48,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:52:48,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:47" (1/1) ... [2022-02-20 21:52:48,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:47" (1/1) ... [2022-02-20 21:52:48,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:47" (1/1) ... [2022-02-20 21:52:48,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:47" (1/1) ... [2022-02-20 21:52:48,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:47" (1/1) ... [2022-02-20 21:52:48,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:47" (1/1) ... [2022-02-20 21:52:48,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:47" (1/1) ... [2022-02-20 21:52:48,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:52:48,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:52:48,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:52:48,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:52:48,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:47" (1/1) ... [2022-02-20 21:52:48,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:52:48,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:52:48,176 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 21:52:48,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 21:52:48,212 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-02-20 21:52:48,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-02-20 21:52:48,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:52:48,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 21:52:48,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:52:48,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:52:48,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 21:52:48,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 21:52:48,214 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:52:48,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:52:48,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:52:48,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 21:52:48,215 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 21:52:48,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:52:48,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-02-20 21:52:48,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-02-20 21:52:48,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 21:52:48,215 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 21:52:48,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:52:48,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:52:48,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_14 [2022-02-20 21:52:48,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_14 [2022-02-20 21:52:48,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:52:48,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:52:48,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-02-20 21:52:48,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-02-20 21:52:48,216 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-02-20 21:52:48,217 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-02-20 21:52:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_zalloc [2022-02-20 21:52:48,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_zalloc [2022-02-20 21:52:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:52:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:52:48,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:52:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-02-20 21:52:48,217 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-02-20 21:52:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure skb_mac_header [2022-02-20 21:52:48,218 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_mac_header [2022-02-20 21:52:48,218 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:52:48,218 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:52:48,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:52:48,218 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2022-02-20 21:52:48,218 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2022-02-20 21:52:48,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:52:48,219 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2022-02-20 21:52:48,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2022-02-20 21:52:48,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 21:52:48,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:52:48,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:52:48,428 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:52:48,430 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:52:48,574 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:52:49,249 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:52:49,260 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:52:49,260 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 21:52:49,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:52:49 BoogieIcfgContainer [2022-02-20 21:52:49,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:52:49,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:52:49,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:52:49,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:52:49,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:52:46" (1/3) ... [2022-02-20 21:52:49,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@635a0819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:52:49, skipping insertion in model container [2022-02-20 21:52:49,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:47" (2/3) ... [2022-02-20 21:52:49,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@635a0819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:52:49, skipping insertion in model container [2022-02-20 21:52:49,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:52:49" (3/3) ... [2022-02-20 21:52:49,270 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i [2022-02-20 21:52:49,274 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:52:49,274 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:52:49,322 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:52:49,328 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 21:52:49,328 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:52:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 170 states have (on average 1.3647058823529412) internal successors, (232), 175 states have internal predecessors, (232), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-02-20 21:52:49,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 21:52:49,357 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:52:49,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:52:49,358 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:52:49,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:52:49,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1296188460, now seen corresponding path program 1 times [2022-02-20 21:52:49,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:52:49,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069421760] [2022-02-20 21:52:49,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:52:49,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:52:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:49,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:52:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:49,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:52:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:49,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {254#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {230#true} is VALID [2022-02-20 21:52:49,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#true} assume true; {230#true} is VALID [2022-02-20 21:52:49,684 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {230#true} {230#true} #537#return; {230#true} is VALID [2022-02-20 21:52:49,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:52:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:49,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {230#true} ~cond := #in~cond; {230#true} is VALID [2022-02-20 21:52:49,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#true} assume 0 == ~cond;assume false; {231#false} is VALID [2022-02-20 21:52:49,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#false} assume true; {231#false} is VALID [2022-02-20 21:52:49,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#false} {230#true} #539#return; {231#false} is VALID [2022-02-20 21:52:49,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {230#true} is VALID [2022-02-20 21:52:49,707 INFO L272 TraceCheckUtils]: 1: Hoare triple {230#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {254#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:49,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {230#true} is VALID [2022-02-20 21:52:49,707 INFO L290 TraceCheckUtils]: 3: Hoare triple {230#true} assume true; {230#true} is VALID [2022-02-20 21:52:49,708 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {230#true} {230#true} #537#return; {230#true} is VALID [2022-02-20 21:52:49,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {230#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {230#true} is VALID [2022-02-20 21:52:49,709 INFO L272 TraceCheckUtils]: 6: Hoare triple {230#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {230#true} is VALID [2022-02-20 21:52:49,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {230#true} ~cond := #in~cond; {230#true} is VALID [2022-02-20 21:52:49,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {230#true} assume 0 == ~cond;assume false; {231#false} is VALID [2022-02-20 21:52:49,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#false} assume true; {231#false} is VALID [2022-02-20 21:52:49,710 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {231#false} {230#true} #539#return; {231#false} is VALID [2022-02-20 21:52:49,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {231#false} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {231#false} is VALID [2022-02-20 21:52:49,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {231#false} assume true; {231#false} is VALID [2022-02-20 21:52:49,711 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {231#false} {230#true} #543#return; {231#false} is VALID [2022-02-20 21:52:49,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {230#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(103, 2);call #Ultimate.allocInit(41, 3);call #Ultimate.allocInit(2, 4);call write~init~int(12, 4, 0, 1);call write~init~int(0, 4, 1, 1);call #Ultimate.allocInit(44, 5);call #Ultimate.allocInit(2, 6);call write~init~int(14, 6, 0, 1);call write~init~int(0, 6, 1, 1);call #Ultimate.allocInit(35, 7);call #Ultimate.allocInit(2, 8);call write~init~int(14, 8, 0, 1);call write~init~int(0, 8, 1, 1);call #Ultimate.allocInit(45, 9);call #Ultimate.allocInit(2, 10);call write~init~int(12, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(2, 12);call write~init~int(12, 12, 0, 1);call write~init~int(0, 12, 1, 1);call #Ultimate.allocInit(40, 13);call #Ultimate.allocInit(2, 14);call write~init~int(14, 14, 0, 1);call write~init~int(0, 14, 1, 1);call #Ultimate.allocInit(54, 15);~LDV_IN_INTERRUPT~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := 0, 0;~#capmode_proto~0.base, ~#capmode_proto~0.offset := 16, 0;call #Ultimate.allocInit(49, 16);call write~init~int(114, ~#capmode_proto~0.base, ~#capmode_proto~0.offset, 1);call write~init~int(508, ~#capmode_proto~0.base, 1 + ~#capmode_proto~0.offset, 4);call write~init~int(0, ~#capmode_proto~0.base, 5 + ~#capmode_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#capmode_proto~0.base, 9 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#capmode_proto~0.base, 17 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#capmode_proto~0.base, 25 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#capmode_proto~0.base, 33 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ack_tx.base, #funAddr~ack_tx.offset, ~#capmode_proto~0.base, 41 + ~#capmode_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 17, 0;call #Ultimate.allocInit(120, 17);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {230#true} is VALID [2022-02-20 21:52:49,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet99#1, main_#t~ret100#1.base, main_#t~ret100#1.offset, main_#t~nondet101#1, main_#t~nondet102#1, main_#t~nondet103#1, main_#t~nondet104#1, main_#t~nondet105#1, main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset, main_#t~nondet107#1, main_#t~switch108#1, main_#t~nondet109#1, main_#t~switch110#1, main_#t~ret111#1, main_#t~ret112#1, main_#t~mem113#1, main_#t~ret114#1, main_#t~nondet115#1, main_#t~switch116#1, main_#t~ret117#1, main_~ldvarg7~0#1, main_~tmp~9#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~0#1, main_~ldvarg5~0#1, main_~tmp___2~0#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~9#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet99#1 && main_#t~nondet99#1 <= 2147483647;main_~tmp~9#1 := main_#t~nondet99#1;havoc main_#t~nondet99#1;main_~ldvarg7~0#1 := main_~tmp~9#1; {230#true} is VALID [2022-02-20 21:52:49,714 INFO L272 TraceCheckUtils]: 2: Hoare triple {230#true} call main_#t~ret100#1.base, main_#t~ret100#1.offset := ldv_successful_zalloc(232); {246#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:49,714 INFO L290 TraceCheckUtils]: 3: Hoare triple {246#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {230#true} is VALID [2022-02-20 21:52:49,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {230#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {254#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:49,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {254#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {230#true} is VALID [2022-02-20 21:52:49,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {230#true} assume true; {230#true} is VALID [2022-02-20 21:52:49,716 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {230#true} {230#true} #537#return; {230#true} is VALID [2022-02-20 21:52:49,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {230#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {230#true} is VALID [2022-02-20 21:52:49,717 INFO L272 TraceCheckUtils]: 9: Hoare triple {230#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {230#true} is VALID [2022-02-20 21:52:49,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {230#true} ~cond := #in~cond; {230#true} is VALID [2022-02-20 21:52:49,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {230#true} assume 0 == ~cond;assume false; {231#false} is VALID [2022-02-20 21:52:49,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {231#false} assume true; {231#false} is VALID [2022-02-20 21:52:49,720 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {231#false} {230#true} #539#return; {231#false} is VALID [2022-02-20 21:52:49,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {231#false} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {231#false} is VALID [2022-02-20 21:52:49,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {231#false} assume true; {231#false} is VALID [2022-02-20 21:52:49,722 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {231#false} {230#true} #543#return; {231#false} is VALID [2022-02-20 21:52:49,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {231#false} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret100#1.base, main_#t~ret100#1.offset;havoc main_#t~ret100#1.base, main_#t~ret100#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet101#1 && main_#t~nondet101#1 <= 2147483647;main_~tmp___1~0#1 := main_#t~nondet101#1;havoc main_#t~nondet101#1;main_~ldvarg0~0#1 := main_~tmp___1~0#1;assume -2147483648 <= main_#t~nondet102#1 && main_#t~nondet102#1 <= 2147483647;main_~tmp___2~0#1 := main_#t~nondet102#1;havoc main_#t~nondet102#1;main_~ldvarg5~0#1 := main_~tmp___2~0#1;assume -2147483648 <= main_#t~nondet103#1 && main_#t~nondet103#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet103#1;havoc main_#t~nondet103#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet104#1 && main_#t~nondet104#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet104#1;havoc main_#t~nondet104#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet105#1;havoc main_#t~nondet105#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {231#false} is VALID [2022-02-20 21:52:49,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {231#false} assume { :end_inline_ldv_set_init } true; {231#false} is VALID [2022-02-20 21:52:49,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {231#false} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr141#1;#Ultimate.C_memset_#t~loopctr141#1 := 0; {231#false} is VALID [2022-02-20 21:52:49,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {231#false} assume !(#Ultimate.C_memset_#t~loopctr141#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {231#false} is VALID [2022-02-20 21:52:49,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {231#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {231#false} is VALID [2022-02-20 21:52:49,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {231#false} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {231#false} is VALID [2022-02-20 21:52:49,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {231#false} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1 == main_~tmp___6~0#1; {231#false} is VALID [2022-02-20 21:52:49,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {231#false} assume main_#t~switch108#1; {231#false} is VALID [2022-02-20 21:52:49,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {231#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet115#1 && main_#t~nondet115#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0 == main_~tmp___8~0#1; {231#false} is VALID [2022-02-20 21:52:49,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {231#false} assume main_#t~switch116#1; {231#false} is VALID [2022-02-20 21:52:49,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {231#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_capmode_module_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;havoc arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset;arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset := arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset; {231#false} is VALID [2022-02-20 21:52:49,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {231#false} assume { :end_inline_arcnet_unregister_proto } true; {231#false} is VALID [2022-02-20 21:52:49,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {231#false} assume { :end_inline_capmode_module_exit } true;~ldv_state_variable_0~0 := 2; {231#false} is VALID [2022-02-20 21:52:49,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {231#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret132#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {231#false} is VALID [2022-02-20 21:52:49,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {231#false} ldv_check_final_state_#t~ret132#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret132#1 && ldv_check_final_state_#t~ret132#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret132#1;havoc ldv_check_final_state_#t~ret132#1; {231#false} is VALID [2022-02-20 21:52:49,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {231#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {231#false} is VALID [2022-02-20 21:52:49,735 INFO L272 TraceCheckUtils]: 33: Hoare triple {231#false} call ldv_error(); {231#false} is VALID [2022-02-20 21:52:49,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {231#false} assume !false; {231#false} is VALID [2022-02-20 21:52:49,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:52:49,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:52:49,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069421760] [2022-02-20 21:52:49,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069421760] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:52:49,738 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:52:49,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:52:49,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712323752] [2022-02-20 21:52:49,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:52:49,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-02-20 21:52:49,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:52:49,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:52:49,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:49,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:52:49,789 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:52:49,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:52:49,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:52:49,809 INFO L87 Difference]: Start difference. First operand has 227 states, 170 states have (on average 1.3647058823529412) internal successors, (232), 175 states have internal predecessors, (232), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:52:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:50,579 INFO L93 Difference]: Finished difference Result 464 states and 657 transitions. [2022-02-20 21:52:50,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 21:52:50,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-02-20 21:52:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:52:50,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:52:50,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 657 transitions. [2022-02-20 21:52:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:52:50,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 657 transitions. [2022-02-20 21:52:50,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 657 transitions. [2022-02-20 21:52:51,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 657 edges. 657 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:51,237 INFO L225 Difference]: With dead ends: 464 [2022-02-20 21:52:51,238 INFO L226 Difference]: Without dead ends: 232 [2022-02-20 21:52:51,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:52:51,255 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 76 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 21:52:51,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 466 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 21:52:51,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-02-20 21:52:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 217. [2022-02-20 21:52:51,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:52:51,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 217 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-02-20 21:52:51,319 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 217 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-02-20 21:52:51,320 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 217 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-02-20 21:52:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:51,337 INFO L93 Difference]: Finished difference Result 232 states and 313 transitions. [2022-02-20 21:52:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 313 transitions. [2022-02-20 21:52:51,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:51,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:51,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 232 states. [2022-02-20 21:52:51,350 INFO L87 Difference]: Start difference. First operand has 217 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 232 states. [2022-02-20 21:52:51,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:51,360 INFO L93 Difference]: Finished difference Result 232 states and 313 transitions. [2022-02-20 21:52:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 313 transitions. [2022-02-20 21:52:51,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:51,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:51,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:52:51,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:52:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-02-20 21:52:51,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2022-02-20 21:52:51,371 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 35 [2022-02-20 21:52:51,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:52:51,372 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2022-02-20 21:52:51,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:52:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2022-02-20 21:52:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 21:52:51,374 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:52:51,374 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:52:51,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:52:51,375 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:52:51,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:52:51,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1162174954, now seen corresponding path program 1 times [2022-02-20 21:52:51,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:52:51,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018375651] [2022-02-20 21:52:51,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:52:51,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:52:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:51,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:52:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:51,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:52:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:51,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {1690#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1665#true} is VALID [2022-02-20 21:52:51,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 21:52:51,491 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1665#true} {1665#true} #537#return; {1665#true} is VALID [2022-02-20 21:52:51,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:52:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:51,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2022-02-20 21:52:51,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {1665#true} assume !(0 == ~cond); {1665#true} is VALID [2022-02-20 21:52:51,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 21:52:51,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1665#true} {1665#true} #539#return; {1665#true} is VALID [2022-02-20 21:52:51,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {1682#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {1665#true} is VALID [2022-02-20 21:52:51,509 INFO L272 TraceCheckUtils]: 1: Hoare triple {1665#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {1690#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:51,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {1690#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1665#true} is VALID [2022-02-20 21:52:51,510 INFO L290 TraceCheckUtils]: 3: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 21:52:51,510 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1665#true} {1665#true} #537#return; {1665#true} is VALID [2022-02-20 21:52:51,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {1665#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {1665#true} is VALID [2022-02-20 21:52:51,510 INFO L272 TraceCheckUtils]: 6: Hoare triple {1665#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {1665#true} is VALID [2022-02-20 21:52:51,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2022-02-20 21:52:51,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {1665#true} assume !(0 == ~cond); {1665#true} is VALID [2022-02-20 21:52:51,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 21:52:51,511 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1665#true} {1665#true} #539#return; {1665#true} is VALID [2022-02-20 21:52:51,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {1665#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {1665#true} is VALID [2022-02-20 21:52:51,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 21:52:51,511 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1665#true} {1665#true} #543#return; {1665#true} is VALID [2022-02-20 21:52:51,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {1665#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(103, 2);call #Ultimate.allocInit(41, 3);call #Ultimate.allocInit(2, 4);call write~init~int(12, 4, 0, 1);call write~init~int(0, 4, 1, 1);call #Ultimate.allocInit(44, 5);call #Ultimate.allocInit(2, 6);call write~init~int(14, 6, 0, 1);call write~init~int(0, 6, 1, 1);call #Ultimate.allocInit(35, 7);call #Ultimate.allocInit(2, 8);call write~init~int(14, 8, 0, 1);call write~init~int(0, 8, 1, 1);call #Ultimate.allocInit(45, 9);call #Ultimate.allocInit(2, 10);call write~init~int(12, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(2, 12);call write~init~int(12, 12, 0, 1);call write~init~int(0, 12, 1, 1);call #Ultimate.allocInit(40, 13);call #Ultimate.allocInit(2, 14);call write~init~int(14, 14, 0, 1);call write~init~int(0, 14, 1, 1);call #Ultimate.allocInit(54, 15);~LDV_IN_INTERRUPT~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := 0, 0;~#capmode_proto~0.base, ~#capmode_proto~0.offset := 16, 0;call #Ultimate.allocInit(49, 16);call write~init~int(114, ~#capmode_proto~0.base, ~#capmode_proto~0.offset, 1);call write~init~int(508, ~#capmode_proto~0.base, 1 + ~#capmode_proto~0.offset, 4);call write~init~int(0, ~#capmode_proto~0.base, 5 + ~#capmode_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#capmode_proto~0.base, 9 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#capmode_proto~0.base, 17 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#capmode_proto~0.base, 25 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#capmode_proto~0.base, 33 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ack_tx.base, #funAddr~ack_tx.offset, ~#capmode_proto~0.base, 41 + ~#capmode_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 17, 0;call #Ultimate.allocInit(120, 17);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {1665#true} is VALID [2022-02-20 21:52:51,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {1665#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet99#1, main_#t~ret100#1.base, main_#t~ret100#1.offset, main_#t~nondet101#1, main_#t~nondet102#1, main_#t~nondet103#1, main_#t~nondet104#1, main_#t~nondet105#1, main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset, main_#t~nondet107#1, main_#t~switch108#1, main_#t~nondet109#1, main_#t~switch110#1, main_#t~ret111#1, main_#t~ret112#1, main_#t~mem113#1, main_#t~ret114#1, main_#t~nondet115#1, main_#t~switch116#1, main_#t~ret117#1, main_~ldvarg7~0#1, main_~tmp~9#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~0#1, main_~ldvarg5~0#1, main_~tmp___2~0#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~9#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet99#1 && main_#t~nondet99#1 <= 2147483647;main_~tmp~9#1 := main_#t~nondet99#1;havoc main_#t~nondet99#1;main_~ldvarg7~0#1 := main_~tmp~9#1; {1665#true} is VALID [2022-02-20 21:52:51,513 INFO L272 TraceCheckUtils]: 2: Hoare triple {1665#true} call main_#t~ret100#1.base, main_#t~ret100#1.offset := ldv_successful_zalloc(232); {1682#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:51,513 INFO L290 TraceCheckUtils]: 3: Hoare triple {1682#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {1665#true} is VALID [2022-02-20 21:52:51,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {1665#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {1690#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:51,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {1690#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1665#true} is VALID [2022-02-20 21:52:51,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 21:52:51,514 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1665#true} {1665#true} #537#return; {1665#true} is VALID [2022-02-20 21:52:51,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {1665#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {1665#true} is VALID [2022-02-20 21:52:51,514 INFO L272 TraceCheckUtils]: 9: Hoare triple {1665#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {1665#true} is VALID [2022-02-20 21:52:51,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2022-02-20 21:52:51,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {1665#true} assume !(0 == ~cond); {1665#true} is VALID [2022-02-20 21:52:51,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 21:52:51,515 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1665#true} {1665#true} #539#return; {1665#true} is VALID [2022-02-20 21:52:51,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {1665#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {1665#true} is VALID [2022-02-20 21:52:51,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-02-20 21:52:51,516 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1665#true} {1665#true} #543#return; {1665#true} is VALID [2022-02-20 21:52:51,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {1665#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret100#1.base, main_#t~ret100#1.offset;havoc main_#t~ret100#1.base, main_#t~ret100#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet101#1 && main_#t~nondet101#1 <= 2147483647;main_~tmp___1~0#1 := main_#t~nondet101#1;havoc main_#t~nondet101#1;main_~ldvarg0~0#1 := main_~tmp___1~0#1;assume -2147483648 <= main_#t~nondet102#1 && main_#t~nondet102#1 <= 2147483647;main_~tmp___2~0#1 := main_#t~nondet102#1;havoc main_#t~nondet102#1;main_~ldvarg5~0#1 := main_~tmp___2~0#1;assume -2147483648 <= main_#t~nondet103#1 && main_#t~nondet103#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet103#1;havoc main_#t~nondet103#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet104#1 && main_#t~nondet104#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet104#1;havoc main_#t~nondet104#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet105#1;havoc main_#t~nondet105#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {1665#true} is VALID [2022-02-20 21:52:51,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {1665#true} assume { :end_inline_ldv_set_init } true; {1665#true} is VALID [2022-02-20 21:52:51,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {1665#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr141#1;#Ultimate.C_memset_#t~loopctr141#1 := 0; {1665#true} is VALID [2022-02-20 21:52:51,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {1665#true} assume !(#Ultimate.C_memset_#t~loopctr141#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {1665#true} is VALID [2022-02-20 21:52:51,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {1665#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {1681#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:52:51,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {1681#(= ~ldv_state_variable_0~0 1)} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {1681#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:52:51,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {1681#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1 == main_~tmp___6~0#1; {1681#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:52:51,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {1681#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch108#1; {1681#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:52:51,518 INFO L290 TraceCheckUtils]: 25: Hoare triple {1681#(= ~ldv_state_variable_0~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet115#1 && main_#t~nondet115#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0 == main_~tmp___8~0#1; {1681#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:52:51,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {1681#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch116#1; {1681#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:52:51,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {1681#(= ~ldv_state_variable_0~0 1)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_capmode_module_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;havoc arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset;arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset := arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset; {1666#false} is VALID [2022-02-20 21:52:51,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {1666#false} assume { :end_inline_arcnet_unregister_proto } true; {1666#false} is VALID [2022-02-20 21:52:51,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {1666#false} assume { :end_inline_capmode_module_exit } true;~ldv_state_variable_0~0 := 2; {1666#false} is VALID [2022-02-20 21:52:51,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {1666#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret132#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {1666#false} is VALID [2022-02-20 21:52:51,520 INFO L290 TraceCheckUtils]: 31: Hoare triple {1666#false} ldv_check_final_state_#t~ret132#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret132#1 && ldv_check_final_state_#t~ret132#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret132#1;havoc ldv_check_final_state_#t~ret132#1; {1666#false} is VALID [2022-02-20 21:52:51,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {1666#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {1666#false} is VALID [2022-02-20 21:52:51,520 INFO L272 TraceCheckUtils]: 33: Hoare triple {1666#false} call ldv_error(); {1666#false} is VALID [2022-02-20 21:52:51,520 INFO L290 TraceCheckUtils]: 34: Hoare triple {1666#false} assume !false; {1666#false} is VALID [2022-02-20 21:52:51,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:52:51,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:52:51,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018375651] [2022-02-20 21:52:51,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018375651] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:52:51,521 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:52:51,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:52:51,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871305507] [2022-02-20 21:52:51,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:52:51,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-02-20 21:52:51,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:52:51,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:52:51,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:51,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:52:51,546 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:52:51,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:52:51,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:52:51,547 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:52:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:52,929 INFO L93 Difference]: Finished difference Result 643 states and 867 transitions. [2022-02-20 21:52:52,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:52:52,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-02-20 21:52:52,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:52:52,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:52:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 867 transitions. [2022-02-20 21:52:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:52:52,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 867 transitions. [2022-02-20 21:52:52,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 867 transitions. [2022-02-20 21:52:53,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 867 edges. 867 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:53,644 INFO L225 Difference]: With dead ends: 643 [2022-02-20 21:52:53,645 INFO L226 Difference]: Without dead ends: 434 [2022-02-20 21:52:53,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:52:53,646 INFO L933 BasicCegarLoop]: 311 mSDtfsCounter, 379 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 21:52:53,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 683 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 21:52:53,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-02-20 21:52:53,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 404. [2022-02-20 21:52:53,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:52:53,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 434 states. Second operand has 404 states, 305 states have (on average 1.301639344262295) internal successors, (397), 305 states have internal predecessors, (397), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-02-20 21:52:53,668 INFO L74 IsIncluded]: Start isIncluded. First operand 434 states. Second operand has 404 states, 305 states have (on average 1.301639344262295) internal successors, (397), 305 states have internal predecessors, (397), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-02-20 21:52:53,669 INFO L87 Difference]: Start difference. First operand 434 states. Second operand has 404 states, 305 states have (on average 1.301639344262295) internal successors, (397), 305 states have internal predecessors, (397), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-02-20 21:52:53,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:53,684 INFO L93 Difference]: Finished difference Result 434 states and 586 transitions. [2022-02-20 21:52:53,685 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 586 transitions. [2022-02-20 21:52:53,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:53,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:53,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 404 states, 305 states have (on average 1.301639344262295) internal successors, (397), 305 states have internal predecessors, (397), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand 434 states. [2022-02-20 21:52:53,689 INFO L87 Difference]: Start difference. First operand has 404 states, 305 states have (on average 1.301639344262295) internal successors, (397), 305 states have internal predecessors, (397), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand 434 states. [2022-02-20 21:52:53,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:53,715 INFO L93 Difference]: Finished difference Result 434 states and 586 transitions. [2022-02-20 21:52:53,715 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 586 transitions. [2022-02-20 21:52:53,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:53,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:53,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:52:53,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:52:53,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 305 states have (on average 1.301639344262295) internal successors, (397), 305 states have internal predecessors, (397), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-02-20 21:52:53,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 536 transitions. [2022-02-20 21:52:53,731 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 536 transitions. Word has length 35 [2022-02-20 21:52:53,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:52:53,732 INFO L470 AbstractCegarLoop]: Abstraction has 404 states and 536 transitions. [2022-02-20 21:52:53,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:52:53,732 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 536 transitions. [2022-02-20 21:52:53,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 21:52:53,733 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:52:53,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:52:53,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:52:53,733 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:52:53,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:52:53,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1455096019, now seen corresponding path program 1 times [2022-02-20 21:52:53,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:52:53,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929038310] [2022-02-20 21:52:53,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:52:53,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:52:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:53,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:52:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:53,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:52:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:53,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {4022#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3997#true} is VALID [2022-02-20 21:52:53,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-02-20 21:52:53,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3997#true} {3997#true} #537#return; {3997#true} is VALID [2022-02-20 21:52:53,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:52:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:53,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-02-20 21:52:53,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-02-20 21:52:53,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-02-20 21:52:53,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3997#true} {3997#true} #539#return; {3997#true} is VALID [2022-02-20 21:52:53,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {4014#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {3997#true} is VALID [2022-02-20 21:52:53,835 INFO L272 TraceCheckUtils]: 1: Hoare triple {3997#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {4022#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:53,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {4022#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3997#true} is VALID [2022-02-20 21:52:53,836 INFO L290 TraceCheckUtils]: 3: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-02-20 21:52:53,836 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3997#true} {3997#true} #537#return; {3997#true} is VALID [2022-02-20 21:52:53,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {3997#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {3997#true} is VALID [2022-02-20 21:52:53,836 INFO L272 TraceCheckUtils]: 6: Hoare triple {3997#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {3997#true} is VALID [2022-02-20 21:52:53,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-02-20 21:52:53,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-02-20 21:52:53,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-02-20 21:52:53,837 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3997#true} {3997#true} #539#return; {3997#true} is VALID [2022-02-20 21:52:53,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {3997#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {3997#true} is VALID [2022-02-20 21:52:53,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-02-20 21:52:53,838 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3997#true} {3997#true} #543#return; {3997#true} is VALID [2022-02-20 21:52:53,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {3997#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(103, 2);call #Ultimate.allocInit(41, 3);call #Ultimate.allocInit(2, 4);call write~init~int(12, 4, 0, 1);call write~init~int(0, 4, 1, 1);call #Ultimate.allocInit(44, 5);call #Ultimate.allocInit(2, 6);call write~init~int(14, 6, 0, 1);call write~init~int(0, 6, 1, 1);call #Ultimate.allocInit(35, 7);call #Ultimate.allocInit(2, 8);call write~init~int(14, 8, 0, 1);call write~init~int(0, 8, 1, 1);call #Ultimate.allocInit(45, 9);call #Ultimate.allocInit(2, 10);call write~init~int(12, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(2, 12);call write~init~int(12, 12, 0, 1);call write~init~int(0, 12, 1, 1);call #Ultimate.allocInit(40, 13);call #Ultimate.allocInit(2, 14);call write~init~int(14, 14, 0, 1);call write~init~int(0, 14, 1, 1);call #Ultimate.allocInit(54, 15);~LDV_IN_INTERRUPT~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := 0, 0;~#capmode_proto~0.base, ~#capmode_proto~0.offset := 16, 0;call #Ultimate.allocInit(49, 16);call write~init~int(114, ~#capmode_proto~0.base, ~#capmode_proto~0.offset, 1);call write~init~int(508, ~#capmode_proto~0.base, 1 + ~#capmode_proto~0.offset, 4);call write~init~int(0, ~#capmode_proto~0.base, 5 + ~#capmode_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#capmode_proto~0.base, 9 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#capmode_proto~0.base, 17 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#capmode_proto~0.base, 25 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#capmode_proto~0.base, 33 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ack_tx.base, #funAddr~ack_tx.offset, ~#capmode_proto~0.base, 41 + ~#capmode_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 17, 0;call #Ultimate.allocInit(120, 17);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {3997#true} is VALID [2022-02-20 21:52:53,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {3997#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet99#1, main_#t~ret100#1.base, main_#t~ret100#1.offset, main_#t~nondet101#1, main_#t~nondet102#1, main_#t~nondet103#1, main_#t~nondet104#1, main_#t~nondet105#1, main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset, main_#t~nondet107#1, main_#t~switch108#1, main_#t~nondet109#1, main_#t~switch110#1, main_#t~ret111#1, main_#t~ret112#1, main_#t~mem113#1, main_#t~ret114#1, main_#t~nondet115#1, main_#t~switch116#1, main_#t~ret117#1, main_~ldvarg7~0#1, main_~tmp~9#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~0#1, main_~ldvarg5~0#1, main_~tmp___2~0#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~9#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet99#1 && main_#t~nondet99#1 <= 2147483647;main_~tmp~9#1 := main_#t~nondet99#1;havoc main_#t~nondet99#1;main_~ldvarg7~0#1 := main_~tmp~9#1; {3997#true} is VALID [2022-02-20 21:52:53,839 INFO L272 TraceCheckUtils]: 2: Hoare triple {3997#true} call main_#t~ret100#1.base, main_#t~ret100#1.offset := ldv_successful_zalloc(232); {4014#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:53,839 INFO L290 TraceCheckUtils]: 3: Hoare triple {4014#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {3997#true} is VALID [2022-02-20 21:52:53,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {3997#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {4022#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:53,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {4022#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3997#true} is VALID [2022-02-20 21:52:53,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-02-20 21:52:53,840 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3997#true} {3997#true} #537#return; {3997#true} is VALID [2022-02-20 21:52:53,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {3997#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {3997#true} is VALID [2022-02-20 21:52:53,841 INFO L272 TraceCheckUtils]: 9: Hoare triple {3997#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {3997#true} is VALID [2022-02-20 21:52:53,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-02-20 21:52:53,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-02-20 21:52:53,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-02-20 21:52:53,841 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3997#true} {3997#true} #539#return; {3997#true} is VALID [2022-02-20 21:52:53,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {3997#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {3997#true} is VALID [2022-02-20 21:52:53,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-02-20 21:52:53,842 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3997#true} {3997#true} #543#return; {3997#true} is VALID [2022-02-20 21:52:53,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {3997#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret100#1.base, main_#t~ret100#1.offset;havoc main_#t~ret100#1.base, main_#t~ret100#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet101#1 && main_#t~nondet101#1 <= 2147483647;main_~tmp___1~0#1 := main_#t~nondet101#1;havoc main_#t~nondet101#1;main_~ldvarg0~0#1 := main_~tmp___1~0#1;assume -2147483648 <= main_#t~nondet102#1 && main_#t~nondet102#1 <= 2147483647;main_~tmp___2~0#1 := main_#t~nondet102#1;havoc main_#t~nondet102#1;main_~ldvarg5~0#1 := main_~tmp___2~0#1;assume -2147483648 <= main_#t~nondet103#1 && main_#t~nondet103#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet103#1;havoc main_#t~nondet103#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet104#1 && main_#t~nondet104#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet104#1;havoc main_#t~nondet104#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet105#1;havoc main_#t~nondet105#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {3997#true} is VALID [2022-02-20 21:52:53,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {3997#true} assume { :end_inline_ldv_set_init } true; {3997#true} is VALID [2022-02-20 21:52:53,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {3997#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr141#1;#Ultimate.C_memset_#t~loopctr141#1 := 0; {3997#true} is VALID [2022-02-20 21:52:53,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {3997#true} assume !(#Ultimate.C_memset_#t~loopctr141#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {3997#true} is VALID [2022-02-20 21:52:53,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {3997#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {3997#true} is VALID [2022-02-20 21:52:53,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {3997#true} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {3997#true} is VALID [2022-02-20 21:52:53,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {3997#true} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1 == main_~tmp___6~0#1; {3997#true} is VALID [2022-02-20 21:52:53,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {3997#true} assume main_#t~switch108#1; {3997#true} is VALID [2022-02-20 21:52:53,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {3997#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet115#1 && main_#t~nondet115#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0 == main_~tmp___8~0#1; {3997#true} is VALID [2022-02-20 21:52:53,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {3997#true} assume !main_#t~switch116#1;main_#t~switch116#1 := main_#t~switch116#1 || 1 == main_~tmp___8~0#1; {3997#true} is VALID [2022-02-20 21:52:53,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {3997#true} assume main_#t~switch116#1; {3997#true} is VALID [2022-02-20 21:52:53,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {3997#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_capmode_module_init } true;havoc capmode_module_init_#res#1;havoc capmode_module_init_#t~nondet96#1;havoc capmode_module_init_#t~nondet96#1;assume { :begin_inline_arcnet_cap_init } true;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset, arcnet_cap_init_~count~0#1;havoc arcnet_cap_init_~count~0#1;arcnet_cap_init_~count~0#1 := 1; {4013#(= 0 (+ (- 1) |ULTIMATE.start_arcnet_cap_init_~count~0#1|))} is VALID [2022-02-20 21:52:53,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {4013#(= 0 (+ (- 1) |ULTIMATE.start_arcnet_cap_init_~count~0#1|))} assume !(arcnet_cap_init_~count~0#1 <= 8); {3998#false} is VALID [2022-02-20 21:52:53,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {3998#false} assume (~arc_bcast_proto~0.base + ~arc_bcast_proto~0.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;~arc_bcast_proto~0.base, ~arc_bcast_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {3998#false} is VALID [2022-02-20 21:52:53,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {3998#false} ~arc_proto_default~0.base, ~arc_proto_default~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;~arc_raw_proto~0.base, ~arc_raw_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {3998#false} is VALID [2022-02-20 21:52:53,845 INFO L290 TraceCheckUtils]: 32: Hoare triple {3998#false} assume { :end_inline_arcnet_cap_init } true;capmode_module_init_#res#1 := 0; {3998#false} is VALID [2022-02-20 21:52:53,845 INFO L290 TraceCheckUtils]: 33: Hoare triple {3998#false} main_#t~ret117#1 := capmode_module_init_#res#1;assume { :end_inline_capmode_module_init } true;assume -2147483648 <= main_#t~ret117#1 && main_#t~ret117#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret117#1;havoc main_#t~ret117#1; {3998#false} is VALID [2022-02-20 21:52:53,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {3998#false} assume !(0 == ~ldv_retval_0~0); {3998#false} is VALID [2022-02-20 21:52:53,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {3998#false} assume 0 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2; {3998#false} is VALID [2022-02-20 21:52:53,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {3998#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret132#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {3998#false} is VALID [2022-02-20 21:52:53,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {3998#false} ldv_check_final_state_#t~ret132#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret132#1 && ldv_check_final_state_#t~ret132#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret132#1;havoc ldv_check_final_state_#t~ret132#1; {3998#false} is VALID [2022-02-20 21:52:53,846 INFO L290 TraceCheckUtils]: 38: Hoare triple {3998#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {3998#false} is VALID [2022-02-20 21:52:53,846 INFO L272 TraceCheckUtils]: 39: Hoare triple {3998#false} call ldv_error(); {3998#false} is VALID [2022-02-20 21:52:53,847 INFO L290 TraceCheckUtils]: 40: Hoare triple {3998#false} assume !false; {3998#false} is VALID [2022-02-20 21:52:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:52:53,847 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:52:53,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929038310] [2022-02-20 21:52:53,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929038310] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:52:53,847 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:52:53,847 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:52:53,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121761925] [2022-02-20 21:52:53,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:52:53,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-02-20 21:52:53,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:52:53,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:52:53,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:53,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:52:53,878 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:52:53,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:52:53,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:52:53,879 INFO L87 Difference]: Start difference. First operand 404 states and 536 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:52:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:54,766 INFO L93 Difference]: Finished difference Result 834 states and 1118 transitions. [2022-02-20 21:52:54,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:52:54,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-02-20 21:52:54,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:52:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:52:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-02-20 21:52:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:52:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-02-20 21:52:54,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-02-20 21:52:55,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:55,224 INFO L225 Difference]: With dead ends: 834 [2022-02-20 21:52:55,224 INFO L226 Difference]: Without dead ends: 438 [2022-02-20 21:52:55,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:52:55,225 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 78 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 21:52:55,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 655 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 21:52:55,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-02-20 21:52:55,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 405. [2022-02-20 21:52:55,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:52:55,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 438 states. Second operand has 405 states, 306 states have (on average 1.3006535947712419) internal successors, (398), 306 states have internal predecessors, (398), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-02-20 21:52:55,255 INFO L74 IsIncluded]: Start isIncluded. First operand 438 states. Second operand has 405 states, 306 states have (on average 1.3006535947712419) internal successors, (398), 306 states have internal predecessors, (398), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-02-20 21:52:55,256 INFO L87 Difference]: Start difference. First operand 438 states. Second operand has 405 states, 306 states have (on average 1.3006535947712419) internal successors, (398), 306 states have internal predecessors, (398), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-02-20 21:52:55,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:55,275 INFO L93 Difference]: Finished difference Result 438 states and 591 transitions. [2022-02-20 21:52:55,275 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 591 transitions. [2022-02-20 21:52:55,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:55,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:55,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 405 states, 306 states have (on average 1.3006535947712419) internal successors, (398), 306 states have internal predecessors, (398), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand 438 states. [2022-02-20 21:52:55,280 INFO L87 Difference]: Start difference. First operand has 405 states, 306 states have (on average 1.3006535947712419) internal successors, (398), 306 states have internal predecessors, (398), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand 438 states. [2022-02-20 21:52:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:55,292 INFO L93 Difference]: Finished difference Result 438 states and 591 transitions. [2022-02-20 21:52:55,292 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 591 transitions. [2022-02-20 21:52:55,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:55,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:55,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:52:55,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:52:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 306 states have (on average 1.3006535947712419) internal successors, (398), 306 states have internal predecessors, (398), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-02-20 21:52:55,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 537 transitions. [2022-02-20 21:52:55,305 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 537 transitions. Word has length 41 [2022-02-20 21:52:55,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:52:55,306 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 537 transitions. [2022-02-20 21:52:55,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:52:55,308 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 537 transitions. [2022-02-20 21:52:55,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 21:52:55,310 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:52:55,310 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:52:55,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:52:55,310 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:52:55,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:52:55,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1093757940, now seen corresponding path program 1 times [2022-02-20 21:52:55,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:52:55,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249735961] [2022-02-20 21:52:55,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:52:55,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:52:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:55,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:52:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:55,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:52:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:55,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {6618#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6592#true} is VALID [2022-02-20 21:52:55,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {6592#true} assume true; {6592#true} is VALID [2022-02-20 21:52:55,401 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6592#true} {6592#true} #537#return; {6592#true} is VALID [2022-02-20 21:52:55,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:52:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:55,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {6592#true} ~cond := #in~cond; {6592#true} is VALID [2022-02-20 21:52:55,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {6592#true} assume !(0 == ~cond); {6592#true} is VALID [2022-02-20 21:52:55,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {6592#true} assume true; {6592#true} is VALID [2022-02-20 21:52:55,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6592#true} {6592#true} #539#return; {6592#true} is VALID [2022-02-20 21:52:55,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {6610#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {6592#true} is VALID [2022-02-20 21:52:55,416 INFO L272 TraceCheckUtils]: 1: Hoare triple {6592#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {6618#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:55,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {6618#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6592#true} is VALID [2022-02-20 21:52:55,419 INFO L290 TraceCheckUtils]: 3: Hoare triple {6592#true} assume true; {6592#true} is VALID [2022-02-20 21:52:55,420 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6592#true} {6592#true} #537#return; {6592#true} is VALID [2022-02-20 21:52:55,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {6592#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {6592#true} is VALID [2022-02-20 21:52:55,422 INFO L272 TraceCheckUtils]: 6: Hoare triple {6592#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {6592#true} is VALID [2022-02-20 21:52:55,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {6592#true} ~cond := #in~cond; {6592#true} is VALID [2022-02-20 21:52:55,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {6592#true} assume !(0 == ~cond); {6592#true} is VALID [2022-02-20 21:52:55,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {6592#true} assume true; {6592#true} is VALID [2022-02-20 21:52:55,426 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6592#true} {6592#true} #539#return; {6592#true} is VALID [2022-02-20 21:52:55,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {6592#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {6592#true} is VALID [2022-02-20 21:52:55,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {6592#true} assume true; {6592#true} is VALID [2022-02-20 21:52:55,427 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6592#true} {6592#true} #543#return; {6592#true} is VALID [2022-02-20 21:52:55,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {6592#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(103, 2);call #Ultimate.allocInit(41, 3);call #Ultimate.allocInit(2, 4);call write~init~int(12, 4, 0, 1);call write~init~int(0, 4, 1, 1);call #Ultimate.allocInit(44, 5);call #Ultimate.allocInit(2, 6);call write~init~int(14, 6, 0, 1);call write~init~int(0, 6, 1, 1);call #Ultimate.allocInit(35, 7);call #Ultimate.allocInit(2, 8);call write~init~int(14, 8, 0, 1);call write~init~int(0, 8, 1, 1);call #Ultimate.allocInit(45, 9);call #Ultimate.allocInit(2, 10);call write~init~int(12, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(2, 12);call write~init~int(12, 12, 0, 1);call write~init~int(0, 12, 1, 1);call #Ultimate.allocInit(40, 13);call #Ultimate.allocInit(2, 14);call write~init~int(14, 14, 0, 1);call write~init~int(0, 14, 1, 1);call #Ultimate.allocInit(54, 15);~LDV_IN_INTERRUPT~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := 0, 0;~#capmode_proto~0.base, ~#capmode_proto~0.offset := 16, 0;call #Ultimate.allocInit(49, 16);call write~init~int(114, ~#capmode_proto~0.base, ~#capmode_proto~0.offset, 1);call write~init~int(508, ~#capmode_proto~0.base, 1 + ~#capmode_proto~0.offset, 4);call write~init~int(0, ~#capmode_proto~0.base, 5 + ~#capmode_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#capmode_proto~0.base, 9 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#capmode_proto~0.base, 17 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#capmode_proto~0.base, 25 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#capmode_proto~0.base, 33 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ack_tx.base, #funAddr~ack_tx.offset, ~#capmode_proto~0.base, 41 + ~#capmode_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 17, 0;call #Ultimate.allocInit(120, 17);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {6592#true} is VALID [2022-02-20 21:52:55,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {6592#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet99#1, main_#t~ret100#1.base, main_#t~ret100#1.offset, main_#t~nondet101#1, main_#t~nondet102#1, main_#t~nondet103#1, main_#t~nondet104#1, main_#t~nondet105#1, main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset, main_#t~nondet107#1, main_#t~switch108#1, main_#t~nondet109#1, main_#t~switch110#1, main_#t~ret111#1, main_#t~ret112#1, main_#t~mem113#1, main_#t~ret114#1, main_#t~nondet115#1, main_#t~switch116#1, main_#t~ret117#1, main_~ldvarg7~0#1, main_~tmp~9#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~0#1, main_~ldvarg5~0#1, main_~tmp___2~0#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~9#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet99#1 && main_#t~nondet99#1 <= 2147483647;main_~tmp~9#1 := main_#t~nondet99#1;havoc main_#t~nondet99#1;main_~ldvarg7~0#1 := main_~tmp~9#1; {6592#true} is VALID [2022-02-20 21:52:55,429 INFO L272 TraceCheckUtils]: 2: Hoare triple {6592#true} call main_#t~ret100#1.base, main_#t~ret100#1.offset := ldv_successful_zalloc(232); {6610#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:55,429 INFO L290 TraceCheckUtils]: 3: Hoare triple {6610#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {6592#true} is VALID [2022-02-20 21:52:55,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {6592#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {6618#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:55,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {6618#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6592#true} is VALID [2022-02-20 21:52:55,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {6592#true} assume true; {6592#true} is VALID [2022-02-20 21:52:55,432 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6592#true} {6592#true} #537#return; {6592#true} is VALID [2022-02-20 21:52:55,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {6592#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {6592#true} is VALID [2022-02-20 21:52:55,432 INFO L272 TraceCheckUtils]: 9: Hoare triple {6592#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {6592#true} is VALID [2022-02-20 21:52:55,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {6592#true} ~cond := #in~cond; {6592#true} is VALID [2022-02-20 21:52:55,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {6592#true} assume !(0 == ~cond); {6592#true} is VALID [2022-02-20 21:52:55,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {6592#true} assume true; {6592#true} is VALID [2022-02-20 21:52:55,432 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6592#true} {6592#true} #539#return; {6592#true} is VALID [2022-02-20 21:52:55,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {6592#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {6592#true} is VALID [2022-02-20 21:52:55,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {6592#true} assume true; {6592#true} is VALID [2022-02-20 21:52:55,432 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6592#true} {6592#true} #543#return; {6592#true} is VALID [2022-02-20 21:52:55,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {6592#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret100#1.base, main_#t~ret100#1.offset;havoc main_#t~ret100#1.base, main_#t~ret100#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet101#1 && main_#t~nondet101#1 <= 2147483647;main_~tmp___1~0#1 := main_#t~nondet101#1;havoc main_#t~nondet101#1;main_~ldvarg0~0#1 := main_~tmp___1~0#1;assume -2147483648 <= main_#t~nondet102#1 && main_#t~nondet102#1 <= 2147483647;main_~tmp___2~0#1 := main_#t~nondet102#1;havoc main_#t~nondet102#1;main_~ldvarg5~0#1 := main_~tmp___2~0#1;assume -2147483648 <= main_#t~nondet103#1 && main_#t~nondet103#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet103#1;havoc main_#t~nondet103#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet104#1 && main_#t~nondet104#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet104#1;havoc main_#t~nondet104#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet105#1;havoc main_#t~nondet105#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {6592#true} is VALID [2022-02-20 21:52:55,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {6592#true} assume { :end_inline_ldv_set_init } true; {6592#true} is VALID [2022-02-20 21:52:55,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {6592#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr141#1;#Ultimate.C_memset_#t~loopctr141#1 := 0; {6592#true} is VALID [2022-02-20 21:52:55,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {6592#true} assume !(#Ultimate.C_memset_#t~loopctr141#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {6592#true} is VALID [2022-02-20 21:52:55,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {6592#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {6592#true} is VALID [2022-02-20 21:52:55,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {6592#true} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {6592#true} is VALID [2022-02-20 21:52:55,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {6592#true} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1 == main_~tmp___6~0#1; {6592#true} is VALID [2022-02-20 21:52:55,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {6592#true} assume main_#t~switch108#1; {6592#true} is VALID [2022-02-20 21:52:55,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {6592#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet115#1 && main_#t~nondet115#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0 == main_~tmp___8~0#1; {6592#true} is VALID [2022-02-20 21:52:55,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {6592#true} assume !main_#t~switch116#1;main_#t~switch116#1 := main_#t~switch116#1 || 1 == main_~tmp___8~0#1; {6592#true} is VALID [2022-02-20 21:52:55,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {6592#true} assume main_#t~switch116#1; {6592#true} is VALID [2022-02-20 21:52:55,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {6592#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_capmode_module_init } true;havoc capmode_module_init_#res#1;havoc capmode_module_init_#t~nondet96#1;havoc capmode_module_init_#t~nondet96#1;assume { :begin_inline_arcnet_cap_init } true;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset, arcnet_cap_init_~count~0#1;havoc arcnet_cap_init_~count~0#1;arcnet_cap_init_~count~0#1 := 1; {6608#(= 0 (+ (- 1) |ULTIMATE.start_arcnet_cap_init_~count~0#1|))} is VALID [2022-02-20 21:52:55,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {6608#(= 0 (+ (- 1) |ULTIMATE.start_arcnet_cap_init_~count~0#1|))} assume arcnet_cap_init_~count~0#1 <= 8; {6608#(= 0 (+ (- 1) |ULTIMATE.start_arcnet_cap_init_~count~0#1|))} is VALID [2022-02-20 21:52:55,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {6608#(= 0 (+ (- 1) |ULTIMATE.start_arcnet_cap_init_~count~0#1|))} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {6608#(= 0 (+ (- 1) |ULTIMATE.start_arcnet_cap_init_~count~0#1|))} is VALID [2022-02-20 21:52:55,441 INFO L290 TraceCheckUtils]: 31: Hoare triple {6608#(= 0 (+ (- 1) |ULTIMATE.start_arcnet_cap_init_~count~0#1|))} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {6608#(= 0 (+ (- 1) |ULTIMATE.start_arcnet_cap_init_~count~0#1|))} is VALID [2022-02-20 21:52:55,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {6608#(= 0 (+ (- 1) |ULTIMATE.start_arcnet_cap_init_~count~0#1|))} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {6609#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 2)} is VALID [2022-02-20 21:52:55,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {6609#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 2)} assume !(arcnet_cap_init_~count~0#1 <= 8); {6593#false} is VALID [2022-02-20 21:52:55,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {6593#false} assume (~arc_bcast_proto~0.base + ~arc_bcast_proto~0.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;~arc_bcast_proto~0.base, ~arc_bcast_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {6593#false} is VALID [2022-02-20 21:52:55,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {6593#false} ~arc_proto_default~0.base, ~arc_proto_default~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;~arc_raw_proto~0.base, ~arc_raw_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {6593#false} is VALID [2022-02-20 21:52:55,442 INFO L290 TraceCheckUtils]: 36: Hoare triple {6593#false} assume { :end_inline_arcnet_cap_init } true;capmode_module_init_#res#1 := 0; {6593#false} is VALID [2022-02-20 21:52:55,442 INFO L290 TraceCheckUtils]: 37: Hoare triple {6593#false} main_#t~ret117#1 := capmode_module_init_#res#1;assume { :end_inline_capmode_module_init } true;assume -2147483648 <= main_#t~ret117#1 && main_#t~ret117#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret117#1;havoc main_#t~ret117#1; {6593#false} is VALID [2022-02-20 21:52:55,442 INFO L290 TraceCheckUtils]: 38: Hoare triple {6593#false} assume !(0 == ~ldv_retval_0~0); {6593#false} is VALID [2022-02-20 21:52:55,442 INFO L290 TraceCheckUtils]: 39: Hoare triple {6593#false} assume 0 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2; {6593#false} is VALID [2022-02-20 21:52:55,442 INFO L290 TraceCheckUtils]: 40: Hoare triple {6593#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret132#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {6593#false} is VALID [2022-02-20 21:52:55,443 INFO L290 TraceCheckUtils]: 41: Hoare triple {6593#false} ldv_check_final_state_#t~ret132#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret132#1 && ldv_check_final_state_#t~ret132#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret132#1;havoc ldv_check_final_state_#t~ret132#1; {6593#false} is VALID [2022-02-20 21:52:55,443 INFO L290 TraceCheckUtils]: 42: Hoare triple {6593#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {6593#false} is VALID [2022-02-20 21:52:55,443 INFO L272 TraceCheckUtils]: 43: Hoare triple {6593#false} call ldv_error(); {6593#false} is VALID [2022-02-20 21:52:55,443 INFO L290 TraceCheckUtils]: 44: Hoare triple {6593#false} assume !false; {6593#false} is VALID [2022-02-20 21:52:55,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:52:55,444 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:52:55,444 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249735961] [2022-02-20 21:52:55,444 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249735961] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:52:55,444 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609325988] [2022-02-20 21:52:55,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:52:55,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:52:55,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:52:55,452 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 21:52:55,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 21:52:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:55,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 21:52:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:55,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:52:55,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {6592#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(103, 2);call #Ultimate.allocInit(41, 3);call #Ultimate.allocInit(2, 4);call write~init~int(12, 4, 0, 1);call write~init~int(0, 4, 1, 1);call #Ultimate.allocInit(44, 5);call #Ultimate.allocInit(2, 6);call write~init~int(14, 6, 0, 1);call write~init~int(0, 6, 1, 1);call #Ultimate.allocInit(35, 7);call #Ultimate.allocInit(2, 8);call write~init~int(14, 8, 0, 1);call write~init~int(0, 8, 1, 1);call #Ultimate.allocInit(45, 9);call #Ultimate.allocInit(2, 10);call write~init~int(12, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(2, 12);call write~init~int(12, 12, 0, 1);call write~init~int(0, 12, 1, 1);call #Ultimate.allocInit(40, 13);call #Ultimate.allocInit(2, 14);call write~init~int(14, 14, 0, 1);call write~init~int(0, 14, 1, 1);call #Ultimate.allocInit(54, 15);~LDV_IN_INTERRUPT~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := 0, 0;~#capmode_proto~0.base, ~#capmode_proto~0.offset := 16, 0;call #Ultimate.allocInit(49, 16);call write~init~int(114, ~#capmode_proto~0.base, ~#capmode_proto~0.offset, 1);call write~init~int(508, ~#capmode_proto~0.base, 1 + ~#capmode_proto~0.offset, 4);call write~init~int(0, ~#capmode_proto~0.base, 5 + ~#capmode_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#capmode_proto~0.base, 9 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#capmode_proto~0.base, 17 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#capmode_proto~0.base, 25 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#capmode_proto~0.base, 33 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ack_tx.base, #funAddr~ack_tx.offset, ~#capmode_proto~0.base, 41 + ~#capmode_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 17, 0;call #Ultimate.allocInit(120, 17);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {6592#true} is VALID [2022-02-20 21:52:55,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {6592#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet99#1, main_#t~ret100#1.base, main_#t~ret100#1.offset, main_#t~nondet101#1, main_#t~nondet102#1, main_#t~nondet103#1, main_#t~nondet104#1, main_#t~nondet105#1, main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset, main_#t~nondet107#1, main_#t~switch108#1, main_#t~nondet109#1, main_#t~switch110#1, main_#t~ret111#1, main_#t~ret112#1, main_#t~mem113#1, main_#t~ret114#1, main_#t~nondet115#1, main_#t~switch116#1, main_#t~ret117#1, main_~ldvarg7~0#1, main_~tmp~9#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~0#1, main_~ldvarg5~0#1, main_~tmp___2~0#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~9#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet99#1 && main_#t~nondet99#1 <= 2147483647;main_~tmp~9#1 := main_#t~nondet99#1;havoc main_#t~nondet99#1;main_~ldvarg7~0#1 := main_~tmp~9#1; {6592#true} is VALID [2022-02-20 21:52:55,825 INFO L272 TraceCheckUtils]: 2: Hoare triple {6592#true} call main_#t~ret100#1.base, main_#t~ret100#1.offset := ldv_successful_zalloc(232); {6592#true} is VALID [2022-02-20 21:52:55,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {6592#true} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {6592#true} is VALID [2022-02-20 21:52:55,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {6592#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {6592#true} is VALID [2022-02-20 21:52:55,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {6592#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6592#true} is VALID [2022-02-20 21:52:55,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {6592#true} assume true; {6592#true} is VALID [2022-02-20 21:52:55,825 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6592#true} {6592#true} #537#return; {6592#true} is VALID [2022-02-20 21:52:55,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {6592#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {6592#true} is VALID [2022-02-20 21:52:55,829 INFO L272 TraceCheckUtils]: 9: Hoare triple {6592#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {6592#true} is VALID [2022-02-20 21:52:55,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {6592#true} ~cond := #in~cond; {6592#true} is VALID [2022-02-20 21:52:55,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {6592#true} assume !(0 == ~cond); {6592#true} is VALID [2022-02-20 21:52:55,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {6592#true} assume true; {6592#true} is VALID [2022-02-20 21:52:55,836 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6592#true} {6592#true} #539#return; {6592#true} is VALID [2022-02-20 21:52:55,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {6592#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {6592#true} is VALID [2022-02-20 21:52:55,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {6592#true} assume true; {6592#true} is VALID [2022-02-20 21:52:55,840 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6592#true} {6592#true} #543#return; {6592#true} is VALID [2022-02-20 21:52:55,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {6592#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret100#1.base, main_#t~ret100#1.offset;havoc main_#t~ret100#1.base, main_#t~ret100#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet101#1 && main_#t~nondet101#1 <= 2147483647;main_~tmp___1~0#1 := main_#t~nondet101#1;havoc main_#t~nondet101#1;main_~ldvarg0~0#1 := main_~tmp___1~0#1;assume -2147483648 <= main_#t~nondet102#1 && main_#t~nondet102#1 <= 2147483647;main_~tmp___2~0#1 := main_#t~nondet102#1;havoc main_#t~nondet102#1;main_~ldvarg5~0#1 := main_~tmp___2~0#1;assume -2147483648 <= main_#t~nondet103#1 && main_#t~nondet103#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet103#1;havoc main_#t~nondet103#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet104#1 && main_#t~nondet104#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet104#1;havoc main_#t~nondet104#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet105#1;havoc main_#t~nondet105#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {6592#true} is VALID [2022-02-20 21:52:55,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {6592#true} assume { :end_inline_ldv_set_init } true; {6592#true} is VALID [2022-02-20 21:52:55,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {6592#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr141#1;#Ultimate.C_memset_#t~loopctr141#1 := 0; {6592#true} is VALID [2022-02-20 21:52:55,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {6592#true} assume !(#Ultimate.C_memset_#t~loopctr141#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {6592#true} is VALID [2022-02-20 21:52:55,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {6592#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {6592#true} is VALID [2022-02-20 21:52:55,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {6592#true} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {6592#true} is VALID [2022-02-20 21:52:55,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {6592#true} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1 == main_~tmp___6~0#1; {6592#true} is VALID [2022-02-20 21:52:55,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {6592#true} assume main_#t~switch108#1; {6592#true} is VALID [2022-02-20 21:52:55,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {6592#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet115#1 && main_#t~nondet115#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0 == main_~tmp___8~0#1; {6592#true} is VALID [2022-02-20 21:52:55,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {6592#true} assume !main_#t~switch116#1;main_#t~switch116#1 := main_#t~switch116#1 || 1 == main_~tmp___8~0#1; {6592#true} is VALID [2022-02-20 21:52:55,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {6592#true} assume main_#t~switch116#1; {6592#true} is VALID [2022-02-20 21:52:55,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {6592#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_capmode_module_init } true;havoc capmode_module_init_#res#1;havoc capmode_module_init_#t~nondet96#1;havoc capmode_module_init_#t~nondet96#1;assume { :begin_inline_arcnet_cap_init } true;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset, arcnet_cap_init_~count~0#1;havoc arcnet_cap_init_~count~0#1;arcnet_cap_init_~count~0#1 := 1; {6706#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 1)} is VALID [2022-02-20 21:52:55,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {6706#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 1)} assume arcnet_cap_init_~count~0#1 <= 8; {6706#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 1)} is VALID [2022-02-20 21:52:55,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {6706#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 1)} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {6706#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 1)} is VALID [2022-02-20 21:52:55,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {6706#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 1)} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {6706#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 1)} is VALID [2022-02-20 21:52:55,846 INFO L290 TraceCheckUtils]: 32: Hoare triple {6706#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 1)} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {6609#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 2)} is VALID [2022-02-20 21:52:55,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {6609#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 2)} assume !(arcnet_cap_init_~count~0#1 <= 8); {6593#false} is VALID [2022-02-20 21:52:55,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {6593#false} assume (~arc_bcast_proto~0.base + ~arc_bcast_proto~0.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;~arc_bcast_proto~0.base, ~arc_bcast_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {6593#false} is VALID [2022-02-20 21:52:55,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {6593#false} ~arc_proto_default~0.base, ~arc_proto_default~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;~arc_raw_proto~0.base, ~arc_raw_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {6593#false} is VALID [2022-02-20 21:52:55,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {6593#false} assume { :end_inline_arcnet_cap_init } true;capmode_module_init_#res#1 := 0; {6593#false} is VALID [2022-02-20 21:52:55,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {6593#false} main_#t~ret117#1 := capmode_module_init_#res#1;assume { :end_inline_capmode_module_init } true;assume -2147483648 <= main_#t~ret117#1 && main_#t~ret117#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret117#1;havoc main_#t~ret117#1; {6593#false} is VALID [2022-02-20 21:52:55,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {6593#false} assume !(0 == ~ldv_retval_0~0); {6593#false} is VALID [2022-02-20 21:52:55,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {6593#false} assume 0 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2; {6593#false} is VALID [2022-02-20 21:52:55,847 INFO L290 TraceCheckUtils]: 40: Hoare triple {6593#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret132#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {6593#false} is VALID [2022-02-20 21:52:55,847 INFO L290 TraceCheckUtils]: 41: Hoare triple {6593#false} ldv_check_final_state_#t~ret132#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret132#1 && ldv_check_final_state_#t~ret132#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret132#1;havoc ldv_check_final_state_#t~ret132#1; {6593#false} is VALID [2022-02-20 21:52:55,847 INFO L290 TraceCheckUtils]: 42: Hoare triple {6593#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {6593#false} is VALID [2022-02-20 21:52:55,847 INFO L272 TraceCheckUtils]: 43: Hoare triple {6593#false} call ldv_error(); {6593#false} is VALID [2022-02-20 21:52:55,848 INFO L290 TraceCheckUtils]: 44: Hoare triple {6593#false} assume !false; {6593#false} is VALID [2022-02-20 21:52:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:52:55,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 21:52:55,977 INFO L290 TraceCheckUtils]: 44: Hoare triple {6593#false} assume !false; {6593#false} is VALID [2022-02-20 21:52:55,977 INFO L272 TraceCheckUtils]: 43: Hoare triple {6593#false} call ldv_error(); {6593#false} is VALID [2022-02-20 21:52:55,977 INFO L290 TraceCheckUtils]: 42: Hoare triple {6593#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {6593#false} is VALID [2022-02-20 21:52:55,977 INFO L290 TraceCheckUtils]: 41: Hoare triple {6593#false} ldv_check_final_state_#t~ret132#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret132#1 && ldv_check_final_state_#t~ret132#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret132#1;havoc ldv_check_final_state_#t~ret132#1; {6593#false} is VALID [2022-02-20 21:52:55,977 INFO L290 TraceCheckUtils]: 40: Hoare triple {6593#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret132#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {6593#false} is VALID [2022-02-20 21:52:55,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {6593#false} assume 0 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2; {6593#false} is VALID [2022-02-20 21:52:55,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {6593#false} assume !(0 == ~ldv_retval_0~0); {6593#false} is VALID [2022-02-20 21:52:55,978 INFO L290 TraceCheckUtils]: 37: Hoare triple {6593#false} main_#t~ret117#1 := capmode_module_init_#res#1;assume { :end_inline_capmode_module_init } true;assume -2147483648 <= main_#t~ret117#1 && main_#t~ret117#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret117#1;havoc main_#t~ret117#1; {6593#false} is VALID [2022-02-20 21:52:55,978 INFO L290 TraceCheckUtils]: 36: Hoare triple {6593#false} assume { :end_inline_arcnet_cap_init } true;capmode_module_init_#res#1 := 0; {6593#false} is VALID [2022-02-20 21:52:55,978 INFO L290 TraceCheckUtils]: 35: Hoare triple {6593#false} ~arc_proto_default~0.base, ~arc_proto_default~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;~arc_raw_proto~0.base, ~arc_raw_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {6593#false} is VALID [2022-02-20 21:52:55,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {6593#false} assume (~arc_bcast_proto~0.base + ~arc_bcast_proto~0.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;~arc_bcast_proto~0.base, ~arc_bcast_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {6593#false} is VALID [2022-02-20 21:52:55,979 INFO L290 TraceCheckUtils]: 33: Hoare triple {6788#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 8)} assume !(arcnet_cap_init_~count~0#1 <= 8); {6593#false} is VALID [2022-02-20 21:52:55,979 INFO L290 TraceCheckUtils]: 32: Hoare triple {6792#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 7)} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {6788#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 8)} is VALID [2022-02-20 21:52:55,979 INFO L290 TraceCheckUtils]: 31: Hoare triple {6792#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 7)} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {6792#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 7)} is VALID [2022-02-20 21:52:55,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {6792#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 7)} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {6792#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 7)} is VALID [2022-02-20 21:52:55,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {6792#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 7)} assume arcnet_cap_init_~count~0#1 <= 8; {6792#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 7)} is VALID [2022-02-20 21:52:55,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {6592#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_capmode_module_init } true;havoc capmode_module_init_#res#1;havoc capmode_module_init_#t~nondet96#1;havoc capmode_module_init_#t~nondet96#1;assume { :begin_inline_arcnet_cap_init } true;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset, arcnet_cap_init_~count~0#1;havoc arcnet_cap_init_~count~0#1;arcnet_cap_init_~count~0#1 := 1; {6792#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 7)} is VALID [2022-02-20 21:52:55,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {6592#true} assume main_#t~switch116#1; {6592#true} is VALID [2022-02-20 21:52:55,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {6592#true} assume !main_#t~switch116#1;main_#t~switch116#1 := main_#t~switch116#1 || 1 == main_~tmp___8~0#1; {6592#true} is VALID [2022-02-20 21:52:55,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {6592#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet115#1 && main_#t~nondet115#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0 == main_~tmp___8~0#1; {6592#true} is VALID [2022-02-20 21:52:55,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {6592#true} assume main_#t~switch108#1; {6592#true} is VALID [2022-02-20 21:52:55,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {6592#true} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1 == main_~tmp___6~0#1; {6592#true} is VALID [2022-02-20 21:52:55,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {6592#true} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {6592#true} is VALID [2022-02-20 21:52:55,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {6592#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {6592#true} is VALID [2022-02-20 21:52:55,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {6592#true} assume !(#Ultimate.C_memset_#t~loopctr141#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {6592#true} is VALID [2022-02-20 21:52:55,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {6592#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr141#1;#Ultimate.C_memset_#t~loopctr141#1 := 0; {6592#true} is VALID [2022-02-20 21:52:55,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {6592#true} assume { :end_inline_ldv_set_init } true; {6592#true} is VALID [2022-02-20 21:52:55,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {6592#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret100#1.base, main_#t~ret100#1.offset;havoc main_#t~ret100#1.base, main_#t~ret100#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet101#1 && main_#t~nondet101#1 <= 2147483647;main_~tmp___1~0#1 := main_#t~nondet101#1;havoc main_#t~nondet101#1;main_~ldvarg0~0#1 := main_~tmp___1~0#1;assume -2147483648 <= main_#t~nondet102#1 && main_#t~nondet102#1 <= 2147483647;main_~tmp___2~0#1 := main_#t~nondet102#1;havoc main_#t~nondet102#1;main_~ldvarg5~0#1 := main_~tmp___2~0#1;assume -2147483648 <= main_#t~nondet103#1 && main_#t~nondet103#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet103#1;havoc main_#t~nondet103#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet104#1 && main_#t~nondet104#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet104#1;havoc main_#t~nondet104#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet105#1;havoc main_#t~nondet105#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {6592#true} is VALID [2022-02-20 21:52:55,982 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6592#true} {6592#true} #543#return; {6592#true} is VALID [2022-02-20 21:52:55,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {6592#true} assume true; {6592#true} is VALID [2022-02-20 21:52:55,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {6592#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {6592#true} is VALID [2022-02-20 21:52:55,982 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6592#true} {6592#true} #539#return; {6592#true} is VALID [2022-02-20 21:52:55,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {6592#true} assume true; {6592#true} is VALID [2022-02-20 21:52:55,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {6592#true} assume !(0 == ~cond); {6592#true} is VALID [2022-02-20 21:52:55,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {6592#true} ~cond := #in~cond; {6592#true} is VALID [2022-02-20 21:52:55,983 INFO L272 TraceCheckUtils]: 9: Hoare triple {6592#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {6592#true} is VALID [2022-02-20 21:52:55,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {6592#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {6592#true} is VALID [2022-02-20 21:52:55,983 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6592#true} {6592#true} #537#return; {6592#true} is VALID [2022-02-20 21:52:55,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {6592#true} assume true; {6592#true} is VALID [2022-02-20 21:52:55,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {6592#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6592#true} is VALID [2022-02-20 21:52:55,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {6592#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {6592#true} is VALID [2022-02-20 21:52:55,984 INFO L290 TraceCheckUtils]: 3: Hoare triple {6592#true} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {6592#true} is VALID [2022-02-20 21:52:55,984 INFO L272 TraceCheckUtils]: 2: Hoare triple {6592#true} call main_#t~ret100#1.base, main_#t~ret100#1.offset := ldv_successful_zalloc(232); {6592#true} is VALID [2022-02-20 21:52:55,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {6592#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet99#1, main_#t~ret100#1.base, main_#t~ret100#1.offset, main_#t~nondet101#1, main_#t~nondet102#1, main_#t~nondet103#1, main_#t~nondet104#1, main_#t~nondet105#1, main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset, main_#t~nondet107#1, main_#t~switch108#1, main_#t~nondet109#1, main_#t~switch110#1, main_#t~ret111#1, main_#t~ret112#1, main_#t~mem113#1, main_#t~ret114#1, main_#t~nondet115#1, main_#t~switch116#1, main_#t~ret117#1, main_~ldvarg7~0#1, main_~tmp~9#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~0#1, main_~ldvarg5~0#1, main_~tmp___2~0#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~9#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet99#1 && main_#t~nondet99#1 <= 2147483647;main_~tmp~9#1 := main_#t~nondet99#1;havoc main_#t~nondet99#1;main_~ldvarg7~0#1 := main_~tmp~9#1; {6592#true} is VALID [2022-02-20 21:52:55,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {6592#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(103, 2);call #Ultimate.allocInit(41, 3);call #Ultimate.allocInit(2, 4);call write~init~int(12, 4, 0, 1);call write~init~int(0, 4, 1, 1);call #Ultimate.allocInit(44, 5);call #Ultimate.allocInit(2, 6);call write~init~int(14, 6, 0, 1);call write~init~int(0, 6, 1, 1);call #Ultimate.allocInit(35, 7);call #Ultimate.allocInit(2, 8);call write~init~int(14, 8, 0, 1);call write~init~int(0, 8, 1, 1);call #Ultimate.allocInit(45, 9);call #Ultimate.allocInit(2, 10);call write~init~int(12, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(2, 12);call write~init~int(12, 12, 0, 1);call write~init~int(0, 12, 1, 1);call #Ultimate.allocInit(40, 13);call #Ultimate.allocInit(2, 14);call write~init~int(14, 14, 0, 1);call write~init~int(0, 14, 1, 1);call #Ultimate.allocInit(54, 15);~LDV_IN_INTERRUPT~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := 0, 0;~#capmode_proto~0.base, ~#capmode_proto~0.offset := 16, 0;call #Ultimate.allocInit(49, 16);call write~init~int(114, ~#capmode_proto~0.base, ~#capmode_proto~0.offset, 1);call write~init~int(508, ~#capmode_proto~0.base, 1 + ~#capmode_proto~0.offset, 4);call write~init~int(0, ~#capmode_proto~0.base, 5 + ~#capmode_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#capmode_proto~0.base, 9 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#capmode_proto~0.base, 17 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#capmode_proto~0.base, 25 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#capmode_proto~0.base, 33 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ack_tx.base, #funAddr~ack_tx.offset, ~#capmode_proto~0.base, 41 + ~#capmode_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 17, 0;call #Ultimate.allocInit(120, 17);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {6592#true} is VALID [2022-02-20 21:52:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:52:55,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609325988] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 21:52:55,985 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 21:52:55,985 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-02-20 21:52:55,985 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257949910] [2022-02-20 21:52:55,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 21:52:55,986 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-02-20 21:52:55,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:52:55,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:52:56,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:56,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 21:52:56,031 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:52:56,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 21:52:56,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-02-20 21:52:56,032 INFO L87 Difference]: Start difference. First operand 405 states and 537 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:52:57,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:57,550 INFO L93 Difference]: Finished difference Result 844 states and 1132 transitions. [2022-02-20 21:52:57,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 21:52:57,551 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-02-20 21:52:57,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:52:57,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:52:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 610 transitions. [2022-02-20 21:52:57,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:52:57,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 610 transitions. [2022-02-20 21:52:57,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 610 transitions. [2022-02-20 21:52:57,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 610 edges. 610 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:57,996 INFO L225 Difference]: With dead ends: 844 [2022-02-20 21:52:57,997 INFO L226 Difference]: Without dead ends: 447 [2022-02-20 21:52:57,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-02-20 21:52:58,002 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 61 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 21:52:58,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 1231 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 21:52:58,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-02-20 21:52:58,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 417. [2022-02-20 21:52:58,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:52:58,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 447 states. Second operand has 417 states, 318 states have (on average 1.29874213836478) internal successors, (413), 318 states have internal predecessors, (413), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-02-20 21:52:58,036 INFO L74 IsIncluded]: Start isIncluded. First operand 447 states. Second operand has 417 states, 318 states have (on average 1.29874213836478) internal successors, (413), 318 states have internal predecessors, (413), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-02-20 21:52:58,037 INFO L87 Difference]: Start difference. First operand 447 states. Second operand has 417 states, 318 states have (on average 1.29874213836478) internal successors, (413), 318 states have internal predecessors, (413), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-02-20 21:52:58,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:58,054 INFO L93 Difference]: Finished difference Result 447 states and 602 transitions. [2022-02-20 21:52:58,054 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 602 transitions. [2022-02-20 21:52:58,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:58,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:58,057 INFO L74 IsIncluded]: Start isIncluded. First operand has 417 states, 318 states have (on average 1.29874213836478) internal successors, (413), 318 states have internal predecessors, (413), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand 447 states. [2022-02-20 21:52:58,058 INFO L87 Difference]: Start difference. First operand has 417 states, 318 states have (on average 1.29874213836478) internal successors, (413), 318 states have internal predecessors, (413), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand 447 states. [2022-02-20 21:52:58,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:58,076 INFO L93 Difference]: Finished difference Result 447 states and 602 transitions. [2022-02-20 21:52:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 602 transitions. [2022-02-20 21:52:58,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:58,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:58,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:52:58,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:52:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 318 states have (on average 1.29874213836478) internal successors, (413), 318 states have internal predecessors, (413), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-02-20 21:52:58,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 552 transitions. [2022-02-20 21:52:58,095 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 552 transitions. Word has length 45 [2022-02-20 21:52:58,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:52:58,096 INFO L470 AbstractCegarLoop]: Abstraction has 417 states and 552 transitions. [2022-02-20 21:52:58,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:52:58,096 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 552 transitions. [2022-02-20 21:52:58,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 21:52:58,098 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:52:58,098 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:52:58,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 21:52:58,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:52:58,324 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:52:58,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:52:58,324 INFO L85 PathProgramCache]: Analyzing trace with hash 797749943, now seen corresponding path program 2 times [2022-02-20 21:52:58,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:52:58,325 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074114239] [2022-02-20 21:52:58,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:52:58,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:52:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:58,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:52:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:58,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:52:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:58,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {9533#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9507#true} is VALID [2022-02-20 21:52:58,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {9507#true} assume true; {9507#true} is VALID [2022-02-20 21:52:58,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9507#true} {9507#true} #537#return; {9507#true} is VALID [2022-02-20 21:52:58,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:52:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:58,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {9507#true} ~cond := #in~cond; {9507#true} is VALID [2022-02-20 21:52:58,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {9507#true} assume !(0 == ~cond); {9507#true} is VALID [2022-02-20 21:52:58,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {9507#true} assume true; {9507#true} is VALID [2022-02-20 21:52:58,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9507#true} {9507#true} #539#return; {9507#true} is VALID [2022-02-20 21:52:58,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {9525#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {9507#true} is VALID [2022-02-20 21:52:58,437 INFO L272 TraceCheckUtils]: 1: Hoare triple {9507#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {9533#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:58,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {9533#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9507#true} is VALID [2022-02-20 21:52:58,437 INFO L290 TraceCheckUtils]: 3: Hoare triple {9507#true} assume true; {9507#true} is VALID [2022-02-20 21:52:58,437 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9507#true} {9507#true} #537#return; {9507#true} is VALID [2022-02-20 21:52:58,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {9507#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {9507#true} is VALID [2022-02-20 21:52:58,437 INFO L272 TraceCheckUtils]: 6: Hoare triple {9507#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {9507#true} is VALID [2022-02-20 21:52:58,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {9507#true} ~cond := #in~cond; {9507#true} is VALID [2022-02-20 21:52:58,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {9507#true} assume !(0 == ~cond); {9507#true} is VALID [2022-02-20 21:52:58,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {9507#true} assume true; {9507#true} is VALID [2022-02-20 21:52:58,438 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9507#true} {9507#true} #539#return; {9507#true} is VALID [2022-02-20 21:52:58,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {9507#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {9507#true} is VALID [2022-02-20 21:52:58,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {9507#true} assume true; {9507#true} is VALID [2022-02-20 21:52:58,438 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {9507#true} {9507#true} #543#return; {9507#true} is VALID [2022-02-20 21:52:58,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {9507#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(103, 2);call #Ultimate.allocInit(41, 3);call #Ultimate.allocInit(2, 4);call write~init~int(12, 4, 0, 1);call write~init~int(0, 4, 1, 1);call #Ultimate.allocInit(44, 5);call #Ultimate.allocInit(2, 6);call write~init~int(14, 6, 0, 1);call write~init~int(0, 6, 1, 1);call #Ultimate.allocInit(35, 7);call #Ultimate.allocInit(2, 8);call write~init~int(14, 8, 0, 1);call write~init~int(0, 8, 1, 1);call #Ultimate.allocInit(45, 9);call #Ultimate.allocInit(2, 10);call write~init~int(12, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(2, 12);call write~init~int(12, 12, 0, 1);call write~init~int(0, 12, 1, 1);call #Ultimate.allocInit(40, 13);call #Ultimate.allocInit(2, 14);call write~init~int(14, 14, 0, 1);call write~init~int(0, 14, 1, 1);call #Ultimate.allocInit(54, 15);~LDV_IN_INTERRUPT~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := 0, 0;~#capmode_proto~0.base, ~#capmode_proto~0.offset := 16, 0;call #Ultimate.allocInit(49, 16);call write~init~int(114, ~#capmode_proto~0.base, ~#capmode_proto~0.offset, 1);call write~init~int(508, ~#capmode_proto~0.base, 1 + ~#capmode_proto~0.offset, 4);call write~init~int(0, ~#capmode_proto~0.base, 5 + ~#capmode_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#capmode_proto~0.base, 9 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#capmode_proto~0.base, 17 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#capmode_proto~0.base, 25 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#capmode_proto~0.base, 33 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ack_tx.base, #funAddr~ack_tx.offset, ~#capmode_proto~0.base, 41 + ~#capmode_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 17, 0;call #Ultimate.allocInit(120, 17);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {9507#true} is VALID [2022-02-20 21:52:58,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {9507#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet99#1, main_#t~ret100#1.base, main_#t~ret100#1.offset, main_#t~nondet101#1, main_#t~nondet102#1, main_#t~nondet103#1, main_#t~nondet104#1, main_#t~nondet105#1, main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset, main_#t~nondet107#1, main_#t~switch108#1, main_#t~nondet109#1, main_#t~switch110#1, main_#t~ret111#1, main_#t~ret112#1, main_#t~mem113#1, main_#t~ret114#1, main_#t~nondet115#1, main_#t~switch116#1, main_#t~ret117#1, main_~ldvarg7~0#1, main_~tmp~9#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~0#1, main_~ldvarg5~0#1, main_~tmp___2~0#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~9#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet99#1 && main_#t~nondet99#1 <= 2147483647;main_~tmp~9#1 := main_#t~nondet99#1;havoc main_#t~nondet99#1;main_~ldvarg7~0#1 := main_~tmp~9#1; {9507#true} is VALID [2022-02-20 21:52:58,440 INFO L272 TraceCheckUtils]: 2: Hoare triple {9507#true} call main_#t~ret100#1.base, main_#t~ret100#1.offset := ldv_successful_zalloc(232); {9525#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:58,440 INFO L290 TraceCheckUtils]: 3: Hoare triple {9525#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {9507#true} is VALID [2022-02-20 21:52:58,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {9507#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {9533#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:58,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {9533#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9507#true} is VALID [2022-02-20 21:52:58,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {9507#true} assume true; {9507#true} is VALID [2022-02-20 21:52:58,441 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9507#true} {9507#true} #537#return; {9507#true} is VALID [2022-02-20 21:52:58,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {9507#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {9507#true} is VALID [2022-02-20 21:52:58,441 INFO L272 TraceCheckUtils]: 9: Hoare triple {9507#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {9507#true} is VALID [2022-02-20 21:52:58,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {9507#true} ~cond := #in~cond; {9507#true} is VALID [2022-02-20 21:52:58,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {9507#true} assume !(0 == ~cond); {9507#true} is VALID [2022-02-20 21:52:58,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {9507#true} assume true; {9507#true} is VALID [2022-02-20 21:52:58,442 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {9507#true} {9507#true} #539#return; {9507#true} is VALID [2022-02-20 21:52:58,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {9507#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {9507#true} is VALID [2022-02-20 21:52:58,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {9507#true} assume true; {9507#true} is VALID [2022-02-20 21:52:58,442 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9507#true} {9507#true} #543#return; {9507#true} is VALID [2022-02-20 21:52:58,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {9507#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret100#1.base, main_#t~ret100#1.offset;havoc main_#t~ret100#1.base, main_#t~ret100#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet101#1 && main_#t~nondet101#1 <= 2147483647;main_~tmp___1~0#1 := main_#t~nondet101#1;havoc main_#t~nondet101#1;main_~ldvarg0~0#1 := main_~tmp___1~0#1;assume -2147483648 <= main_#t~nondet102#1 && main_#t~nondet102#1 <= 2147483647;main_~tmp___2~0#1 := main_#t~nondet102#1;havoc main_#t~nondet102#1;main_~ldvarg5~0#1 := main_~tmp___2~0#1;assume -2147483648 <= main_#t~nondet103#1 && main_#t~nondet103#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet103#1;havoc main_#t~nondet103#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet104#1 && main_#t~nondet104#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet104#1;havoc main_#t~nondet104#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet105#1;havoc main_#t~nondet105#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {9507#true} is VALID [2022-02-20 21:52:58,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {9507#true} assume { :end_inline_ldv_set_init } true; {9507#true} is VALID [2022-02-20 21:52:58,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {9507#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr141#1;#Ultimate.C_memset_#t~loopctr141#1 := 0; {9507#true} is VALID [2022-02-20 21:52:58,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {9507#true} assume !(#Ultimate.C_memset_#t~loopctr141#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {9507#true} is VALID [2022-02-20 21:52:58,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {9507#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {9507#true} is VALID [2022-02-20 21:52:58,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {9507#true} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {9507#true} is VALID [2022-02-20 21:52:58,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {9507#true} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1 == main_~tmp___6~0#1; {9507#true} is VALID [2022-02-20 21:52:58,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {9507#true} assume main_#t~switch108#1; {9507#true} is VALID [2022-02-20 21:52:58,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {9507#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet115#1 && main_#t~nondet115#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0 == main_~tmp___8~0#1; {9507#true} is VALID [2022-02-20 21:52:58,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {9507#true} assume !main_#t~switch116#1;main_#t~switch116#1 := main_#t~switch116#1 || 1 == main_~tmp___8~0#1; {9507#true} is VALID [2022-02-20 21:52:58,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {9507#true} assume main_#t~switch116#1; {9507#true} is VALID [2022-02-20 21:52:58,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {9507#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_capmode_module_init } true;havoc capmode_module_init_#res#1;havoc capmode_module_init_#t~nondet96#1;havoc capmode_module_init_#t~nondet96#1;assume { :begin_inline_arcnet_cap_init } true;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset, arcnet_cap_init_~count~0#1;havoc arcnet_cap_init_~count~0#1;arcnet_cap_init_~count~0#1 := 1; {9507#true} is VALID [2022-02-20 21:52:58,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {9507#true} assume arcnet_cap_init_~count~0#1 <= 8; {9507#true} is VALID [2022-02-20 21:52:58,444 INFO L290 TraceCheckUtils]: 30: Hoare triple {9507#true} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {9507#true} is VALID [2022-02-20 21:52:58,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {9507#true} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {9507#true} is VALID [2022-02-20 21:52:58,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {9507#true} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {9507#true} is VALID [2022-02-20 21:52:58,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {9507#true} assume arcnet_cap_init_~count~0#1 <= 8; {9507#true} is VALID [2022-02-20 21:52:58,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {9507#true} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {9507#true} is VALID [2022-02-20 21:52:58,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {9507#true} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {9507#true} is VALID [2022-02-20 21:52:58,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {9507#true} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {9507#true} is VALID [2022-02-20 21:52:58,445 INFO L290 TraceCheckUtils]: 37: Hoare triple {9507#true} assume arcnet_cap_init_~count~0#1 <= 8; {9507#true} is VALID [2022-02-20 21:52:58,445 INFO L290 TraceCheckUtils]: 38: Hoare triple {9507#true} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {9507#true} is VALID [2022-02-20 21:52:58,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {9507#true} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {9507#true} is VALID [2022-02-20 21:52:58,445 INFO L290 TraceCheckUtils]: 40: Hoare triple {9507#true} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {9507#true} is VALID [2022-02-20 21:52:58,445 INFO L290 TraceCheckUtils]: 41: Hoare triple {9507#true} assume arcnet_cap_init_~count~0#1 <= 8; {9507#true} is VALID [2022-02-20 21:52:58,446 INFO L290 TraceCheckUtils]: 42: Hoare triple {9507#true} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {9507#true} is VALID [2022-02-20 21:52:58,446 INFO L290 TraceCheckUtils]: 43: Hoare triple {9507#true} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {9507#true} is VALID [2022-02-20 21:52:58,446 INFO L290 TraceCheckUtils]: 44: Hoare triple {9507#true} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {9507#true} is VALID [2022-02-20 21:52:58,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {9507#true} assume !(arcnet_cap_init_~count~0#1 <= 8); {9507#true} is VALID [2022-02-20 21:52:58,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {9507#true} assume (~arc_bcast_proto~0.base + ~arc_bcast_proto~0.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;~arc_bcast_proto~0.base, ~arc_bcast_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {9507#true} is VALID [2022-02-20 21:52:58,446 INFO L290 TraceCheckUtils]: 47: Hoare triple {9507#true} ~arc_proto_default~0.base, ~arc_proto_default~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;~arc_raw_proto~0.base, ~arc_raw_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {9507#true} is VALID [2022-02-20 21:52:58,451 INFO L290 TraceCheckUtils]: 48: Hoare triple {9507#true} assume { :end_inline_arcnet_cap_init } true;capmode_module_init_#res#1 := 0; {9523#(= |ULTIMATE.start_capmode_module_init_#res#1| 0)} is VALID [2022-02-20 21:52:58,451 INFO L290 TraceCheckUtils]: 49: Hoare triple {9523#(= |ULTIMATE.start_capmode_module_init_#res#1| 0)} main_#t~ret117#1 := capmode_module_init_#res#1;assume { :end_inline_capmode_module_init } true;assume -2147483648 <= main_#t~ret117#1 && main_#t~ret117#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret117#1;havoc main_#t~ret117#1; {9524#(= ~ldv_retval_0~0 0)} is VALID [2022-02-20 21:52:58,451 INFO L290 TraceCheckUtils]: 50: Hoare triple {9524#(= ~ldv_retval_0~0 0)} assume !(0 == ~ldv_retval_0~0); {9508#false} is VALID [2022-02-20 21:52:58,452 INFO L290 TraceCheckUtils]: 51: Hoare triple {9508#false} assume 0 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2; {9508#false} is VALID [2022-02-20 21:52:58,452 INFO L290 TraceCheckUtils]: 52: Hoare triple {9508#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret132#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {9508#false} is VALID [2022-02-20 21:52:58,452 INFO L290 TraceCheckUtils]: 53: Hoare triple {9508#false} ldv_check_final_state_#t~ret132#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret132#1 && ldv_check_final_state_#t~ret132#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret132#1;havoc ldv_check_final_state_#t~ret132#1; {9508#false} is VALID [2022-02-20 21:52:58,452 INFO L290 TraceCheckUtils]: 54: Hoare triple {9508#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {9508#false} is VALID [2022-02-20 21:52:58,452 INFO L272 TraceCheckUtils]: 55: Hoare triple {9508#false} call ldv_error(); {9508#false} is VALID [2022-02-20 21:52:58,452 INFO L290 TraceCheckUtils]: 56: Hoare triple {9508#false} assume !false; {9508#false} is VALID [2022-02-20 21:52:58,454 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-20 21:52:58,454 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:52:58,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074114239] [2022-02-20 21:52:58,455 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074114239] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:52:58,455 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:52:58,455 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:52:58,455 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704559801] [2022-02-20 21:52:58,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:52:58,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2022-02-20 21:52:58,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:52:58,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:52:58,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:58,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:52:58,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:52:58,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:52:58,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:52:58,485 INFO L87 Difference]: Start difference. First operand 417 states and 552 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:00,429 INFO L93 Difference]: Finished difference Result 855 states and 1142 transitions. [2022-02-20 21:53:00,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 21:53:00,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2022-02-20 21:53:00,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:00,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:00,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 763 transitions. [2022-02-20 21:53:00,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 763 transitions. [2022-02-20 21:53:00,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 763 transitions. [2022-02-20 21:53:01,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 763 edges. 763 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:01,035 INFO L225 Difference]: With dead ends: 855 [2022-02-20 21:53:01,035 INFO L226 Difference]: Without dead ends: 446 [2022-02-20 21:53:01,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-02-20 21:53:01,037 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 440 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 21:53:01,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [464 Valid, 1132 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 21:53:01,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2022-02-20 21:53:01,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 416. [2022-02-20 21:53:01,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:53:01,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 446 states. Second operand has 416 states, 317 states have (on average 1.2902208201892744) internal successors, (409), 317 states have internal predecessors, (409), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-02-20 21:53:01,054 INFO L74 IsIncluded]: Start isIncluded. First operand 446 states. Second operand has 416 states, 317 states have (on average 1.2902208201892744) internal successors, (409), 317 states have internal predecessors, (409), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-02-20 21:53:01,055 INFO L87 Difference]: Start difference. First operand 446 states. Second operand has 416 states, 317 states have (on average 1.2902208201892744) internal successors, (409), 317 states have internal predecessors, (409), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-02-20 21:53:01,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:01,065 INFO L93 Difference]: Finished difference Result 446 states and 598 transitions. [2022-02-20 21:53:01,065 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 598 transitions. [2022-02-20 21:53:01,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:01,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:01,067 INFO L74 IsIncluded]: Start isIncluded. First operand has 416 states, 317 states have (on average 1.2902208201892744) internal successors, (409), 317 states have internal predecessors, (409), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand 446 states. [2022-02-20 21:53:01,068 INFO L87 Difference]: Start difference. First operand has 416 states, 317 states have (on average 1.2902208201892744) internal successors, (409), 317 states have internal predecessors, (409), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand 446 states. [2022-02-20 21:53:01,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:01,079 INFO L93 Difference]: Finished difference Result 446 states and 598 transitions. [2022-02-20 21:53:01,079 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 598 transitions. [2022-02-20 21:53:01,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:01,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:01,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:53:01,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:53:01,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 317 states have (on average 1.2902208201892744) internal successors, (409), 317 states have internal predecessors, (409), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-02-20 21:53:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 548 transitions. [2022-02-20 21:53:01,098 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 548 transitions. Word has length 57 [2022-02-20 21:53:01,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:53:01,098 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 548 transitions. [2022-02-20 21:53:01,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 548 transitions. [2022-02-20 21:53:01,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-20 21:53:01,101 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:01,102 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-02-20 21:53:01,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 21:53:01,102 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:01,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:01,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1188095234, now seen corresponding path program 1 times [2022-02-20 21:53:01,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:53:01,103 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406936455] [2022-02-20 21:53:01,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:01,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:53:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:53:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {12233#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12178#true} is VALID [2022-02-20 21:53:01,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12178#true} {12178#true} #537#return; {12178#true} is VALID [2022-02-20 21:53:01,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {12178#true} ~cond := #in~cond; {12178#true} is VALID [2022-02-20 21:53:01,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {12178#true} assume !(0 == ~cond); {12178#true} is VALID [2022-02-20 21:53:01,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12178#true} {12178#true} #539#return; {12178#true} is VALID [2022-02-20 21:53:01,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {12225#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {12178#true} is VALID [2022-02-20 21:53:01,252 INFO L272 TraceCheckUtils]: 1: Hoare triple {12178#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {12233#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:01,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {12233#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12178#true} is VALID [2022-02-20 21:53:01,253 INFO L290 TraceCheckUtils]: 3: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,253 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12178#true} {12178#true} #537#return; {12178#true} is VALID [2022-02-20 21:53:01,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {12178#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {12178#true} is VALID [2022-02-20 21:53:01,253 INFO L272 TraceCheckUtils]: 6: Hoare triple {12178#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {12178#true} is VALID [2022-02-20 21:53:01,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {12178#true} ~cond := #in~cond; {12178#true} is VALID [2022-02-20 21:53:01,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {12178#true} assume !(0 == ~cond); {12178#true} is VALID [2022-02-20 21:53:01,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,253 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12178#true} {12178#true} #539#return; {12178#true} is VALID [2022-02-20 21:53:01,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {12178#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {12178#true} is VALID [2022-02-20 21:53:01,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,254 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {12178#true} {12178#true} #543#return; {12178#true} is VALID [2022-02-20 21:53:01,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 21:53:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {12233#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12178#true} is VALID [2022-02-20 21:53:01,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,270 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12178#true} {12178#true} #537#return; {12178#true} is VALID [2022-02-20 21:53:01,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {12178#true} ~cond := #in~cond; {12178#true} is VALID [2022-02-20 21:53:01,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {12178#true} assume !(0 == ~cond); {12178#true} is VALID [2022-02-20 21:53:01,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12178#true} {12178#true} #539#return; {12178#true} is VALID [2022-02-20 21:53:01,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {12225#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {12178#true} is VALID [2022-02-20 21:53:01,276 INFO L272 TraceCheckUtils]: 1: Hoare triple {12178#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {12233#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:01,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {12233#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12178#true} is VALID [2022-02-20 21:53:01,276 INFO L290 TraceCheckUtils]: 3: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,276 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12178#true} {12178#true} #537#return; {12178#true} is VALID [2022-02-20 21:53:01,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {12178#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {12178#true} is VALID [2022-02-20 21:53:01,276 INFO L272 TraceCheckUtils]: 6: Hoare triple {12178#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {12178#true} is VALID [2022-02-20 21:53:01,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {12178#true} ~cond := #in~cond; {12178#true} is VALID [2022-02-20 21:53:01,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {12178#true} assume !(0 == ~cond); {12178#true} is VALID [2022-02-20 21:53:01,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,277 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12178#true} {12178#true} #539#return; {12178#true} is VALID [2022-02-20 21:53:01,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {12178#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {12178#true} is VALID [2022-02-20 21:53:01,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,278 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {12178#true} {12194#(= ~last_index~0 0)} #599#return; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-02-20 21:53:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {12233#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12178#true} is VALID [2022-02-20 21:53:01,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,291 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12178#true} {12178#true} #537#return; {12178#true} is VALID [2022-02-20 21:53:01,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {12178#true} ~cond := #in~cond; {12178#true} is VALID [2022-02-20 21:53:01,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {12178#true} assume !(0 == ~cond); {12178#true} is VALID [2022-02-20 21:53:01,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12178#true} {12178#true} #539#return; {12178#true} is VALID [2022-02-20 21:53:01,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {12225#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {12178#true} is VALID [2022-02-20 21:53:01,296 INFO L272 TraceCheckUtils]: 1: Hoare triple {12178#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {12233#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:01,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {12233#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12178#true} is VALID [2022-02-20 21:53:01,296 INFO L290 TraceCheckUtils]: 3: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,296 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12178#true} {12178#true} #537#return; {12178#true} is VALID [2022-02-20 21:53:01,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {12178#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {12178#true} is VALID [2022-02-20 21:53:01,296 INFO L272 TraceCheckUtils]: 6: Hoare triple {12178#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {12178#true} is VALID [2022-02-20 21:53:01,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {12178#true} ~cond := #in~cond; {12178#true} is VALID [2022-02-20 21:53:01,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {12178#true} assume !(0 == ~cond); {12178#true} is VALID [2022-02-20 21:53:01,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,297 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12178#true} {12178#true} #539#return; {12178#true} is VALID [2022-02-20 21:53:01,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {12178#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {12178#true} is VALID [2022-02-20 21:53:01,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,297 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {12178#true} {12194#(= ~last_index~0 0)} #601#return; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {12178#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(103, 2);call #Ultimate.allocInit(41, 3);call #Ultimate.allocInit(2, 4);call write~init~int(12, 4, 0, 1);call write~init~int(0, 4, 1, 1);call #Ultimate.allocInit(44, 5);call #Ultimate.allocInit(2, 6);call write~init~int(14, 6, 0, 1);call write~init~int(0, 6, 1, 1);call #Ultimate.allocInit(35, 7);call #Ultimate.allocInit(2, 8);call write~init~int(14, 8, 0, 1);call write~init~int(0, 8, 1, 1);call #Ultimate.allocInit(45, 9);call #Ultimate.allocInit(2, 10);call write~init~int(12, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(2, 12);call write~init~int(12, 12, 0, 1);call write~init~int(0, 12, 1, 1);call #Ultimate.allocInit(40, 13);call #Ultimate.allocInit(2, 14);call write~init~int(14, 14, 0, 1);call write~init~int(0, 14, 1, 1);call #Ultimate.allocInit(54, 15);~LDV_IN_INTERRUPT~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := 0, 0;~#capmode_proto~0.base, ~#capmode_proto~0.offset := 16, 0;call #Ultimate.allocInit(49, 16);call write~init~int(114, ~#capmode_proto~0.base, ~#capmode_proto~0.offset, 1);call write~init~int(508, ~#capmode_proto~0.base, 1 + ~#capmode_proto~0.offset, 4);call write~init~int(0, ~#capmode_proto~0.base, 5 + ~#capmode_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#capmode_proto~0.base, 9 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#capmode_proto~0.base, 17 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#capmode_proto~0.base, 25 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#capmode_proto~0.base, 33 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ack_tx.base, #funAddr~ack_tx.offset, ~#capmode_proto~0.base, 41 + ~#capmode_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 17, 0;call #Ultimate.allocInit(120, 17);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {12178#true} is VALID [2022-02-20 21:53:01,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {12178#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet99#1, main_#t~ret100#1.base, main_#t~ret100#1.offset, main_#t~nondet101#1, main_#t~nondet102#1, main_#t~nondet103#1, main_#t~nondet104#1, main_#t~nondet105#1, main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset, main_#t~nondet107#1, main_#t~switch108#1, main_#t~nondet109#1, main_#t~switch110#1, main_#t~ret111#1, main_#t~ret112#1, main_#t~mem113#1, main_#t~ret114#1, main_#t~nondet115#1, main_#t~switch116#1, main_#t~ret117#1, main_~ldvarg7~0#1, main_~tmp~9#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~0#1, main_~ldvarg5~0#1, main_~tmp___2~0#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~9#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet99#1 && main_#t~nondet99#1 <= 2147483647;main_~tmp~9#1 := main_#t~nondet99#1;havoc main_#t~nondet99#1;main_~ldvarg7~0#1 := main_~tmp~9#1; {12178#true} is VALID [2022-02-20 21:53:01,298 INFO L272 TraceCheckUtils]: 2: Hoare triple {12178#true} call main_#t~ret100#1.base, main_#t~ret100#1.offset := ldv_successful_zalloc(232); {12225#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:01,298 INFO L290 TraceCheckUtils]: 3: Hoare triple {12225#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {12178#true} is VALID [2022-02-20 21:53:01,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {12178#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {12233#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:01,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {12233#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12178#true} is VALID [2022-02-20 21:53:01,299 INFO L290 TraceCheckUtils]: 6: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,300 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12178#true} {12178#true} #537#return; {12178#true} is VALID [2022-02-20 21:53:01,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {12178#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {12178#true} is VALID [2022-02-20 21:53:01,300 INFO L272 TraceCheckUtils]: 9: Hoare triple {12178#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {12178#true} is VALID [2022-02-20 21:53:01,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {12178#true} ~cond := #in~cond; {12178#true} is VALID [2022-02-20 21:53:01,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {12178#true} assume !(0 == ~cond); {12178#true} is VALID [2022-02-20 21:53:01,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,300 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {12178#true} {12178#true} #539#return; {12178#true} is VALID [2022-02-20 21:53:01,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {12178#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {12178#true} is VALID [2022-02-20 21:53:01,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,301 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12178#true} {12178#true} #543#return; {12178#true} is VALID [2022-02-20 21:53:01,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {12178#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret100#1.base, main_#t~ret100#1.offset;havoc main_#t~ret100#1.base, main_#t~ret100#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet101#1 && main_#t~nondet101#1 <= 2147483647;main_~tmp___1~0#1 := main_#t~nondet101#1;havoc main_#t~nondet101#1;main_~ldvarg0~0#1 := main_~tmp___1~0#1;assume -2147483648 <= main_#t~nondet102#1 && main_#t~nondet102#1 <= 2147483647;main_~tmp___2~0#1 := main_#t~nondet102#1;havoc main_#t~nondet102#1;main_~ldvarg5~0#1 := main_~tmp___2~0#1;assume -2147483648 <= main_#t~nondet103#1 && main_#t~nondet103#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet103#1;havoc main_#t~nondet103#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet104#1 && main_#t~nondet104#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet104#1;havoc main_#t~nondet104#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet105#1;havoc main_#t~nondet105#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {12194#(= ~last_index~0 0)} assume { :end_inline_ldv_set_init } true; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {12194#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr141#1;#Ultimate.C_memset_#t~loopctr141#1 := 0; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {12194#(= ~last_index~0 0)} assume !(#Ultimate.C_memset_#t~loopctr141#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {12194#(= ~last_index~0 0)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {12194#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {12194#(= ~last_index~0 0)} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1 == main_~tmp___6~0#1; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {12194#(= ~last_index~0 0)} assume main_#t~switch108#1; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {12194#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet115#1 && main_#t~nondet115#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0 == main_~tmp___8~0#1; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {12194#(= ~last_index~0 0)} assume !main_#t~switch116#1;main_#t~switch116#1 := main_#t~switch116#1 || 1 == main_~tmp___8~0#1; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {12194#(= ~last_index~0 0)} assume main_#t~switch116#1; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {12194#(= ~last_index~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_capmode_module_init } true;havoc capmode_module_init_#res#1;havoc capmode_module_init_#t~nondet96#1;havoc capmode_module_init_#t~nondet96#1;assume { :begin_inline_arcnet_cap_init } true;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset, arcnet_cap_init_~count~0#1;havoc arcnet_cap_init_~count~0#1;arcnet_cap_init_~count~0#1 := 1; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {12194#(= ~last_index~0 0)} assume arcnet_cap_init_~count~0#1 <= 8; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {12194#(= ~last_index~0 0)} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {12194#(= ~last_index~0 0)} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {12194#(= ~last_index~0 0)} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {12194#(= ~last_index~0 0)} assume arcnet_cap_init_~count~0#1 <= 8; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {12194#(= ~last_index~0 0)} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {12194#(= ~last_index~0 0)} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {12194#(= ~last_index~0 0)} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,307 INFO L290 TraceCheckUtils]: 37: Hoare triple {12194#(= ~last_index~0 0)} assume arcnet_cap_init_~count~0#1 <= 8; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {12194#(= ~last_index~0 0)} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,307 INFO L290 TraceCheckUtils]: 39: Hoare triple {12194#(= ~last_index~0 0)} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {12194#(= ~last_index~0 0)} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,308 INFO L290 TraceCheckUtils]: 41: Hoare triple {12194#(= ~last_index~0 0)} assume arcnet_cap_init_~count~0#1 <= 8; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,308 INFO L290 TraceCheckUtils]: 42: Hoare triple {12194#(= ~last_index~0 0)} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,308 INFO L290 TraceCheckUtils]: 43: Hoare triple {12194#(= ~last_index~0 0)} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,309 INFO L290 TraceCheckUtils]: 44: Hoare triple {12194#(= ~last_index~0 0)} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,309 INFO L290 TraceCheckUtils]: 45: Hoare triple {12194#(= ~last_index~0 0)} assume !(arcnet_cap_init_~count~0#1 <= 8); {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,309 INFO L290 TraceCheckUtils]: 46: Hoare triple {12194#(= ~last_index~0 0)} assume (~arc_bcast_proto~0.base + ~arc_bcast_proto~0.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;~arc_bcast_proto~0.base, ~arc_bcast_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,309 INFO L290 TraceCheckUtils]: 47: Hoare triple {12194#(= ~last_index~0 0)} ~arc_proto_default~0.base, ~arc_proto_default~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;~arc_raw_proto~0.base, ~arc_raw_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,310 INFO L290 TraceCheckUtils]: 48: Hoare triple {12194#(= ~last_index~0 0)} assume { :end_inline_arcnet_cap_init } true;capmode_module_init_#res#1 := 0; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {12194#(= ~last_index~0 0)} main_#t~ret117#1 := capmode_module_init_#res#1;assume { :end_inline_capmode_module_init } true;assume -2147483648 <= main_#t~ret117#1 && main_#t~ret117#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret117#1;havoc main_#t~ret117#1; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,310 INFO L290 TraceCheckUtils]: 50: Hoare triple {12194#(= ~last_index~0 0)} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_ArcProto_1 } true;havoc ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset, ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset, ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset, ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset;havoc ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset;havoc ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,311 INFO L272 TraceCheckUtils]: 51: Hoare triple {12194#(= ~last_index~0 0)} call ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset := ldv_successful_zalloc(20); {12225#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:01,311 INFO L290 TraceCheckUtils]: 52: Hoare triple {12225#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {12178#true} is VALID [2022-02-20 21:53:01,312 INFO L272 TraceCheckUtils]: 53: Hoare triple {12178#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {12233#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:01,312 INFO L290 TraceCheckUtils]: 54: Hoare triple {12233#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12178#true} is VALID [2022-02-20 21:53:01,312 INFO L290 TraceCheckUtils]: 55: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,312 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {12178#true} {12178#true} #537#return; {12178#true} is VALID [2022-02-20 21:53:01,312 INFO L290 TraceCheckUtils]: 57: Hoare triple {12178#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {12178#true} is VALID [2022-02-20 21:53:01,312 INFO L272 TraceCheckUtils]: 58: Hoare triple {12178#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {12178#true} is VALID [2022-02-20 21:53:01,312 INFO L290 TraceCheckUtils]: 59: Hoare triple {12178#true} ~cond := #in~cond; {12178#true} is VALID [2022-02-20 21:53:01,312 INFO L290 TraceCheckUtils]: 60: Hoare triple {12178#true} assume !(0 == ~cond); {12178#true} is VALID [2022-02-20 21:53:01,312 INFO L290 TraceCheckUtils]: 61: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,313 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {12178#true} {12178#true} #539#return; {12178#true} is VALID [2022-02-20 21:53:01,313 INFO L290 TraceCheckUtils]: 63: Hoare triple {12178#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {12178#true} is VALID [2022-02-20 21:53:01,313 INFO L290 TraceCheckUtils]: 64: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,313 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {12178#true} {12194#(= ~last_index~0 0)} #599#return; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,314 INFO L290 TraceCheckUtils]: 66: Hoare triple {12194#(= ~last_index~0 0)} ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset := ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,314 INFO L272 TraceCheckUtils]: 67: Hoare triple {12194#(= ~last_index~0 0)} call ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset := ldv_successful_zalloc(3264); {12225#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:01,314 INFO L290 TraceCheckUtils]: 68: Hoare triple {12225#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {12178#true} is VALID [2022-02-20 21:53:01,315 INFO L272 TraceCheckUtils]: 69: Hoare triple {12178#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {12233#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:01,315 INFO L290 TraceCheckUtils]: 70: Hoare triple {12233#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12178#true} is VALID [2022-02-20 21:53:01,315 INFO L290 TraceCheckUtils]: 71: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,315 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {12178#true} {12178#true} #537#return; {12178#true} is VALID [2022-02-20 21:53:01,315 INFO L290 TraceCheckUtils]: 73: Hoare triple {12178#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {12178#true} is VALID [2022-02-20 21:53:01,315 INFO L272 TraceCheckUtils]: 74: Hoare triple {12178#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {12178#true} is VALID [2022-02-20 21:53:01,315 INFO L290 TraceCheckUtils]: 75: Hoare triple {12178#true} ~cond := #in~cond; {12178#true} is VALID [2022-02-20 21:53:01,316 INFO L290 TraceCheckUtils]: 76: Hoare triple {12178#true} assume !(0 == ~cond); {12178#true} is VALID [2022-02-20 21:53:01,316 INFO L290 TraceCheckUtils]: 77: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,316 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {12178#true} {12178#true} #539#return; {12178#true} is VALID [2022-02-20 21:53:01,316 INFO L290 TraceCheckUtils]: 79: Hoare triple {12178#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {12178#true} is VALID [2022-02-20 21:53:01,316 INFO L290 TraceCheckUtils]: 80: Hoare triple {12178#true} assume true; {12178#true} is VALID [2022-02-20 21:53:01,316 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {12178#true} {12194#(= ~last_index~0 0)} #601#return; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,317 INFO L290 TraceCheckUtils]: 82: Hoare triple {12194#(= ~last_index~0 0)} ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset := ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,317 INFO L290 TraceCheckUtils]: 83: Hoare triple {12194#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize_ArcProto_1 } true; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,317 INFO L290 TraceCheckUtils]: 84: Hoare triple {12194#(= ~last_index~0 0)} assume !(0 != ~ldv_retval_0~0); {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,317 INFO L290 TraceCheckUtils]: 85: Hoare triple {12194#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,318 INFO L290 TraceCheckUtils]: 86: Hoare triple {12194#(= ~last_index~0 0)} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1 == main_~tmp___6~0#1; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,318 INFO L290 TraceCheckUtils]: 87: Hoare triple {12194#(= ~last_index~0 0)} assume main_#t~switch108#1; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,318 INFO L290 TraceCheckUtils]: 88: Hoare triple {12194#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet115#1 && main_#t~nondet115#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0 == main_~tmp___8~0#1; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,318 INFO L290 TraceCheckUtils]: 89: Hoare triple {12194#(= ~last_index~0 0)} assume main_#t~switch116#1; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,319 INFO L290 TraceCheckUtils]: 90: Hoare triple {12194#(= ~last_index~0 0)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_capmode_module_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;havoc arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset;arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset := arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,319 INFO L290 TraceCheckUtils]: 91: Hoare triple {12194#(= ~last_index~0 0)} assume { :end_inline_arcnet_unregister_proto } true; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,319 INFO L290 TraceCheckUtils]: 92: Hoare triple {12194#(= ~last_index~0 0)} assume { :end_inline_capmode_module_exit } true;~ldv_state_variable_0~0 := 2; {12194#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:01,320 INFO L290 TraceCheckUtils]: 93: Hoare triple {12194#(= ~last_index~0 0)} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret132#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {12223#(not (= |ULTIMATE.start_ldv_set_is_empty_#res#1| 0))} is VALID [2022-02-20 21:53:01,320 INFO L290 TraceCheckUtils]: 94: Hoare triple {12223#(not (= |ULTIMATE.start_ldv_set_is_empty_#res#1| 0))} ldv_check_final_state_#t~ret132#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret132#1 && ldv_check_final_state_#t~ret132#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret132#1;havoc ldv_check_final_state_#t~ret132#1; {12224#(not (= |ULTIMATE.start_ldv_check_final_state_~tmp___7~6#1| 0))} is VALID [2022-02-20 21:53:01,320 INFO L290 TraceCheckUtils]: 95: Hoare triple {12224#(not (= |ULTIMATE.start_ldv_check_final_state_~tmp___7~6#1| 0))} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {12179#false} is VALID [2022-02-20 21:53:01,320 INFO L272 TraceCheckUtils]: 96: Hoare triple {12179#false} call ldv_error(); {12179#false} is VALID [2022-02-20 21:53:01,320 INFO L290 TraceCheckUtils]: 97: Hoare triple {12179#false} assume !false; {12179#false} is VALID [2022-02-20 21:53:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-02-20 21:53:01,322 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:53:01,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406936455] [2022-02-20 21:53:01,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406936455] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:01,322 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:01,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 21:53:01,322 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761793935] [2022-02-20 21:53:01,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:01,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 98 [2022-02-20 21:53:01,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:01,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 21:53:01,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:01,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 21:53:01,356 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:53:01,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 21:53:01,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:53:01,357 INFO L87 Difference]: Start difference. First operand 416 states and 548 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 21:53:03,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:03,300 INFO L93 Difference]: Finished difference Result 1279 states and 1734 transitions. [2022-02-20 21:53:03,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 21:53:03,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 98 [2022-02-20 21:53:03,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 21:53:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 892 transitions. [2022-02-20 21:53:03,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 21:53:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 892 transitions. [2022-02-20 21:53:03,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 892 transitions. [2022-02-20 21:53:03,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 892 edges. 892 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:04,019 INFO L225 Difference]: With dead ends: 1279 [2022-02-20 21:53:04,020 INFO L226 Difference]: Without dead ends: 866 [2022-02-20 21:53:04,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-20 21:53:04,021 INFO L933 BasicCegarLoop]: 311 mSDtfsCounter, 370 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 21:53:04,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 1166 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 21:53:04,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2022-02-20 21:53:04,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 808. [2022-02-20 21:53:04,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:53:04,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 866 states. Second operand has 808 states, 613 states have (on average 1.2903752039151712) internal successors, (791), 613 states have internal predecessors, (791), 138 states have call successors, (138), 57 states have call predecessors, (138), 56 states have return successors, (149), 137 states have call predecessors, (149), 137 states have call successors, (149) [2022-02-20 21:53:04,047 INFO L74 IsIncluded]: Start isIncluded. First operand 866 states. Second operand has 808 states, 613 states have (on average 1.2903752039151712) internal successors, (791), 613 states have internal predecessors, (791), 138 states have call successors, (138), 57 states have call predecessors, (138), 56 states have return successors, (149), 137 states have call predecessors, (149), 137 states have call successors, (149) [2022-02-20 21:53:04,049 INFO L87 Difference]: Start difference. First operand 866 states. Second operand has 808 states, 613 states have (on average 1.2903752039151712) internal successors, (791), 613 states have internal predecessors, (791), 138 states have call successors, (138), 57 states have call predecessors, (138), 56 states have return successors, (149), 137 states have call predecessors, (149), 137 states have call successors, (149) [2022-02-20 21:53:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:04,078 INFO L93 Difference]: Finished difference Result 866 states and 1182 transitions. [2022-02-20 21:53:04,078 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1182 transitions. [2022-02-20 21:53:04,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:04,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:04,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 808 states, 613 states have (on average 1.2903752039151712) internal successors, (791), 613 states have internal predecessors, (791), 138 states have call successors, (138), 57 states have call predecessors, (138), 56 states have return successors, (149), 137 states have call predecessors, (149), 137 states have call successors, (149) Second operand 866 states. [2022-02-20 21:53:04,084 INFO L87 Difference]: Start difference. First operand has 808 states, 613 states have (on average 1.2903752039151712) internal successors, (791), 613 states have internal predecessors, (791), 138 states have call successors, (138), 57 states have call predecessors, (138), 56 states have return successors, (149), 137 states have call predecessors, (149), 137 states have call successors, (149) Second operand 866 states. [2022-02-20 21:53:04,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:04,114 INFO L93 Difference]: Finished difference Result 866 states and 1182 transitions. [2022-02-20 21:53:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1182 transitions. [2022-02-20 21:53:04,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:04,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:04,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:53:04,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:53:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 613 states have (on average 1.2903752039151712) internal successors, (791), 613 states have internal predecessors, (791), 138 states have call successors, (138), 57 states have call predecessors, (138), 56 states have return successors, (149), 137 states have call predecessors, (149), 137 states have call successors, (149) [2022-02-20 21:53:04,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1078 transitions. [2022-02-20 21:53:04,150 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1078 transitions. Word has length 98 [2022-02-20 21:53:04,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:53:04,150 INFO L470 AbstractCegarLoop]: Abstraction has 808 states and 1078 transitions. [2022-02-20 21:53:04,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 21:53:04,151 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1078 transitions. [2022-02-20 21:53:04,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-02-20 21:53:04,155 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:04,155 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:53:04,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 21:53:04,155 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:04,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:04,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2043442978, now seen corresponding path program 1 times [2022-02-20 21:53:04,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:53:04,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395966668] [2022-02-20 21:53:04,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:04,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:53:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:04,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:53:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:04,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:04,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {16935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16849#true} is VALID [2022-02-20 21:53:04,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,275 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16849#true} {16849#true} #537#return; {16849#true} is VALID [2022-02-20 21:53:04,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:04,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {16849#true} ~cond := #in~cond; {16849#true} is VALID [2022-02-20 21:53:04,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {16849#true} assume !(0 == ~cond); {16849#true} is VALID [2022-02-20 21:53:04,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16849#true} {16849#true} #539#return; {16849#true} is VALID [2022-02-20 21:53:04,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {16927#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {16849#true} is VALID [2022-02-20 21:53:04,282 INFO L272 TraceCheckUtils]: 1: Hoare triple {16849#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {16935#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:04,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {16935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16849#true} is VALID [2022-02-20 21:53:04,282 INFO L290 TraceCheckUtils]: 3: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,282 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16849#true} {16849#true} #537#return; {16849#true} is VALID [2022-02-20 21:53:04,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {16849#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {16849#true} is VALID [2022-02-20 21:53:04,282 INFO L272 TraceCheckUtils]: 6: Hoare triple {16849#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {16849#true} is VALID [2022-02-20 21:53:04,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {16849#true} ~cond := #in~cond; {16849#true} is VALID [2022-02-20 21:53:04,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {16849#true} assume !(0 == ~cond); {16849#true} is VALID [2022-02-20 21:53:04,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,283 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16849#true} {16849#true} #539#return; {16849#true} is VALID [2022-02-20 21:53:04,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {16849#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {16849#true} is VALID [2022-02-20 21:53:04,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,283 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {16849#true} {16849#true} #543#return; {16849#true} is VALID [2022-02-20 21:53:04,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 21:53:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:04,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:04,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {16935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16849#true} is VALID [2022-02-20 21:53:04,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,298 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16849#true} {16849#true} #537#return; {16849#true} is VALID [2022-02-20 21:53:04,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:04,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {16849#true} ~cond := #in~cond; {16849#true} is VALID [2022-02-20 21:53:04,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {16849#true} assume !(0 == ~cond); {16849#true} is VALID [2022-02-20 21:53:04,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16849#true} {16849#true} #539#return; {16849#true} is VALID [2022-02-20 21:53:04,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {16927#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {16849#true} is VALID [2022-02-20 21:53:04,303 INFO L272 TraceCheckUtils]: 1: Hoare triple {16849#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {16935#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:04,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {16935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16849#true} is VALID [2022-02-20 21:53:04,303 INFO L290 TraceCheckUtils]: 3: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,304 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16849#true} {16849#true} #537#return; {16849#true} is VALID [2022-02-20 21:53:04,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {16849#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {16849#true} is VALID [2022-02-20 21:53:04,304 INFO L272 TraceCheckUtils]: 6: Hoare triple {16849#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {16849#true} is VALID [2022-02-20 21:53:04,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {16849#true} ~cond := #in~cond; {16849#true} is VALID [2022-02-20 21:53:04,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {16849#true} assume !(0 == ~cond); {16849#true} is VALID [2022-02-20 21:53:04,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,304 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16849#true} {16849#true} #539#return; {16849#true} is VALID [2022-02-20 21:53:04,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {16849#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {16849#true} is VALID [2022-02-20 21:53:04,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,305 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {16849#true} {16849#true} #599#return; {16849#true} is VALID [2022-02-20 21:53:04,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-02-20 21:53:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:04,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:04,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {16935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16849#true} is VALID [2022-02-20 21:53:04,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,318 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16849#true} {16849#true} #537#return; {16849#true} is VALID [2022-02-20 21:53:04,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:04,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {16849#true} ~cond := #in~cond; {16849#true} is VALID [2022-02-20 21:53:04,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {16849#true} assume !(0 == ~cond); {16849#true} is VALID [2022-02-20 21:53:04,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16849#true} {16849#true} #539#return; {16849#true} is VALID [2022-02-20 21:53:04,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {16927#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {16849#true} is VALID [2022-02-20 21:53:04,325 INFO L272 TraceCheckUtils]: 1: Hoare triple {16849#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {16935#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:04,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {16935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16849#true} is VALID [2022-02-20 21:53:04,325 INFO L290 TraceCheckUtils]: 3: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,325 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16849#true} {16849#true} #537#return; {16849#true} is VALID [2022-02-20 21:53:04,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {16849#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {16849#true} is VALID [2022-02-20 21:53:04,326 INFO L272 TraceCheckUtils]: 6: Hoare triple {16849#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {16849#true} is VALID [2022-02-20 21:53:04,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {16849#true} ~cond := #in~cond; {16849#true} is VALID [2022-02-20 21:53:04,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {16849#true} assume !(0 == ~cond); {16849#true} is VALID [2022-02-20 21:53:04,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,326 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16849#true} {16849#true} #539#return; {16849#true} is VALID [2022-02-20 21:53:04,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {16849#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {16849#true} is VALID [2022-02-20 21:53:04,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,326 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {16849#true} {16849#true} #601#return; {16849#true} is VALID [2022-02-20 21:53:04,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-02-20 21:53:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:04,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {16849#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {16849#true} is VALID [2022-02-20 21:53:04,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,331 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16849#true} {16849#true} #573#return; {16849#true} is VALID [2022-02-20 21:53:04,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-02-20 21:53:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:04,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:04,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:04,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:04,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {16935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16849#true} is VALID [2022-02-20 21:53:04,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,448 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16849#true} {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} #537#return; {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} is VALID [2022-02-20 21:53:04,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:04,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {16849#true} ~cond := #in~cond; {16849#true} is VALID [2022-02-20 21:53:04,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {16849#true} assume !(0 == ~cond); {16849#true} is VALID [2022-02-20 21:53:04,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16849#true} {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} #539#return; {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} is VALID [2022-02-20 21:53:04,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {16927#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} is VALID [2022-02-20 21:53:04,454 INFO L272 TraceCheckUtils]: 1: Hoare triple {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {16935#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:04,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {16935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16849#true} is VALID [2022-02-20 21:53:04,454 INFO L290 TraceCheckUtils]: 3: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,455 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16849#true} {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} #537#return; {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} is VALID [2022-02-20 21:53:04,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} is VALID [2022-02-20 21:53:04,455 INFO L272 TraceCheckUtils]: 6: Hoare triple {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {16849#true} is VALID [2022-02-20 21:53:04,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {16849#true} ~cond := #in~cond; {16849#true} is VALID [2022-02-20 21:53:04,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {16849#true} assume !(0 == ~cond); {16849#true} is VALID [2022-02-20 21:53:04,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,456 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16849#true} {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} #539#return; {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} is VALID [2022-02-20 21:53:04,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {17003#(not (= |ldv_successful_zalloc_#res.base| 0))} is VALID [2022-02-20 21:53:04,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {17003#(not (= |ldv_successful_zalloc_#res.base| 0))} assume true; {17003#(not (= |ldv_successful_zalloc_#res.base| 0))} is VALID [2022-02-20 21:53:04,457 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {17003#(not (= |ldv_successful_zalloc_#res.base| 0))} {16849#true} #535#return; {16991#(not (= |ldv_skb_alloc_#t~ret128#1.base| 0))} is VALID [2022-02-20 21:53:04,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {16950#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {16849#true} is VALID [2022-02-20 21:53:04,458 INFO L272 TraceCheckUtils]: 1: Hoare triple {16849#true} call #t~ret128#1.base, #t~ret128#1.offset := ldv_successful_zalloc(248); {16927#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:04,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {16927#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} is VALID [2022-02-20 21:53:04,459 INFO L272 TraceCheckUtils]: 3: Hoare triple {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {16935#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:04,459 INFO L290 TraceCheckUtils]: 4: Hoare triple {16935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16849#true} is VALID [2022-02-20 21:53:04,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,460 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {16849#true} {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} #537#return; {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} is VALID [2022-02-20 21:53:04,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} is VALID [2022-02-20 21:53:04,461 INFO L272 TraceCheckUtils]: 8: Hoare triple {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {16849#true} is VALID [2022-02-20 21:53:04,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {16849#true} ~cond := #in~cond; {16849#true} is VALID [2022-02-20 21:53:04,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {16849#true} assume !(0 == ~cond); {16849#true} is VALID [2022-02-20 21:53:04,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,461 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16849#true} {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} #539#return; {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} is VALID [2022-02-20 21:53:04,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {17003#(not (= |ldv_successful_zalloc_#res.base| 0))} is VALID [2022-02-20 21:53:04,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {17003#(not (= |ldv_successful_zalloc_#res.base| 0))} assume true; {17003#(not (= |ldv_successful_zalloc_#res.base| 0))} is VALID [2022-02-20 21:53:04,463 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17003#(not (= |ldv_successful_zalloc_#res.base| 0))} {16849#true} #535#return; {16991#(not (= |ldv_skb_alloc_#t~ret128#1.base| 0))} is VALID [2022-02-20 21:53:04,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {16991#(not (= |ldv_skb_alloc_#t~ret128#1.base| 0))} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret128#1.base, #t~ret128#1.offset;havoc #t~ret128#1.base, #t~ret128#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:04,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume !(~skb~1#1.base == 0 && ~skb~1#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem123#1.base, ldv_set_add_#t~mem123#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:04,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume !false; {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:04,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:04,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:04,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {16993#(not (= |ldv_skb_alloc_#res#1.base| 0))} is VALID [2022-02-20 21:53:04,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {16993#(not (= |ldv_skb_alloc_#res#1.base| 0))} assume true; {16993#(not (= |ldv_skb_alloc_#res#1.base| 0))} is VALID [2022-02-20 21:53:04,466 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16993#(not (= |ldv_skb_alloc_#res#1.base| 0))} {16849#true} #609#return; {16975#(not (= |ldv_alloc_skb_14_#t~ret118.base| 0))} is VALID [2022-02-20 21:53:04,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {16950#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~10.base, ~tmp~10.offset; {16849#true} is VALID [2022-02-20 21:53:04,467 INFO L272 TraceCheckUtils]: 1: Hoare triple {16849#true} call #t~ret118.base, #t~ret118.offset := ldv_skb_alloc(); {16950#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:04,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {16950#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {16849#true} is VALID [2022-02-20 21:53:04,468 INFO L272 TraceCheckUtils]: 3: Hoare triple {16849#true} call #t~ret128#1.base, #t~ret128#1.offset := ldv_successful_zalloc(248); {16927#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:04,468 INFO L290 TraceCheckUtils]: 4: Hoare triple {16927#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} is VALID [2022-02-20 21:53:04,469 INFO L272 TraceCheckUtils]: 5: Hoare triple {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {16935#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:04,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {16935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16849#true} is VALID [2022-02-20 21:53:04,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,469 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16849#true} {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} #537#return; {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} is VALID [2022-02-20 21:53:04,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} is VALID [2022-02-20 21:53:04,470 INFO L272 TraceCheckUtils]: 10: Hoare triple {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {16849#true} is VALID [2022-02-20 21:53:04,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {16849#true} ~cond := #in~cond; {16849#true} is VALID [2022-02-20 21:53:04,470 INFO L290 TraceCheckUtils]: 12: Hoare triple {16849#true} assume !(0 == ~cond); {16849#true} is VALID [2022-02-20 21:53:04,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,471 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {16849#true} {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} #539#return; {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} is VALID [2022-02-20 21:53:04,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {17003#(not (= |ldv_successful_zalloc_#res.base| 0))} is VALID [2022-02-20 21:53:04,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {17003#(not (= |ldv_successful_zalloc_#res.base| 0))} assume true; {17003#(not (= |ldv_successful_zalloc_#res.base| 0))} is VALID [2022-02-20 21:53:04,472 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17003#(not (= |ldv_successful_zalloc_#res.base| 0))} {16849#true} #535#return; {16991#(not (= |ldv_skb_alloc_#t~ret128#1.base| 0))} is VALID [2022-02-20 21:53:04,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {16991#(not (= |ldv_skb_alloc_#t~ret128#1.base| 0))} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret128#1.base, #t~ret128#1.offset;havoc #t~ret128#1.base, #t~ret128#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:04,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume !(~skb~1#1.base == 0 && ~skb~1#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem123#1.base, ldv_set_add_#t~mem123#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:04,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume !false; {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:04,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:04,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:04,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {16993#(not (= |ldv_skb_alloc_#res#1.base| 0))} is VALID [2022-02-20 21:53:04,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {16993#(not (= |ldv_skb_alloc_#res#1.base| 0))} assume true; {16993#(not (= |ldv_skb_alloc_#res#1.base| 0))} is VALID [2022-02-20 21:53:04,475 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16993#(not (= |ldv_skb_alloc_#res#1.base| 0))} {16849#true} #609#return; {16975#(not (= |ldv_alloc_skb_14_#t~ret118.base| 0))} is VALID [2022-02-20 21:53:04,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {16975#(not (= |ldv_alloc_skb_14_#t~ret118.base| 0))} ~tmp~10.base, ~tmp~10.offset := #t~ret118.base, #t~ret118.offset;havoc #t~ret118.base, #t~ret118.offset; {16976#(not (= ldv_alloc_skb_14_~tmp~10.base 0))} is VALID [2022-02-20 21:53:04,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {16976#(not (= ldv_alloc_skb_14_~tmp~10.base 0))} assume !(~tmp~10.base != 0 || ~tmp~10.offset != 0); {16850#false} is VALID [2022-02-20 21:53:04,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {16850#false} #res.base, #res.offset := ~tmp~10.base, ~tmp~10.offset; {16850#false} is VALID [2022-02-20 21:53:04,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {16850#false} assume true; {16850#false} is VALID [2022-02-20 21:53:04,476 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {16850#false} {16849#true} #575#return; {16850#false} is VALID [2022-02-20 21:53:04,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {16849#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(103, 2);call #Ultimate.allocInit(41, 3);call #Ultimate.allocInit(2, 4);call write~init~int(12, 4, 0, 1);call write~init~int(0, 4, 1, 1);call #Ultimate.allocInit(44, 5);call #Ultimate.allocInit(2, 6);call write~init~int(14, 6, 0, 1);call write~init~int(0, 6, 1, 1);call #Ultimate.allocInit(35, 7);call #Ultimate.allocInit(2, 8);call write~init~int(14, 8, 0, 1);call write~init~int(0, 8, 1, 1);call #Ultimate.allocInit(45, 9);call #Ultimate.allocInit(2, 10);call write~init~int(12, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(2, 12);call write~init~int(12, 12, 0, 1);call write~init~int(0, 12, 1, 1);call #Ultimate.allocInit(40, 13);call #Ultimate.allocInit(2, 14);call write~init~int(14, 14, 0, 1);call write~init~int(0, 14, 1, 1);call #Ultimate.allocInit(54, 15);~LDV_IN_INTERRUPT~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := 0, 0;~#capmode_proto~0.base, ~#capmode_proto~0.offset := 16, 0;call #Ultimate.allocInit(49, 16);call write~init~int(114, ~#capmode_proto~0.base, ~#capmode_proto~0.offset, 1);call write~init~int(508, ~#capmode_proto~0.base, 1 + ~#capmode_proto~0.offset, 4);call write~init~int(0, ~#capmode_proto~0.base, 5 + ~#capmode_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#capmode_proto~0.base, 9 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#capmode_proto~0.base, 17 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#capmode_proto~0.base, 25 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#capmode_proto~0.base, 33 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ack_tx.base, #funAddr~ack_tx.offset, ~#capmode_proto~0.base, 41 + ~#capmode_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 17, 0;call #Ultimate.allocInit(120, 17);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {16849#true} is VALID [2022-02-20 21:53:04,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {16849#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet99#1, main_#t~ret100#1.base, main_#t~ret100#1.offset, main_#t~nondet101#1, main_#t~nondet102#1, main_#t~nondet103#1, main_#t~nondet104#1, main_#t~nondet105#1, main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset, main_#t~nondet107#1, main_#t~switch108#1, main_#t~nondet109#1, main_#t~switch110#1, main_#t~ret111#1, main_#t~ret112#1, main_#t~mem113#1, main_#t~ret114#1, main_#t~nondet115#1, main_#t~switch116#1, main_#t~ret117#1, main_~ldvarg7~0#1, main_~tmp~9#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~0#1, main_~ldvarg5~0#1, main_~tmp___2~0#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~9#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet99#1 && main_#t~nondet99#1 <= 2147483647;main_~tmp~9#1 := main_#t~nondet99#1;havoc main_#t~nondet99#1;main_~ldvarg7~0#1 := main_~tmp~9#1; {16849#true} is VALID [2022-02-20 21:53:04,477 INFO L272 TraceCheckUtils]: 2: Hoare triple {16849#true} call main_#t~ret100#1.base, main_#t~ret100#1.offset := ldv_successful_zalloc(232); {16927#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:04,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {16927#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {16849#true} is VALID [2022-02-20 21:53:04,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {16849#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {16935#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:04,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {16935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16849#true} is VALID [2022-02-20 21:53:04,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,478 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16849#true} {16849#true} #537#return; {16849#true} is VALID [2022-02-20 21:53:04,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {16849#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {16849#true} is VALID [2022-02-20 21:53:04,478 INFO L272 TraceCheckUtils]: 9: Hoare triple {16849#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {16849#true} is VALID [2022-02-20 21:53:04,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {16849#true} ~cond := #in~cond; {16849#true} is VALID [2022-02-20 21:53:04,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {16849#true} assume !(0 == ~cond); {16849#true} is VALID [2022-02-20 21:53:04,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,478 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {16849#true} {16849#true} #539#return; {16849#true} is VALID [2022-02-20 21:53:04,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {16849#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {16849#true} is VALID [2022-02-20 21:53:04,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,479 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16849#true} {16849#true} #543#return; {16849#true} is VALID [2022-02-20 21:53:04,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {16849#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret100#1.base, main_#t~ret100#1.offset;havoc main_#t~ret100#1.base, main_#t~ret100#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet101#1 && main_#t~nondet101#1 <= 2147483647;main_~tmp___1~0#1 := main_#t~nondet101#1;havoc main_#t~nondet101#1;main_~ldvarg0~0#1 := main_~tmp___1~0#1;assume -2147483648 <= main_#t~nondet102#1 && main_#t~nondet102#1 <= 2147483647;main_~tmp___2~0#1 := main_#t~nondet102#1;havoc main_#t~nondet102#1;main_~ldvarg5~0#1 := main_~tmp___2~0#1;assume -2147483648 <= main_#t~nondet103#1 && main_#t~nondet103#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet103#1;havoc main_#t~nondet103#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet104#1 && main_#t~nondet104#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet104#1;havoc main_#t~nondet104#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet105#1;havoc main_#t~nondet105#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {16849#true} is VALID [2022-02-20 21:53:04,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {16849#true} assume { :end_inline_ldv_set_init } true; {16849#true} is VALID [2022-02-20 21:53:04,479 INFO L290 TraceCheckUtils]: 19: Hoare triple {16849#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr141#1;#Ultimate.C_memset_#t~loopctr141#1 := 0; {16849#true} is VALID [2022-02-20 21:53:04,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {16849#true} assume !(#Ultimate.C_memset_#t~loopctr141#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {16849#true} is VALID [2022-02-20 21:53:04,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {16849#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {16849#true} is VALID [2022-02-20 21:53:04,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {16849#true} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {16849#true} is VALID [2022-02-20 21:53:04,480 INFO L290 TraceCheckUtils]: 23: Hoare triple {16849#true} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1 == main_~tmp___6~0#1; {16849#true} is VALID [2022-02-20 21:53:04,480 INFO L290 TraceCheckUtils]: 24: Hoare triple {16849#true} assume main_#t~switch108#1; {16849#true} is VALID [2022-02-20 21:53:04,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {16849#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet115#1 && main_#t~nondet115#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0 == main_~tmp___8~0#1; {16849#true} is VALID [2022-02-20 21:53:04,480 INFO L290 TraceCheckUtils]: 26: Hoare triple {16849#true} assume !main_#t~switch116#1;main_#t~switch116#1 := main_#t~switch116#1 || 1 == main_~tmp___8~0#1; {16849#true} is VALID [2022-02-20 21:53:04,480 INFO L290 TraceCheckUtils]: 27: Hoare triple {16849#true} assume main_#t~switch116#1; {16849#true} is VALID [2022-02-20 21:53:04,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {16849#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_capmode_module_init } true;havoc capmode_module_init_#res#1;havoc capmode_module_init_#t~nondet96#1;havoc capmode_module_init_#t~nondet96#1;assume { :begin_inline_arcnet_cap_init } true;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset, arcnet_cap_init_~count~0#1;havoc arcnet_cap_init_~count~0#1;arcnet_cap_init_~count~0#1 := 1; {16849#true} is VALID [2022-02-20 21:53:04,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {16849#true} assume arcnet_cap_init_~count~0#1 <= 8; {16849#true} is VALID [2022-02-20 21:53:04,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {16849#true} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {16849#true} is VALID [2022-02-20 21:53:04,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {16849#true} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {16849#true} is VALID [2022-02-20 21:53:04,481 INFO L290 TraceCheckUtils]: 32: Hoare triple {16849#true} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {16849#true} is VALID [2022-02-20 21:53:04,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {16849#true} assume arcnet_cap_init_~count~0#1 <= 8; {16849#true} is VALID [2022-02-20 21:53:04,481 INFO L290 TraceCheckUtils]: 34: Hoare triple {16849#true} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {16849#true} is VALID [2022-02-20 21:53:04,481 INFO L290 TraceCheckUtils]: 35: Hoare triple {16849#true} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {16849#true} is VALID [2022-02-20 21:53:04,481 INFO L290 TraceCheckUtils]: 36: Hoare triple {16849#true} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {16849#true} is VALID [2022-02-20 21:53:04,481 INFO L290 TraceCheckUtils]: 37: Hoare triple {16849#true} assume arcnet_cap_init_~count~0#1 <= 8; {16849#true} is VALID [2022-02-20 21:53:04,481 INFO L290 TraceCheckUtils]: 38: Hoare triple {16849#true} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {16849#true} is VALID [2022-02-20 21:53:04,481 INFO L290 TraceCheckUtils]: 39: Hoare triple {16849#true} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {16849#true} is VALID [2022-02-20 21:53:04,481 INFO L290 TraceCheckUtils]: 40: Hoare triple {16849#true} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {16849#true} is VALID [2022-02-20 21:53:04,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {16849#true} assume arcnet_cap_init_~count~0#1 <= 8; {16849#true} is VALID [2022-02-20 21:53:04,482 INFO L290 TraceCheckUtils]: 42: Hoare triple {16849#true} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {16849#true} is VALID [2022-02-20 21:53:04,482 INFO L290 TraceCheckUtils]: 43: Hoare triple {16849#true} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {16849#true} is VALID [2022-02-20 21:53:04,482 INFO L290 TraceCheckUtils]: 44: Hoare triple {16849#true} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {16849#true} is VALID [2022-02-20 21:53:04,482 INFO L290 TraceCheckUtils]: 45: Hoare triple {16849#true} assume !(arcnet_cap_init_~count~0#1 <= 8); {16849#true} is VALID [2022-02-20 21:53:04,482 INFO L290 TraceCheckUtils]: 46: Hoare triple {16849#true} assume (~arc_bcast_proto~0.base + ~arc_bcast_proto~0.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;~arc_bcast_proto~0.base, ~arc_bcast_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {16849#true} is VALID [2022-02-20 21:53:04,482 INFO L290 TraceCheckUtils]: 47: Hoare triple {16849#true} ~arc_proto_default~0.base, ~arc_proto_default~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;~arc_raw_proto~0.base, ~arc_raw_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {16849#true} is VALID [2022-02-20 21:53:04,482 INFO L290 TraceCheckUtils]: 48: Hoare triple {16849#true} assume { :end_inline_arcnet_cap_init } true;capmode_module_init_#res#1 := 0; {16849#true} is VALID [2022-02-20 21:53:04,482 INFO L290 TraceCheckUtils]: 49: Hoare triple {16849#true} main_#t~ret117#1 := capmode_module_init_#res#1;assume { :end_inline_capmode_module_init } true;assume -2147483648 <= main_#t~ret117#1 && main_#t~ret117#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret117#1;havoc main_#t~ret117#1; {16849#true} is VALID [2022-02-20 21:53:04,483 INFO L290 TraceCheckUtils]: 50: Hoare triple {16849#true} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_ArcProto_1 } true;havoc ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset, ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset, ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset, ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset;havoc ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset;havoc ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {16849#true} is VALID [2022-02-20 21:53:04,483 INFO L272 TraceCheckUtils]: 51: Hoare triple {16849#true} call ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset := ldv_successful_zalloc(20); {16927#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:04,484 INFO L290 TraceCheckUtils]: 52: Hoare triple {16927#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {16849#true} is VALID [2022-02-20 21:53:04,484 INFO L272 TraceCheckUtils]: 53: Hoare triple {16849#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {16935#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:04,484 INFO L290 TraceCheckUtils]: 54: Hoare triple {16935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16849#true} is VALID [2022-02-20 21:53:04,484 INFO L290 TraceCheckUtils]: 55: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,485 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {16849#true} {16849#true} #537#return; {16849#true} is VALID [2022-02-20 21:53:04,485 INFO L290 TraceCheckUtils]: 57: Hoare triple {16849#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {16849#true} is VALID [2022-02-20 21:53:04,485 INFO L272 TraceCheckUtils]: 58: Hoare triple {16849#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {16849#true} is VALID [2022-02-20 21:53:04,485 INFO L290 TraceCheckUtils]: 59: Hoare triple {16849#true} ~cond := #in~cond; {16849#true} is VALID [2022-02-20 21:53:04,485 INFO L290 TraceCheckUtils]: 60: Hoare triple {16849#true} assume !(0 == ~cond); {16849#true} is VALID [2022-02-20 21:53:04,485 INFO L290 TraceCheckUtils]: 61: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,485 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {16849#true} {16849#true} #539#return; {16849#true} is VALID [2022-02-20 21:53:04,485 INFO L290 TraceCheckUtils]: 63: Hoare triple {16849#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {16849#true} is VALID [2022-02-20 21:53:04,485 INFO L290 TraceCheckUtils]: 64: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,486 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {16849#true} {16849#true} #599#return; {16849#true} is VALID [2022-02-20 21:53:04,486 INFO L290 TraceCheckUtils]: 66: Hoare triple {16849#true} ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset := ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset; {16849#true} is VALID [2022-02-20 21:53:04,486 INFO L272 TraceCheckUtils]: 67: Hoare triple {16849#true} call ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset := ldv_successful_zalloc(3264); {16927#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:04,486 INFO L290 TraceCheckUtils]: 68: Hoare triple {16927#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {16849#true} is VALID [2022-02-20 21:53:04,487 INFO L272 TraceCheckUtils]: 69: Hoare triple {16849#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {16935#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:04,487 INFO L290 TraceCheckUtils]: 70: Hoare triple {16935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16849#true} is VALID [2022-02-20 21:53:04,487 INFO L290 TraceCheckUtils]: 71: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,487 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {16849#true} {16849#true} #537#return; {16849#true} is VALID [2022-02-20 21:53:04,487 INFO L290 TraceCheckUtils]: 73: Hoare triple {16849#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {16849#true} is VALID [2022-02-20 21:53:04,488 INFO L272 TraceCheckUtils]: 74: Hoare triple {16849#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {16849#true} is VALID [2022-02-20 21:53:04,488 INFO L290 TraceCheckUtils]: 75: Hoare triple {16849#true} ~cond := #in~cond; {16849#true} is VALID [2022-02-20 21:53:04,488 INFO L290 TraceCheckUtils]: 76: Hoare triple {16849#true} assume !(0 == ~cond); {16849#true} is VALID [2022-02-20 21:53:04,488 INFO L290 TraceCheckUtils]: 77: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,488 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {16849#true} {16849#true} #539#return; {16849#true} is VALID [2022-02-20 21:53:04,488 INFO L290 TraceCheckUtils]: 79: Hoare triple {16849#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {16849#true} is VALID [2022-02-20 21:53:04,488 INFO L290 TraceCheckUtils]: 80: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,488 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {16849#true} {16849#true} #601#return; {16849#true} is VALID [2022-02-20 21:53:04,488 INFO L290 TraceCheckUtils]: 82: Hoare triple {16849#true} ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset := ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {16849#true} is VALID [2022-02-20 21:53:04,489 INFO L290 TraceCheckUtils]: 83: Hoare triple {16849#true} assume { :end_inline_ldv_initialize_ArcProto_1 } true; {16849#true} is VALID [2022-02-20 21:53:04,489 INFO L290 TraceCheckUtils]: 84: Hoare triple {16849#true} assume !(0 != ~ldv_retval_0~0); {16849#true} is VALID [2022-02-20 21:53:04,489 INFO L290 TraceCheckUtils]: 85: Hoare triple {16849#true} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {16849#true} is VALID [2022-02-20 21:53:04,489 INFO L290 TraceCheckUtils]: 86: Hoare triple {16849#true} assume main_#t~switch108#1; {16849#true} is VALID [2022-02-20 21:53:04,489 INFO L290 TraceCheckUtils]: 87: Hoare triple {16849#true} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet109#1 && main_#t~nondet109#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet109#1;havoc main_#t~nondet109#1;main_#t~switch110#1 := 0 == main_~tmp___7~0#1; {16849#true} is VALID [2022-02-20 21:53:04,489 INFO L290 TraceCheckUtils]: 88: Hoare triple {16849#true} assume !main_#t~switch110#1;main_#t~switch110#1 := main_#t~switch110#1 || 1 == main_~tmp___7~0#1; {16849#true} is VALID [2022-02-20 21:53:04,489 INFO L290 TraceCheckUtils]: 89: Hoare triple {16849#true} assume !main_#t~switch110#1;main_#t~switch110#1 := main_#t~switch110#1 || 2 == main_~tmp___7~0#1; {16849#true} is VALID [2022-02-20 21:53:04,489 INFO L290 TraceCheckUtils]: 90: Hoare triple {16849#true} assume !main_#t~switch110#1;main_#t~switch110#1 := main_#t~switch110#1 || 3 == main_~tmp___7~0#1; {16849#true} is VALID [2022-02-20 21:53:04,490 INFO L290 TraceCheckUtils]: 91: Hoare triple {16849#true} assume main_#t~switch110#1; {16849#true} is VALID [2022-02-20 21:53:04,490 INFO L290 TraceCheckUtils]: 92: Hoare triple {16849#true} assume 1 == ~ldv_state_variable_1~0;assume { :begin_inline_rx } true;rx_#in~dev#1.base, rx_#in~dev#1.offset, rx_#in~bufnum#1, rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset, rx_#in~length#1 := ~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset, main_~ldvarg1~0#1, ~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset, main_~ldvarg0~0#1;havoc rx_#t~ret32#1.base, rx_#t~ret32#1.offset, rx_#t~ret33#1.base, rx_#t~ret33#1.offset, rx_#t~nondet34#1, rx_#t~mem35#1, rx_#t~ret36#1.base, rx_#t~ret36#1.offset, rx_#t~ret37#1.base, rx_#t~ret37#1.offset, rx_#t~ret38#1.base, rx_#t~ret38#1.offset, rx_#t~memcpy~res39#1.base, rx_#t~memcpy~res39#1.offset, rx_#t~memcpy~res40#1.base, rx_#t~memcpy~res40#1.offset, rx_#t~memcpy~res41#1.base, rx_#t~memcpy~res41#1.offset, rx_#t~memcpy~res42#1.base, rx_#t~memcpy~res42#1.offset, rx_#t~mem49#1.base, rx_#t~mem49#1.offset, rx_#t~ret50#1, rx_~dev#1.base, rx_~dev#1.offset, rx_~bufnum#1, rx_~pkthdr#1.base, rx_~pkthdr#1.offset, rx_~length#1, rx_~lp~0#1.base, rx_~lp~0#1.offset, rx_~tmp~4#1.base, rx_~tmp~4#1.offset, rx_~skb~0#1.base, rx_~skb~0#1.offset, rx_~pkt~0#1.base, rx_~pkt~0#1.offset, rx_~pktbuf~0#1.base, rx_~pktbuf~0#1.offset, rx_~pkthdrbuf~0#1.base, rx_~pkthdrbuf~0#1.offset, rx_~ofs~0#1, rx_~tmp___0~2#1.base, rx_~tmp___0~2#1.offset, rx_~__len~1#1, rx_~__ret~1#1.base, rx_~__ret~1#1.offset, rx_~__len___0~0#1, rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset;rx_~dev#1.base, rx_~dev#1.offset := rx_#in~dev#1.base, rx_#in~dev#1.offset;rx_~bufnum#1 := rx_#in~bufnum#1;rx_~pkthdr#1.base, rx_~pkthdr#1.offset := rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset;rx_~length#1 := rx_#in~length#1;havoc rx_~lp~0#1.base, rx_~lp~0#1.offset;havoc rx_~tmp~4#1.base, rx_~tmp~4#1.offset;havoc rx_~skb~0#1.base, rx_~skb~0#1.offset;havoc rx_~pkt~0#1.base, rx_~pkt~0#1.offset;havoc rx_~pktbuf~0#1.base, rx_~pktbuf~0#1.offset;havoc rx_~pkthdrbuf~0#1.base, rx_~pkthdrbuf~0#1.offset;havoc rx_~ofs~0#1;havoc rx_~tmp___0~2#1.base, rx_~tmp___0~2#1.offset;havoc rx_~__len~1#1;havoc rx_~__ret~1#1.base, rx_~__ret~1#1.offset;havoc rx_~__len___0~0#1;havoc rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset; {16849#true} is VALID [2022-02-20 21:53:04,490 INFO L272 TraceCheckUtils]: 93: Hoare triple {16849#true} call rx_#t~ret32#1.base, rx_#t~ret32#1.offset := netdev_priv(rx_~dev#1.base, rx_~dev#1.offset); {16849#true} is VALID [2022-02-20 21:53:04,490 INFO L290 TraceCheckUtils]: 94: Hoare triple {16849#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {16849#true} is VALID [2022-02-20 21:53:04,490 INFO L290 TraceCheckUtils]: 95: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,490 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {16849#true} {16849#true} #573#return; {16849#true} is VALID [2022-02-20 21:53:04,490 INFO L290 TraceCheckUtils]: 97: Hoare triple {16849#true} rx_~tmp~4#1.base, rx_~tmp~4#1.offset := rx_#t~ret32#1.base, rx_#t~ret32#1.offset;havoc rx_#t~ret32#1.base, rx_#t~ret32#1.offset;rx_~lp~0#1.base, rx_~lp~0#1.offset := rx_~tmp~4#1.base, rx_~tmp~4#1.offset;rx_~pkt~0#1.base, rx_~pkt~0#1.offset := rx_~pkthdr#1.base, rx_~pkthdr#1.offset; {16849#true} is VALID [2022-02-20 21:53:04,490 INFO L290 TraceCheckUtils]: 98: Hoare triple {16849#true} assume rx_~length#1 > 256;rx_~ofs~0#1 := 512 - rx_~length#1; {16849#true} is VALID [2022-02-20 21:53:04,491 INFO L272 TraceCheckUtils]: 99: Hoare triple {16849#true} call rx_#t~ret33#1.base, rx_#t~ret33#1.offset := ldv_alloc_skb_14(8 + rx_~length#1, 32); {16950#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:04,491 INFO L290 TraceCheckUtils]: 100: Hoare triple {16950#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~10.base, ~tmp~10.offset; {16849#true} is VALID [2022-02-20 21:53:04,492 INFO L272 TraceCheckUtils]: 101: Hoare triple {16849#true} call #t~ret118.base, #t~ret118.offset := ldv_skb_alloc(); {16950#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:04,492 INFO L290 TraceCheckUtils]: 102: Hoare triple {16950#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {16849#true} is VALID [2022-02-20 21:53:04,493 INFO L272 TraceCheckUtils]: 103: Hoare triple {16849#true} call #t~ret128#1.base, #t~ret128#1.offset := ldv_successful_zalloc(248); {16927#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:04,493 INFO L290 TraceCheckUtils]: 104: Hoare triple {16927#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} is VALID [2022-02-20 21:53:04,494 INFO L272 TraceCheckUtils]: 105: Hoare triple {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {16935#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:04,494 INFO L290 TraceCheckUtils]: 106: Hoare triple {16935#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16849#true} is VALID [2022-02-20 21:53:04,494 INFO L290 TraceCheckUtils]: 107: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,495 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {16849#true} {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} #537#return; {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} is VALID [2022-02-20 21:53:04,495 INFO L290 TraceCheckUtils]: 109: Hoare triple {16994#(not (= |ldv_successful_zalloc_#t~malloc22.base| 0))} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} is VALID [2022-02-20 21:53:04,495 INFO L272 TraceCheckUtils]: 110: Hoare triple {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {16849#true} is VALID [2022-02-20 21:53:04,495 INFO L290 TraceCheckUtils]: 111: Hoare triple {16849#true} ~cond := #in~cond; {16849#true} is VALID [2022-02-20 21:53:04,495 INFO L290 TraceCheckUtils]: 112: Hoare triple {16849#true} assume !(0 == ~cond); {16849#true} is VALID [2022-02-20 21:53:04,495 INFO L290 TraceCheckUtils]: 113: Hoare triple {16849#true} assume true; {16849#true} is VALID [2022-02-20 21:53:04,496 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {16849#true} {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} #539#return; {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} is VALID [2022-02-20 21:53:04,496 INFO L290 TraceCheckUtils]: 115: Hoare triple {16998#(not (= ldv_successful_zalloc_~p~0.base 0))} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {17003#(not (= |ldv_successful_zalloc_#res.base| 0))} is VALID [2022-02-20 21:53:04,496 INFO L290 TraceCheckUtils]: 116: Hoare triple {17003#(not (= |ldv_successful_zalloc_#res.base| 0))} assume true; {17003#(not (= |ldv_successful_zalloc_#res.base| 0))} is VALID [2022-02-20 21:53:04,497 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {17003#(not (= |ldv_successful_zalloc_#res.base| 0))} {16849#true} #535#return; {16991#(not (= |ldv_skb_alloc_#t~ret128#1.base| 0))} is VALID [2022-02-20 21:53:04,497 INFO L290 TraceCheckUtils]: 118: Hoare triple {16991#(not (= |ldv_skb_alloc_#t~ret128#1.base| 0))} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret128#1.base, #t~ret128#1.offset;havoc #t~ret128#1.base, #t~ret128#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:04,498 INFO L290 TraceCheckUtils]: 119: Hoare triple {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume !(~skb~1#1.base == 0 && ~skb~1#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem123#1.base, ldv_set_add_#t~mem123#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:04,498 INFO L290 TraceCheckUtils]: 120: Hoare triple {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume !false; {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:04,498 INFO L290 TraceCheckUtils]: 121: Hoare triple {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:04,499 INFO L290 TraceCheckUtils]: 122: Hoare triple {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:04,499 INFO L290 TraceCheckUtils]: 123: Hoare triple {16992#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {16993#(not (= |ldv_skb_alloc_#res#1.base| 0))} is VALID [2022-02-20 21:53:04,499 INFO L290 TraceCheckUtils]: 124: Hoare triple {16993#(not (= |ldv_skb_alloc_#res#1.base| 0))} assume true; {16993#(not (= |ldv_skb_alloc_#res#1.base| 0))} is VALID [2022-02-20 21:53:04,500 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {16993#(not (= |ldv_skb_alloc_#res#1.base| 0))} {16849#true} #609#return; {16975#(not (= |ldv_alloc_skb_14_#t~ret118.base| 0))} is VALID [2022-02-20 21:53:04,500 INFO L290 TraceCheckUtils]: 126: Hoare triple {16975#(not (= |ldv_alloc_skb_14_#t~ret118.base| 0))} ~tmp~10.base, ~tmp~10.offset := #t~ret118.base, #t~ret118.offset;havoc #t~ret118.base, #t~ret118.offset; {16976#(not (= ldv_alloc_skb_14_~tmp~10.base 0))} is VALID [2022-02-20 21:53:04,500 INFO L290 TraceCheckUtils]: 127: Hoare triple {16976#(not (= ldv_alloc_skb_14_~tmp~10.base 0))} assume !(~tmp~10.base != 0 || ~tmp~10.offset != 0); {16850#false} is VALID [2022-02-20 21:53:04,500 INFO L290 TraceCheckUtils]: 128: Hoare triple {16850#false} #res.base, #res.offset := ~tmp~10.base, ~tmp~10.offset; {16850#false} is VALID [2022-02-20 21:53:04,501 INFO L290 TraceCheckUtils]: 129: Hoare triple {16850#false} assume true; {16850#false} is VALID [2022-02-20 21:53:04,501 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {16850#false} {16849#true} #575#return; {16850#false} is VALID [2022-02-20 21:53:04,501 INFO L290 TraceCheckUtils]: 131: Hoare triple {16850#false} rx_~skb~0#1.base, rx_~skb~0#1.offset := rx_#t~ret33#1.base, rx_#t~ret33#1.offset;havoc rx_#t~ret33#1.base, rx_#t~ret33#1.offset; {16850#false} is VALID [2022-02-20 21:53:04,501 INFO L290 TraceCheckUtils]: 132: Hoare triple {16850#false} assume 0 == (rx_~skb~0#1.base + rx_~skb~0#1.offset) % 18446744073709551616; {16850#false} is VALID [2022-02-20 21:53:04,501 INFO L290 TraceCheckUtils]: 133: Hoare triple {16850#false} assume !(0 != ~arcnet_debug~0); {16850#false} is VALID [2022-02-20 21:53:04,501 INFO L290 TraceCheckUtils]: 134: Hoare triple {16850#false} call rx_#t~mem35#1 := read~int(rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);call write~int(1 + rx_#t~mem35#1, rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);havoc rx_#t~mem35#1; {16850#false} is VALID [2022-02-20 21:53:04,502 INFO L290 TraceCheckUtils]: 135: Hoare triple {16850#false} assume { :end_inline_rx } true;~ldv_state_variable_1~0 := 1; {16850#false} is VALID [2022-02-20 21:53:04,502 INFO L290 TraceCheckUtils]: 136: Hoare triple {16850#false} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {16850#false} is VALID [2022-02-20 21:53:04,502 INFO L290 TraceCheckUtils]: 137: Hoare triple {16850#false} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1 == main_~tmp___6~0#1; {16850#false} is VALID [2022-02-20 21:53:04,502 INFO L290 TraceCheckUtils]: 138: Hoare triple {16850#false} assume main_#t~switch108#1; {16850#false} is VALID [2022-02-20 21:53:04,502 INFO L290 TraceCheckUtils]: 139: Hoare triple {16850#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet115#1 && main_#t~nondet115#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0 == main_~tmp___8~0#1; {16850#false} is VALID [2022-02-20 21:53:04,502 INFO L290 TraceCheckUtils]: 140: Hoare triple {16850#false} assume main_#t~switch116#1; {16850#false} is VALID [2022-02-20 21:53:04,502 INFO L290 TraceCheckUtils]: 141: Hoare triple {16850#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_capmode_module_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;havoc arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset;arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset := arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset; {16850#false} is VALID [2022-02-20 21:53:04,502 INFO L290 TraceCheckUtils]: 142: Hoare triple {16850#false} assume { :end_inline_arcnet_unregister_proto } true; {16850#false} is VALID [2022-02-20 21:53:04,502 INFO L290 TraceCheckUtils]: 143: Hoare triple {16850#false} assume { :end_inline_capmode_module_exit } true;~ldv_state_variable_0~0 := 2; {16850#false} is VALID [2022-02-20 21:53:04,503 INFO L290 TraceCheckUtils]: 144: Hoare triple {16850#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret132#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {16850#false} is VALID [2022-02-20 21:53:04,503 INFO L290 TraceCheckUtils]: 145: Hoare triple {16850#false} ldv_check_final_state_#t~ret132#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret132#1 && ldv_check_final_state_#t~ret132#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret132#1;havoc ldv_check_final_state_#t~ret132#1; {16850#false} is VALID [2022-02-20 21:53:04,503 INFO L290 TraceCheckUtils]: 146: Hoare triple {16850#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {16850#false} is VALID [2022-02-20 21:53:04,503 INFO L272 TraceCheckUtils]: 147: Hoare triple {16850#false} call ldv_error(); {16850#false} is VALID [2022-02-20 21:53:04,503 INFO L290 TraceCheckUtils]: 148: Hoare triple {16850#false} assume !false; {16850#false} is VALID [2022-02-20 21:53:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-02-20 21:53:04,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:53:04,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395966668] [2022-02-20 21:53:04,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395966668] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:04,504 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:04,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 21:53:04,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003075584] [2022-02-20 21:53:04,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:04,505 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) Word has length 149 [2022-02-20 21:53:04,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:04,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 21:53:04,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:04,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 21:53:04,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:53:04,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 21:53:04,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-02-20 21:53:04,575 INFO L87 Difference]: Start difference. First operand 808 states and 1078 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 21:53:07,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:07,440 INFO L93 Difference]: Finished difference Result 1660 states and 2258 transitions. [2022-02-20 21:53:07,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 21:53:07,440 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) Word has length 149 [2022-02-20 21:53:07,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 21:53:07,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 596 transitions. [2022-02-20 21:53:07,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 21:53:07,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 596 transitions. [2022-02-20 21:53:07,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 596 transitions. [2022-02-20 21:53:07,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 596 edges. 596 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:07,902 INFO L225 Difference]: With dead ends: 1660 [2022-02-20 21:53:07,903 INFO L226 Difference]: Without dead ends: 860 [2022-02-20 21:53:07,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-02-20 21:53:07,905 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 91 mSDsluCounter, 1939 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 21:53:07,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 2198 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 21:53:07,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-02-20 21:53:07,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 818. [2022-02-20 21:53:07,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:53:07,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 860 states. Second operand has 818 states, 619 states have (on average 1.2746365105008077) internal successors, (789), 621 states have internal predecessors, (789), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (155), 139 states have call predecessors, (155), 137 states have call successors, (155) [2022-02-20 21:53:07,932 INFO L74 IsIncluded]: Start isIncluded. First operand 860 states. Second operand has 818 states, 619 states have (on average 1.2746365105008077) internal successors, (789), 621 states have internal predecessors, (789), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (155), 139 states have call predecessors, (155), 137 states have call successors, (155) [2022-02-20 21:53:07,934 INFO L87 Difference]: Start difference. First operand 860 states. Second operand has 818 states, 619 states have (on average 1.2746365105008077) internal successors, (789), 621 states have internal predecessors, (789), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (155), 139 states have call predecessors, (155), 137 states have call successors, (155) [2022-02-20 21:53:07,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:07,965 INFO L93 Difference]: Finished difference Result 860 states and 1166 transitions. [2022-02-20 21:53:07,965 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1166 transitions. [2022-02-20 21:53:07,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:07,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:07,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 818 states, 619 states have (on average 1.2746365105008077) internal successors, (789), 621 states have internal predecessors, (789), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (155), 139 states have call predecessors, (155), 137 states have call successors, (155) Second operand 860 states. [2022-02-20 21:53:07,984 INFO L87 Difference]: Start difference. First operand has 818 states, 619 states have (on average 1.2746365105008077) internal successors, (789), 621 states have internal predecessors, (789), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (155), 139 states have call predecessors, (155), 137 states have call successors, (155) Second operand 860 states. [2022-02-20 21:53:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:08,012 INFO L93 Difference]: Finished difference Result 860 states and 1166 transitions. [2022-02-20 21:53:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1166 transitions. [2022-02-20 21:53:08,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:08,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:08,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:53:08,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:53:08,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 619 states have (on average 1.2746365105008077) internal successors, (789), 621 states have internal predecessors, (789), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (155), 139 states have call predecessors, (155), 137 states have call successors, (155) [2022-02-20 21:53:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1082 transitions. [2022-02-20 21:53:08,068 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1082 transitions. Word has length 149 [2022-02-20 21:53:08,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:53:08,069 INFO L470 AbstractCegarLoop]: Abstraction has 818 states and 1082 transitions. [2022-02-20 21:53:08,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 21:53:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1082 transitions. [2022-02-20 21:53:08,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-02-20 21:53:08,072 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:08,073 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:53:08,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 21:53:08,073 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:08,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:08,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1151008919, now seen corresponding path program 1 times [2022-02-20 21:53:08,074 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:53:08,074 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850739788] [2022-02-20 21:53:08,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:08,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:53:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:08,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:53:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:08,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:08,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {22215#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22118#true} is VALID [2022-02-20 21:53:08,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,207 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22118#true} {22118#true} #537#return; {22118#true} is VALID [2022-02-20 21:53:08,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:08,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {22118#true} ~cond := #in~cond; {22118#true} is VALID [2022-02-20 21:53:08,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {22118#true} assume !(0 == ~cond); {22118#true} is VALID [2022-02-20 21:53:08,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22118#true} {22118#true} #539#return; {22118#true} is VALID [2022-02-20 21:53:08,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {22207#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {22118#true} is VALID [2022-02-20 21:53:08,213 INFO L272 TraceCheckUtils]: 1: Hoare triple {22118#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {22215#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:08,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {22215#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22118#true} is VALID [2022-02-20 21:53:08,214 INFO L290 TraceCheckUtils]: 3: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,214 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22118#true} {22118#true} #537#return; {22118#true} is VALID [2022-02-20 21:53:08,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {22118#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {22118#true} is VALID [2022-02-20 21:53:08,214 INFO L272 TraceCheckUtils]: 6: Hoare triple {22118#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22118#true} is VALID [2022-02-20 21:53:08,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {22118#true} ~cond := #in~cond; {22118#true} is VALID [2022-02-20 21:53:08,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {22118#true} assume !(0 == ~cond); {22118#true} is VALID [2022-02-20 21:53:08,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,215 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22118#true} {22118#true} #539#return; {22118#true} is VALID [2022-02-20 21:53:08,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {22118#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22118#true} is VALID [2022-02-20 21:53:08,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,215 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {22118#true} {22118#true} #543#return; {22118#true} is VALID [2022-02-20 21:53:08,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 21:53:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:08,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:08,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {22215#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22118#true} is VALID [2022-02-20 21:53:08,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,229 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22118#true} {22118#true} #537#return; {22118#true} is VALID [2022-02-20 21:53:08,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:08,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {22118#true} ~cond := #in~cond; {22118#true} is VALID [2022-02-20 21:53:08,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {22118#true} assume !(0 == ~cond); {22118#true} is VALID [2022-02-20 21:53:08,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22118#true} {22118#true} #539#return; {22118#true} is VALID [2022-02-20 21:53:08,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {22207#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {22118#true} is VALID [2022-02-20 21:53:08,237 INFO L272 TraceCheckUtils]: 1: Hoare triple {22118#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {22215#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:08,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {22215#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22118#true} is VALID [2022-02-20 21:53:08,237 INFO L290 TraceCheckUtils]: 3: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,237 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22118#true} {22118#true} #537#return; {22118#true} is VALID [2022-02-20 21:53:08,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {22118#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {22118#true} is VALID [2022-02-20 21:53:08,237 INFO L272 TraceCheckUtils]: 6: Hoare triple {22118#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22118#true} is VALID [2022-02-20 21:53:08,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {22118#true} ~cond := #in~cond; {22118#true} is VALID [2022-02-20 21:53:08,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {22118#true} assume !(0 == ~cond); {22118#true} is VALID [2022-02-20 21:53:08,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,238 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22118#true} {22118#true} #539#return; {22118#true} is VALID [2022-02-20 21:53:08,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {22118#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22118#true} is VALID [2022-02-20 21:53:08,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,238 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {22118#true} {22119#false} #599#return; {22119#false} is VALID [2022-02-20 21:53:08,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-02-20 21:53:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:08,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:08,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {22215#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22118#true} is VALID [2022-02-20 21:53:08,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22118#true} {22118#true} #537#return; {22118#true} is VALID [2022-02-20 21:53:08,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:08,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {22118#true} ~cond := #in~cond; {22118#true} is VALID [2022-02-20 21:53:08,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {22118#true} assume !(0 == ~cond); {22118#true} is VALID [2022-02-20 21:53:08,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22118#true} {22118#true} #539#return; {22118#true} is VALID [2022-02-20 21:53:08,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {22207#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {22118#true} is VALID [2022-02-20 21:53:08,259 INFO L272 TraceCheckUtils]: 1: Hoare triple {22118#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {22215#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:08,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {22215#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22118#true} is VALID [2022-02-20 21:53:08,260 INFO L290 TraceCheckUtils]: 3: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,260 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22118#true} {22118#true} #537#return; {22118#true} is VALID [2022-02-20 21:53:08,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {22118#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {22118#true} is VALID [2022-02-20 21:53:08,260 INFO L272 TraceCheckUtils]: 6: Hoare triple {22118#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22118#true} is VALID [2022-02-20 21:53:08,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {22118#true} ~cond := #in~cond; {22118#true} is VALID [2022-02-20 21:53:08,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {22118#true} assume !(0 == ~cond); {22118#true} is VALID [2022-02-20 21:53:08,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,261 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22118#true} {22118#true} #539#return; {22118#true} is VALID [2022-02-20 21:53:08,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {22118#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22118#true} is VALID [2022-02-20 21:53:08,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,261 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {22118#true} {22119#false} #601#return; {22119#false} is VALID [2022-02-20 21:53:08,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-02-20 21:53:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:08,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {22118#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {22118#true} is VALID [2022-02-20 21:53:08,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,266 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22118#true} {22119#false} #573#return; {22119#false} is VALID [2022-02-20 21:53:08,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-02-20 21:53:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:08,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:08,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:08,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:08,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {22215#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22118#true} is VALID [2022-02-20 21:53:08,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22118#true} {22118#true} #537#return; {22118#true} is VALID [2022-02-20 21:53:08,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:08,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {22118#true} ~cond := #in~cond; {22118#true} is VALID [2022-02-20 21:53:08,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {22118#true} assume !(0 == ~cond); {22118#true} is VALID [2022-02-20 21:53:08,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22118#true} {22118#true} #539#return; {22118#true} is VALID [2022-02-20 21:53:08,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {22207#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {22118#true} is VALID [2022-02-20 21:53:08,318 INFO L272 TraceCheckUtils]: 1: Hoare triple {22118#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {22215#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:08,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {22215#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22118#true} is VALID [2022-02-20 21:53:08,318 INFO L290 TraceCheckUtils]: 3: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,319 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22118#true} {22118#true} #537#return; {22118#true} is VALID [2022-02-20 21:53:08,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {22118#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {22118#true} is VALID [2022-02-20 21:53:08,319 INFO L272 TraceCheckUtils]: 6: Hoare triple {22118#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22118#true} is VALID [2022-02-20 21:53:08,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {22118#true} ~cond := #in~cond; {22118#true} is VALID [2022-02-20 21:53:08,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {22118#true} assume !(0 == ~cond); {22118#true} is VALID [2022-02-20 21:53:08,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,319 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22118#true} {22118#true} #539#return; {22118#true} is VALID [2022-02-20 21:53:08,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {22118#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22118#true} is VALID [2022-02-20 21:53:08,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,320 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {22118#true} {22118#true} #535#return; {22118#true} is VALID [2022-02-20 21:53:08,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {22230#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {22118#true} is VALID [2022-02-20 21:53:08,320 INFO L272 TraceCheckUtils]: 1: Hoare triple {22118#true} call #t~ret128#1.base, #t~ret128#1.offset := ldv_successful_zalloc(248); {22207#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:08,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {22207#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {22118#true} is VALID [2022-02-20 21:53:08,321 INFO L272 TraceCheckUtils]: 3: Hoare triple {22118#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {22215#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:08,321 INFO L290 TraceCheckUtils]: 4: Hoare triple {22215#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22118#true} is VALID [2022-02-20 21:53:08,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,321 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {22118#true} {22118#true} #537#return; {22118#true} is VALID [2022-02-20 21:53:08,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {22118#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {22118#true} is VALID [2022-02-20 21:53:08,321 INFO L272 TraceCheckUtils]: 8: Hoare triple {22118#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22118#true} is VALID [2022-02-20 21:53:08,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {22118#true} ~cond := #in~cond; {22118#true} is VALID [2022-02-20 21:53:08,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {22118#true} assume !(0 == ~cond); {22118#true} is VALID [2022-02-20 21:53:08,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,322 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {22118#true} {22118#true} #539#return; {22118#true} is VALID [2022-02-20 21:53:08,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {22118#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22118#true} is VALID [2022-02-20 21:53:08,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,322 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22118#true} {22118#true} #535#return; {22118#true} is VALID [2022-02-20 21:53:08,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {22118#true} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret128#1.base, #t~ret128#1.offset;havoc #t~ret128#1.base, #t~ret128#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {22118#true} is VALID [2022-02-20 21:53:08,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {22118#true} assume !(~skb~1#1.base == 0 && ~skb~1#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem123#1.base, ldv_set_add_#t~mem123#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {22118#true} is VALID [2022-02-20 21:53:08,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {22118#true} assume !false; {22118#true} is VALID [2022-02-20 21:53:08,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {22118#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {22118#true} is VALID [2022-02-20 21:53:08,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {22118#true} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {22118#true} is VALID [2022-02-20 21:53:08,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {22118#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {22118#true} is VALID [2022-02-20 21:53:08,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,323 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22118#true} {22118#true} #609#return; {22118#true} is VALID [2022-02-20 21:53:08,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 21:53:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:08,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {22280#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~1.base, ~p~1.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___0~0 := #t~nondet23;havoc #t~nondet23; {22118#true} is VALID [2022-02-20 21:53:08,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {22118#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {22118#true} is VALID [2022-02-20 21:53:08,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22118#true} {22118#true} #611#return; {22118#true} is VALID [2022-02-20 21:53:08,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {22230#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~10.base, ~tmp~10.offset; {22118#true} is VALID [2022-02-20 21:53:08,334 INFO L272 TraceCheckUtils]: 1: Hoare triple {22118#true} call #t~ret118.base, #t~ret118.offset := ldv_skb_alloc(); {22230#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:08,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {22230#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {22118#true} is VALID [2022-02-20 21:53:08,335 INFO L272 TraceCheckUtils]: 3: Hoare triple {22118#true} call #t~ret128#1.base, #t~ret128#1.offset := ldv_successful_zalloc(248); {22207#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:08,335 INFO L290 TraceCheckUtils]: 4: Hoare triple {22207#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {22118#true} is VALID [2022-02-20 21:53:08,335 INFO L272 TraceCheckUtils]: 5: Hoare triple {22118#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {22215#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:08,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {22215#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22118#true} is VALID [2022-02-20 21:53:08,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,336 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {22118#true} {22118#true} #537#return; {22118#true} is VALID [2022-02-20 21:53:08,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {22118#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {22118#true} is VALID [2022-02-20 21:53:08,336 INFO L272 TraceCheckUtils]: 10: Hoare triple {22118#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22118#true} is VALID [2022-02-20 21:53:08,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {22118#true} ~cond := #in~cond; {22118#true} is VALID [2022-02-20 21:53:08,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {22118#true} assume !(0 == ~cond); {22118#true} is VALID [2022-02-20 21:53:08,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,336 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {22118#true} {22118#true} #539#return; {22118#true} is VALID [2022-02-20 21:53:08,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {22118#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22118#true} is VALID [2022-02-20 21:53:08,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,337 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {22118#true} {22118#true} #535#return; {22118#true} is VALID [2022-02-20 21:53:08,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {22118#true} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret128#1.base, #t~ret128#1.offset;havoc #t~ret128#1.base, #t~ret128#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {22118#true} is VALID [2022-02-20 21:53:08,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {22118#true} assume !(~skb~1#1.base == 0 && ~skb~1#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem123#1.base, ldv_set_add_#t~mem123#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {22118#true} is VALID [2022-02-20 21:53:08,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {22118#true} assume !false; {22118#true} is VALID [2022-02-20 21:53:08,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {22118#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {22118#true} is VALID [2022-02-20 21:53:08,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {22118#true} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {22118#true} is VALID [2022-02-20 21:53:08,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {22118#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {22118#true} is VALID [2022-02-20 21:53:08,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,338 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {22118#true} {22118#true} #609#return; {22118#true} is VALID [2022-02-20 21:53:08,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {22118#true} ~tmp~10.base, ~tmp~10.offset := #t~ret118.base, #t~ret118.offset;havoc #t~ret118.base, #t~ret118.offset; {22118#true} is VALID [2022-02-20 21:53:08,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {22118#true} assume ~tmp~10.base != 0 || ~tmp~10.offset != 0; {22118#true} is VALID [2022-02-20 21:53:08,338 INFO L272 TraceCheckUtils]: 28: Hoare triple {22118#true} call #t~ret119.base, #t~ret119.offset := ldv_malloc(~size % 4294967296); {22280#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:08,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {22280#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~1.base, ~p~1.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___0~0 := #t~nondet23;havoc #t~nondet23; {22118#true} is VALID [2022-02-20 21:53:08,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {22118#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {22118#true} is VALID [2022-02-20 21:53:08,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,339 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {22118#true} {22118#true} #611#return; {22118#true} is VALID [2022-02-20 21:53:08,339 INFO L290 TraceCheckUtils]: 33: Hoare triple {22118#true} call write~$Pointer$(#t~ret119.base, #t~ret119.offset, ~tmp~10.base, 224 + ~tmp~10.offset, 8);havoc #t~ret119.base, #t~ret119.offset;call #t~mem120.base, #t~mem120.offset := read~$Pointer$(~tmp~10.base, 224 + ~tmp~10.offset, 8);call write~$Pointer$(#t~mem120.base, #t~mem120.offset, ~tmp~10.base, 232 + ~tmp~10.offset, 8);havoc #t~mem120.base, #t~mem120.offset; {22118#true} is VALID [2022-02-20 21:53:08,339 INFO L290 TraceCheckUtils]: 34: Hoare triple {22118#true} #res.base, #res.offset := ~tmp~10.base, ~tmp~10.offset; {22118#true} is VALID [2022-02-20 21:53:08,339 INFO L290 TraceCheckUtils]: 35: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,339 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22118#true} {22119#false} #575#return; {22119#false} is VALID [2022-02-20 21:53:08,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {22118#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(103, 2);call #Ultimate.allocInit(41, 3);call #Ultimate.allocInit(2, 4);call write~init~int(12, 4, 0, 1);call write~init~int(0, 4, 1, 1);call #Ultimate.allocInit(44, 5);call #Ultimate.allocInit(2, 6);call write~init~int(14, 6, 0, 1);call write~init~int(0, 6, 1, 1);call #Ultimate.allocInit(35, 7);call #Ultimate.allocInit(2, 8);call write~init~int(14, 8, 0, 1);call write~init~int(0, 8, 1, 1);call #Ultimate.allocInit(45, 9);call #Ultimate.allocInit(2, 10);call write~init~int(12, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(2, 12);call write~init~int(12, 12, 0, 1);call write~init~int(0, 12, 1, 1);call #Ultimate.allocInit(40, 13);call #Ultimate.allocInit(2, 14);call write~init~int(14, 14, 0, 1);call write~init~int(0, 14, 1, 1);call #Ultimate.allocInit(54, 15);~LDV_IN_INTERRUPT~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := 0, 0;~#capmode_proto~0.base, ~#capmode_proto~0.offset := 16, 0;call #Ultimate.allocInit(49, 16);call write~init~int(114, ~#capmode_proto~0.base, ~#capmode_proto~0.offset, 1);call write~init~int(508, ~#capmode_proto~0.base, 1 + ~#capmode_proto~0.offset, 4);call write~init~int(0, ~#capmode_proto~0.base, 5 + ~#capmode_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#capmode_proto~0.base, 9 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#capmode_proto~0.base, 17 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#capmode_proto~0.base, 25 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#capmode_proto~0.base, 33 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ack_tx.base, #funAddr~ack_tx.offset, ~#capmode_proto~0.base, 41 + ~#capmode_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 17, 0;call #Ultimate.allocInit(120, 17);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {22118#true} is VALID [2022-02-20 21:53:08,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {22118#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet99#1, main_#t~ret100#1.base, main_#t~ret100#1.offset, main_#t~nondet101#1, main_#t~nondet102#1, main_#t~nondet103#1, main_#t~nondet104#1, main_#t~nondet105#1, main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset, main_#t~nondet107#1, main_#t~switch108#1, main_#t~nondet109#1, main_#t~switch110#1, main_#t~ret111#1, main_#t~ret112#1, main_#t~mem113#1, main_#t~ret114#1, main_#t~nondet115#1, main_#t~switch116#1, main_#t~ret117#1, main_~ldvarg7~0#1, main_~tmp~9#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~0#1, main_~ldvarg5~0#1, main_~tmp___2~0#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~9#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet99#1 && main_#t~nondet99#1 <= 2147483647;main_~tmp~9#1 := main_#t~nondet99#1;havoc main_#t~nondet99#1;main_~ldvarg7~0#1 := main_~tmp~9#1; {22118#true} is VALID [2022-02-20 21:53:08,340 INFO L272 TraceCheckUtils]: 2: Hoare triple {22118#true} call main_#t~ret100#1.base, main_#t~ret100#1.offset := ldv_successful_zalloc(232); {22207#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:08,340 INFO L290 TraceCheckUtils]: 3: Hoare triple {22207#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {22118#true} is VALID [2022-02-20 21:53:08,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {22118#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {22215#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:08,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {22215#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22118#true} is VALID [2022-02-20 21:53:08,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,341 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22118#true} {22118#true} #537#return; {22118#true} is VALID [2022-02-20 21:53:08,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {22118#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {22118#true} is VALID [2022-02-20 21:53:08,341 INFO L272 TraceCheckUtils]: 9: Hoare triple {22118#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22118#true} is VALID [2022-02-20 21:53:08,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {22118#true} ~cond := #in~cond; {22118#true} is VALID [2022-02-20 21:53:08,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {22118#true} assume !(0 == ~cond); {22118#true} is VALID [2022-02-20 21:53:08,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,342 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {22118#true} {22118#true} #539#return; {22118#true} is VALID [2022-02-20 21:53:08,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {22118#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22118#true} is VALID [2022-02-20 21:53:08,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,342 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22118#true} {22118#true} #543#return; {22118#true} is VALID [2022-02-20 21:53:08,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {22118#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret100#1.base, main_#t~ret100#1.offset;havoc main_#t~ret100#1.base, main_#t~ret100#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet101#1 && main_#t~nondet101#1 <= 2147483647;main_~tmp___1~0#1 := main_#t~nondet101#1;havoc main_#t~nondet101#1;main_~ldvarg0~0#1 := main_~tmp___1~0#1;assume -2147483648 <= main_#t~nondet102#1 && main_#t~nondet102#1 <= 2147483647;main_~tmp___2~0#1 := main_#t~nondet102#1;havoc main_#t~nondet102#1;main_~ldvarg5~0#1 := main_~tmp___2~0#1;assume -2147483648 <= main_#t~nondet103#1 && main_#t~nondet103#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet103#1;havoc main_#t~nondet103#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet104#1 && main_#t~nondet104#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet104#1;havoc main_#t~nondet104#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet105#1;havoc main_#t~nondet105#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {22118#true} is VALID [2022-02-20 21:53:08,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {22118#true} assume { :end_inline_ldv_set_init } true; {22118#true} is VALID [2022-02-20 21:53:08,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {22118#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr141#1;#Ultimate.C_memset_#t~loopctr141#1 := 0; {22118#true} is VALID [2022-02-20 21:53:08,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {22118#true} assume !(#Ultimate.C_memset_#t~loopctr141#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {22118#true} is VALID [2022-02-20 21:53:08,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {22118#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {22118#true} is VALID [2022-02-20 21:53:08,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {22118#true} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {22118#true} is VALID [2022-02-20 21:53:08,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {22118#true} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1 == main_~tmp___6~0#1; {22118#true} is VALID [2022-02-20 21:53:08,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {22118#true} assume main_#t~switch108#1; {22118#true} is VALID [2022-02-20 21:53:08,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {22118#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet115#1 && main_#t~nondet115#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0 == main_~tmp___8~0#1; {22118#true} is VALID [2022-02-20 21:53:08,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {22118#true} assume !main_#t~switch116#1;main_#t~switch116#1 := main_#t~switch116#1 || 1 == main_~tmp___8~0#1; {22118#true} is VALID [2022-02-20 21:53:08,343 INFO L290 TraceCheckUtils]: 27: Hoare triple {22118#true} assume main_#t~switch116#1; {22118#true} is VALID [2022-02-20 21:53:08,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {22118#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_capmode_module_init } true;havoc capmode_module_init_#res#1;havoc capmode_module_init_#t~nondet96#1;havoc capmode_module_init_#t~nondet96#1;assume { :begin_inline_arcnet_cap_init } true;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset, arcnet_cap_init_~count~0#1;havoc arcnet_cap_init_~count~0#1;arcnet_cap_init_~count~0#1 := 1; {22134#(= 0 (+ (- 1) |ULTIMATE.start_arcnet_cap_init_~count~0#1|))} is VALID [2022-02-20 21:53:08,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {22134#(= 0 (+ (- 1) |ULTIMATE.start_arcnet_cap_init_~count~0#1|))} assume arcnet_cap_init_~count~0#1 <= 8; {22134#(= 0 (+ (- 1) |ULTIMATE.start_arcnet_cap_init_~count~0#1|))} is VALID [2022-02-20 21:53:08,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {22134#(= 0 (+ (- 1) |ULTIMATE.start_arcnet_cap_init_~count~0#1|))} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {22134#(= 0 (+ (- 1) |ULTIMATE.start_arcnet_cap_init_~count~0#1|))} is VALID [2022-02-20 21:53:08,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {22134#(= 0 (+ (- 1) |ULTIMATE.start_arcnet_cap_init_~count~0#1|))} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {22134#(= 0 (+ (- 1) |ULTIMATE.start_arcnet_cap_init_~count~0#1|))} is VALID [2022-02-20 21:53:08,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {22134#(= 0 (+ (- 1) |ULTIMATE.start_arcnet_cap_init_~count~0#1|))} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {22135#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 2)} is VALID [2022-02-20 21:53:08,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {22135#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 2)} assume arcnet_cap_init_~count~0#1 <= 8; {22135#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 2)} is VALID [2022-02-20 21:53:08,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {22135#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 2)} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {22135#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 2)} is VALID [2022-02-20 21:53:08,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {22135#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 2)} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {22135#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 2)} is VALID [2022-02-20 21:53:08,346 INFO L290 TraceCheckUtils]: 36: Hoare triple {22135#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 2)} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {22136#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 3)} is VALID [2022-02-20 21:53:08,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {22136#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 3)} assume arcnet_cap_init_~count~0#1 <= 8; {22136#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 3)} is VALID [2022-02-20 21:53:08,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {22136#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 3)} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {22136#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 3)} is VALID [2022-02-20 21:53:08,347 INFO L290 TraceCheckUtils]: 39: Hoare triple {22136#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 3)} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {22136#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 3)} is VALID [2022-02-20 21:53:08,347 INFO L290 TraceCheckUtils]: 40: Hoare triple {22136#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 3)} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} is VALID [2022-02-20 21:53:08,348 INFO L290 TraceCheckUtils]: 41: Hoare triple {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} assume arcnet_cap_init_~count~0#1 <= 8; {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} is VALID [2022-02-20 21:53:08,348 INFO L290 TraceCheckUtils]: 42: Hoare triple {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} is VALID [2022-02-20 21:53:08,348 INFO L290 TraceCheckUtils]: 43: Hoare triple {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} is VALID [2022-02-20 21:53:08,349 INFO L290 TraceCheckUtils]: 44: Hoare triple {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {22138#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 5)} is VALID [2022-02-20 21:53:08,349 INFO L290 TraceCheckUtils]: 45: Hoare triple {22138#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 5)} assume !(arcnet_cap_init_~count~0#1 <= 8); {22119#false} is VALID [2022-02-20 21:53:08,349 INFO L290 TraceCheckUtils]: 46: Hoare triple {22119#false} assume (~arc_bcast_proto~0.base + ~arc_bcast_proto~0.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;~arc_bcast_proto~0.base, ~arc_bcast_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {22119#false} is VALID [2022-02-20 21:53:08,349 INFO L290 TraceCheckUtils]: 47: Hoare triple {22119#false} ~arc_proto_default~0.base, ~arc_proto_default~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;~arc_raw_proto~0.base, ~arc_raw_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {22119#false} is VALID [2022-02-20 21:53:08,349 INFO L290 TraceCheckUtils]: 48: Hoare triple {22119#false} assume { :end_inline_arcnet_cap_init } true;capmode_module_init_#res#1 := 0; {22119#false} is VALID [2022-02-20 21:53:08,349 INFO L290 TraceCheckUtils]: 49: Hoare triple {22119#false} main_#t~ret117#1 := capmode_module_init_#res#1;assume { :end_inline_capmode_module_init } true;assume -2147483648 <= main_#t~ret117#1 && main_#t~ret117#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret117#1;havoc main_#t~ret117#1; {22119#false} is VALID [2022-02-20 21:53:08,349 INFO L290 TraceCheckUtils]: 50: Hoare triple {22119#false} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_ArcProto_1 } true;havoc ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset, ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset, ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset, ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset;havoc ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset;havoc ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {22119#false} is VALID [2022-02-20 21:53:08,349 INFO L272 TraceCheckUtils]: 51: Hoare triple {22119#false} call ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset := ldv_successful_zalloc(20); {22207#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:08,350 INFO L290 TraceCheckUtils]: 52: Hoare triple {22207#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {22118#true} is VALID [2022-02-20 21:53:08,350 INFO L272 TraceCheckUtils]: 53: Hoare triple {22118#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {22215#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:08,350 INFO L290 TraceCheckUtils]: 54: Hoare triple {22215#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22118#true} is VALID [2022-02-20 21:53:08,351 INFO L290 TraceCheckUtils]: 55: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,351 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {22118#true} {22118#true} #537#return; {22118#true} is VALID [2022-02-20 21:53:08,351 INFO L290 TraceCheckUtils]: 57: Hoare triple {22118#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {22118#true} is VALID [2022-02-20 21:53:08,351 INFO L272 TraceCheckUtils]: 58: Hoare triple {22118#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22118#true} is VALID [2022-02-20 21:53:08,351 INFO L290 TraceCheckUtils]: 59: Hoare triple {22118#true} ~cond := #in~cond; {22118#true} is VALID [2022-02-20 21:53:08,351 INFO L290 TraceCheckUtils]: 60: Hoare triple {22118#true} assume !(0 == ~cond); {22118#true} is VALID [2022-02-20 21:53:08,351 INFO L290 TraceCheckUtils]: 61: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,351 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {22118#true} {22118#true} #539#return; {22118#true} is VALID [2022-02-20 21:53:08,351 INFO L290 TraceCheckUtils]: 63: Hoare triple {22118#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22118#true} is VALID [2022-02-20 21:53:08,352 INFO L290 TraceCheckUtils]: 64: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,352 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {22118#true} {22119#false} #599#return; {22119#false} is VALID [2022-02-20 21:53:08,352 INFO L290 TraceCheckUtils]: 66: Hoare triple {22119#false} ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset := ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset; {22119#false} is VALID [2022-02-20 21:53:08,352 INFO L272 TraceCheckUtils]: 67: Hoare triple {22119#false} call ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset := ldv_successful_zalloc(3264); {22207#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:08,352 INFO L290 TraceCheckUtils]: 68: Hoare triple {22207#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {22118#true} is VALID [2022-02-20 21:53:08,353 INFO L272 TraceCheckUtils]: 69: Hoare triple {22118#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {22215#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:08,353 INFO L290 TraceCheckUtils]: 70: Hoare triple {22215#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22118#true} is VALID [2022-02-20 21:53:08,353 INFO L290 TraceCheckUtils]: 71: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,353 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {22118#true} {22118#true} #537#return; {22118#true} is VALID [2022-02-20 21:53:08,353 INFO L290 TraceCheckUtils]: 73: Hoare triple {22118#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {22118#true} is VALID [2022-02-20 21:53:08,353 INFO L272 TraceCheckUtils]: 74: Hoare triple {22118#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22118#true} is VALID [2022-02-20 21:53:08,353 INFO L290 TraceCheckUtils]: 75: Hoare triple {22118#true} ~cond := #in~cond; {22118#true} is VALID [2022-02-20 21:53:08,353 INFO L290 TraceCheckUtils]: 76: Hoare triple {22118#true} assume !(0 == ~cond); {22118#true} is VALID [2022-02-20 21:53:08,354 INFO L290 TraceCheckUtils]: 77: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,354 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {22118#true} {22118#true} #539#return; {22118#true} is VALID [2022-02-20 21:53:08,354 INFO L290 TraceCheckUtils]: 79: Hoare triple {22118#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22118#true} is VALID [2022-02-20 21:53:08,354 INFO L290 TraceCheckUtils]: 80: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,354 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {22118#true} {22119#false} #601#return; {22119#false} is VALID [2022-02-20 21:53:08,354 INFO L290 TraceCheckUtils]: 82: Hoare triple {22119#false} ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset := ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {22119#false} is VALID [2022-02-20 21:53:08,354 INFO L290 TraceCheckUtils]: 83: Hoare triple {22119#false} assume { :end_inline_ldv_initialize_ArcProto_1 } true; {22119#false} is VALID [2022-02-20 21:53:08,354 INFO L290 TraceCheckUtils]: 84: Hoare triple {22119#false} assume !(0 != ~ldv_retval_0~0); {22119#false} is VALID [2022-02-20 21:53:08,354 INFO L290 TraceCheckUtils]: 85: Hoare triple {22119#false} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {22119#false} is VALID [2022-02-20 21:53:08,355 INFO L290 TraceCheckUtils]: 86: Hoare triple {22119#false} assume main_#t~switch108#1; {22119#false} is VALID [2022-02-20 21:53:08,355 INFO L290 TraceCheckUtils]: 87: Hoare triple {22119#false} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet109#1 && main_#t~nondet109#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet109#1;havoc main_#t~nondet109#1;main_#t~switch110#1 := 0 == main_~tmp___7~0#1; {22119#false} is VALID [2022-02-20 21:53:08,355 INFO L290 TraceCheckUtils]: 88: Hoare triple {22119#false} assume !main_#t~switch110#1;main_#t~switch110#1 := main_#t~switch110#1 || 1 == main_~tmp___7~0#1; {22119#false} is VALID [2022-02-20 21:53:08,355 INFO L290 TraceCheckUtils]: 89: Hoare triple {22119#false} assume !main_#t~switch110#1;main_#t~switch110#1 := main_#t~switch110#1 || 2 == main_~tmp___7~0#1; {22119#false} is VALID [2022-02-20 21:53:08,355 INFO L290 TraceCheckUtils]: 90: Hoare triple {22119#false} assume !main_#t~switch110#1;main_#t~switch110#1 := main_#t~switch110#1 || 3 == main_~tmp___7~0#1; {22119#false} is VALID [2022-02-20 21:53:08,355 INFO L290 TraceCheckUtils]: 91: Hoare triple {22119#false} assume main_#t~switch110#1; {22119#false} is VALID [2022-02-20 21:53:08,355 INFO L290 TraceCheckUtils]: 92: Hoare triple {22119#false} assume 1 == ~ldv_state_variable_1~0;assume { :begin_inline_rx } true;rx_#in~dev#1.base, rx_#in~dev#1.offset, rx_#in~bufnum#1, rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset, rx_#in~length#1 := ~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset, main_~ldvarg1~0#1, ~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset, main_~ldvarg0~0#1;havoc rx_#t~ret32#1.base, rx_#t~ret32#1.offset, rx_#t~ret33#1.base, rx_#t~ret33#1.offset, rx_#t~nondet34#1, rx_#t~mem35#1, rx_#t~ret36#1.base, rx_#t~ret36#1.offset, rx_#t~ret37#1.base, rx_#t~ret37#1.offset, rx_#t~ret38#1.base, rx_#t~ret38#1.offset, rx_#t~memcpy~res39#1.base, rx_#t~memcpy~res39#1.offset, rx_#t~memcpy~res40#1.base, rx_#t~memcpy~res40#1.offset, rx_#t~memcpy~res41#1.base, rx_#t~memcpy~res41#1.offset, rx_#t~memcpy~res42#1.base, rx_#t~memcpy~res42#1.offset, rx_#t~mem49#1.base, rx_#t~mem49#1.offset, rx_#t~ret50#1, rx_~dev#1.base, rx_~dev#1.offset, rx_~bufnum#1, rx_~pkthdr#1.base, rx_~pkthdr#1.offset, rx_~length#1, rx_~lp~0#1.base, rx_~lp~0#1.offset, rx_~tmp~4#1.base, rx_~tmp~4#1.offset, rx_~skb~0#1.base, rx_~skb~0#1.offset, rx_~pkt~0#1.base, rx_~pkt~0#1.offset, rx_~pktbuf~0#1.base, rx_~pktbuf~0#1.offset, rx_~pkthdrbuf~0#1.base, rx_~pkthdrbuf~0#1.offset, rx_~ofs~0#1, rx_~tmp___0~2#1.base, rx_~tmp___0~2#1.offset, rx_~__len~1#1, rx_~__ret~1#1.base, rx_~__ret~1#1.offset, rx_~__len___0~0#1, rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset;rx_~dev#1.base, rx_~dev#1.offset := rx_#in~dev#1.base, rx_#in~dev#1.offset;rx_~bufnum#1 := rx_#in~bufnum#1;rx_~pkthdr#1.base, rx_~pkthdr#1.offset := rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset;rx_~length#1 := rx_#in~length#1;havoc rx_~lp~0#1.base, rx_~lp~0#1.offset;havoc rx_~tmp~4#1.base, rx_~tmp~4#1.offset;havoc rx_~skb~0#1.base, rx_~skb~0#1.offset;havoc rx_~pkt~0#1.base, rx_~pkt~0#1.offset;havoc rx_~pktbuf~0#1.base, rx_~pktbuf~0#1.offset;havoc rx_~pkthdrbuf~0#1.base, rx_~pkthdrbuf~0#1.offset;havoc rx_~ofs~0#1;havoc rx_~tmp___0~2#1.base, rx_~tmp___0~2#1.offset;havoc rx_~__len~1#1;havoc rx_~__ret~1#1.base, rx_~__ret~1#1.offset;havoc rx_~__len___0~0#1;havoc rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset; {22119#false} is VALID [2022-02-20 21:53:08,355 INFO L272 TraceCheckUtils]: 93: Hoare triple {22119#false} call rx_#t~ret32#1.base, rx_#t~ret32#1.offset := netdev_priv(rx_~dev#1.base, rx_~dev#1.offset); {22118#true} is VALID [2022-02-20 21:53:08,355 INFO L290 TraceCheckUtils]: 94: Hoare triple {22118#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {22118#true} is VALID [2022-02-20 21:53:08,356 INFO L290 TraceCheckUtils]: 95: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,356 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {22118#true} {22119#false} #573#return; {22119#false} is VALID [2022-02-20 21:53:08,356 INFO L290 TraceCheckUtils]: 97: Hoare triple {22119#false} rx_~tmp~4#1.base, rx_~tmp~4#1.offset := rx_#t~ret32#1.base, rx_#t~ret32#1.offset;havoc rx_#t~ret32#1.base, rx_#t~ret32#1.offset;rx_~lp~0#1.base, rx_~lp~0#1.offset := rx_~tmp~4#1.base, rx_~tmp~4#1.offset;rx_~pkt~0#1.base, rx_~pkt~0#1.offset := rx_~pkthdr#1.base, rx_~pkthdr#1.offset; {22119#false} is VALID [2022-02-20 21:53:08,356 INFO L290 TraceCheckUtils]: 98: Hoare triple {22119#false} assume rx_~length#1 > 256;rx_~ofs~0#1 := 512 - rx_~length#1; {22119#false} is VALID [2022-02-20 21:53:08,356 INFO L272 TraceCheckUtils]: 99: Hoare triple {22119#false} call rx_#t~ret33#1.base, rx_#t~ret33#1.offset := ldv_alloc_skb_14(8 + rx_~length#1, 32); {22230#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:08,356 INFO L290 TraceCheckUtils]: 100: Hoare triple {22230#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~10.base, ~tmp~10.offset; {22118#true} is VALID [2022-02-20 21:53:08,357 INFO L272 TraceCheckUtils]: 101: Hoare triple {22118#true} call #t~ret118.base, #t~ret118.offset := ldv_skb_alloc(); {22230#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:08,357 INFO L290 TraceCheckUtils]: 102: Hoare triple {22230#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {22118#true} is VALID [2022-02-20 21:53:08,357 INFO L272 TraceCheckUtils]: 103: Hoare triple {22118#true} call #t~ret128#1.base, #t~ret128#1.offset := ldv_successful_zalloc(248); {22207#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:08,357 INFO L290 TraceCheckUtils]: 104: Hoare triple {22207#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {22118#true} is VALID [2022-02-20 21:53:08,358 INFO L272 TraceCheckUtils]: 105: Hoare triple {22118#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {22215#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:08,358 INFO L290 TraceCheckUtils]: 106: Hoare triple {22215#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22118#true} is VALID [2022-02-20 21:53:08,358 INFO L290 TraceCheckUtils]: 107: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,358 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {22118#true} {22118#true} #537#return; {22118#true} is VALID [2022-02-20 21:53:08,358 INFO L290 TraceCheckUtils]: 109: Hoare triple {22118#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {22118#true} is VALID [2022-02-20 21:53:08,358 INFO L272 TraceCheckUtils]: 110: Hoare triple {22118#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22118#true} is VALID [2022-02-20 21:53:08,359 INFO L290 TraceCheckUtils]: 111: Hoare triple {22118#true} ~cond := #in~cond; {22118#true} is VALID [2022-02-20 21:53:08,359 INFO L290 TraceCheckUtils]: 112: Hoare triple {22118#true} assume !(0 == ~cond); {22118#true} is VALID [2022-02-20 21:53:08,359 INFO L290 TraceCheckUtils]: 113: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,359 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {22118#true} {22118#true} #539#return; {22118#true} is VALID [2022-02-20 21:53:08,359 INFO L290 TraceCheckUtils]: 115: Hoare triple {22118#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22118#true} is VALID [2022-02-20 21:53:08,359 INFO L290 TraceCheckUtils]: 116: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,359 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {22118#true} {22118#true} #535#return; {22118#true} is VALID [2022-02-20 21:53:08,359 INFO L290 TraceCheckUtils]: 118: Hoare triple {22118#true} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret128#1.base, #t~ret128#1.offset;havoc #t~ret128#1.base, #t~ret128#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {22118#true} is VALID [2022-02-20 21:53:08,359 INFO L290 TraceCheckUtils]: 119: Hoare triple {22118#true} assume !(~skb~1#1.base == 0 && ~skb~1#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem123#1.base, ldv_set_add_#t~mem123#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {22118#true} is VALID [2022-02-20 21:53:08,360 INFO L290 TraceCheckUtils]: 120: Hoare triple {22118#true} assume !false; {22118#true} is VALID [2022-02-20 21:53:08,360 INFO L290 TraceCheckUtils]: 121: Hoare triple {22118#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {22118#true} is VALID [2022-02-20 21:53:08,360 INFO L290 TraceCheckUtils]: 122: Hoare triple {22118#true} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {22118#true} is VALID [2022-02-20 21:53:08,360 INFO L290 TraceCheckUtils]: 123: Hoare triple {22118#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {22118#true} is VALID [2022-02-20 21:53:08,360 INFO L290 TraceCheckUtils]: 124: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,360 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {22118#true} {22118#true} #609#return; {22118#true} is VALID [2022-02-20 21:53:08,360 INFO L290 TraceCheckUtils]: 126: Hoare triple {22118#true} ~tmp~10.base, ~tmp~10.offset := #t~ret118.base, #t~ret118.offset;havoc #t~ret118.base, #t~ret118.offset; {22118#true} is VALID [2022-02-20 21:53:08,360 INFO L290 TraceCheckUtils]: 127: Hoare triple {22118#true} assume ~tmp~10.base != 0 || ~tmp~10.offset != 0; {22118#true} is VALID [2022-02-20 21:53:08,361 INFO L272 TraceCheckUtils]: 128: Hoare triple {22118#true} call #t~ret119.base, #t~ret119.offset := ldv_malloc(~size % 4294967296); {22280#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:08,361 INFO L290 TraceCheckUtils]: 129: Hoare triple {22280#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~1.base, ~p~1.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___0~0 := #t~nondet23;havoc #t~nondet23; {22118#true} is VALID [2022-02-20 21:53:08,361 INFO L290 TraceCheckUtils]: 130: Hoare triple {22118#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {22118#true} is VALID [2022-02-20 21:53:08,361 INFO L290 TraceCheckUtils]: 131: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,361 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {22118#true} {22118#true} #611#return; {22118#true} is VALID [2022-02-20 21:53:08,361 INFO L290 TraceCheckUtils]: 133: Hoare triple {22118#true} call write~$Pointer$(#t~ret119.base, #t~ret119.offset, ~tmp~10.base, 224 + ~tmp~10.offset, 8);havoc #t~ret119.base, #t~ret119.offset;call #t~mem120.base, #t~mem120.offset := read~$Pointer$(~tmp~10.base, 224 + ~tmp~10.offset, 8);call write~$Pointer$(#t~mem120.base, #t~mem120.offset, ~tmp~10.base, 232 + ~tmp~10.offset, 8);havoc #t~mem120.base, #t~mem120.offset; {22118#true} is VALID [2022-02-20 21:53:08,362 INFO L290 TraceCheckUtils]: 134: Hoare triple {22118#true} #res.base, #res.offset := ~tmp~10.base, ~tmp~10.offset; {22118#true} is VALID [2022-02-20 21:53:08,362 INFO L290 TraceCheckUtils]: 135: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,362 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {22118#true} {22119#false} #575#return; {22119#false} is VALID [2022-02-20 21:53:08,362 INFO L290 TraceCheckUtils]: 137: Hoare triple {22119#false} rx_~skb~0#1.base, rx_~skb~0#1.offset := rx_#t~ret33#1.base, rx_#t~ret33#1.offset;havoc rx_#t~ret33#1.base, rx_#t~ret33#1.offset; {22119#false} is VALID [2022-02-20 21:53:08,362 INFO L290 TraceCheckUtils]: 138: Hoare triple {22119#false} assume 0 == (rx_~skb~0#1.base + rx_~skb~0#1.offset) % 18446744073709551616; {22119#false} is VALID [2022-02-20 21:53:08,362 INFO L290 TraceCheckUtils]: 139: Hoare triple {22119#false} assume !(0 != ~arcnet_debug~0); {22119#false} is VALID [2022-02-20 21:53:08,362 INFO L290 TraceCheckUtils]: 140: Hoare triple {22119#false} call rx_#t~mem35#1 := read~int(rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);call write~int(1 + rx_#t~mem35#1, rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);havoc rx_#t~mem35#1; {22119#false} is VALID [2022-02-20 21:53:08,362 INFO L290 TraceCheckUtils]: 141: Hoare triple {22119#false} assume { :end_inline_rx } true;~ldv_state_variable_1~0 := 1; {22119#false} is VALID [2022-02-20 21:53:08,362 INFO L290 TraceCheckUtils]: 142: Hoare triple {22119#false} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {22119#false} is VALID [2022-02-20 21:53:08,363 INFO L290 TraceCheckUtils]: 143: Hoare triple {22119#false} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1 == main_~tmp___6~0#1; {22119#false} is VALID [2022-02-20 21:53:08,363 INFO L290 TraceCheckUtils]: 144: Hoare triple {22119#false} assume main_#t~switch108#1; {22119#false} is VALID [2022-02-20 21:53:08,363 INFO L290 TraceCheckUtils]: 145: Hoare triple {22119#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet115#1 && main_#t~nondet115#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0 == main_~tmp___8~0#1; {22119#false} is VALID [2022-02-20 21:53:08,363 INFO L290 TraceCheckUtils]: 146: Hoare triple {22119#false} assume main_#t~switch116#1; {22119#false} is VALID [2022-02-20 21:53:08,363 INFO L290 TraceCheckUtils]: 147: Hoare triple {22119#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_capmode_module_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;havoc arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset;arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset := arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset; {22119#false} is VALID [2022-02-20 21:53:08,363 INFO L290 TraceCheckUtils]: 148: Hoare triple {22119#false} assume { :end_inline_arcnet_unregister_proto } true; {22119#false} is VALID [2022-02-20 21:53:08,363 INFO L290 TraceCheckUtils]: 149: Hoare triple {22119#false} assume { :end_inline_capmode_module_exit } true;~ldv_state_variable_0~0 := 2; {22119#false} is VALID [2022-02-20 21:53:08,363 INFO L290 TraceCheckUtils]: 150: Hoare triple {22119#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret132#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {22119#false} is VALID [2022-02-20 21:53:08,363 INFO L290 TraceCheckUtils]: 151: Hoare triple {22119#false} ldv_check_final_state_#t~ret132#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret132#1 && ldv_check_final_state_#t~ret132#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret132#1;havoc ldv_check_final_state_#t~ret132#1; {22119#false} is VALID [2022-02-20 21:53:08,364 INFO L290 TraceCheckUtils]: 152: Hoare triple {22119#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {22119#false} is VALID [2022-02-20 21:53:08,364 INFO L272 TraceCheckUtils]: 153: Hoare triple {22119#false} call ldv_error(); {22119#false} is VALID [2022-02-20 21:53:08,364 INFO L290 TraceCheckUtils]: 154: Hoare triple {22119#false} assume !false; {22119#false} is VALID [2022-02-20 21:53:08,364 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-02-20 21:53:08,364 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:53:08,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850739788] [2022-02-20 21:53:08,365 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850739788] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:53:08,365 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328158494] [2022-02-20 21:53:08,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:08,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:53:08,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:53:08,366 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 21:53:08,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 21:53:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:08,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 21:53:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:08,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:53:08,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {22118#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(103, 2);call #Ultimate.allocInit(41, 3);call #Ultimate.allocInit(2, 4);call write~init~int(12, 4, 0, 1);call write~init~int(0, 4, 1, 1);call #Ultimate.allocInit(44, 5);call #Ultimate.allocInit(2, 6);call write~init~int(14, 6, 0, 1);call write~init~int(0, 6, 1, 1);call #Ultimate.allocInit(35, 7);call #Ultimate.allocInit(2, 8);call write~init~int(14, 8, 0, 1);call write~init~int(0, 8, 1, 1);call #Ultimate.allocInit(45, 9);call #Ultimate.allocInit(2, 10);call write~init~int(12, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(2, 12);call write~init~int(12, 12, 0, 1);call write~init~int(0, 12, 1, 1);call #Ultimate.allocInit(40, 13);call #Ultimate.allocInit(2, 14);call write~init~int(14, 14, 0, 1);call write~init~int(0, 14, 1, 1);call #Ultimate.allocInit(54, 15);~LDV_IN_INTERRUPT~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := 0, 0;~#capmode_proto~0.base, ~#capmode_proto~0.offset := 16, 0;call #Ultimate.allocInit(49, 16);call write~init~int(114, ~#capmode_proto~0.base, ~#capmode_proto~0.offset, 1);call write~init~int(508, ~#capmode_proto~0.base, 1 + ~#capmode_proto~0.offset, 4);call write~init~int(0, ~#capmode_proto~0.base, 5 + ~#capmode_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#capmode_proto~0.base, 9 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#capmode_proto~0.base, 17 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#capmode_proto~0.base, 25 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#capmode_proto~0.base, 33 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ack_tx.base, #funAddr~ack_tx.offset, ~#capmode_proto~0.base, 41 + ~#capmode_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 17, 0;call #Ultimate.allocInit(120, 17);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {22118#true} is VALID [2022-02-20 21:53:08,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {22118#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet99#1, main_#t~ret100#1.base, main_#t~ret100#1.offset, main_#t~nondet101#1, main_#t~nondet102#1, main_#t~nondet103#1, main_#t~nondet104#1, main_#t~nondet105#1, main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset, main_#t~nondet107#1, main_#t~switch108#1, main_#t~nondet109#1, main_#t~switch110#1, main_#t~ret111#1, main_#t~ret112#1, main_#t~mem113#1, main_#t~ret114#1, main_#t~nondet115#1, main_#t~switch116#1, main_#t~ret117#1, main_~ldvarg7~0#1, main_~tmp~9#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~0#1, main_~ldvarg5~0#1, main_~tmp___2~0#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~9#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet99#1 && main_#t~nondet99#1 <= 2147483647;main_~tmp~9#1 := main_#t~nondet99#1;havoc main_#t~nondet99#1;main_~ldvarg7~0#1 := main_~tmp~9#1; {22118#true} is VALID [2022-02-20 21:53:08,961 INFO L272 TraceCheckUtils]: 2: Hoare triple {22118#true} call main_#t~ret100#1.base, main_#t~ret100#1.offset := ldv_successful_zalloc(232); {22118#true} is VALID [2022-02-20 21:53:08,961 INFO L290 TraceCheckUtils]: 3: Hoare triple {22118#true} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {22118#true} is VALID [2022-02-20 21:53:08,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {22118#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {22118#true} is VALID [2022-02-20 21:53:08,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {22118#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22118#true} is VALID [2022-02-20 21:53:08,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,961 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22118#true} {22118#true} #537#return; {22118#true} is VALID [2022-02-20 21:53:08,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {22118#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {22118#true} is VALID [2022-02-20 21:53:08,961 INFO L272 TraceCheckUtils]: 9: Hoare triple {22118#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22118#true} is VALID [2022-02-20 21:53:08,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {22118#true} ~cond := #in~cond; {22118#true} is VALID [2022-02-20 21:53:08,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {22118#true} assume !(0 == ~cond); {22118#true} is VALID [2022-02-20 21:53:08,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,961 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {22118#true} {22118#true} #539#return; {22118#true} is VALID [2022-02-20 21:53:08,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {22118#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22118#true} is VALID [2022-02-20 21:53:08,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:08,962 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22118#true} {22118#true} #543#return; {22118#true} is VALID [2022-02-20 21:53:08,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {22118#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret100#1.base, main_#t~ret100#1.offset;havoc main_#t~ret100#1.base, main_#t~ret100#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet101#1 && main_#t~nondet101#1 <= 2147483647;main_~tmp___1~0#1 := main_#t~nondet101#1;havoc main_#t~nondet101#1;main_~ldvarg0~0#1 := main_~tmp___1~0#1;assume -2147483648 <= main_#t~nondet102#1 && main_#t~nondet102#1 <= 2147483647;main_~tmp___2~0#1 := main_#t~nondet102#1;havoc main_#t~nondet102#1;main_~ldvarg5~0#1 := main_~tmp___2~0#1;assume -2147483648 <= main_#t~nondet103#1 && main_#t~nondet103#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet103#1;havoc main_#t~nondet103#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet104#1 && main_#t~nondet104#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet104#1;havoc main_#t~nondet104#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet105#1;havoc main_#t~nondet105#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {22118#true} is VALID [2022-02-20 21:53:08,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {22118#true} assume { :end_inline_ldv_set_init } true; {22118#true} is VALID [2022-02-20 21:53:08,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {22118#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr141#1;#Ultimate.C_memset_#t~loopctr141#1 := 0; {22118#true} is VALID [2022-02-20 21:53:08,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {22118#true} assume !(#Ultimate.C_memset_#t~loopctr141#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {22118#true} is VALID [2022-02-20 21:53:08,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {22118#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {22118#true} is VALID [2022-02-20 21:53:08,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {22118#true} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {22118#true} is VALID [2022-02-20 21:53:08,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {22118#true} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1 == main_~tmp___6~0#1; {22118#true} is VALID [2022-02-20 21:53:08,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {22118#true} assume main_#t~switch108#1; {22118#true} is VALID [2022-02-20 21:53:08,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {22118#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet115#1 && main_#t~nondet115#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0 == main_~tmp___8~0#1; {22118#true} is VALID [2022-02-20 21:53:08,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {22118#true} assume !main_#t~switch116#1;main_#t~switch116#1 := main_#t~switch116#1 || 1 == main_~tmp___8~0#1; {22118#true} is VALID [2022-02-20 21:53:08,970 INFO L290 TraceCheckUtils]: 27: Hoare triple {22118#true} assume main_#t~switch116#1; {22118#true} is VALID [2022-02-20 21:53:08,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {22118#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_capmode_module_init } true;havoc capmode_module_init_#res#1;havoc capmode_module_init_#t~nondet96#1;havoc capmode_module_init_#t~nondet96#1;assume { :begin_inline_arcnet_cap_init } true;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset, arcnet_cap_init_~count~0#1;havoc arcnet_cap_init_~count~0#1;arcnet_cap_init_~count~0#1 := 1; {22368#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 1)} is VALID [2022-02-20 21:53:08,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {22368#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 1)} assume arcnet_cap_init_~count~0#1 <= 8; {22368#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 1)} is VALID [2022-02-20 21:53:08,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {22368#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 1)} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {22368#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 1)} is VALID [2022-02-20 21:53:08,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {22368#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 1)} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {22368#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 1)} is VALID [2022-02-20 21:53:08,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {22368#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 1)} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {22135#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 2)} is VALID [2022-02-20 21:53:08,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {22135#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 2)} assume arcnet_cap_init_~count~0#1 <= 8; {22135#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 2)} is VALID [2022-02-20 21:53:08,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {22135#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 2)} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {22135#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 2)} is VALID [2022-02-20 21:53:08,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {22135#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 2)} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {22135#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 2)} is VALID [2022-02-20 21:53:08,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {22135#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 2)} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {22136#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 3)} is VALID [2022-02-20 21:53:08,974 INFO L290 TraceCheckUtils]: 37: Hoare triple {22136#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 3)} assume arcnet_cap_init_~count~0#1 <= 8; {22136#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 3)} is VALID [2022-02-20 21:53:08,974 INFO L290 TraceCheckUtils]: 38: Hoare triple {22136#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 3)} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {22136#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 3)} is VALID [2022-02-20 21:53:08,974 INFO L290 TraceCheckUtils]: 39: Hoare triple {22136#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 3)} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {22136#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 3)} is VALID [2022-02-20 21:53:08,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {22136#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 3)} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} is VALID [2022-02-20 21:53:08,975 INFO L290 TraceCheckUtils]: 41: Hoare triple {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} assume arcnet_cap_init_~count~0#1 <= 8; {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} is VALID [2022-02-20 21:53:08,975 INFO L290 TraceCheckUtils]: 42: Hoare triple {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} is VALID [2022-02-20 21:53:08,976 INFO L290 TraceCheckUtils]: 43: Hoare triple {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} is VALID [2022-02-20 21:53:08,976 INFO L290 TraceCheckUtils]: 44: Hoare triple {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {22138#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 5)} is VALID [2022-02-20 21:53:08,976 INFO L290 TraceCheckUtils]: 45: Hoare triple {22138#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 5)} assume !(arcnet_cap_init_~count~0#1 <= 8); {22119#false} is VALID [2022-02-20 21:53:08,976 INFO L290 TraceCheckUtils]: 46: Hoare triple {22119#false} assume (~arc_bcast_proto~0.base + ~arc_bcast_proto~0.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;~arc_bcast_proto~0.base, ~arc_bcast_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {22119#false} is VALID [2022-02-20 21:53:08,977 INFO L290 TraceCheckUtils]: 47: Hoare triple {22119#false} ~arc_proto_default~0.base, ~arc_proto_default~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;~arc_raw_proto~0.base, ~arc_raw_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {22119#false} is VALID [2022-02-20 21:53:08,977 INFO L290 TraceCheckUtils]: 48: Hoare triple {22119#false} assume { :end_inline_arcnet_cap_init } true;capmode_module_init_#res#1 := 0; {22119#false} is VALID [2022-02-20 21:53:08,977 INFO L290 TraceCheckUtils]: 49: Hoare triple {22119#false} main_#t~ret117#1 := capmode_module_init_#res#1;assume { :end_inline_capmode_module_init } true;assume -2147483648 <= main_#t~ret117#1 && main_#t~ret117#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret117#1;havoc main_#t~ret117#1; {22119#false} is VALID [2022-02-20 21:53:08,977 INFO L290 TraceCheckUtils]: 50: Hoare triple {22119#false} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_ArcProto_1 } true;havoc ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset, ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset, ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset, ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset;havoc ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset;havoc ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {22119#false} is VALID [2022-02-20 21:53:08,977 INFO L272 TraceCheckUtils]: 51: Hoare triple {22119#false} call ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset := ldv_successful_zalloc(20); {22119#false} is VALID [2022-02-20 21:53:08,977 INFO L290 TraceCheckUtils]: 52: Hoare triple {22119#false} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {22119#false} is VALID [2022-02-20 21:53:08,977 INFO L272 TraceCheckUtils]: 53: Hoare triple {22119#false} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {22119#false} is VALID [2022-02-20 21:53:08,977 INFO L290 TraceCheckUtils]: 54: Hoare triple {22119#false} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22119#false} is VALID [2022-02-20 21:53:08,977 INFO L290 TraceCheckUtils]: 55: Hoare triple {22119#false} assume true; {22119#false} is VALID [2022-02-20 21:53:08,978 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {22119#false} {22119#false} #537#return; {22119#false} is VALID [2022-02-20 21:53:08,978 INFO L290 TraceCheckUtils]: 57: Hoare triple {22119#false} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {22119#false} is VALID [2022-02-20 21:53:08,978 INFO L272 TraceCheckUtils]: 58: Hoare triple {22119#false} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22119#false} is VALID [2022-02-20 21:53:08,978 INFO L290 TraceCheckUtils]: 59: Hoare triple {22119#false} ~cond := #in~cond; {22119#false} is VALID [2022-02-20 21:53:08,978 INFO L290 TraceCheckUtils]: 60: Hoare triple {22119#false} assume !(0 == ~cond); {22119#false} is VALID [2022-02-20 21:53:08,978 INFO L290 TraceCheckUtils]: 61: Hoare triple {22119#false} assume true; {22119#false} is VALID [2022-02-20 21:53:08,978 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {22119#false} {22119#false} #539#return; {22119#false} is VALID [2022-02-20 21:53:08,978 INFO L290 TraceCheckUtils]: 63: Hoare triple {22119#false} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22119#false} is VALID [2022-02-20 21:53:08,978 INFO L290 TraceCheckUtils]: 64: Hoare triple {22119#false} assume true; {22119#false} is VALID [2022-02-20 21:53:08,979 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {22119#false} {22119#false} #599#return; {22119#false} is VALID [2022-02-20 21:53:08,979 INFO L290 TraceCheckUtils]: 66: Hoare triple {22119#false} ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset := ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset; {22119#false} is VALID [2022-02-20 21:53:08,979 INFO L272 TraceCheckUtils]: 67: Hoare triple {22119#false} call ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset := ldv_successful_zalloc(3264); {22119#false} is VALID [2022-02-20 21:53:08,979 INFO L290 TraceCheckUtils]: 68: Hoare triple {22119#false} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {22119#false} is VALID [2022-02-20 21:53:08,979 INFO L272 TraceCheckUtils]: 69: Hoare triple {22119#false} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {22119#false} is VALID [2022-02-20 21:53:08,979 INFO L290 TraceCheckUtils]: 70: Hoare triple {22119#false} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22119#false} is VALID [2022-02-20 21:53:08,979 INFO L290 TraceCheckUtils]: 71: Hoare triple {22119#false} assume true; {22119#false} is VALID [2022-02-20 21:53:08,979 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {22119#false} {22119#false} #537#return; {22119#false} is VALID [2022-02-20 21:53:08,979 INFO L290 TraceCheckUtils]: 73: Hoare triple {22119#false} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {22119#false} is VALID [2022-02-20 21:53:08,980 INFO L272 TraceCheckUtils]: 74: Hoare triple {22119#false} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22119#false} is VALID [2022-02-20 21:53:08,980 INFO L290 TraceCheckUtils]: 75: Hoare triple {22119#false} ~cond := #in~cond; {22119#false} is VALID [2022-02-20 21:53:08,980 INFO L290 TraceCheckUtils]: 76: Hoare triple {22119#false} assume !(0 == ~cond); {22119#false} is VALID [2022-02-20 21:53:08,980 INFO L290 TraceCheckUtils]: 77: Hoare triple {22119#false} assume true; {22119#false} is VALID [2022-02-20 21:53:08,980 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {22119#false} {22119#false} #539#return; {22119#false} is VALID [2022-02-20 21:53:08,980 INFO L290 TraceCheckUtils]: 79: Hoare triple {22119#false} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22119#false} is VALID [2022-02-20 21:53:08,980 INFO L290 TraceCheckUtils]: 80: Hoare triple {22119#false} assume true; {22119#false} is VALID [2022-02-20 21:53:08,980 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {22119#false} {22119#false} #601#return; {22119#false} is VALID [2022-02-20 21:53:08,980 INFO L290 TraceCheckUtils]: 82: Hoare triple {22119#false} ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset := ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {22119#false} is VALID [2022-02-20 21:53:08,981 INFO L290 TraceCheckUtils]: 83: Hoare triple {22119#false} assume { :end_inline_ldv_initialize_ArcProto_1 } true; {22119#false} is VALID [2022-02-20 21:53:08,981 INFO L290 TraceCheckUtils]: 84: Hoare triple {22119#false} assume !(0 != ~ldv_retval_0~0); {22119#false} is VALID [2022-02-20 21:53:08,981 INFO L290 TraceCheckUtils]: 85: Hoare triple {22119#false} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {22119#false} is VALID [2022-02-20 21:53:08,981 INFO L290 TraceCheckUtils]: 86: Hoare triple {22119#false} assume main_#t~switch108#1; {22119#false} is VALID [2022-02-20 21:53:08,981 INFO L290 TraceCheckUtils]: 87: Hoare triple {22119#false} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet109#1 && main_#t~nondet109#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet109#1;havoc main_#t~nondet109#1;main_#t~switch110#1 := 0 == main_~tmp___7~0#1; {22119#false} is VALID [2022-02-20 21:53:08,981 INFO L290 TraceCheckUtils]: 88: Hoare triple {22119#false} assume !main_#t~switch110#1;main_#t~switch110#1 := main_#t~switch110#1 || 1 == main_~tmp___7~0#1; {22119#false} is VALID [2022-02-20 21:53:08,981 INFO L290 TraceCheckUtils]: 89: Hoare triple {22119#false} assume !main_#t~switch110#1;main_#t~switch110#1 := main_#t~switch110#1 || 2 == main_~tmp___7~0#1; {22119#false} is VALID [2022-02-20 21:53:08,981 INFO L290 TraceCheckUtils]: 90: Hoare triple {22119#false} assume !main_#t~switch110#1;main_#t~switch110#1 := main_#t~switch110#1 || 3 == main_~tmp___7~0#1; {22119#false} is VALID [2022-02-20 21:53:08,981 INFO L290 TraceCheckUtils]: 91: Hoare triple {22119#false} assume main_#t~switch110#1; {22119#false} is VALID [2022-02-20 21:53:08,982 INFO L290 TraceCheckUtils]: 92: Hoare triple {22119#false} assume 1 == ~ldv_state_variable_1~0;assume { :begin_inline_rx } true;rx_#in~dev#1.base, rx_#in~dev#1.offset, rx_#in~bufnum#1, rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset, rx_#in~length#1 := ~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset, main_~ldvarg1~0#1, ~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset, main_~ldvarg0~0#1;havoc rx_#t~ret32#1.base, rx_#t~ret32#1.offset, rx_#t~ret33#1.base, rx_#t~ret33#1.offset, rx_#t~nondet34#1, rx_#t~mem35#1, rx_#t~ret36#1.base, rx_#t~ret36#1.offset, rx_#t~ret37#1.base, rx_#t~ret37#1.offset, rx_#t~ret38#1.base, rx_#t~ret38#1.offset, rx_#t~memcpy~res39#1.base, rx_#t~memcpy~res39#1.offset, rx_#t~memcpy~res40#1.base, rx_#t~memcpy~res40#1.offset, rx_#t~memcpy~res41#1.base, rx_#t~memcpy~res41#1.offset, rx_#t~memcpy~res42#1.base, rx_#t~memcpy~res42#1.offset, rx_#t~mem49#1.base, rx_#t~mem49#1.offset, rx_#t~ret50#1, rx_~dev#1.base, rx_~dev#1.offset, rx_~bufnum#1, rx_~pkthdr#1.base, rx_~pkthdr#1.offset, rx_~length#1, rx_~lp~0#1.base, rx_~lp~0#1.offset, rx_~tmp~4#1.base, rx_~tmp~4#1.offset, rx_~skb~0#1.base, rx_~skb~0#1.offset, rx_~pkt~0#1.base, rx_~pkt~0#1.offset, rx_~pktbuf~0#1.base, rx_~pktbuf~0#1.offset, rx_~pkthdrbuf~0#1.base, rx_~pkthdrbuf~0#1.offset, rx_~ofs~0#1, rx_~tmp___0~2#1.base, rx_~tmp___0~2#1.offset, rx_~__len~1#1, rx_~__ret~1#1.base, rx_~__ret~1#1.offset, rx_~__len___0~0#1, rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset;rx_~dev#1.base, rx_~dev#1.offset := rx_#in~dev#1.base, rx_#in~dev#1.offset;rx_~bufnum#1 := rx_#in~bufnum#1;rx_~pkthdr#1.base, rx_~pkthdr#1.offset := rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset;rx_~length#1 := rx_#in~length#1;havoc rx_~lp~0#1.base, rx_~lp~0#1.offset;havoc rx_~tmp~4#1.base, rx_~tmp~4#1.offset;havoc rx_~skb~0#1.base, rx_~skb~0#1.offset;havoc rx_~pkt~0#1.base, rx_~pkt~0#1.offset;havoc rx_~pktbuf~0#1.base, rx_~pktbuf~0#1.offset;havoc rx_~pkthdrbuf~0#1.base, rx_~pkthdrbuf~0#1.offset;havoc rx_~ofs~0#1;havoc rx_~tmp___0~2#1.base, rx_~tmp___0~2#1.offset;havoc rx_~__len~1#1;havoc rx_~__ret~1#1.base, rx_~__ret~1#1.offset;havoc rx_~__len___0~0#1;havoc rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset; {22119#false} is VALID [2022-02-20 21:53:08,982 INFO L272 TraceCheckUtils]: 93: Hoare triple {22119#false} call rx_#t~ret32#1.base, rx_#t~ret32#1.offset := netdev_priv(rx_~dev#1.base, rx_~dev#1.offset); {22119#false} is VALID [2022-02-20 21:53:08,982 INFO L290 TraceCheckUtils]: 94: Hoare triple {22119#false} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {22119#false} is VALID [2022-02-20 21:53:08,982 INFO L290 TraceCheckUtils]: 95: Hoare triple {22119#false} assume true; {22119#false} is VALID [2022-02-20 21:53:08,982 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {22119#false} {22119#false} #573#return; {22119#false} is VALID [2022-02-20 21:53:08,982 INFO L290 TraceCheckUtils]: 97: Hoare triple {22119#false} rx_~tmp~4#1.base, rx_~tmp~4#1.offset := rx_#t~ret32#1.base, rx_#t~ret32#1.offset;havoc rx_#t~ret32#1.base, rx_#t~ret32#1.offset;rx_~lp~0#1.base, rx_~lp~0#1.offset := rx_~tmp~4#1.base, rx_~tmp~4#1.offset;rx_~pkt~0#1.base, rx_~pkt~0#1.offset := rx_~pkthdr#1.base, rx_~pkthdr#1.offset; {22119#false} is VALID [2022-02-20 21:53:08,982 INFO L290 TraceCheckUtils]: 98: Hoare triple {22119#false} assume rx_~length#1 > 256;rx_~ofs~0#1 := 512 - rx_~length#1; {22119#false} is VALID [2022-02-20 21:53:08,982 INFO L272 TraceCheckUtils]: 99: Hoare triple {22119#false} call rx_#t~ret33#1.base, rx_#t~ret33#1.offset := ldv_alloc_skb_14(8 + rx_~length#1, 32); {22119#false} is VALID [2022-02-20 21:53:08,982 INFO L290 TraceCheckUtils]: 100: Hoare triple {22119#false} ~size := #in~size;~priority := #in~priority;havoc ~tmp~10.base, ~tmp~10.offset; {22119#false} is VALID [2022-02-20 21:53:08,983 INFO L272 TraceCheckUtils]: 101: Hoare triple {22119#false} call #t~ret118.base, #t~ret118.offset := ldv_skb_alloc(); {22119#false} is VALID [2022-02-20 21:53:08,983 INFO L290 TraceCheckUtils]: 102: Hoare triple {22119#false} havoc ~skb~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {22119#false} is VALID [2022-02-20 21:53:08,983 INFO L272 TraceCheckUtils]: 103: Hoare triple {22119#false} call #t~ret128#1.base, #t~ret128#1.offset := ldv_successful_zalloc(248); {22119#false} is VALID [2022-02-20 21:53:08,983 INFO L290 TraceCheckUtils]: 104: Hoare triple {22119#false} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {22119#false} is VALID [2022-02-20 21:53:08,983 INFO L272 TraceCheckUtils]: 105: Hoare triple {22119#false} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {22119#false} is VALID [2022-02-20 21:53:08,983 INFO L290 TraceCheckUtils]: 106: Hoare triple {22119#false} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22119#false} is VALID [2022-02-20 21:53:08,983 INFO L290 TraceCheckUtils]: 107: Hoare triple {22119#false} assume true; {22119#false} is VALID [2022-02-20 21:53:08,983 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {22119#false} {22119#false} #537#return; {22119#false} is VALID [2022-02-20 21:53:08,983 INFO L290 TraceCheckUtils]: 109: Hoare triple {22119#false} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {22119#false} is VALID [2022-02-20 21:53:08,984 INFO L272 TraceCheckUtils]: 110: Hoare triple {22119#false} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22119#false} is VALID [2022-02-20 21:53:08,984 INFO L290 TraceCheckUtils]: 111: Hoare triple {22119#false} ~cond := #in~cond; {22119#false} is VALID [2022-02-20 21:53:08,984 INFO L290 TraceCheckUtils]: 112: Hoare triple {22119#false} assume !(0 == ~cond); {22119#false} is VALID [2022-02-20 21:53:08,984 INFO L290 TraceCheckUtils]: 113: Hoare triple {22119#false} assume true; {22119#false} is VALID [2022-02-20 21:53:08,984 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {22119#false} {22119#false} #539#return; {22119#false} is VALID [2022-02-20 21:53:08,984 INFO L290 TraceCheckUtils]: 115: Hoare triple {22119#false} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22119#false} is VALID [2022-02-20 21:53:08,984 INFO L290 TraceCheckUtils]: 116: Hoare triple {22119#false} assume true; {22119#false} is VALID [2022-02-20 21:53:08,984 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {22119#false} {22119#false} #535#return; {22119#false} is VALID [2022-02-20 21:53:08,984 INFO L290 TraceCheckUtils]: 118: Hoare triple {22119#false} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret128#1.base, #t~ret128#1.offset;havoc #t~ret128#1.base, #t~ret128#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {22119#false} is VALID [2022-02-20 21:53:08,985 INFO L290 TraceCheckUtils]: 119: Hoare triple {22119#false} assume !(~skb~1#1.base == 0 && ~skb~1#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem123#1.base, ldv_set_add_#t~mem123#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {22119#false} is VALID [2022-02-20 21:53:08,985 INFO L290 TraceCheckUtils]: 120: Hoare triple {22119#false} assume !false; {22119#false} is VALID [2022-02-20 21:53:08,985 INFO L290 TraceCheckUtils]: 121: Hoare triple {22119#false} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {22119#false} is VALID [2022-02-20 21:53:08,985 INFO L290 TraceCheckUtils]: 122: Hoare triple {22119#false} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {22119#false} is VALID [2022-02-20 21:53:08,985 INFO L290 TraceCheckUtils]: 123: Hoare triple {22119#false} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {22119#false} is VALID [2022-02-20 21:53:08,985 INFO L290 TraceCheckUtils]: 124: Hoare triple {22119#false} assume true; {22119#false} is VALID [2022-02-20 21:53:08,985 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {22119#false} {22119#false} #609#return; {22119#false} is VALID [2022-02-20 21:53:08,985 INFO L290 TraceCheckUtils]: 126: Hoare triple {22119#false} ~tmp~10.base, ~tmp~10.offset := #t~ret118.base, #t~ret118.offset;havoc #t~ret118.base, #t~ret118.offset; {22119#false} is VALID [2022-02-20 21:53:08,985 INFO L290 TraceCheckUtils]: 127: Hoare triple {22119#false} assume ~tmp~10.base != 0 || ~tmp~10.offset != 0; {22119#false} is VALID [2022-02-20 21:53:08,986 INFO L272 TraceCheckUtils]: 128: Hoare triple {22119#false} call #t~ret119.base, #t~ret119.offset := ldv_malloc(~size % 4294967296); {22119#false} is VALID [2022-02-20 21:53:08,986 INFO L290 TraceCheckUtils]: 129: Hoare triple {22119#false} ~size := #in~size;havoc ~p~1.base, ~p~1.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___0~0 := #t~nondet23;havoc #t~nondet23; {22119#false} is VALID [2022-02-20 21:53:08,986 INFO L290 TraceCheckUtils]: 130: Hoare triple {22119#false} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {22119#false} is VALID [2022-02-20 21:53:08,986 INFO L290 TraceCheckUtils]: 131: Hoare triple {22119#false} assume true; {22119#false} is VALID [2022-02-20 21:53:08,986 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {22119#false} {22119#false} #611#return; {22119#false} is VALID [2022-02-20 21:53:08,986 INFO L290 TraceCheckUtils]: 133: Hoare triple {22119#false} call write~$Pointer$(#t~ret119.base, #t~ret119.offset, ~tmp~10.base, 224 + ~tmp~10.offset, 8);havoc #t~ret119.base, #t~ret119.offset;call #t~mem120.base, #t~mem120.offset := read~$Pointer$(~tmp~10.base, 224 + ~tmp~10.offset, 8);call write~$Pointer$(#t~mem120.base, #t~mem120.offset, ~tmp~10.base, 232 + ~tmp~10.offset, 8);havoc #t~mem120.base, #t~mem120.offset; {22119#false} is VALID [2022-02-20 21:53:08,986 INFO L290 TraceCheckUtils]: 134: Hoare triple {22119#false} #res.base, #res.offset := ~tmp~10.base, ~tmp~10.offset; {22119#false} is VALID [2022-02-20 21:53:08,986 INFO L290 TraceCheckUtils]: 135: Hoare triple {22119#false} assume true; {22119#false} is VALID [2022-02-20 21:53:08,986 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {22119#false} {22119#false} #575#return; {22119#false} is VALID [2022-02-20 21:53:08,987 INFO L290 TraceCheckUtils]: 137: Hoare triple {22119#false} rx_~skb~0#1.base, rx_~skb~0#1.offset := rx_#t~ret33#1.base, rx_#t~ret33#1.offset;havoc rx_#t~ret33#1.base, rx_#t~ret33#1.offset; {22119#false} is VALID [2022-02-20 21:53:08,987 INFO L290 TraceCheckUtils]: 138: Hoare triple {22119#false} assume 0 == (rx_~skb~0#1.base + rx_~skb~0#1.offset) % 18446744073709551616; {22119#false} is VALID [2022-02-20 21:53:08,987 INFO L290 TraceCheckUtils]: 139: Hoare triple {22119#false} assume !(0 != ~arcnet_debug~0); {22119#false} is VALID [2022-02-20 21:53:08,987 INFO L290 TraceCheckUtils]: 140: Hoare triple {22119#false} call rx_#t~mem35#1 := read~int(rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);call write~int(1 + rx_#t~mem35#1, rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);havoc rx_#t~mem35#1; {22119#false} is VALID [2022-02-20 21:53:08,987 INFO L290 TraceCheckUtils]: 141: Hoare triple {22119#false} assume { :end_inline_rx } true;~ldv_state_variable_1~0 := 1; {22119#false} is VALID [2022-02-20 21:53:08,987 INFO L290 TraceCheckUtils]: 142: Hoare triple {22119#false} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {22119#false} is VALID [2022-02-20 21:53:08,987 INFO L290 TraceCheckUtils]: 143: Hoare triple {22119#false} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1 == main_~tmp___6~0#1; {22119#false} is VALID [2022-02-20 21:53:08,987 INFO L290 TraceCheckUtils]: 144: Hoare triple {22119#false} assume main_#t~switch108#1; {22119#false} is VALID [2022-02-20 21:53:08,987 INFO L290 TraceCheckUtils]: 145: Hoare triple {22119#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet115#1 && main_#t~nondet115#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0 == main_~tmp___8~0#1; {22119#false} is VALID [2022-02-20 21:53:08,988 INFO L290 TraceCheckUtils]: 146: Hoare triple {22119#false} assume main_#t~switch116#1; {22119#false} is VALID [2022-02-20 21:53:08,988 INFO L290 TraceCheckUtils]: 147: Hoare triple {22119#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_capmode_module_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;havoc arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset;arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset := arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset; {22119#false} is VALID [2022-02-20 21:53:08,988 INFO L290 TraceCheckUtils]: 148: Hoare triple {22119#false} assume { :end_inline_arcnet_unregister_proto } true; {22119#false} is VALID [2022-02-20 21:53:08,988 INFO L290 TraceCheckUtils]: 149: Hoare triple {22119#false} assume { :end_inline_capmode_module_exit } true;~ldv_state_variable_0~0 := 2; {22119#false} is VALID [2022-02-20 21:53:08,988 INFO L290 TraceCheckUtils]: 150: Hoare triple {22119#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret132#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {22119#false} is VALID [2022-02-20 21:53:08,988 INFO L290 TraceCheckUtils]: 151: Hoare triple {22119#false} ldv_check_final_state_#t~ret132#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret132#1 && ldv_check_final_state_#t~ret132#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret132#1;havoc ldv_check_final_state_#t~ret132#1; {22119#false} is VALID [2022-02-20 21:53:08,988 INFO L290 TraceCheckUtils]: 152: Hoare triple {22119#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {22119#false} is VALID [2022-02-20 21:53:08,988 INFO L272 TraceCheckUtils]: 153: Hoare triple {22119#false} call ldv_error(); {22119#false} is VALID [2022-02-20 21:53:08,988 INFO L290 TraceCheckUtils]: 154: Hoare triple {22119#false} assume !false; {22119#false} is VALID [2022-02-20 21:53:08,989 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 49 proven. 28 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-02-20 21:53:08,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 21:53:09,501 INFO L290 TraceCheckUtils]: 154: Hoare triple {22119#false} assume !false; {22119#false} is VALID [2022-02-20 21:53:09,502 INFO L272 TraceCheckUtils]: 153: Hoare triple {22119#false} call ldv_error(); {22119#false} is VALID [2022-02-20 21:53:09,502 INFO L290 TraceCheckUtils]: 152: Hoare triple {22119#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {22119#false} is VALID [2022-02-20 21:53:09,502 INFO L290 TraceCheckUtils]: 151: Hoare triple {22119#false} ldv_check_final_state_#t~ret132#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret132#1 && ldv_check_final_state_#t~ret132#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret132#1;havoc ldv_check_final_state_#t~ret132#1; {22119#false} is VALID [2022-02-20 21:53:09,502 INFO L290 TraceCheckUtils]: 150: Hoare triple {22119#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret132#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {22119#false} is VALID [2022-02-20 21:53:09,502 INFO L290 TraceCheckUtils]: 149: Hoare triple {22119#false} assume { :end_inline_capmode_module_exit } true;~ldv_state_variable_0~0 := 2; {22119#false} is VALID [2022-02-20 21:53:09,503 INFO L290 TraceCheckUtils]: 148: Hoare triple {22119#false} assume { :end_inline_arcnet_unregister_proto } true; {22119#false} is VALID [2022-02-20 21:53:09,503 INFO L290 TraceCheckUtils]: 147: Hoare triple {22119#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_capmode_module_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;havoc arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset;arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset := arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset; {22119#false} is VALID [2022-02-20 21:53:09,503 INFO L290 TraceCheckUtils]: 146: Hoare triple {22119#false} assume main_#t~switch116#1; {22119#false} is VALID [2022-02-20 21:53:09,503 INFO L290 TraceCheckUtils]: 145: Hoare triple {22119#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet115#1 && main_#t~nondet115#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0 == main_~tmp___8~0#1; {22119#false} is VALID [2022-02-20 21:53:09,503 INFO L290 TraceCheckUtils]: 144: Hoare triple {22119#false} assume main_#t~switch108#1; {22119#false} is VALID [2022-02-20 21:53:09,503 INFO L290 TraceCheckUtils]: 143: Hoare triple {22119#false} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1 == main_~tmp___6~0#1; {22119#false} is VALID [2022-02-20 21:53:09,503 INFO L290 TraceCheckUtils]: 142: Hoare triple {22119#false} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {22119#false} is VALID [2022-02-20 21:53:09,503 INFO L290 TraceCheckUtils]: 141: Hoare triple {22119#false} assume { :end_inline_rx } true;~ldv_state_variable_1~0 := 1; {22119#false} is VALID [2022-02-20 21:53:09,503 INFO L290 TraceCheckUtils]: 140: Hoare triple {22119#false} call rx_#t~mem35#1 := read~int(rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);call write~int(1 + rx_#t~mem35#1, rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);havoc rx_#t~mem35#1; {22119#false} is VALID [2022-02-20 21:53:09,503 INFO L290 TraceCheckUtils]: 139: Hoare triple {22119#false} assume !(0 != ~arcnet_debug~0); {22119#false} is VALID [2022-02-20 21:53:09,503 INFO L290 TraceCheckUtils]: 138: Hoare triple {22119#false} assume 0 == (rx_~skb~0#1.base + rx_~skb~0#1.offset) % 18446744073709551616; {22119#false} is VALID [2022-02-20 21:53:09,503 INFO L290 TraceCheckUtils]: 137: Hoare triple {22119#false} rx_~skb~0#1.base, rx_~skb~0#1.offset := rx_#t~ret33#1.base, rx_#t~ret33#1.offset;havoc rx_#t~ret33#1.base, rx_#t~ret33#1.offset; {22119#false} is VALID [2022-02-20 21:53:09,503 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {22118#true} {22119#false} #575#return; {22119#false} is VALID [2022-02-20 21:53:09,503 INFO L290 TraceCheckUtils]: 135: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:09,503 INFO L290 TraceCheckUtils]: 134: Hoare triple {22118#true} #res.base, #res.offset := ~tmp~10.base, ~tmp~10.offset; {22118#true} is VALID [2022-02-20 21:53:09,503 INFO L290 TraceCheckUtils]: 133: Hoare triple {22118#true} call write~$Pointer$(#t~ret119.base, #t~ret119.offset, ~tmp~10.base, 224 + ~tmp~10.offset, 8);havoc #t~ret119.base, #t~ret119.offset;call #t~mem120.base, #t~mem120.offset := read~$Pointer$(~tmp~10.base, 224 + ~tmp~10.offset, 8);call write~$Pointer$(#t~mem120.base, #t~mem120.offset, ~tmp~10.base, 232 + ~tmp~10.offset, 8);havoc #t~mem120.base, #t~mem120.offset; {22118#true} is VALID [2022-02-20 21:53:09,504 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {22118#true} {22118#true} #611#return; {22118#true} is VALID [2022-02-20 21:53:09,504 INFO L290 TraceCheckUtils]: 131: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:09,504 INFO L290 TraceCheckUtils]: 130: Hoare triple {22118#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {22118#true} is VALID [2022-02-20 21:53:09,504 INFO L290 TraceCheckUtils]: 129: Hoare triple {22118#true} ~size := #in~size;havoc ~p~1.base, ~p~1.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___0~0 := #t~nondet23;havoc #t~nondet23; {22118#true} is VALID [2022-02-20 21:53:09,504 INFO L272 TraceCheckUtils]: 128: Hoare triple {22118#true} call #t~ret119.base, #t~ret119.offset := ldv_malloc(~size % 4294967296); {22118#true} is VALID [2022-02-20 21:53:09,504 INFO L290 TraceCheckUtils]: 127: Hoare triple {22118#true} assume ~tmp~10.base != 0 || ~tmp~10.offset != 0; {22118#true} is VALID [2022-02-20 21:53:09,504 INFO L290 TraceCheckUtils]: 126: Hoare triple {22118#true} ~tmp~10.base, ~tmp~10.offset := #t~ret118.base, #t~ret118.offset;havoc #t~ret118.base, #t~ret118.offset; {22118#true} is VALID [2022-02-20 21:53:09,504 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {22118#true} {22118#true} #609#return; {22118#true} is VALID [2022-02-20 21:53:09,504 INFO L290 TraceCheckUtils]: 124: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:09,504 INFO L290 TraceCheckUtils]: 123: Hoare triple {22118#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {22118#true} is VALID [2022-02-20 21:53:09,504 INFO L290 TraceCheckUtils]: 122: Hoare triple {22118#true} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {22118#true} is VALID [2022-02-20 21:53:09,504 INFO L290 TraceCheckUtils]: 121: Hoare triple {22118#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {22118#true} is VALID [2022-02-20 21:53:09,504 INFO L290 TraceCheckUtils]: 120: Hoare triple {22118#true} assume !false; {22118#true} is VALID [2022-02-20 21:53:09,504 INFO L290 TraceCheckUtils]: 119: Hoare triple {22118#true} assume !(~skb~1#1.base == 0 && ~skb~1#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem123#1.base, ldv_set_add_#t~mem123#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {22118#true} is VALID [2022-02-20 21:53:09,504 INFO L290 TraceCheckUtils]: 118: Hoare triple {22118#true} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret128#1.base, #t~ret128#1.offset;havoc #t~ret128#1.base, #t~ret128#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {22118#true} is VALID [2022-02-20 21:53:09,504 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {22118#true} {22118#true} #535#return; {22118#true} is VALID [2022-02-20 21:53:09,504 INFO L290 TraceCheckUtils]: 116: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:09,504 INFO L290 TraceCheckUtils]: 115: Hoare triple {22118#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22118#true} is VALID [2022-02-20 21:53:09,505 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {22118#true} {22118#true} #539#return; {22118#true} is VALID [2022-02-20 21:53:09,505 INFO L290 TraceCheckUtils]: 113: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:09,505 INFO L290 TraceCheckUtils]: 112: Hoare triple {22118#true} assume !(0 == ~cond); {22118#true} is VALID [2022-02-20 21:53:09,505 INFO L290 TraceCheckUtils]: 111: Hoare triple {22118#true} ~cond := #in~cond; {22118#true} is VALID [2022-02-20 21:53:09,505 INFO L272 TraceCheckUtils]: 110: Hoare triple {22118#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22118#true} is VALID [2022-02-20 21:53:09,505 INFO L290 TraceCheckUtils]: 109: Hoare triple {22118#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {22118#true} is VALID [2022-02-20 21:53:09,505 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {22118#true} {22118#true} #537#return; {22118#true} is VALID [2022-02-20 21:53:09,505 INFO L290 TraceCheckUtils]: 107: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:09,505 INFO L290 TraceCheckUtils]: 106: Hoare triple {22118#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22118#true} is VALID [2022-02-20 21:53:09,505 INFO L272 TraceCheckUtils]: 105: Hoare triple {22118#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {22118#true} is VALID [2022-02-20 21:53:09,505 INFO L290 TraceCheckUtils]: 104: Hoare triple {22118#true} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {22118#true} is VALID [2022-02-20 21:53:09,506 INFO L272 TraceCheckUtils]: 103: Hoare triple {22118#true} call #t~ret128#1.base, #t~ret128#1.offset := ldv_successful_zalloc(248); {22118#true} is VALID [2022-02-20 21:53:09,506 INFO L290 TraceCheckUtils]: 102: Hoare triple {22118#true} havoc ~skb~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {22118#true} is VALID [2022-02-20 21:53:09,506 INFO L272 TraceCheckUtils]: 101: Hoare triple {22118#true} call #t~ret118.base, #t~ret118.offset := ldv_skb_alloc(); {22118#true} is VALID [2022-02-20 21:53:09,506 INFO L290 TraceCheckUtils]: 100: Hoare triple {22118#true} ~size := #in~size;~priority := #in~priority;havoc ~tmp~10.base, ~tmp~10.offset; {22118#true} is VALID [2022-02-20 21:53:09,506 INFO L272 TraceCheckUtils]: 99: Hoare triple {22119#false} call rx_#t~ret33#1.base, rx_#t~ret33#1.offset := ldv_alloc_skb_14(8 + rx_~length#1, 32); {22118#true} is VALID [2022-02-20 21:53:09,506 INFO L290 TraceCheckUtils]: 98: Hoare triple {22119#false} assume rx_~length#1 > 256;rx_~ofs~0#1 := 512 - rx_~length#1; {22119#false} is VALID [2022-02-20 21:53:09,506 INFO L290 TraceCheckUtils]: 97: Hoare triple {22119#false} rx_~tmp~4#1.base, rx_~tmp~4#1.offset := rx_#t~ret32#1.base, rx_#t~ret32#1.offset;havoc rx_#t~ret32#1.base, rx_#t~ret32#1.offset;rx_~lp~0#1.base, rx_~lp~0#1.offset := rx_~tmp~4#1.base, rx_~tmp~4#1.offset;rx_~pkt~0#1.base, rx_~pkt~0#1.offset := rx_~pkthdr#1.base, rx_~pkthdr#1.offset; {22119#false} is VALID [2022-02-20 21:53:09,506 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {22118#true} {22119#false} #573#return; {22119#false} is VALID [2022-02-20 21:53:09,506 INFO L290 TraceCheckUtils]: 95: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:09,506 INFO L290 TraceCheckUtils]: 94: Hoare triple {22118#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {22118#true} is VALID [2022-02-20 21:53:09,506 INFO L272 TraceCheckUtils]: 93: Hoare triple {22119#false} call rx_#t~ret32#1.base, rx_#t~ret32#1.offset := netdev_priv(rx_~dev#1.base, rx_~dev#1.offset); {22118#true} is VALID [2022-02-20 21:53:09,506 INFO L290 TraceCheckUtils]: 92: Hoare triple {22119#false} assume 1 == ~ldv_state_variable_1~0;assume { :begin_inline_rx } true;rx_#in~dev#1.base, rx_#in~dev#1.offset, rx_#in~bufnum#1, rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset, rx_#in~length#1 := ~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset, main_~ldvarg1~0#1, ~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset, main_~ldvarg0~0#1;havoc rx_#t~ret32#1.base, rx_#t~ret32#1.offset, rx_#t~ret33#1.base, rx_#t~ret33#1.offset, rx_#t~nondet34#1, rx_#t~mem35#1, rx_#t~ret36#1.base, rx_#t~ret36#1.offset, rx_#t~ret37#1.base, rx_#t~ret37#1.offset, rx_#t~ret38#1.base, rx_#t~ret38#1.offset, rx_#t~memcpy~res39#1.base, rx_#t~memcpy~res39#1.offset, rx_#t~memcpy~res40#1.base, rx_#t~memcpy~res40#1.offset, rx_#t~memcpy~res41#1.base, rx_#t~memcpy~res41#1.offset, rx_#t~memcpy~res42#1.base, rx_#t~memcpy~res42#1.offset, rx_#t~mem49#1.base, rx_#t~mem49#1.offset, rx_#t~ret50#1, rx_~dev#1.base, rx_~dev#1.offset, rx_~bufnum#1, rx_~pkthdr#1.base, rx_~pkthdr#1.offset, rx_~length#1, rx_~lp~0#1.base, rx_~lp~0#1.offset, rx_~tmp~4#1.base, rx_~tmp~4#1.offset, rx_~skb~0#1.base, rx_~skb~0#1.offset, rx_~pkt~0#1.base, rx_~pkt~0#1.offset, rx_~pktbuf~0#1.base, rx_~pktbuf~0#1.offset, rx_~pkthdrbuf~0#1.base, rx_~pkthdrbuf~0#1.offset, rx_~ofs~0#1, rx_~tmp___0~2#1.base, rx_~tmp___0~2#1.offset, rx_~__len~1#1, rx_~__ret~1#1.base, rx_~__ret~1#1.offset, rx_~__len___0~0#1, rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset;rx_~dev#1.base, rx_~dev#1.offset := rx_#in~dev#1.base, rx_#in~dev#1.offset;rx_~bufnum#1 := rx_#in~bufnum#1;rx_~pkthdr#1.base, rx_~pkthdr#1.offset := rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset;rx_~length#1 := rx_#in~length#1;havoc rx_~lp~0#1.base, rx_~lp~0#1.offset;havoc rx_~tmp~4#1.base, rx_~tmp~4#1.offset;havoc rx_~skb~0#1.base, rx_~skb~0#1.offset;havoc rx_~pkt~0#1.base, rx_~pkt~0#1.offset;havoc rx_~pktbuf~0#1.base, rx_~pktbuf~0#1.offset;havoc rx_~pkthdrbuf~0#1.base, rx_~pkthdrbuf~0#1.offset;havoc rx_~ofs~0#1;havoc rx_~tmp___0~2#1.base, rx_~tmp___0~2#1.offset;havoc rx_~__len~1#1;havoc rx_~__ret~1#1.base, rx_~__ret~1#1.offset;havoc rx_~__len___0~0#1;havoc rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset; {22119#false} is VALID [2022-02-20 21:53:09,506 INFO L290 TraceCheckUtils]: 91: Hoare triple {22119#false} assume main_#t~switch110#1; {22119#false} is VALID [2022-02-20 21:53:09,506 INFO L290 TraceCheckUtils]: 90: Hoare triple {22119#false} assume !main_#t~switch110#1;main_#t~switch110#1 := main_#t~switch110#1 || 3 == main_~tmp___7~0#1; {22119#false} is VALID [2022-02-20 21:53:09,506 INFO L290 TraceCheckUtils]: 89: Hoare triple {22119#false} assume !main_#t~switch110#1;main_#t~switch110#1 := main_#t~switch110#1 || 2 == main_~tmp___7~0#1; {22119#false} is VALID [2022-02-20 21:53:09,506 INFO L290 TraceCheckUtils]: 88: Hoare triple {22119#false} assume !main_#t~switch110#1;main_#t~switch110#1 := main_#t~switch110#1 || 1 == main_~tmp___7~0#1; {22119#false} is VALID [2022-02-20 21:53:09,506 INFO L290 TraceCheckUtils]: 87: Hoare triple {22119#false} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet109#1 && main_#t~nondet109#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet109#1;havoc main_#t~nondet109#1;main_#t~switch110#1 := 0 == main_~tmp___7~0#1; {22119#false} is VALID [2022-02-20 21:53:09,506 INFO L290 TraceCheckUtils]: 86: Hoare triple {22119#false} assume main_#t~switch108#1; {22119#false} is VALID [2022-02-20 21:53:09,507 INFO L290 TraceCheckUtils]: 85: Hoare triple {22119#false} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {22119#false} is VALID [2022-02-20 21:53:09,507 INFO L290 TraceCheckUtils]: 84: Hoare triple {22119#false} assume !(0 != ~ldv_retval_0~0); {22119#false} is VALID [2022-02-20 21:53:09,507 INFO L290 TraceCheckUtils]: 83: Hoare triple {22119#false} assume { :end_inline_ldv_initialize_ArcProto_1 } true; {22119#false} is VALID [2022-02-20 21:53:09,507 INFO L290 TraceCheckUtils]: 82: Hoare triple {22119#false} ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset := ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {22119#false} is VALID [2022-02-20 21:53:09,507 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {22118#true} {22119#false} #601#return; {22119#false} is VALID [2022-02-20 21:53:09,507 INFO L290 TraceCheckUtils]: 80: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:09,507 INFO L290 TraceCheckUtils]: 79: Hoare triple {22118#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22118#true} is VALID [2022-02-20 21:53:09,507 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {22118#true} {22118#true} #539#return; {22118#true} is VALID [2022-02-20 21:53:09,507 INFO L290 TraceCheckUtils]: 77: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:09,507 INFO L290 TraceCheckUtils]: 76: Hoare triple {22118#true} assume !(0 == ~cond); {22118#true} is VALID [2022-02-20 21:53:09,507 INFO L290 TraceCheckUtils]: 75: Hoare triple {22118#true} ~cond := #in~cond; {22118#true} is VALID [2022-02-20 21:53:09,507 INFO L272 TraceCheckUtils]: 74: Hoare triple {22118#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22118#true} is VALID [2022-02-20 21:53:09,507 INFO L290 TraceCheckUtils]: 73: Hoare triple {22118#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {22118#true} is VALID [2022-02-20 21:53:09,507 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {22118#true} {22118#true} #537#return; {22118#true} is VALID [2022-02-20 21:53:09,507 INFO L290 TraceCheckUtils]: 71: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:09,507 INFO L290 TraceCheckUtils]: 70: Hoare triple {22118#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22118#true} is VALID [2022-02-20 21:53:09,507 INFO L272 TraceCheckUtils]: 69: Hoare triple {22118#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {22118#true} is VALID [2022-02-20 21:53:09,507 INFO L290 TraceCheckUtils]: 68: Hoare triple {22118#true} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {22118#true} is VALID [2022-02-20 21:53:09,508 INFO L272 TraceCheckUtils]: 67: Hoare triple {22119#false} call ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset := ldv_successful_zalloc(3264); {22118#true} is VALID [2022-02-20 21:53:09,508 INFO L290 TraceCheckUtils]: 66: Hoare triple {22119#false} ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset := ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset; {22119#false} is VALID [2022-02-20 21:53:09,508 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {22118#true} {22119#false} #599#return; {22119#false} is VALID [2022-02-20 21:53:09,508 INFO L290 TraceCheckUtils]: 64: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:09,508 INFO L290 TraceCheckUtils]: 63: Hoare triple {22118#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22118#true} is VALID [2022-02-20 21:53:09,508 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {22118#true} {22118#true} #539#return; {22118#true} is VALID [2022-02-20 21:53:09,508 INFO L290 TraceCheckUtils]: 61: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:09,508 INFO L290 TraceCheckUtils]: 60: Hoare triple {22118#true} assume !(0 == ~cond); {22118#true} is VALID [2022-02-20 21:53:09,508 INFO L290 TraceCheckUtils]: 59: Hoare triple {22118#true} ~cond := #in~cond; {22118#true} is VALID [2022-02-20 21:53:09,508 INFO L272 TraceCheckUtils]: 58: Hoare triple {22118#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22118#true} is VALID [2022-02-20 21:53:09,508 INFO L290 TraceCheckUtils]: 57: Hoare triple {22118#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {22118#true} is VALID [2022-02-20 21:53:09,508 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {22118#true} {22118#true} #537#return; {22118#true} is VALID [2022-02-20 21:53:09,508 INFO L290 TraceCheckUtils]: 55: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:09,508 INFO L290 TraceCheckUtils]: 54: Hoare triple {22118#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22118#true} is VALID [2022-02-20 21:53:09,508 INFO L272 TraceCheckUtils]: 53: Hoare triple {22118#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {22118#true} is VALID [2022-02-20 21:53:09,508 INFO L290 TraceCheckUtils]: 52: Hoare triple {22118#true} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {22118#true} is VALID [2022-02-20 21:53:09,508 INFO L272 TraceCheckUtils]: 51: Hoare triple {22119#false} call ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset := ldv_successful_zalloc(20); {22118#true} is VALID [2022-02-20 21:53:09,508 INFO L290 TraceCheckUtils]: 50: Hoare triple {22119#false} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_ArcProto_1 } true;havoc ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset, ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset, ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset, ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset;havoc ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset;havoc ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {22119#false} is VALID [2022-02-20 21:53:09,508 INFO L290 TraceCheckUtils]: 49: Hoare triple {22119#false} main_#t~ret117#1 := capmode_module_init_#res#1;assume { :end_inline_capmode_module_init } true;assume -2147483648 <= main_#t~ret117#1 && main_#t~ret117#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret117#1;havoc main_#t~ret117#1; {22119#false} is VALID [2022-02-20 21:53:09,509 INFO L290 TraceCheckUtils]: 48: Hoare triple {22119#false} assume { :end_inline_arcnet_cap_init } true;capmode_module_init_#res#1 := 0; {22119#false} is VALID [2022-02-20 21:53:09,509 INFO L290 TraceCheckUtils]: 47: Hoare triple {22119#false} ~arc_proto_default~0.base, ~arc_proto_default~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;~arc_raw_proto~0.base, ~arc_raw_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {22119#false} is VALID [2022-02-20 21:53:09,509 INFO L290 TraceCheckUtils]: 46: Hoare triple {22119#false} assume (~arc_bcast_proto~0.base + ~arc_bcast_proto~0.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;~arc_bcast_proto~0.base, ~arc_bcast_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {22119#false} is VALID [2022-02-20 21:53:09,509 INFO L290 TraceCheckUtils]: 45: Hoare triple {23074#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 8)} assume !(arcnet_cap_init_~count~0#1 <= 8); {22119#false} is VALID [2022-02-20 21:53:09,509 INFO L290 TraceCheckUtils]: 44: Hoare triple {23078#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 7)} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {23074#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 8)} is VALID [2022-02-20 21:53:09,510 INFO L290 TraceCheckUtils]: 43: Hoare triple {23078#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 7)} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {23078#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 7)} is VALID [2022-02-20 21:53:09,510 INFO L290 TraceCheckUtils]: 42: Hoare triple {23078#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 7)} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {23078#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 7)} is VALID [2022-02-20 21:53:09,510 INFO L290 TraceCheckUtils]: 41: Hoare triple {23078#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 7)} assume arcnet_cap_init_~count~0#1 <= 8; {23078#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 7)} is VALID [2022-02-20 21:53:09,510 INFO L290 TraceCheckUtils]: 40: Hoare triple {23091#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 6)} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {23078#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 7)} is VALID [2022-02-20 21:53:09,511 INFO L290 TraceCheckUtils]: 39: Hoare triple {23091#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 6)} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {23091#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 6)} is VALID [2022-02-20 21:53:09,511 INFO L290 TraceCheckUtils]: 38: Hoare triple {23091#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 6)} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {23091#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 6)} is VALID [2022-02-20 21:53:09,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {23091#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 6)} assume arcnet_cap_init_~count~0#1 <= 8; {23091#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 6)} is VALID [2022-02-20 21:53:09,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {22138#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 5)} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {23091#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 6)} is VALID [2022-02-20 21:53:09,512 INFO L290 TraceCheckUtils]: 35: Hoare triple {22138#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 5)} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {22138#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 5)} is VALID [2022-02-20 21:53:09,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {22138#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 5)} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {22138#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 5)} is VALID [2022-02-20 21:53:09,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {22138#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 5)} assume arcnet_cap_init_~count~0#1 <= 8; {22138#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 5)} is VALID [2022-02-20 21:53:09,512 INFO L290 TraceCheckUtils]: 32: Hoare triple {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {22138#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 5)} is VALID [2022-02-20 21:53:09,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} is VALID [2022-02-20 21:53:09,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} is VALID [2022-02-20 21:53:09,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} assume arcnet_cap_init_~count~0#1 <= 8; {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} is VALID [2022-02-20 21:53:09,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {22118#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_capmode_module_init } true;havoc capmode_module_init_#res#1;havoc capmode_module_init_#t~nondet96#1;havoc capmode_module_init_#t~nondet96#1;assume { :begin_inline_arcnet_cap_init } true;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset, arcnet_cap_init_~count~0#1;havoc arcnet_cap_init_~count~0#1;arcnet_cap_init_~count~0#1 := 1; {22137#(<= |ULTIMATE.start_arcnet_cap_init_~count~0#1| 4)} is VALID [2022-02-20 21:53:09,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {22118#true} assume main_#t~switch116#1; {22118#true} is VALID [2022-02-20 21:53:09,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {22118#true} assume !main_#t~switch116#1;main_#t~switch116#1 := main_#t~switch116#1 || 1 == main_~tmp___8~0#1; {22118#true} is VALID [2022-02-20 21:53:09,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {22118#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet115#1 && main_#t~nondet115#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0 == main_~tmp___8~0#1; {22118#true} is VALID [2022-02-20 21:53:09,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {22118#true} assume main_#t~switch108#1; {22118#true} is VALID [2022-02-20 21:53:09,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {22118#true} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1 == main_~tmp___6~0#1; {22118#true} is VALID [2022-02-20 21:53:09,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {22118#true} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {22118#true} is VALID [2022-02-20 21:53:09,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {22118#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {22118#true} is VALID [2022-02-20 21:53:09,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {22118#true} assume !(#Ultimate.C_memset_#t~loopctr141#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {22118#true} is VALID [2022-02-20 21:53:09,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {22118#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr141#1;#Ultimate.C_memset_#t~loopctr141#1 := 0; {22118#true} is VALID [2022-02-20 21:53:09,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {22118#true} assume { :end_inline_ldv_set_init } true; {22118#true} is VALID [2022-02-20 21:53:09,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {22118#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret100#1.base, main_#t~ret100#1.offset;havoc main_#t~ret100#1.base, main_#t~ret100#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet101#1 && main_#t~nondet101#1 <= 2147483647;main_~tmp___1~0#1 := main_#t~nondet101#1;havoc main_#t~nondet101#1;main_~ldvarg0~0#1 := main_~tmp___1~0#1;assume -2147483648 <= main_#t~nondet102#1 && main_#t~nondet102#1 <= 2147483647;main_~tmp___2~0#1 := main_#t~nondet102#1;havoc main_#t~nondet102#1;main_~ldvarg5~0#1 := main_~tmp___2~0#1;assume -2147483648 <= main_#t~nondet103#1 && main_#t~nondet103#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet103#1;havoc main_#t~nondet103#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet104#1 && main_#t~nondet104#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet104#1;havoc main_#t~nondet104#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet105#1;havoc main_#t~nondet105#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {22118#true} is VALID [2022-02-20 21:53:09,514 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22118#true} {22118#true} #543#return; {22118#true} is VALID [2022-02-20 21:53:09,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:09,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {22118#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {22118#true} is VALID [2022-02-20 21:53:09,514 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {22118#true} {22118#true} #539#return; {22118#true} is VALID [2022-02-20 21:53:09,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:09,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {22118#true} assume !(0 == ~cond); {22118#true} is VALID [2022-02-20 21:53:09,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {22118#true} ~cond := #in~cond; {22118#true} is VALID [2022-02-20 21:53:09,514 INFO L272 TraceCheckUtils]: 9: Hoare triple {22118#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {22118#true} is VALID [2022-02-20 21:53:09,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {22118#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {22118#true} is VALID [2022-02-20 21:53:09,515 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22118#true} {22118#true} #537#return; {22118#true} is VALID [2022-02-20 21:53:09,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {22118#true} assume true; {22118#true} is VALID [2022-02-20 21:53:09,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {22118#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {22118#true} is VALID [2022-02-20 21:53:09,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {22118#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {22118#true} is VALID [2022-02-20 21:53:09,515 INFO L290 TraceCheckUtils]: 3: Hoare triple {22118#true} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {22118#true} is VALID [2022-02-20 21:53:09,515 INFO L272 TraceCheckUtils]: 2: Hoare triple {22118#true} call main_#t~ret100#1.base, main_#t~ret100#1.offset := ldv_successful_zalloc(232); {22118#true} is VALID [2022-02-20 21:53:09,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {22118#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet99#1, main_#t~ret100#1.base, main_#t~ret100#1.offset, main_#t~nondet101#1, main_#t~nondet102#1, main_#t~nondet103#1, main_#t~nondet104#1, main_#t~nondet105#1, main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset, main_#t~nondet107#1, main_#t~switch108#1, main_#t~nondet109#1, main_#t~switch110#1, main_#t~ret111#1, main_#t~ret112#1, main_#t~mem113#1, main_#t~ret114#1, main_#t~nondet115#1, main_#t~switch116#1, main_#t~ret117#1, main_~ldvarg7~0#1, main_~tmp~9#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~0#1, main_~ldvarg5~0#1, main_~tmp___2~0#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~9#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet99#1 && main_#t~nondet99#1 <= 2147483647;main_~tmp~9#1 := main_#t~nondet99#1;havoc main_#t~nondet99#1;main_~ldvarg7~0#1 := main_~tmp~9#1; {22118#true} is VALID [2022-02-20 21:53:09,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {22118#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(103, 2);call #Ultimate.allocInit(41, 3);call #Ultimate.allocInit(2, 4);call write~init~int(12, 4, 0, 1);call write~init~int(0, 4, 1, 1);call #Ultimate.allocInit(44, 5);call #Ultimate.allocInit(2, 6);call write~init~int(14, 6, 0, 1);call write~init~int(0, 6, 1, 1);call #Ultimate.allocInit(35, 7);call #Ultimate.allocInit(2, 8);call write~init~int(14, 8, 0, 1);call write~init~int(0, 8, 1, 1);call #Ultimate.allocInit(45, 9);call #Ultimate.allocInit(2, 10);call write~init~int(12, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(2, 12);call write~init~int(12, 12, 0, 1);call write~init~int(0, 12, 1, 1);call #Ultimate.allocInit(40, 13);call #Ultimate.allocInit(2, 14);call write~init~int(14, 14, 0, 1);call write~init~int(0, 14, 1, 1);call #Ultimate.allocInit(54, 15);~LDV_IN_INTERRUPT~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := 0, 0;~#capmode_proto~0.base, ~#capmode_proto~0.offset := 16, 0;call #Ultimate.allocInit(49, 16);call write~init~int(114, ~#capmode_proto~0.base, ~#capmode_proto~0.offset, 1);call write~init~int(508, ~#capmode_proto~0.base, 1 + ~#capmode_proto~0.offset, 4);call write~init~int(0, ~#capmode_proto~0.base, 5 + ~#capmode_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#capmode_proto~0.base, 9 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#capmode_proto~0.base, 17 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#capmode_proto~0.base, 25 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#capmode_proto~0.base, 33 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ack_tx.base, #funAddr~ack_tx.offset, ~#capmode_proto~0.base, 41 + ~#capmode_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 17, 0;call #Ultimate.allocInit(120, 17);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {22118#true} is VALID [2022-02-20 21:53:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-02-20 21:53:09,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328158494] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 21:53:09,515 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 21:53:09,516 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 15 [2022-02-20 21:53:09,516 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070747674] [2022-02-20 21:53:09,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 21:53:09,517 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.733333333333333) internal successors, (146), 11 states have internal predecessors, (146), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2022-02-20 21:53:09,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:09,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 9.733333333333333) internal successors, (146), 11 states have internal predecessors, (146), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-02-20 21:53:10,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:10,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 21:53:10,054 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:53:10,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 21:53:10,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-02-20 21:53:10,056 INFO L87 Difference]: Start difference. First operand 818 states and 1082 transitions. Second operand has 15 states, 15 states have (on average 9.733333333333333) internal successors, (146), 11 states have internal predecessors, (146), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-02-20 21:53:12,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:12,193 INFO L93 Difference]: Finished difference Result 1329 states and 1792 transitions. [2022-02-20 21:53:12,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 21:53:12,193 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.733333333333333) internal successors, (146), 11 states have internal predecessors, (146), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2022-02-20 21:53:12,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 9.733333333333333) internal successors, (146), 11 states have internal predecessors, (146), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-02-20 21:53:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 629 transitions. [2022-02-20 21:53:12,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 9.733333333333333) internal successors, (146), 11 states have internal predecessors, (146), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-02-20 21:53:12,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 629 transitions. [2022-02-20 21:53:12,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 629 transitions. [2022-02-20 21:53:12,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 629 edges. 629 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:12,690 INFO L225 Difference]: With dead ends: 1329 [2022-02-20 21:53:12,691 INFO L226 Difference]: Without dead ends: 892 [2022-02-20 21:53:12,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-02-20 21:53:12,694 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 129 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 21:53:12,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 1524 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 21:53:12,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2022-02-20 21:53:12,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 850. [2022-02-20 21:53:12,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:53:12,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 892 states. Second operand has 850 states, 651 states have (on average 1.273425499231951) internal successors, (829), 653 states have internal predecessors, (829), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (155), 139 states have call predecessors, (155), 137 states have call successors, (155) [2022-02-20 21:53:12,754 INFO L74 IsIncluded]: Start isIncluded. First operand 892 states. Second operand has 850 states, 651 states have (on average 1.273425499231951) internal successors, (829), 653 states have internal predecessors, (829), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (155), 139 states have call predecessors, (155), 137 states have call successors, (155) [2022-02-20 21:53:12,755 INFO L87 Difference]: Start difference. First operand 892 states. Second operand has 850 states, 651 states have (on average 1.273425499231951) internal successors, (829), 653 states have internal predecessors, (829), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (155), 139 states have call predecessors, (155), 137 states have call successors, (155) [2022-02-20 21:53:12,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:12,785 INFO L93 Difference]: Finished difference Result 892 states and 1206 transitions. [2022-02-20 21:53:12,785 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1206 transitions. [2022-02-20 21:53:12,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:12,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:12,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 850 states, 651 states have (on average 1.273425499231951) internal successors, (829), 653 states have internal predecessors, (829), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (155), 139 states have call predecessors, (155), 137 states have call successors, (155) Second operand 892 states. [2022-02-20 21:53:12,790 INFO L87 Difference]: Start difference. First operand has 850 states, 651 states have (on average 1.273425499231951) internal successors, (829), 653 states have internal predecessors, (829), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (155), 139 states have call predecessors, (155), 137 states have call successors, (155) Second operand 892 states. [2022-02-20 21:53:12,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:12,819 INFO L93 Difference]: Finished difference Result 892 states and 1206 transitions. [2022-02-20 21:53:12,819 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1206 transitions. [2022-02-20 21:53:12,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:12,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:12,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:53:12,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:53:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 651 states have (on average 1.273425499231951) internal successors, (829), 653 states have internal predecessors, (829), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (155), 139 states have call predecessors, (155), 137 states have call successors, (155) [2022-02-20 21:53:12,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1122 transitions. [2022-02-20 21:53:12,857 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1122 transitions. Word has length 155 [2022-02-20 21:53:12,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:53:12,857 INFO L470 AbstractCegarLoop]: Abstraction has 850 states and 1122 transitions. [2022-02-20 21:53:12,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.733333333333333) internal successors, (146), 11 states have internal predecessors, (146), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-02-20 21:53:12,857 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1122 transitions. [2022-02-20 21:53:12,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-02-20 21:53:12,860 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:12,860 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:53:12,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 21:53:13,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-02-20 21:53:13,077 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:13,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:13,078 INFO L85 PathProgramCache]: Analyzing trace with hash 745918541, now seen corresponding path program 2 times [2022-02-20 21:53:13,078 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:53:13,078 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385437365] [2022-02-20 21:53:13,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:13,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:53:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:13,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:53:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:13,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:13,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {28074#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {27981#true} is VALID [2022-02-20 21:53:13,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27981#true} {27981#true} #537#return; {27981#true} is VALID [2022-02-20 21:53:13,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:13,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {27981#true} ~cond := #in~cond; {27981#true} is VALID [2022-02-20 21:53:13,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {27981#true} assume !(0 == ~cond); {27981#true} is VALID [2022-02-20 21:53:13,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27981#true} {27981#true} #539#return; {27981#true} is VALID [2022-02-20 21:53:13,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {28066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {27981#true} is VALID [2022-02-20 21:53:13,244 INFO L272 TraceCheckUtils]: 1: Hoare triple {27981#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {28074#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:13,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {28074#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {27981#true} is VALID [2022-02-20 21:53:13,245 INFO L290 TraceCheckUtils]: 3: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,245 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {27981#true} {27981#true} #537#return; {27981#true} is VALID [2022-02-20 21:53:13,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {27981#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {27981#true} is VALID [2022-02-20 21:53:13,245 INFO L272 TraceCheckUtils]: 6: Hoare triple {27981#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {27981#true} is VALID [2022-02-20 21:53:13,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {27981#true} ~cond := #in~cond; {27981#true} is VALID [2022-02-20 21:53:13,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {27981#true} assume !(0 == ~cond); {27981#true} is VALID [2022-02-20 21:53:13,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,245 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27981#true} {27981#true} #539#return; {27981#true} is VALID [2022-02-20 21:53:13,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {27981#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {27981#true} is VALID [2022-02-20 21:53:13,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,246 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {27981#true} {27981#true} #543#return; {27981#true} is VALID [2022-02-20 21:53:13,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-02-20 21:53:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:13,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:13,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {28074#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {27981#true} is VALID [2022-02-20 21:53:13,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,255 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27981#true} {27981#true} #537#return; {27981#true} is VALID [2022-02-20 21:53:13,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:13,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {27981#true} ~cond := #in~cond; {27981#true} is VALID [2022-02-20 21:53:13,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {27981#true} assume !(0 == ~cond); {27981#true} is VALID [2022-02-20 21:53:13,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27981#true} {27981#true} #539#return; {27981#true} is VALID [2022-02-20 21:53:13,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {28066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {27981#true} is VALID [2022-02-20 21:53:13,263 INFO L272 TraceCheckUtils]: 1: Hoare triple {27981#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {28074#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:13,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {28074#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {27981#true} is VALID [2022-02-20 21:53:13,264 INFO L290 TraceCheckUtils]: 3: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,264 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {27981#true} {27981#true} #537#return; {27981#true} is VALID [2022-02-20 21:53:13,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {27981#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {27981#true} is VALID [2022-02-20 21:53:13,264 INFO L272 TraceCheckUtils]: 6: Hoare triple {27981#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {27981#true} is VALID [2022-02-20 21:53:13,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {27981#true} ~cond := #in~cond; {27981#true} is VALID [2022-02-20 21:53:13,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {27981#true} assume !(0 == ~cond); {27981#true} is VALID [2022-02-20 21:53:13,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,264 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27981#true} {27981#true} #539#return; {27981#true} is VALID [2022-02-20 21:53:13,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {27981#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {27981#true} is VALID [2022-02-20 21:53:13,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,265 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {27981#true} {27982#false} #599#return; {27982#false} is VALID [2022-02-20 21:53:13,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-02-20 21:53:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:13,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:13,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {28074#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {27981#true} is VALID [2022-02-20 21:53:13,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27981#true} {27981#true} #537#return; {27981#true} is VALID [2022-02-20 21:53:13,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:13,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {27981#true} ~cond := #in~cond; {27981#true} is VALID [2022-02-20 21:53:13,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {27981#true} assume !(0 == ~cond); {27981#true} is VALID [2022-02-20 21:53:13,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27981#true} {27981#true} #539#return; {27981#true} is VALID [2022-02-20 21:53:13,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {28066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {27981#true} is VALID [2022-02-20 21:53:13,285 INFO L272 TraceCheckUtils]: 1: Hoare triple {27981#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {28074#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:13,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {28074#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {27981#true} is VALID [2022-02-20 21:53:13,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,285 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {27981#true} {27981#true} #537#return; {27981#true} is VALID [2022-02-20 21:53:13,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {27981#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {27981#true} is VALID [2022-02-20 21:53:13,285 INFO L272 TraceCheckUtils]: 6: Hoare triple {27981#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {27981#true} is VALID [2022-02-20 21:53:13,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {27981#true} ~cond := #in~cond; {27981#true} is VALID [2022-02-20 21:53:13,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {27981#true} assume !(0 == ~cond); {27981#true} is VALID [2022-02-20 21:53:13,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,286 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27981#true} {27981#true} #539#return; {27981#true} is VALID [2022-02-20 21:53:13,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {27981#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {27981#true} is VALID [2022-02-20 21:53:13,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,286 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {27981#true} {27982#false} #601#return; {27982#false} is VALID [2022-02-20 21:53:13,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-02-20 21:53:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:13,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {27981#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {27981#true} is VALID [2022-02-20 21:53:13,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,290 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27981#true} {27982#false} #573#return; {27982#false} is VALID [2022-02-20 21:53:13,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-02-20 21:53:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:13,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:13,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:13,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:13,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {28074#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {27981#true} is VALID [2022-02-20 21:53:13,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,332 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27981#true} {27981#true} #537#return; {27981#true} is VALID [2022-02-20 21:53:13,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:13,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {27981#true} ~cond := #in~cond; {27981#true} is VALID [2022-02-20 21:53:13,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {27981#true} assume !(0 == ~cond); {27981#true} is VALID [2022-02-20 21:53:13,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27981#true} {27981#true} #539#return; {27981#true} is VALID [2022-02-20 21:53:13,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {28066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {27981#true} is VALID [2022-02-20 21:53:13,336 INFO L272 TraceCheckUtils]: 1: Hoare triple {27981#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {28074#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:13,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {28074#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {27981#true} is VALID [2022-02-20 21:53:13,336 INFO L290 TraceCheckUtils]: 3: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,336 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {27981#true} {27981#true} #537#return; {27981#true} is VALID [2022-02-20 21:53:13,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {27981#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {27981#true} is VALID [2022-02-20 21:53:13,337 INFO L272 TraceCheckUtils]: 6: Hoare triple {27981#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {27981#true} is VALID [2022-02-20 21:53:13,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {27981#true} ~cond := #in~cond; {27981#true} is VALID [2022-02-20 21:53:13,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {27981#true} assume !(0 == ~cond); {27981#true} is VALID [2022-02-20 21:53:13,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,337 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27981#true} {27981#true} #539#return; {27981#true} is VALID [2022-02-20 21:53:13,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {27981#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {27981#true} is VALID [2022-02-20 21:53:13,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,337 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {27981#true} {27981#true} #535#return; {27981#true} is VALID [2022-02-20 21:53:13,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {28089#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {27981#true} is VALID [2022-02-20 21:53:13,337 INFO L272 TraceCheckUtils]: 1: Hoare triple {27981#true} call #t~ret128#1.base, #t~ret128#1.offset := ldv_successful_zalloc(248); {28066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:13,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {28066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {27981#true} is VALID [2022-02-20 21:53:13,338 INFO L272 TraceCheckUtils]: 3: Hoare triple {27981#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {28074#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:13,338 INFO L290 TraceCheckUtils]: 4: Hoare triple {28074#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {27981#true} is VALID [2022-02-20 21:53:13,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,338 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {27981#true} {27981#true} #537#return; {27981#true} is VALID [2022-02-20 21:53:13,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {27981#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {27981#true} is VALID [2022-02-20 21:53:13,338 INFO L272 TraceCheckUtils]: 8: Hoare triple {27981#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {27981#true} is VALID [2022-02-20 21:53:13,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {27981#true} ~cond := #in~cond; {27981#true} is VALID [2022-02-20 21:53:13,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {27981#true} assume !(0 == ~cond); {27981#true} is VALID [2022-02-20 21:53:13,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,339 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {27981#true} {27981#true} #539#return; {27981#true} is VALID [2022-02-20 21:53:13,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {27981#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {27981#true} is VALID [2022-02-20 21:53:13,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,339 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {27981#true} {27981#true} #535#return; {27981#true} is VALID [2022-02-20 21:53:13,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {27981#true} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret128#1.base, #t~ret128#1.offset;havoc #t~ret128#1.base, #t~ret128#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {27981#true} is VALID [2022-02-20 21:53:13,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {27981#true} assume !(~skb~1#1.base == 0 && ~skb~1#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem123#1.base, ldv_set_add_#t~mem123#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {27981#true} is VALID [2022-02-20 21:53:13,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {27981#true} assume !false; {27981#true} is VALID [2022-02-20 21:53:13,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {27981#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {27981#true} is VALID [2022-02-20 21:53:13,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {27981#true} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {27981#true} is VALID [2022-02-20 21:53:13,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {27981#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {27981#true} is VALID [2022-02-20 21:53:13,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,339 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {27981#true} {27981#true} #609#return; {27981#true} is VALID [2022-02-20 21:53:13,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 21:53:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:13,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {28139#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~1.base, ~p~1.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___0~0 := #t~nondet23;havoc #t~nondet23; {27981#true} is VALID [2022-02-20 21:53:13,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {27981#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {27981#true} is VALID [2022-02-20 21:53:13,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27981#true} {27981#true} #611#return; {27981#true} is VALID [2022-02-20 21:53:13,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {28089#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~10.base, ~tmp~10.offset; {27981#true} is VALID [2022-02-20 21:53:13,349 INFO L272 TraceCheckUtils]: 1: Hoare triple {27981#true} call #t~ret118.base, #t~ret118.offset := ldv_skb_alloc(); {28089#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:13,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {28089#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {27981#true} is VALID [2022-02-20 21:53:13,350 INFO L272 TraceCheckUtils]: 3: Hoare triple {27981#true} call #t~ret128#1.base, #t~ret128#1.offset := ldv_successful_zalloc(248); {28066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:13,350 INFO L290 TraceCheckUtils]: 4: Hoare triple {28066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {27981#true} is VALID [2022-02-20 21:53:13,350 INFO L272 TraceCheckUtils]: 5: Hoare triple {27981#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {28074#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:13,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {28074#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {27981#true} is VALID [2022-02-20 21:53:13,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,351 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {27981#true} {27981#true} #537#return; {27981#true} is VALID [2022-02-20 21:53:13,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {27981#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {27981#true} is VALID [2022-02-20 21:53:13,351 INFO L272 TraceCheckUtils]: 10: Hoare triple {27981#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {27981#true} is VALID [2022-02-20 21:53:13,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {27981#true} ~cond := #in~cond; {27981#true} is VALID [2022-02-20 21:53:13,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {27981#true} assume !(0 == ~cond); {27981#true} is VALID [2022-02-20 21:53:13,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,351 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {27981#true} {27981#true} #539#return; {27981#true} is VALID [2022-02-20 21:53:13,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {27981#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {27981#true} is VALID [2022-02-20 21:53:13,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,351 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27981#true} {27981#true} #535#return; {27981#true} is VALID [2022-02-20 21:53:13,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {27981#true} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret128#1.base, #t~ret128#1.offset;havoc #t~ret128#1.base, #t~ret128#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {27981#true} is VALID [2022-02-20 21:53:13,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {27981#true} assume !(~skb~1#1.base == 0 && ~skb~1#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem123#1.base, ldv_set_add_#t~mem123#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {27981#true} is VALID [2022-02-20 21:53:13,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {27981#true} assume !false; {27981#true} is VALID [2022-02-20 21:53:13,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {27981#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {27981#true} is VALID [2022-02-20 21:53:13,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {27981#true} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {27981#true} is VALID [2022-02-20 21:53:13,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {27981#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {27981#true} is VALID [2022-02-20 21:53:13,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,351 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {27981#true} {27981#true} #609#return; {27981#true} is VALID [2022-02-20 21:53:13,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {27981#true} ~tmp~10.base, ~tmp~10.offset := #t~ret118.base, #t~ret118.offset;havoc #t~ret118.base, #t~ret118.offset; {27981#true} is VALID [2022-02-20 21:53:13,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {27981#true} assume ~tmp~10.base != 0 || ~tmp~10.offset != 0; {27981#true} is VALID [2022-02-20 21:53:13,352 INFO L272 TraceCheckUtils]: 28: Hoare triple {27981#true} call #t~ret119.base, #t~ret119.offset := ldv_malloc(~size % 4294967296); {28139#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:13,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {28139#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~1.base, ~p~1.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___0~0 := #t~nondet23;havoc #t~nondet23; {27981#true} is VALID [2022-02-20 21:53:13,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {27981#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {27981#true} is VALID [2022-02-20 21:53:13,352 INFO L290 TraceCheckUtils]: 31: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,352 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {27981#true} {27981#true} #611#return; {27981#true} is VALID [2022-02-20 21:53:13,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {27981#true} call write~$Pointer$(#t~ret119.base, #t~ret119.offset, ~tmp~10.base, 224 + ~tmp~10.offset, 8);havoc #t~ret119.base, #t~ret119.offset;call #t~mem120.base, #t~mem120.offset := read~$Pointer$(~tmp~10.base, 224 + ~tmp~10.offset, 8);call write~$Pointer$(#t~mem120.base, #t~mem120.offset, ~tmp~10.base, 232 + ~tmp~10.offset, 8);havoc #t~mem120.base, #t~mem120.offset; {27981#true} is VALID [2022-02-20 21:53:13,352 INFO L290 TraceCheckUtils]: 34: Hoare triple {27981#true} #res.base, #res.offset := ~tmp~10.base, ~tmp~10.offset; {27981#true} is VALID [2022-02-20 21:53:13,352 INFO L290 TraceCheckUtils]: 35: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,352 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {27981#true} {27982#false} #575#return; {27982#false} is VALID [2022-02-20 21:53:13,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {27981#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(103, 2);call #Ultimate.allocInit(41, 3);call #Ultimate.allocInit(2, 4);call write~init~int(12, 4, 0, 1);call write~init~int(0, 4, 1, 1);call #Ultimate.allocInit(44, 5);call #Ultimate.allocInit(2, 6);call write~init~int(14, 6, 0, 1);call write~init~int(0, 6, 1, 1);call #Ultimate.allocInit(35, 7);call #Ultimate.allocInit(2, 8);call write~init~int(14, 8, 0, 1);call write~init~int(0, 8, 1, 1);call #Ultimate.allocInit(45, 9);call #Ultimate.allocInit(2, 10);call write~init~int(12, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(2, 12);call write~init~int(12, 12, 0, 1);call write~init~int(0, 12, 1, 1);call #Ultimate.allocInit(40, 13);call #Ultimate.allocInit(2, 14);call write~init~int(14, 14, 0, 1);call write~init~int(0, 14, 1, 1);call #Ultimate.allocInit(54, 15);~LDV_IN_INTERRUPT~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := 0, 0;~#capmode_proto~0.base, ~#capmode_proto~0.offset := 16, 0;call #Ultimate.allocInit(49, 16);call write~init~int(114, ~#capmode_proto~0.base, ~#capmode_proto~0.offset, 1);call write~init~int(508, ~#capmode_proto~0.base, 1 + ~#capmode_proto~0.offset, 4);call write~init~int(0, ~#capmode_proto~0.base, 5 + ~#capmode_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#capmode_proto~0.base, 9 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#capmode_proto~0.base, 17 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#capmode_proto~0.base, 25 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#capmode_proto~0.base, 33 + ~#capmode_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~ack_tx.base, #funAddr~ack_tx.offset, ~#capmode_proto~0.base, 41 + ~#capmode_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 17, 0;call #Ultimate.allocInit(120, 17);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {27981#true} is VALID [2022-02-20 21:53:13,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {27981#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet99#1, main_#t~ret100#1.base, main_#t~ret100#1.offset, main_#t~nondet101#1, main_#t~nondet102#1, main_#t~nondet103#1, main_#t~nondet104#1, main_#t~nondet105#1, main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset, main_#t~nondet107#1, main_#t~switch108#1, main_#t~nondet109#1, main_#t~switch110#1, main_#t~ret111#1, main_#t~ret112#1, main_#t~mem113#1, main_#t~ret114#1, main_#t~nondet115#1, main_#t~switch116#1, main_#t~ret117#1, main_~ldvarg7~0#1, main_~tmp~9#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~0#1, main_~ldvarg5~0#1, main_~tmp___2~0#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~9#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet99#1 && main_#t~nondet99#1 <= 2147483647;main_~tmp~9#1 := main_#t~nondet99#1;havoc main_#t~nondet99#1;main_~ldvarg7~0#1 := main_~tmp~9#1; {27981#true} is VALID [2022-02-20 21:53:13,353 INFO L272 TraceCheckUtils]: 2: Hoare triple {27981#true} call main_#t~ret100#1.base, main_#t~ret100#1.offset := ldv_successful_zalloc(232); {28066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:13,353 INFO L290 TraceCheckUtils]: 3: Hoare triple {28066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {27981#true} is VALID [2022-02-20 21:53:13,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {27981#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {28074#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:13,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {28074#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {27981#true} is VALID [2022-02-20 21:53:13,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,354 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {27981#true} {27981#true} #537#return; {27981#true} is VALID [2022-02-20 21:53:13,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {27981#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {27981#true} is VALID [2022-02-20 21:53:13,354 INFO L272 TraceCheckUtils]: 9: Hoare triple {27981#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {27981#true} is VALID [2022-02-20 21:53:13,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {27981#true} ~cond := #in~cond; {27981#true} is VALID [2022-02-20 21:53:13,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {27981#true} assume !(0 == ~cond); {27981#true} is VALID [2022-02-20 21:53:13,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,354 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {27981#true} {27981#true} #539#return; {27981#true} is VALID [2022-02-20 21:53:13,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {27981#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {27981#true} is VALID [2022-02-20 21:53:13,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,354 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {27981#true} {27981#true} #543#return; {27981#true} is VALID [2022-02-20 21:53:13,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {27981#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret100#1.base, main_#t~ret100#1.offset;havoc main_#t~ret100#1.base, main_#t~ret100#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;assume -2147483648 <= main_#t~nondet101#1 && main_#t~nondet101#1 <= 2147483647;main_~tmp___1~0#1 := main_#t~nondet101#1;havoc main_#t~nondet101#1;main_~ldvarg0~0#1 := main_~tmp___1~0#1;assume -2147483648 <= main_#t~nondet102#1 && main_#t~nondet102#1 <= 2147483647;main_~tmp___2~0#1 := main_#t~nondet102#1;havoc main_#t~nondet102#1;main_~ldvarg5~0#1 := main_~tmp___2~0#1;assume -2147483648 <= main_#t~nondet103#1 && main_#t~nondet103#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet103#1;havoc main_#t~nondet103#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet104#1 && main_#t~nondet104#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet104#1;havoc main_#t~nondet104#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet105#1;havoc main_#t~nondet105#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {27981#true} is VALID [2022-02-20 21:53:13,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {27981#true} assume { :end_inline_ldv_set_init } true; {27981#true} is VALID [2022-02-20 21:53:13,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {27981#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr141#1;#Ultimate.C_memset_#t~loopctr141#1 := 0; {27997#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr141#1| 0) (= (+ (- 1) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) 0))} is VALID [2022-02-20 21:53:13,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {27997#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr141#1| 0) (= (+ (- 1) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) 0))} assume !(#Ultimate.C_memset_#t~loopctr141#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {27982#false} is VALID [2022-02-20 21:53:13,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {27982#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {27982#false} is VALID [2022-02-20 21:53:13,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {27982#false} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {27982#false} is VALID [2022-02-20 21:53:13,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {27982#false} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1 == main_~tmp___6~0#1; {27982#false} is VALID [2022-02-20 21:53:13,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {27982#false} assume main_#t~switch108#1; {27982#false} is VALID [2022-02-20 21:53:13,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {27982#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet115#1 && main_#t~nondet115#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0 == main_~tmp___8~0#1; {27982#false} is VALID [2022-02-20 21:53:13,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {27982#false} assume !main_#t~switch116#1;main_#t~switch116#1 := main_#t~switch116#1 || 1 == main_~tmp___8~0#1; {27982#false} is VALID [2022-02-20 21:53:13,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {27982#false} assume main_#t~switch116#1; {27982#false} is VALID [2022-02-20 21:53:13,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {27982#false} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_capmode_module_init } true;havoc capmode_module_init_#res#1;havoc capmode_module_init_#t~nondet96#1;havoc capmode_module_init_#t~nondet96#1;assume { :begin_inline_arcnet_cap_init } true;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset, arcnet_cap_init_~count~0#1;havoc arcnet_cap_init_~count~0#1;arcnet_cap_init_~count~0#1 := 1; {27982#false} is VALID [2022-02-20 21:53:13,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {27982#false} assume arcnet_cap_init_~count~0#1 <= 8; {27982#false} is VALID [2022-02-20 21:53:13,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {27982#false} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {27982#false} is VALID [2022-02-20 21:53:13,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {27982#false} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {27982#false} is VALID [2022-02-20 21:53:13,356 INFO L290 TraceCheckUtils]: 32: Hoare triple {27982#false} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {27982#false} is VALID [2022-02-20 21:53:13,356 INFO L290 TraceCheckUtils]: 33: Hoare triple {27982#false} assume arcnet_cap_init_~count~0#1 <= 8; {27982#false} is VALID [2022-02-20 21:53:13,356 INFO L290 TraceCheckUtils]: 34: Hoare triple {27982#false} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {27982#false} is VALID [2022-02-20 21:53:13,356 INFO L290 TraceCheckUtils]: 35: Hoare triple {27982#false} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {27982#false} is VALID [2022-02-20 21:53:13,356 INFO L290 TraceCheckUtils]: 36: Hoare triple {27982#false} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {27982#false} is VALID [2022-02-20 21:53:13,356 INFO L290 TraceCheckUtils]: 37: Hoare triple {27982#false} assume arcnet_cap_init_~count~0#1 <= 8; {27982#false} is VALID [2022-02-20 21:53:13,356 INFO L290 TraceCheckUtils]: 38: Hoare triple {27982#false} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {27982#false} is VALID [2022-02-20 21:53:13,356 INFO L290 TraceCheckUtils]: 39: Hoare triple {27982#false} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {27982#false} is VALID [2022-02-20 21:53:13,356 INFO L290 TraceCheckUtils]: 40: Hoare triple {27982#false} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {27982#false} is VALID [2022-02-20 21:53:13,356 INFO L290 TraceCheckUtils]: 41: Hoare triple {27982#false} assume arcnet_cap_init_~count~0#1 <= 8; {27982#false} is VALID [2022-02-20 21:53:13,356 INFO L290 TraceCheckUtils]: 42: Hoare triple {27982#false} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {27982#false} is VALID [2022-02-20 21:53:13,356 INFO L290 TraceCheckUtils]: 43: Hoare triple {27982#false} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {27982#false} is VALID [2022-02-20 21:53:13,356 INFO L290 TraceCheckUtils]: 44: Hoare triple {27982#false} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {27982#false} is VALID [2022-02-20 21:53:13,356 INFO L290 TraceCheckUtils]: 45: Hoare triple {27982#false} assume arcnet_cap_init_~count~0#1 <= 8; {27982#false} is VALID [2022-02-20 21:53:13,356 INFO L290 TraceCheckUtils]: 46: Hoare triple {27982#false} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {27982#false} is VALID [2022-02-20 21:53:13,357 INFO L290 TraceCheckUtils]: 47: Hoare triple {27982#false} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {27982#false} is VALID [2022-02-20 21:53:13,357 INFO L290 TraceCheckUtils]: 48: Hoare triple {27982#false} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {27982#false} is VALID [2022-02-20 21:53:13,357 INFO L290 TraceCheckUtils]: 49: Hoare triple {27982#false} assume arcnet_cap_init_~count~0#1 <= 8; {27982#false} is VALID [2022-02-20 21:53:13,357 INFO L290 TraceCheckUtils]: 50: Hoare triple {27982#false} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {27982#false} is VALID [2022-02-20 21:53:13,357 INFO L290 TraceCheckUtils]: 51: Hoare triple {27982#false} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {27982#false} is VALID [2022-02-20 21:53:13,357 INFO L290 TraceCheckUtils]: 52: Hoare triple {27982#false} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {27982#false} is VALID [2022-02-20 21:53:13,357 INFO L290 TraceCheckUtils]: 53: Hoare triple {27982#false} assume arcnet_cap_init_~count~0#1 <= 8; {27982#false} is VALID [2022-02-20 21:53:13,357 INFO L290 TraceCheckUtils]: 54: Hoare triple {27982#false} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {27982#false} is VALID [2022-02-20 21:53:13,357 INFO L290 TraceCheckUtils]: 55: Hoare triple {27982#false} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {27982#false} is VALID [2022-02-20 21:53:13,357 INFO L290 TraceCheckUtils]: 56: Hoare triple {27982#false} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {27982#false} is VALID [2022-02-20 21:53:13,357 INFO L290 TraceCheckUtils]: 57: Hoare triple {27982#false} assume arcnet_cap_init_~count~0#1 <= 8; {27982#false} is VALID [2022-02-20 21:53:13,357 INFO L290 TraceCheckUtils]: 58: Hoare triple {27982#false} call arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {27982#false} is VALID [2022-02-20 21:53:13,357 INFO L290 TraceCheckUtils]: 59: Hoare triple {27982#false} assume (arcnet_cap_init_#t~mem95#1.base + arcnet_cap_init_#t~mem95#1.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset;call write~$Pointer$(~#capmode_proto~0.base, ~#capmode_proto~0.offset, ~#arc_proto_map~0.base, ~#arc_proto_map~0.offset + 8 * arcnet_cap_init_~count~0#1, 8); {27982#false} is VALID [2022-02-20 21:53:13,357 INFO L290 TraceCheckUtils]: 60: Hoare triple {27982#false} arcnet_cap_init_~count~0#1 := 1 + arcnet_cap_init_~count~0#1; {27982#false} is VALID [2022-02-20 21:53:13,357 INFO L290 TraceCheckUtils]: 61: Hoare triple {27982#false} assume !(arcnet_cap_init_~count~0#1 <= 8); {27982#false} is VALID [2022-02-20 21:53:13,357 INFO L290 TraceCheckUtils]: 62: Hoare triple {27982#false} assume (~arc_bcast_proto~0.base + ~arc_bcast_proto~0.offset) % 18446744073709551616 == (~arc_proto_default~0.base + ~arc_proto_default~0.offset) % 18446744073709551616;~arc_bcast_proto~0.base, ~arc_bcast_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {27982#false} is VALID [2022-02-20 21:53:13,357 INFO L290 TraceCheckUtils]: 63: Hoare triple {27982#false} ~arc_proto_default~0.base, ~arc_proto_default~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;~arc_raw_proto~0.base, ~arc_raw_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {27982#false} is VALID [2022-02-20 21:53:13,357 INFO L290 TraceCheckUtils]: 64: Hoare triple {27982#false} assume { :end_inline_arcnet_cap_init } true;capmode_module_init_#res#1 := 0; {27982#false} is VALID [2022-02-20 21:53:13,357 INFO L290 TraceCheckUtils]: 65: Hoare triple {27982#false} main_#t~ret117#1 := capmode_module_init_#res#1;assume { :end_inline_capmode_module_init } true;assume -2147483648 <= main_#t~ret117#1 && main_#t~ret117#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret117#1;havoc main_#t~ret117#1; {27982#false} is VALID [2022-02-20 21:53:13,357 INFO L290 TraceCheckUtils]: 66: Hoare triple {27982#false} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_ArcProto_1 } true;havoc ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset, ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset, ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset, ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset;havoc ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset;havoc ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {27982#false} is VALID [2022-02-20 21:53:13,358 INFO L272 TraceCheckUtils]: 67: Hoare triple {27982#false} call ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset := ldv_successful_zalloc(20); {28066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:13,358 INFO L290 TraceCheckUtils]: 68: Hoare triple {28066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {27981#true} is VALID [2022-02-20 21:53:13,358 INFO L272 TraceCheckUtils]: 69: Hoare triple {27981#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {28074#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:13,358 INFO L290 TraceCheckUtils]: 70: Hoare triple {28074#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {27981#true} is VALID [2022-02-20 21:53:13,358 INFO L290 TraceCheckUtils]: 71: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,358 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {27981#true} {27981#true} #537#return; {27981#true} is VALID [2022-02-20 21:53:13,358 INFO L290 TraceCheckUtils]: 73: Hoare triple {27981#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {27981#true} is VALID [2022-02-20 21:53:13,359 INFO L272 TraceCheckUtils]: 74: Hoare triple {27981#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {27981#true} is VALID [2022-02-20 21:53:13,359 INFO L290 TraceCheckUtils]: 75: Hoare triple {27981#true} ~cond := #in~cond; {27981#true} is VALID [2022-02-20 21:53:13,359 INFO L290 TraceCheckUtils]: 76: Hoare triple {27981#true} assume !(0 == ~cond); {27981#true} is VALID [2022-02-20 21:53:13,359 INFO L290 TraceCheckUtils]: 77: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,359 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {27981#true} {27981#true} #539#return; {27981#true} is VALID [2022-02-20 21:53:13,359 INFO L290 TraceCheckUtils]: 79: Hoare triple {27981#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {27981#true} is VALID [2022-02-20 21:53:13,359 INFO L290 TraceCheckUtils]: 80: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,359 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {27981#true} {27982#false} #599#return; {27982#false} is VALID [2022-02-20 21:53:13,359 INFO L290 TraceCheckUtils]: 82: Hoare triple {27982#false} ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset := ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret97#1.base, ldv_initialize_ArcProto_1_#t~ret97#1.offset;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := ldv_initialize_ArcProto_1_~tmp~8#1.base, ldv_initialize_ArcProto_1_~tmp~8#1.offset; {27982#false} is VALID [2022-02-20 21:53:13,359 INFO L272 TraceCheckUtils]: 83: Hoare triple {27982#false} call ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset := ldv_successful_zalloc(3264); {28066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:13,359 INFO L290 TraceCheckUtils]: 84: Hoare triple {28066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {27981#true} is VALID [2022-02-20 21:53:13,360 INFO L272 TraceCheckUtils]: 85: Hoare triple {27981#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {28074#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:13,360 INFO L290 TraceCheckUtils]: 86: Hoare triple {28074#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {27981#true} is VALID [2022-02-20 21:53:13,360 INFO L290 TraceCheckUtils]: 87: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,360 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {27981#true} {27981#true} #537#return; {27981#true} is VALID [2022-02-20 21:53:13,360 INFO L290 TraceCheckUtils]: 89: Hoare triple {27981#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {27981#true} is VALID [2022-02-20 21:53:13,360 INFO L272 TraceCheckUtils]: 90: Hoare triple {27981#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {27981#true} is VALID [2022-02-20 21:53:13,360 INFO L290 TraceCheckUtils]: 91: Hoare triple {27981#true} ~cond := #in~cond; {27981#true} is VALID [2022-02-20 21:53:13,360 INFO L290 TraceCheckUtils]: 92: Hoare triple {27981#true} assume !(0 == ~cond); {27981#true} is VALID [2022-02-20 21:53:13,360 INFO L290 TraceCheckUtils]: 93: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,360 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27981#true} {27981#true} #539#return; {27981#true} is VALID [2022-02-20 21:53:13,360 INFO L290 TraceCheckUtils]: 95: Hoare triple {27981#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {27981#true} is VALID [2022-02-20 21:53:13,360 INFO L290 TraceCheckUtils]: 96: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,360 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {27981#true} {27982#false} #601#return; {27982#false} is VALID [2022-02-20 21:53:13,360 INFO L290 TraceCheckUtils]: 98: Hoare triple {27982#false} ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset := ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret98#1.base, ldv_initialize_ArcProto_1_#t~ret98#1.offset;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := ldv_initialize_ArcProto_1_~tmp___0~4#1.base, ldv_initialize_ArcProto_1_~tmp___0~4#1.offset; {27982#false} is VALID [2022-02-20 21:53:13,360 INFO L290 TraceCheckUtils]: 99: Hoare triple {27982#false} assume { :end_inline_ldv_initialize_ArcProto_1 } true; {27982#false} is VALID [2022-02-20 21:53:13,360 INFO L290 TraceCheckUtils]: 100: Hoare triple {27982#false} assume !(0 != ~ldv_retval_0~0); {27982#false} is VALID [2022-02-20 21:53:13,360 INFO L290 TraceCheckUtils]: 101: Hoare triple {27982#false} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {27982#false} is VALID [2022-02-20 21:53:13,360 INFO L290 TraceCheckUtils]: 102: Hoare triple {27982#false} assume main_#t~switch108#1; {27982#false} is VALID [2022-02-20 21:53:13,361 INFO L290 TraceCheckUtils]: 103: Hoare triple {27982#false} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet109#1 && main_#t~nondet109#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet109#1;havoc main_#t~nondet109#1;main_#t~switch110#1 := 0 == main_~tmp___7~0#1; {27982#false} is VALID [2022-02-20 21:53:13,361 INFO L290 TraceCheckUtils]: 104: Hoare triple {27982#false} assume !main_#t~switch110#1;main_#t~switch110#1 := main_#t~switch110#1 || 1 == main_~tmp___7~0#1; {27982#false} is VALID [2022-02-20 21:53:13,361 INFO L290 TraceCheckUtils]: 105: Hoare triple {27982#false} assume !main_#t~switch110#1;main_#t~switch110#1 := main_#t~switch110#1 || 2 == main_~tmp___7~0#1; {27982#false} is VALID [2022-02-20 21:53:13,361 INFO L290 TraceCheckUtils]: 106: Hoare triple {27982#false} assume !main_#t~switch110#1;main_#t~switch110#1 := main_#t~switch110#1 || 3 == main_~tmp___7~0#1; {27982#false} is VALID [2022-02-20 21:53:13,361 INFO L290 TraceCheckUtils]: 107: Hoare triple {27982#false} assume main_#t~switch110#1; {27982#false} is VALID [2022-02-20 21:53:13,361 INFO L290 TraceCheckUtils]: 108: Hoare triple {27982#false} assume 1 == ~ldv_state_variable_1~0;assume { :begin_inline_rx } true;rx_#in~dev#1.base, rx_#in~dev#1.offset, rx_#in~bufnum#1, rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset, rx_#in~length#1 := ~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset, main_~ldvarg1~0#1, ~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset, main_~ldvarg0~0#1;havoc rx_#t~ret32#1.base, rx_#t~ret32#1.offset, rx_#t~ret33#1.base, rx_#t~ret33#1.offset, rx_#t~nondet34#1, rx_#t~mem35#1, rx_#t~ret36#1.base, rx_#t~ret36#1.offset, rx_#t~ret37#1.base, rx_#t~ret37#1.offset, rx_#t~ret38#1.base, rx_#t~ret38#1.offset, rx_#t~memcpy~res39#1.base, rx_#t~memcpy~res39#1.offset, rx_#t~memcpy~res40#1.base, rx_#t~memcpy~res40#1.offset, rx_#t~memcpy~res41#1.base, rx_#t~memcpy~res41#1.offset, rx_#t~memcpy~res42#1.base, rx_#t~memcpy~res42#1.offset, rx_#t~mem49#1.base, rx_#t~mem49#1.offset, rx_#t~ret50#1, rx_~dev#1.base, rx_~dev#1.offset, rx_~bufnum#1, rx_~pkthdr#1.base, rx_~pkthdr#1.offset, rx_~length#1, rx_~lp~0#1.base, rx_~lp~0#1.offset, rx_~tmp~4#1.base, rx_~tmp~4#1.offset, rx_~skb~0#1.base, rx_~skb~0#1.offset, rx_~pkt~0#1.base, rx_~pkt~0#1.offset, rx_~pktbuf~0#1.base, rx_~pktbuf~0#1.offset, rx_~pkthdrbuf~0#1.base, rx_~pkthdrbuf~0#1.offset, rx_~ofs~0#1, rx_~tmp___0~2#1.base, rx_~tmp___0~2#1.offset, rx_~__len~1#1, rx_~__ret~1#1.base, rx_~__ret~1#1.offset, rx_~__len___0~0#1, rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset;rx_~dev#1.base, rx_~dev#1.offset := rx_#in~dev#1.base, rx_#in~dev#1.offset;rx_~bufnum#1 := rx_#in~bufnum#1;rx_~pkthdr#1.base, rx_~pkthdr#1.offset := rx_#in~pkthdr#1.base, rx_#in~pkthdr#1.offset;rx_~length#1 := rx_#in~length#1;havoc rx_~lp~0#1.base, rx_~lp~0#1.offset;havoc rx_~tmp~4#1.base, rx_~tmp~4#1.offset;havoc rx_~skb~0#1.base, rx_~skb~0#1.offset;havoc rx_~pkt~0#1.base, rx_~pkt~0#1.offset;havoc rx_~pktbuf~0#1.base, rx_~pktbuf~0#1.offset;havoc rx_~pkthdrbuf~0#1.base, rx_~pkthdrbuf~0#1.offset;havoc rx_~ofs~0#1;havoc rx_~tmp___0~2#1.base, rx_~tmp___0~2#1.offset;havoc rx_~__len~1#1;havoc rx_~__ret~1#1.base, rx_~__ret~1#1.offset;havoc rx_~__len___0~0#1;havoc rx_~__ret___0~0#1.base, rx_~__ret___0~0#1.offset; {27982#false} is VALID [2022-02-20 21:53:13,361 INFO L272 TraceCheckUtils]: 109: Hoare triple {27982#false} call rx_#t~ret32#1.base, rx_#t~ret32#1.offset := netdev_priv(rx_~dev#1.base, rx_~dev#1.offset); {27981#true} is VALID [2022-02-20 21:53:13,361 INFO L290 TraceCheckUtils]: 110: Hoare triple {27981#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {27981#true} is VALID [2022-02-20 21:53:13,361 INFO L290 TraceCheckUtils]: 111: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,361 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {27981#true} {27982#false} #573#return; {27982#false} is VALID [2022-02-20 21:53:13,361 INFO L290 TraceCheckUtils]: 113: Hoare triple {27982#false} rx_~tmp~4#1.base, rx_~tmp~4#1.offset := rx_#t~ret32#1.base, rx_#t~ret32#1.offset;havoc rx_#t~ret32#1.base, rx_#t~ret32#1.offset;rx_~lp~0#1.base, rx_~lp~0#1.offset := rx_~tmp~4#1.base, rx_~tmp~4#1.offset;rx_~pkt~0#1.base, rx_~pkt~0#1.offset := rx_~pkthdr#1.base, rx_~pkthdr#1.offset; {27982#false} is VALID [2022-02-20 21:53:13,361 INFO L290 TraceCheckUtils]: 114: Hoare triple {27982#false} assume rx_~length#1 > 256;rx_~ofs~0#1 := 512 - rx_~length#1; {27982#false} is VALID [2022-02-20 21:53:13,361 INFO L272 TraceCheckUtils]: 115: Hoare triple {27982#false} call rx_#t~ret33#1.base, rx_#t~ret33#1.offset := ldv_alloc_skb_14(8 + rx_~length#1, 32); {28089#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:13,361 INFO L290 TraceCheckUtils]: 116: Hoare triple {28089#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~10.base, ~tmp~10.offset; {27981#true} is VALID [2022-02-20 21:53:13,362 INFO L272 TraceCheckUtils]: 117: Hoare triple {27981#true} call #t~ret118.base, #t~ret118.offset := ldv_skb_alloc(); {28089#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:13,362 INFO L290 TraceCheckUtils]: 118: Hoare triple {28089#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~1#1.base, ~skb~1#1.offset;havoc ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {27981#true} is VALID [2022-02-20 21:53:13,362 INFO L272 TraceCheckUtils]: 119: Hoare triple {27981#true} call #t~ret128#1.base, #t~ret128#1.offset := ldv_successful_zalloc(248); {28066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:13,362 INFO L290 TraceCheckUtils]: 120: Hoare triple {28066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {27981#true} is VALID [2022-02-20 21:53:13,363 INFO L272 TraceCheckUtils]: 121: Hoare triple {27981#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1, ~__size, ~__size); {28074#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:13,363 INFO L290 TraceCheckUtils]: 122: Hoare triple {28074#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {27981#true} is VALID [2022-02-20 21:53:13,363 INFO L290 TraceCheckUtils]: 123: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,363 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {27981#true} {27981#true} #537#return; {27981#true} is VALID [2022-02-20 21:53:13,363 INFO L290 TraceCheckUtils]: 125: Hoare triple {27981#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {27981#true} is VALID [2022-02-20 21:53:13,363 INFO L272 TraceCheckUtils]: 126: Hoare triple {27981#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {27981#true} is VALID [2022-02-20 21:53:13,363 INFO L290 TraceCheckUtils]: 127: Hoare triple {27981#true} ~cond := #in~cond; {27981#true} is VALID [2022-02-20 21:53:13,363 INFO L290 TraceCheckUtils]: 128: Hoare triple {27981#true} assume !(0 == ~cond); {27981#true} is VALID [2022-02-20 21:53:13,363 INFO L290 TraceCheckUtils]: 129: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,363 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {27981#true} {27981#true} #539#return; {27981#true} is VALID [2022-02-20 21:53:13,363 INFO L290 TraceCheckUtils]: 131: Hoare triple {27981#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {27981#true} is VALID [2022-02-20 21:53:13,363 INFO L290 TraceCheckUtils]: 132: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,363 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {27981#true} {27981#true} #535#return; {27981#true} is VALID [2022-02-20 21:53:13,364 INFO L290 TraceCheckUtils]: 134: Hoare triple {27981#true} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret128#1.base, #t~ret128#1.offset;havoc #t~ret128#1.base, #t~ret128#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {27981#true} is VALID [2022-02-20 21:53:13,364 INFO L290 TraceCheckUtils]: 135: Hoare triple {27981#true} assume !(~skb~1#1.base == 0 && ~skb~1#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~1#1.base, ~skb~1#1.offset;havoc ldv_set_add_#t~mem123#1.base, ldv_set_add_#t~mem123#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {27981#true} is VALID [2022-02-20 21:53:13,364 INFO L290 TraceCheckUtils]: 136: Hoare triple {27981#true} assume !false; {27981#true} is VALID [2022-02-20 21:53:13,364 INFO L290 TraceCheckUtils]: 137: Hoare triple {27981#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {27981#true} is VALID [2022-02-20 21:53:13,364 INFO L290 TraceCheckUtils]: 138: Hoare triple {27981#true} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {27981#true} is VALID [2022-02-20 21:53:13,364 INFO L290 TraceCheckUtils]: 139: Hoare triple {27981#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {27981#true} is VALID [2022-02-20 21:53:13,364 INFO L290 TraceCheckUtils]: 140: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,364 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {27981#true} {27981#true} #609#return; {27981#true} is VALID [2022-02-20 21:53:13,364 INFO L290 TraceCheckUtils]: 142: Hoare triple {27981#true} ~tmp~10.base, ~tmp~10.offset := #t~ret118.base, #t~ret118.offset;havoc #t~ret118.base, #t~ret118.offset; {27981#true} is VALID [2022-02-20 21:53:13,364 INFO L290 TraceCheckUtils]: 143: Hoare triple {27981#true} assume ~tmp~10.base != 0 || ~tmp~10.offset != 0; {27981#true} is VALID [2022-02-20 21:53:13,364 INFO L272 TraceCheckUtils]: 144: Hoare triple {27981#true} call #t~ret119.base, #t~ret119.offset := ldv_malloc(~size % 4294967296); {28139#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:13,364 INFO L290 TraceCheckUtils]: 145: Hoare triple {28139#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~1.base, ~p~1.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___0~0 := #t~nondet23;havoc #t~nondet23; {27981#true} is VALID [2022-02-20 21:53:13,365 INFO L290 TraceCheckUtils]: 146: Hoare triple {27981#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {27981#true} is VALID [2022-02-20 21:53:13,365 INFO L290 TraceCheckUtils]: 147: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,365 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {27981#true} {27981#true} #611#return; {27981#true} is VALID [2022-02-20 21:53:13,365 INFO L290 TraceCheckUtils]: 149: Hoare triple {27981#true} call write~$Pointer$(#t~ret119.base, #t~ret119.offset, ~tmp~10.base, 224 + ~tmp~10.offset, 8);havoc #t~ret119.base, #t~ret119.offset;call #t~mem120.base, #t~mem120.offset := read~$Pointer$(~tmp~10.base, 224 + ~tmp~10.offset, 8);call write~$Pointer$(#t~mem120.base, #t~mem120.offset, ~tmp~10.base, 232 + ~tmp~10.offset, 8);havoc #t~mem120.base, #t~mem120.offset; {27981#true} is VALID [2022-02-20 21:53:13,365 INFO L290 TraceCheckUtils]: 150: Hoare triple {27981#true} #res.base, #res.offset := ~tmp~10.base, ~tmp~10.offset; {27981#true} is VALID [2022-02-20 21:53:13,365 INFO L290 TraceCheckUtils]: 151: Hoare triple {27981#true} assume true; {27981#true} is VALID [2022-02-20 21:53:13,365 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {27981#true} {27982#false} #575#return; {27982#false} is VALID [2022-02-20 21:53:13,365 INFO L290 TraceCheckUtils]: 153: Hoare triple {27982#false} rx_~skb~0#1.base, rx_~skb~0#1.offset := rx_#t~ret33#1.base, rx_#t~ret33#1.offset;havoc rx_#t~ret33#1.base, rx_#t~ret33#1.offset; {27982#false} is VALID [2022-02-20 21:53:13,365 INFO L290 TraceCheckUtils]: 154: Hoare triple {27982#false} assume 0 == (rx_~skb~0#1.base + rx_~skb~0#1.offset) % 18446744073709551616; {27982#false} is VALID [2022-02-20 21:53:13,365 INFO L290 TraceCheckUtils]: 155: Hoare triple {27982#false} assume !(0 != ~arcnet_debug~0); {27982#false} is VALID [2022-02-20 21:53:13,365 INFO L290 TraceCheckUtils]: 156: Hoare triple {27982#false} call rx_#t~mem35#1 := read~int(rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);call write~int(1 + rx_#t~mem35#1, rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);havoc rx_#t~mem35#1; {27982#false} is VALID [2022-02-20 21:53:13,365 INFO L290 TraceCheckUtils]: 157: Hoare triple {27982#false} assume { :end_inline_rx } true;~ldv_state_variable_1~0 := 1; {27982#false} is VALID [2022-02-20 21:53:13,365 INFO L290 TraceCheckUtils]: 158: Hoare triple {27982#false} assume -2147483648 <= main_#t~nondet107#1 && main_#t~nondet107#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0 == main_~tmp___6~0#1; {27982#false} is VALID [2022-02-20 21:53:13,365 INFO L290 TraceCheckUtils]: 159: Hoare triple {27982#false} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1 == main_~tmp___6~0#1; {27982#false} is VALID [2022-02-20 21:53:13,365 INFO L290 TraceCheckUtils]: 160: Hoare triple {27982#false} assume main_#t~switch108#1; {27982#false} is VALID [2022-02-20 21:53:13,365 INFO L290 TraceCheckUtils]: 161: Hoare triple {27982#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet115#1 && main_#t~nondet115#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0 == main_~tmp___8~0#1; {27982#false} is VALID [2022-02-20 21:53:13,365 INFO L290 TraceCheckUtils]: 162: Hoare triple {27982#false} assume main_#t~switch116#1; {27982#false} is VALID [2022-02-20 21:53:13,365 INFO L290 TraceCheckUtils]: 163: Hoare triple {27982#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_capmode_module_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;havoc arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset;arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset := arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset; {27982#false} is VALID [2022-02-20 21:53:13,365 INFO L290 TraceCheckUtils]: 164: Hoare triple {27982#false} assume { :end_inline_arcnet_unregister_proto } true; {27982#false} is VALID [2022-02-20 21:53:13,365 INFO L290 TraceCheckUtils]: 165: Hoare triple {27982#false} assume { :end_inline_capmode_module_exit } true;~ldv_state_variable_0~0 := 2; {27982#false} is VALID [2022-02-20 21:53:13,366 INFO L290 TraceCheckUtils]: 166: Hoare triple {27982#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret132#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {27982#false} is VALID [2022-02-20 21:53:13,366 INFO L290 TraceCheckUtils]: 167: Hoare triple {27982#false} ldv_check_final_state_#t~ret132#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret132#1 && ldv_check_final_state_#t~ret132#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret132#1;havoc ldv_check_final_state_#t~ret132#1; {27982#false} is VALID [2022-02-20 21:53:13,366 INFO L290 TraceCheckUtils]: 168: Hoare triple {27982#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {27982#false} is VALID [2022-02-20 21:53:13,366 INFO L272 TraceCheckUtils]: 169: Hoare triple {27982#false} call ldv_error(); {27982#false} is VALID [2022-02-20 21:53:13,366 INFO L290 TraceCheckUtils]: 170: Hoare triple {27982#false} assume !false; {27982#false} is VALID [2022-02-20 21:53:13,367 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2022-02-20 21:53:13,367 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:53:13,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385437365] [2022-02-20 21:53:13,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385437365] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:13,367 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:13,367 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 21:53:13,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755582963] [2022-02-20 21:53:13,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:13,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 171 [2022-02-20 21:53:13,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:13,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 21:53:13,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:13,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 21:53:13,430 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:53:13,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 21:53:13,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:53:13,431 INFO L87 Difference]: Start difference. First operand 850 states and 1122 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 21:53:14,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:14,649 INFO L93 Difference]: Finished difference Result 1736 states and 2321 transitions. [2022-02-20 21:53:14,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:53:14,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 171 [2022-02-20 21:53:14,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:14,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 21:53:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 592 transitions. [2022-02-20 21:53:14,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 21:53:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 592 transitions. [2022-02-20 21:53:14,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 592 transitions. [2022-02-20 21:53:15,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 592 edges. 592 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:15,109 INFO L225 Difference]: With dead ends: 1736 [2022-02-20 21:53:15,109 INFO L226 Difference]: Without dead ends: 893 [2022-02-20 21:53:15,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:53:15,111 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 132 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 21:53:15,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 785 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 21:53:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2022-02-20 21:53:15,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 851. [2022-02-20 21:53:15,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:53:15,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 893 states. Second operand has 851 states, 652 states have (on average 1.2730061349693251) internal successors, (830), 654 states have internal predecessors, (830), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (155), 139 states have call predecessors, (155), 137 states have call successors, (155) [2022-02-20 21:53:15,148 INFO L74 IsIncluded]: Start isIncluded. First operand 893 states. Second operand has 851 states, 652 states have (on average 1.2730061349693251) internal successors, (830), 654 states have internal predecessors, (830), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (155), 139 states have call predecessors, (155), 137 states have call successors, (155) [2022-02-20 21:53:15,148 INFO L87 Difference]: Start difference. First operand 893 states. Second operand has 851 states, 652 states have (on average 1.2730061349693251) internal successors, (830), 654 states have internal predecessors, (830), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (155), 139 states have call predecessors, (155), 137 states have call successors, (155) [2022-02-20 21:53:15,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:15,183 INFO L93 Difference]: Finished difference Result 893 states and 1207 transitions. [2022-02-20 21:53:15,183 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1207 transitions. [2022-02-20 21:53:15,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:15,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:15,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 851 states, 652 states have (on average 1.2730061349693251) internal successors, (830), 654 states have internal predecessors, (830), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (155), 139 states have call predecessors, (155), 137 states have call successors, (155) Second operand 893 states. [2022-02-20 21:53:15,187 INFO L87 Difference]: Start difference. First operand has 851 states, 652 states have (on average 1.2730061349693251) internal successors, (830), 654 states have internal predecessors, (830), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (155), 139 states have call predecessors, (155), 137 states have call successors, (155) Second operand 893 states. [2022-02-20 21:53:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:15,217 INFO L93 Difference]: Finished difference Result 893 states and 1207 transitions. [2022-02-20 21:53:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1207 transitions. [2022-02-20 21:53:15,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:15,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:15,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:53:15,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:53:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 652 states have (on average 1.2730061349693251) internal successors, (830), 654 states have internal predecessors, (830), 138 states have call successors, (138), 57 states have call predecessors, (138), 60 states have return successors, (155), 139 states have call predecessors, (155), 137 states have call successors, (155) [2022-02-20 21:53:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1123 transitions. [2022-02-20 21:53:15,271 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1123 transitions. Word has length 171 [2022-02-20 21:53:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:53:15,271 INFO L470 AbstractCegarLoop]: Abstraction has 851 states and 1123 transitions. [2022-02-20 21:53:15,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 21:53:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1123 transitions. [2022-02-20 21:53:15,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-02-20 21:53:15,274 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:15,274 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:53:15,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 21:53:15,274 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:15,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:15,275 INFO L85 PathProgramCache]: Analyzing trace with hash -595602417, now seen corresponding path program 1 times [2022-02-20 21:53:15,275 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:53:15,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126472581] [2022-02-20 21:53:15,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:15,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:53:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 21:53:15,411 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 21:53:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 21:53:15,639 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 21:53:15,639 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 21:53:15,640 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 21:53:15,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 21:53:15,644 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-20 21:53:15,646 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 21:53:15,672 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,673 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,673 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,673 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,674 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,674 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,676 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,676 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,676 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,677 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,677 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,677 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,677 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,677 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,678 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,678 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,678 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,678 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,678 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,678 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,678 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,679 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,679 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,679 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,679 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,679 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,679 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,679 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,680 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,680 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,680 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,680 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,680 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,680 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,680 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,681 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,681 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,681 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,681 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,681 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,682 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,682 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,682 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,682 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,683 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,683 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,683 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,683 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,683 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,683 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,683 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,684 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,684 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,684 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,684 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,684 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,684 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,684 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,684 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,685 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,685 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,685 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,685 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,685 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,685 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,685 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,686 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,686 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,686 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,686 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,686 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,687 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,687 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,687 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,687 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,687 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,687 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,687 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,688 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,688 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,688 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,688 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,688 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,689 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,689 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,689 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,689 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,689 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,689 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,689 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,690 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,690 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,690 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,690 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,690 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,690 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,691 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,691 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,691 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,691 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,691 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,691 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,691 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,692 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,692 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,692 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,692 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,692 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,692 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,692 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,692 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,693 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,693 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,693 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,693 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,693 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,693 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,693 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,694 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,694 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,694 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,694 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,694 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,694 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,694 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,695 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,695 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,695 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,695 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,695 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,695 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,696 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,696 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,696 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,696 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,696 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,696 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,696 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,697 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,697 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,697 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,697 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,697 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,697 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,697 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,698 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,698 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,698 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,698 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,698 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,698 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,698 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,699 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,699 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,699 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,699 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,699 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,699 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,699 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,700 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,700 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,700 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,700 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,700 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,700 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,700 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,701 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,701 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,701 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,701 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,701 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,701 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,701 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,701 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,702 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,702 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,702 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,702 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,702 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,702 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,703 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,704 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,704 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,704 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,704 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,704 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,705 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,705 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,705 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,705 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,706 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,707 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,707 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,707 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,707 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,707 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,707 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,707 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,710 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,711 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,711 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,711 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,711 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,711 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,711 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,711 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,712 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,712 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,712 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,712 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,713 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,713 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,713 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,713 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,713 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,713 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,713 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,714 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,714 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,714 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,714 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,714 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,714 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,714 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,715 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,715 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,715 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,715 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,715 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,715 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,716 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,716 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,716 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,716 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,716 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,716 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,716 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,717 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,717 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,717 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,717 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,717 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,717 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,718 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,718 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,718 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,718 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,719 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,719 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,719 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,719 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,719 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,719 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,720 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,720 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,722 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,722 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,722 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,727 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,727 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,727 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,727 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,727 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,728 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,728 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,728 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,728 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,728 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,728 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,728 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,729 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,729 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,729 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,729 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,729 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,730 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,730 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,730 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,730 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,730 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,730 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,730 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,731 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,731 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,731 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,731 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,731 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,731 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,732 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,732 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,732 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,732 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,732 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,732 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,733 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,733 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,733 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,733 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,733 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,733 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,733 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,734 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,734 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,734 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,734 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,734 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,734 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,735 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,735 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,735 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,735 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,735 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,735 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,736 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,736 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,736 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,736 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,736 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,736 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,737 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,737 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,737 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,737 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,737 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,737 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:15,738 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:15,797 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret100 := ldv_successful_zalloc(232); [2022-02-20 21:53:15,797 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 21:53:15,803 INFO L158 Benchmark]: Toolchain (without parser) took 28818.30ms. Allocated memory was 94.4MB in the beginning and 343.9MB in the end (delta: 249.6MB). Free memory was 53.7MB in the beginning and 115.5MB in the end (delta: -61.8MB). Peak memory consumption was 188.8MB. Max. memory is 16.1GB. [2022-02-20 21:53:15,803 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory was 50.0MB in the beginning and 49.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 21:53:15,806 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1004.03ms. Allocated memory was 94.4MB in the beginning and 121.6MB in the end (delta: 27.3MB). Free memory was 53.4MB in the beginning and 75.3MB in the end (delta: -21.9MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2022-02-20 21:53:15,806 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.89ms. Allocated memory is still 121.6MB. Free memory was 75.3MB in the beginning and 69.6MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 21:53:15,806 INFO L158 Benchmark]: Boogie Preprocessor took 56.53ms. Allocated memory is still 121.6MB. Free memory was 69.6MB in the beginning and 62.8MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 21:53:15,806 INFO L158 Benchmark]: RCFGBuilder took 1127.78ms. Allocated memory was 121.6MB in the beginning and 197.1MB in the end (delta: 75.5MB). Free memory was 62.8MB in the beginning and 136.6MB in the end (delta: -73.8MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2022-02-20 21:53:15,807 INFO L158 Benchmark]: TraceAbstraction took 26538.35ms. Allocated memory was 197.1MB in the beginning and 343.9MB in the end (delta: 146.8MB). Free memory was 136.5MB in the beginning and 115.5MB in the end (delta: 21.0MB). Peak memory consumption was 168.8MB. Max. memory is 16.1GB. [2022-02-20 21:53:15,808 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory was 50.0MB in the beginning and 49.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1004.03ms. Allocated memory was 94.4MB in the beginning and 121.6MB in the end (delta: 27.3MB). Free memory was 53.4MB in the beginning and 75.3MB in the end (delta: -21.9MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.89ms. Allocated memory is still 121.6MB. Free memory was 75.3MB in the beginning and 69.6MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.53ms. Allocated memory is still 121.6MB. Free memory was 69.6MB in the beginning and 62.8MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1127.78ms. Allocated memory was 121.6MB in the beginning and 197.1MB in the end (delta: 75.5MB). Free memory was 62.8MB in the beginning and 136.6MB in the end (delta: -73.8MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * TraceAbstraction took 26538.35ms. Allocated memory was 197.1MB in the beginning and 343.9MB in the end (delta: 146.8MB). Free memory was 136.5MB in the beginning and 115.5MB in the end (delta: 21.0MB). Peak memory consumption was 168.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 21:53:15,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 992626749f2e8ca84a93ad6fc64a197d6c8e66b412d995c24cf1e1136a1f2393 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:53:17,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:53:17,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:53:17,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:53:17,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:53:17,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:53:17,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:53:17,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:53:17,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:53:17,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:53:17,639 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:53:17,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:53:17,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:53:17,645 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:53:17,646 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:53:17,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:53:17,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:53:17,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:53:17,651 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:53:17,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:53:17,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:53:17,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:53:17,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:53:17,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:53:17,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:53:17,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:53:17,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:53:17,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:53:17,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:53:17,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:53:17,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:53:17,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:53:17,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:53:17,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:53:17,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:53:17,667 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:53:17,668 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:53:17,668 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:53:17,668 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:53:17,669 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:53:17,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:53:17,670 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-02-20 21:53:17,697 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:53:17,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:53:17,698 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:53:17,698 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:53:17,699 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:53:17,699 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:53:17,700 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:53:17,700 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:53:17,700 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:53:17,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:53:17,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:53:17,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:53:17,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:53:17,701 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:53:17,701 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 21:53:17,701 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 21:53:17,701 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 21:53:17,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:53:17,702 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:53:17,702 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:53:17,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:53:17,702 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:53:17,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:53:17,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:53:17,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:53:17,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:53:17,702 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:53:17,709 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 21:53:17,710 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 21:53:17,710 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:53:17,710 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:53:17,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:53:17,710 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 21:53:17,710 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 992626749f2e8ca84a93ad6fc64a197d6c8e66b412d995c24cf1e1136a1f2393 [2022-02-20 21:53:18,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:53:18,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:53:18,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:53:18,046 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:53:18,046 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:53:18,049 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i [2022-02-20 21:53:18,110 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894137104/a1f8e17ba0c849e1902935e3a3580be8/FLAG8a7c22532 [2022-02-20 21:53:18,664 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:53:18,665 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i [2022-02-20 21:53:18,688 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894137104/a1f8e17ba0c849e1902935e3a3580be8/FLAG8a7c22532 [2022-02-20 21:53:19,132 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894137104/a1f8e17ba0c849e1902935e3a3580be8 [2022-02-20 21:53:19,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:53:19,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:53:19,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:53:19,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:53:19,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:53:19,139 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:53:19" (1/1) ... [2022-02-20 21:53:19,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1beefbfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:19, skipping insertion in model container [2022-02-20 21:53:19,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:53:19" (1/1) ... [2022-02-20 21:53:19,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:53:19,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:53:19,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i[154031,154044] [2022-02-20 21:53:19,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:53:19,887 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 21:53:19,918 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:53:20,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i[154031,154044] [2022-02-20 21:53:20,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:53:20,093 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:53:20,201 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i[154031,154044] [2022-02-20 21:53:20,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:53:20,327 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:53:20,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:20 WrapperNode [2022-02-20 21:53:20,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:53:20,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:53:20,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:53:20,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:53:20,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:20" (1/1) ... [2022-02-20 21:53:20,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:20" (1/1) ... [2022-02-20 21:53:20,427 INFO L137 Inliner]: procedures = 103, calls = 193, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 529 [2022-02-20 21:53:20,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:53:20,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:53:20,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:53:20,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:53:20,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:20" (1/1) ... [2022-02-20 21:53:20,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:20" (1/1) ... [2022-02-20 21:53:20,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:20" (1/1) ... [2022-02-20 21:53:20,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:20" (1/1) ... [2022-02-20 21:53:20,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:20" (1/1) ... [2022-02-20 21:53:20,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:20" (1/1) ... [2022-02-20 21:53:20,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:20" (1/1) ... [2022-02-20 21:53:20,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:53:20,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:53:20,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:53:20,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:53:20,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:20" (1/1) ... [2022-02-20 21:53:20,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:53:20,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:53:20,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 21:53:20,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 21:53:20,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-02-20 21:53:20,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-02-20 21:53:20,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 21:53:20,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 21:53:20,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-02-20 21:53:20,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 21:53:20,636 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:53:20,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:53:20,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 21:53:20,636 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 21:53:20,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 21:53:20,636 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 21:53:20,636 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:53:20,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:53:20,637 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_14 [2022-02-20 21:53:20,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_14 [2022-02-20 21:53:20,637 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~C_INT~X~C_INT~X~$Pointer$~X~C_INT~TO~VOID [2022-02-20 21:53:20,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~C_INT~X~C_INT~X~$Pointer$~X~C_INT~TO~VOID [2022-02-20 21:53:20,637 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-02-20 21:53:20,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-02-20 21:53:20,637 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:53:20,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:53:20,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-02-20 21:53:20,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2022-02-20 21:53:20,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-02-20 21:53:20,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2022-02-20 21:53:20,638 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:53:20,638 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:53:20,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:53:20,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-02-20 21:53:20,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-02-20 21:53:20,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:53:20,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:53:20,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:53:20,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2022-02-20 21:53:20,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2022-02-20 21:53:20,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2022-02-20 21:53:20,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:53:20,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-02-20 21:53:20,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-02-20 21:53:20,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-02-20 21:53:20,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-02-20 21:53:20,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-02-20 21:53:20,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:53:20,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 21:53:20,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:53:20,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 21:53:20,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-02-20 21:53:20,642 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-02-20 21:53:20,642 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-02-20 21:53:20,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_zalloc [2022-02-20 21:53:20,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_zalloc [2022-02-20 21:53:20,643 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-02-20 21:53:20,644 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-02-20 21:53:20,644 INFO L130 BoogieDeclarations]: Found specification of procedure skb_mac_header [2022-02-20 21:53:20,644 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_mac_header [2022-02-20 21:53:20,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2022-02-20 21:53:20,645 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2022-02-20 21:53:20,645 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2022-02-20 21:53:20,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:53:20,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:53:20,915 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:53:20,916 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:53:21,083 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:53:23,978 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:53:23,991 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:53:23,991 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 21:53:23,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:53:23 BoogieIcfgContainer [2022-02-20 21:53:23,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:53:23,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:53:23,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:53:23,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:53:23,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:53:19" (1/3) ... [2022-02-20 21:53:23,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aeb813b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:53:23, skipping insertion in model container [2022-02-20 21:53:23,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:20" (2/3) ... [2022-02-20 21:53:23,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aeb813b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:53:23, skipping insertion in model container [2022-02-20 21:53:23,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:53:23" (3/3) ... [2022-02-20 21:53:23,999 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--capmode.ko-entry_point.cil.out.i [2022-02-20 21:53:24,002 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:53:24,002 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:53:24,048 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:53:24,052 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 21:53:24,052 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:53:24,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 170 states have (on average 1.3647058823529412) internal successors, (232), 175 states have internal predecessors, (232), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-02-20 21:53:24,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 21:53:24,080 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:24,080 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:53:24,082 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:24,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:24,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1585805392, now seen corresponding path program 1 times [2022-02-20 21:53:24,097 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:53:24,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552195009] [2022-02-20 21:53:24,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:24,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:53:24,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:53:24,100 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 21:53:24,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 21:53:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:24,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 21:53:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:24,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:53:24,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {230#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(103bv64, 2bv64);call #Ultimate.allocInit(41bv64, 3bv64);call #Ultimate.allocInit(2bv64, 4bv64);call write~init~intINTTYPE1(12bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 1bv64, 1bv64);call #Ultimate.allocInit(44bv64, 5bv64);call #Ultimate.allocInit(2bv64, 6bv64);call write~init~intINTTYPE1(14bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 1bv64, 1bv64);call #Ultimate.allocInit(35bv64, 7bv64);call #Ultimate.allocInit(2bv64, 8bv64);call write~init~intINTTYPE1(14bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 1bv64, 1bv64);call #Ultimate.allocInit(45bv64, 9bv64);call #Ultimate.allocInit(2bv64, 10bv64);call write~init~intINTTYPE1(12bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 1bv64, 1bv64);call #Ultimate.allocInit(43bv64, 11bv64);call #Ultimate.allocInit(2bv64, 12bv64);call write~init~intINTTYPE1(12bv8, 12bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 12bv64, 1bv64, 1bv64);call #Ultimate.allocInit(40bv64, 13bv64);call #Ultimate.allocInit(2bv64, 14bv64);call write~init~intINTTYPE1(14bv8, 14bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 14bv64, 1bv64, 1bv64);call #Ultimate.allocInit(54bv64, 15bv64);~LDV_IN_INTERRUPT~0 := 1bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_1~0 := 0bv32;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := 0bv64, 0bv64;~ldv_state_variable_0~0 := 0bv32;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := 0bv64, 0bv64;~#capmode_proto~0.base, ~#capmode_proto~0.offset := 16bv64, 0bv64;call #Ultimate.allocInit(49bv64, 16bv64);call write~init~intINTTYPE1(114bv8, ~#capmode_proto~0.base, ~#capmode_proto~0.offset, 1bv64);call write~init~intINTTYPE4(508bv32, ~#capmode_proto~0.base, ~bvadd64(1bv64, ~#capmode_proto~0.offset), 4bv64);call write~init~intINTTYPE4(0bv32, ~#capmode_proto~0.base, ~bvadd64(5bv64, ~#capmode_proto~0.offset), 4bv64);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#capmode_proto~0.base, ~bvadd64(9bv64, ~#capmode_proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#capmode_proto~0.base, ~bvadd64(17bv64, ~#capmode_proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#capmode_proto~0.base, ~bvadd64(25bv64, ~#capmode_proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#capmode_proto~0.base, ~bvadd64(33bv64, ~#capmode_proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~ack_tx.base, #funAddr~ack_tx.offset, ~#capmode_proto~0.base, ~bvadd64(41bv64, ~#capmode_proto~0.offset), 8bv64);~ldv_retval_0~0 := 0bv32;~#set_impl~0.base, ~#set_impl~0.offset := 17bv64, 0bv64;call #Ultimate.allocInit(120bv64, 17bv64);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0bv32;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0bv64, 0bv64; {230#true} is VALID [2022-02-20 21:53:24,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet99#1, main_#t~ret100#1.base, main_#t~ret100#1.offset, main_#t~nondet101#1, main_#t~nondet102#1, main_#t~nondet103#1, main_#t~nondet104#1, main_#t~nondet105#1, main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset, main_#t~nondet107#1, main_#t~switch108#1, main_#t~nondet109#1, main_#t~switch110#1, main_#t~ret111#1, main_#t~ret112#1, main_#t~mem113#1, main_#t~ret114#1, main_#t~nondet115#1, main_#t~switch116#1, main_#t~ret117#1, main_~ldvarg7~0#1, main_~tmp~9#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~0#1, main_~ldvarg5~0#1, main_~tmp___2~0#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~9#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1bv64);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;main_~tmp~9#1 := main_#t~nondet99#1;havoc main_#t~nondet99#1;main_~ldvarg7~0#1 := main_~tmp~9#1; {230#true} is VALID [2022-02-20 21:53:24,490 INFO L272 TraceCheckUtils]: 2: Hoare triple {230#true} call main_#t~ret100#1.base, main_#t~ret100#1.offset := ldv_successful_zalloc(232bv64); {230#true} is VALID [2022-02-20 21:53:24,490 INFO L290 TraceCheckUtils]: 3: Hoare triple {230#true} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {230#true} is VALID [2022-02-20 21:53:24,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {230#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1bv64, ~__size, ~__size); {230#true} is VALID [2022-02-20 21:53:24,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {230#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {230#true} is VALID [2022-02-20 21:53:24,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {230#true} assume true; {230#true} is VALID [2022-02-20 21:53:24,491 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {230#true} {230#true} #537#return; {230#true} is VALID [2022-02-20 21:53:24,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {230#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {230#true} is VALID [2022-02-20 21:53:24,491 INFO L272 TraceCheckUtils]: 9: Hoare triple {230#true} call assume_abort_if_not((if ~p~0.base != 0bv64 || ~p~0.offset != 0bv64 then 1bv32 else 0bv32)); {230#true} is VALID [2022-02-20 21:53:24,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {230#true} ~cond := #in~cond; {230#true} is VALID [2022-02-20 21:53:24,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {230#true} assume 0bv32 == ~cond;assume false; {231#false} is VALID [2022-02-20 21:53:24,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {231#false} assume true; {231#false} is VALID [2022-02-20 21:53:24,492 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {231#false} {230#true} #539#return; {231#false} is VALID [2022-02-20 21:53:24,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {231#false} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {231#false} is VALID [2022-02-20 21:53:24,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {231#false} assume true; {231#false} is VALID [2022-02-20 21:53:24,493 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {231#false} {230#true} #543#return; {231#false} is VALID [2022-02-20 21:53:24,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {231#false} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret100#1.base, main_#t~ret100#1.offset;havoc main_#t~ret100#1.base, main_#t~ret100#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;main_~tmp___1~0#1 := main_#t~nondet101#1;havoc main_#t~nondet101#1;main_~ldvarg0~0#1 := main_~tmp___1~0#1;main_~tmp___2~0#1 := main_#t~nondet102#1;havoc main_#t~nondet102#1;main_~ldvarg5~0#1 := main_~tmp___2~0#1;main_~tmp___3~0#1 := main_#t~nondet103#1;havoc main_#t~nondet103#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;main_~tmp___4~0#1 := main_#t~nondet104#1;havoc main_#t~nondet104#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet105#1;havoc main_#t~nondet105#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0bv32; {231#false} is VALID [2022-02-20 21:53:24,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {231#false} assume { :end_inline_ldv_set_init } true; {231#false} is VALID [2022-02-20 21:53:24,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {231#false} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0bv32, 1bv64;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr141#1;#Ultimate.C_memset_#t~loopctr141#1 := 0bv64; {231#false} is VALID [2022-02-20 21:53:24,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {231#false} assume !~bvult64(#Ultimate.C_memset_#t~loopctr141#1, #Ultimate.C_memset_#amount#1); {231#false} is VALID [2022-02-20 21:53:24,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {231#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset;~ldv_state_variable_1~0 := 0bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 1bv32; {231#false} is VALID [2022-02-20 21:53:24,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {231#false} main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0bv32 == main_~tmp___6~0#1; {231#false} is VALID [2022-02-20 21:53:24,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {231#false} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1bv32 == main_~tmp___6~0#1; {231#false} is VALID [2022-02-20 21:53:24,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {231#false} assume main_#t~switch108#1; {231#false} is VALID [2022-02-20 21:53:24,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {231#false} assume 0bv32 != ~ldv_state_variable_0~0;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0bv32 == main_~tmp___8~0#1; {231#false} is VALID [2022-02-20 21:53:24,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {231#false} assume main_#t~switch116#1; {231#false} is VALID [2022-02-20 21:53:24,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {231#false} assume 3bv32 == ~ldv_state_variable_0~0 && 0bv32 == ~ref_cnt~0;assume { :begin_inline_capmode_module_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;havoc arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset;arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset := arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset; {231#false} is VALID [2022-02-20 21:53:24,503 INFO L290 TraceCheckUtils]: 28: Hoare triple {231#false} assume { :end_inline_arcnet_unregister_proto } true; {231#false} is VALID [2022-02-20 21:53:24,503 INFO L290 TraceCheckUtils]: 29: Hoare triple {231#false} assume { :end_inline_capmode_module_exit } true;~ldv_state_variable_0~0 := 2bv32; {231#false} is VALID [2022-02-20 21:53:24,504 INFO L290 TraceCheckUtils]: 30: Hoare triple {231#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret132#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0bv32 == ~last_index~0 then 1bv32 else 0bv32); {231#false} is VALID [2022-02-20 21:53:24,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {231#false} ldv_check_final_state_#t~ret132#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret132#1;havoc ldv_check_final_state_#t~ret132#1; {231#false} is VALID [2022-02-20 21:53:24,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {231#false} assume !(0bv32 != ldv_check_final_state_~tmp___7~6#1); {231#false} is VALID [2022-02-20 21:53:24,504 INFO L272 TraceCheckUtils]: 33: Hoare triple {231#false} call ldv_error(); {231#false} is VALID [2022-02-20 21:53:24,505 INFO L290 TraceCheckUtils]: 34: Hoare triple {231#false} assume !false; {231#false} is VALID [2022-02-20 21:53:24,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:53:24,506 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:53:24,506 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:53:24,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552195009] [2022-02-20 21:53:24,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552195009] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:24,507 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:24,507 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 21:53:24,508 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727511954] [2022-02-20 21:53:24,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:24,514 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-02-20 21:53:24,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:24,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:24,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:24,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 21:53:24,571 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:53:24,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 21:53:24,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 21:53:24,596 INFO L87 Difference]: Start difference. First operand has 227 states, 170 states have (on average 1.3647058823529412) internal successors, (232), 175 states have internal predecessors, (232), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:27,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:27,519 INFO L93 Difference]: Finished difference Result 449 states and 630 transitions. [2022-02-20 21:53:27,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 21:53:27,520 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-02-20 21:53:27,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:27,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:27,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 630 transitions. [2022-02-20 21:53:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:27,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 630 transitions. [2022-02-20 21:53:27,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 630 transitions. [2022-02-20 21:53:28,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 630 edges. 630 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:28,348 INFO L225 Difference]: With dead ends: 449 [2022-02-20 21:53:28,348 INFO L226 Difference]: Without dead ends: 217 [2022-02-20 21:53:28,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 21:53:28,353 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:53:28,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:53:28,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-02-20 21:53:28,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-02-20 21:53:28,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:53:28,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand has 217 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-02-20 21:53:28,385 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand has 217 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-02-20 21:53:28,386 INFO L87 Difference]: Start difference. First operand 217 states. Second operand has 217 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-02-20 21:53:28,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:28,402 INFO L93 Difference]: Finished difference Result 217 states and 288 transitions. [2022-02-20 21:53:28,402 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2022-02-20 21:53:28,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:28,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:28,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 217 states. [2022-02-20 21:53:28,405 INFO L87 Difference]: Start difference. First operand has 217 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 217 states. [2022-02-20 21:53:28,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:28,413 INFO L93 Difference]: Finished difference Result 217 states and 288 transitions. [2022-02-20 21:53:28,413 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2022-02-20 21:53:28,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:28,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:28,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:53:28,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:53:28,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-02-20 21:53:28,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2022-02-20 21:53:28,423 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 35 [2022-02-20 21:53:28,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:53:28,424 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2022-02-20 21:53:28,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:28,424 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2022-02-20 21:53:28,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 21:53:28,425 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:28,425 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:53:28,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 21:53:28,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 21:53:28,635 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:28,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:28,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1719818898, now seen corresponding path program 1 times [2022-02-20 21:53:28,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:53:28,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289518348] [2022-02-20 21:53:28,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:28,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:53:28,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:53:28,637 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 21:53:28,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 21:53:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:28,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 21:53:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:28,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:53:28,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {1696#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(103bv64, 2bv64);call #Ultimate.allocInit(41bv64, 3bv64);call #Ultimate.allocInit(2bv64, 4bv64);call write~init~intINTTYPE1(12bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 1bv64, 1bv64);call #Ultimate.allocInit(44bv64, 5bv64);call #Ultimate.allocInit(2bv64, 6bv64);call write~init~intINTTYPE1(14bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 1bv64, 1bv64);call #Ultimate.allocInit(35bv64, 7bv64);call #Ultimate.allocInit(2bv64, 8bv64);call write~init~intINTTYPE1(14bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 1bv64, 1bv64);call #Ultimate.allocInit(45bv64, 9bv64);call #Ultimate.allocInit(2bv64, 10bv64);call write~init~intINTTYPE1(12bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 1bv64, 1bv64);call #Ultimate.allocInit(43bv64, 11bv64);call #Ultimate.allocInit(2bv64, 12bv64);call write~init~intINTTYPE1(12bv8, 12bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 12bv64, 1bv64, 1bv64);call #Ultimate.allocInit(40bv64, 13bv64);call #Ultimate.allocInit(2bv64, 14bv64);call write~init~intINTTYPE1(14bv8, 14bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 14bv64, 1bv64, 1bv64);call #Ultimate.allocInit(54bv64, 15bv64);~LDV_IN_INTERRUPT~0 := 1bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_1~0 := 0bv32;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := 0bv64, 0bv64;~ldv_state_variable_0~0 := 0bv32;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := 0bv64, 0bv64;~#capmode_proto~0.base, ~#capmode_proto~0.offset := 16bv64, 0bv64;call #Ultimate.allocInit(49bv64, 16bv64);call write~init~intINTTYPE1(114bv8, ~#capmode_proto~0.base, ~#capmode_proto~0.offset, 1bv64);call write~init~intINTTYPE4(508bv32, ~#capmode_proto~0.base, ~bvadd64(1bv64, ~#capmode_proto~0.offset), 4bv64);call write~init~intINTTYPE4(0bv32, ~#capmode_proto~0.base, ~bvadd64(5bv64, ~#capmode_proto~0.offset), 4bv64);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#capmode_proto~0.base, ~bvadd64(9bv64, ~#capmode_proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#capmode_proto~0.base, ~bvadd64(17bv64, ~#capmode_proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#capmode_proto~0.base, ~bvadd64(25bv64, ~#capmode_proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#capmode_proto~0.base, ~bvadd64(33bv64, ~#capmode_proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~ack_tx.base, #funAddr~ack_tx.offset, ~#capmode_proto~0.base, ~bvadd64(41bv64, ~#capmode_proto~0.offset), 8bv64);~ldv_retval_0~0 := 0bv32;~#set_impl~0.base, ~#set_impl~0.offset := 17bv64, 0bv64;call #Ultimate.allocInit(120bv64, 17bv64);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0bv32;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0bv64, 0bv64; {1696#true} is VALID [2022-02-20 21:53:28,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {1696#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet99#1, main_#t~ret100#1.base, main_#t~ret100#1.offset, main_#t~nondet101#1, main_#t~nondet102#1, main_#t~nondet103#1, main_#t~nondet104#1, main_#t~nondet105#1, main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset, main_#t~nondet107#1, main_#t~switch108#1, main_#t~nondet109#1, main_#t~switch110#1, main_#t~ret111#1, main_#t~ret112#1, main_#t~mem113#1, main_#t~ret114#1, main_#t~nondet115#1, main_#t~switch116#1, main_#t~ret117#1, main_~ldvarg7~0#1, main_~tmp~9#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~0#1, main_~ldvarg5~0#1, main_~tmp___2~0#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~9#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1bv64);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;main_~tmp~9#1 := main_#t~nondet99#1;havoc main_#t~nondet99#1;main_~ldvarg7~0#1 := main_~tmp~9#1; {1696#true} is VALID [2022-02-20 21:53:28,919 INFO L272 TraceCheckUtils]: 2: Hoare triple {1696#true} call main_#t~ret100#1.base, main_#t~ret100#1.offset := ldv_successful_zalloc(232bv64); {1696#true} is VALID [2022-02-20 21:53:28,919 INFO L290 TraceCheckUtils]: 3: Hoare triple {1696#true} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {1696#true} is VALID [2022-02-20 21:53:28,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {1696#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1bv64, ~__size, ~__size); {1696#true} is VALID [2022-02-20 21:53:28,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {1696#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1696#true} is VALID [2022-02-20 21:53:28,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {1696#true} assume true; {1696#true} is VALID [2022-02-20 21:53:28,919 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1696#true} {1696#true} #537#return; {1696#true} is VALID [2022-02-20 21:53:28,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {1696#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {1696#true} is VALID [2022-02-20 21:53:28,920 INFO L272 TraceCheckUtils]: 9: Hoare triple {1696#true} call assume_abort_if_not((if ~p~0.base != 0bv64 || ~p~0.offset != 0bv64 then 1bv32 else 0bv32)); {1696#true} is VALID [2022-02-20 21:53:28,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {1696#true} ~cond := #in~cond; {1696#true} is VALID [2022-02-20 21:53:28,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {1696#true} assume !(0bv32 == ~cond); {1696#true} is VALID [2022-02-20 21:53:28,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {1696#true} assume true; {1696#true} is VALID [2022-02-20 21:53:28,921 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1696#true} {1696#true} #539#return; {1696#true} is VALID [2022-02-20 21:53:28,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {1696#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {1696#true} is VALID [2022-02-20 21:53:28,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {1696#true} assume true; {1696#true} is VALID [2022-02-20 21:53:28,921 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1696#true} {1696#true} #543#return; {1696#true} is VALID [2022-02-20 21:53:28,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {1696#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret100#1.base, main_#t~ret100#1.offset;havoc main_#t~ret100#1.base, main_#t~ret100#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;main_~tmp___1~0#1 := main_#t~nondet101#1;havoc main_#t~nondet101#1;main_~ldvarg0~0#1 := main_~tmp___1~0#1;main_~tmp___2~0#1 := main_#t~nondet102#1;havoc main_#t~nondet102#1;main_~ldvarg5~0#1 := main_~tmp___2~0#1;main_~tmp___3~0#1 := main_#t~nondet103#1;havoc main_#t~nondet103#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;main_~tmp___4~0#1 := main_#t~nondet104#1;havoc main_#t~nondet104#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet105#1;havoc main_#t~nondet105#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0bv32; {1696#true} is VALID [2022-02-20 21:53:28,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {1696#true} assume { :end_inline_ldv_set_init } true; {1696#true} is VALID [2022-02-20 21:53:28,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {1696#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0bv32, 1bv64;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr141#1;#Ultimate.C_memset_#t~loopctr141#1 := 0bv64; {1758#(and (= (_ bv1 64) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= (_ bv0 64) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr141#1|))} is VALID [2022-02-20 21:53:28,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {1758#(and (= (_ bv1 64) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= (_ bv0 64) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr141#1|))} assume !~bvult64(#Ultimate.C_memset_#t~loopctr141#1, #Ultimate.C_memset_#amount#1); {1697#false} is VALID [2022-02-20 21:53:28,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {1697#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset;~ldv_state_variable_1~0 := 0bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 1bv32; {1697#false} is VALID [2022-02-20 21:53:28,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {1697#false} main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0bv32 == main_~tmp___6~0#1; {1697#false} is VALID [2022-02-20 21:53:28,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {1697#false} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1bv32 == main_~tmp___6~0#1; {1697#false} is VALID [2022-02-20 21:53:28,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {1697#false} assume main_#t~switch108#1; {1697#false} is VALID [2022-02-20 21:53:28,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {1697#false} assume 0bv32 != ~ldv_state_variable_0~0;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0bv32 == main_~tmp___8~0#1; {1697#false} is VALID [2022-02-20 21:53:28,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {1697#false} assume main_#t~switch116#1; {1697#false} is VALID [2022-02-20 21:53:28,924 INFO L290 TraceCheckUtils]: 27: Hoare triple {1697#false} assume 3bv32 == ~ldv_state_variable_0~0 && 0bv32 == ~ref_cnt~0;assume { :begin_inline_capmode_module_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;havoc arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset;arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset := arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset; {1697#false} is VALID [2022-02-20 21:53:28,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {1697#false} assume { :end_inline_arcnet_unregister_proto } true; {1697#false} is VALID [2022-02-20 21:53:28,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {1697#false} assume { :end_inline_capmode_module_exit } true;~ldv_state_variable_0~0 := 2bv32; {1697#false} is VALID [2022-02-20 21:53:28,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {1697#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret132#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0bv32 == ~last_index~0 then 1bv32 else 0bv32); {1697#false} is VALID [2022-02-20 21:53:28,925 INFO L290 TraceCheckUtils]: 31: Hoare triple {1697#false} ldv_check_final_state_#t~ret132#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret132#1;havoc ldv_check_final_state_#t~ret132#1; {1697#false} is VALID [2022-02-20 21:53:28,925 INFO L290 TraceCheckUtils]: 32: Hoare triple {1697#false} assume !(0bv32 != ldv_check_final_state_~tmp___7~6#1); {1697#false} is VALID [2022-02-20 21:53:28,925 INFO L272 TraceCheckUtils]: 33: Hoare triple {1697#false} call ldv_error(); {1697#false} is VALID [2022-02-20 21:53:28,925 INFO L290 TraceCheckUtils]: 34: Hoare triple {1697#false} assume !false; {1697#false} is VALID [2022-02-20 21:53:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:53:28,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:53:28,926 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:53:28,926 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289518348] [2022-02-20 21:53:28,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [289518348] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:28,926 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:28,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 21:53:28,927 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533801217] [2022-02-20 21:53:28,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:28,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-02-20 21:53:28,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:28,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:28,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:28,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:53:28,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:53:28,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:53:28,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:53:28,964 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:34,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:34,507 INFO L93 Difference]: Finished difference Result 428 states and 569 transitions. [2022-02-20 21:53:34,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:53:34,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-02-20 21:53:34,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions. [2022-02-20 21:53:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions. [2022-02-20 21:53:34,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 569 transitions. [2022-02-20 21:53:35,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 569 edges. 569 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:35,191 INFO L225 Difference]: With dead ends: 428 [2022-02-20 21:53:35,191 INFO L226 Difference]: Without dead ends: 218 [2022-02-20 21:53:35,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:53:35,192 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:53:35,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 572 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:53:35,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-02-20 21:53:35,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-02-20 21:53:35,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:53:35,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand has 218 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 states have internal predecessors, (216), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-02-20 21:53:35,216 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand has 218 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 states have internal predecessors, (216), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-02-20 21:53:35,217 INFO L87 Difference]: Start difference. First operand 218 states. Second operand has 218 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 states have internal predecessors, (216), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-02-20 21:53:35,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:35,223 INFO L93 Difference]: Finished difference Result 218 states and 289 transitions. [2022-02-20 21:53:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 289 transitions. [2022-02-20 21:53:35,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:35,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:35,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 218 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 states have internal predecessors, (216), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 218 states. [2022-02-20 21:53:35,224 INFO L87 Difference]: Start difference. First operand has 218 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 states have internal predecessors, (216), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 218 states. [2022-02-20 21:53:35,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:35,230 INFO L93 Difference]: Finished difference Result 218 states and 289 transitions. [2022-02-20 21:53:35,230 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 289 transitions. [2022-02-20 21:53:35,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:35,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:35,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:53:35,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:53:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 states have internal predecessors, (216), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-02-20 21:53:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 289 transitions. [2022-02-20 21:53:35,238 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 289 transitions. Word has length 35 [2022-02-20 21:53:35,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:53:35,238 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 289 transitions. [2022-02-20 21:53:35,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:35,239 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 289 transitions. [2022-02-20 21:53:35,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 21:53:35,239 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:35,239 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:53:35,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 21:53:35,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 21:53:35,448 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:35,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:35,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1435931756, now seen corresponding path program 1 times [2022-02-20 21:53:35,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:53:35,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99073584] [2022-02-20 21:53:35,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:35,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:53:35,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:53:35,450 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 21:53:35,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 21:53:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:35,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 21:53:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:35,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:53:35,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {3132#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(103bv64, 2bv64);call #Ultimate.allocInit(41bv64, 3bv64);call #Ultimate.allocInit(2bv64, 4bv64);call write~init~intINTTYPE1(12bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 1bv64, 1bv64);call #Ultimate.allocInit(44bv64, 5bv64);call #Ultimate.allocInit(2bv64, 6bv64);call write~init~intINTTYPE1(14bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 1bv64, 1bv64);call #Ultimate.allocInit(35bv64, 7bv64);call #Ultimate.allocInit(2bv64, 8bv64);call write~init~intINTTYPE1(14bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 1bv64, 1bv64);call #Ultimate.allocInit(45bv64, 9bv64);call #Ultimate.allocInit(2bv64, 10bv64);call write~init~intINTTYPE1(12bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 1bv64, 1bv64);call #Ultimate.allocInit(43bv64, 11bv64);call #Ultimate.allocInit(2bv64, 12bv64);call write~init~intINTTYPE1(12bv8, 12bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 12bv64, 1bv64, 1bv64);call #Ultimate.allocInit(40bv64, 13bv64);call #Ultimate.allocInit(2bv64, 14bv64);call write~init~intINTTYPE1(14bv8, 14bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 14bv64, 1bv64, 1bv64);call #Ultimate.allocInit(54bv64, 15bv64);~LDV_IN_INTERRUPT~0 := 1bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_1~0 := 0bv32;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := 0bv64, 0bv64;~ldv_state_variable_0~0 := 0bv32;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := 0bv64, 0bv64;~#capmode_proto~0.base, ~#capmode_proto~0.offset := 16bv64, 0bv64;call #Ultimate.allocInit(49bv64, 16bv64);call write~init~intINTTYPE1(114bv8, ~#capmode_proto~0.base, ~#capmode_proto~0.offset, 1bv64);call write~init~intINTTYPE4(508bv32, ~#capmode_proto~0.base, ~bvadd64(1bv64, ~#capmode_proto~0.offset), 4bv64);call write~init~intINTTYPE4(0bv32, ~#capmode_proto~0.base, ~bvadd64(5bv64, ~#capmode_proto~0.offset), 4bv64);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#capmode_proto~0.base, ~bvadd64(9bv64, ~#capmode_proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#capmode_proto~0.base, ~bvadd64(17bv64, ~#capmode_proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#capmode_proto~0.base, ~bvadd64(25bv64, ~#capmode_proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#capmode_proto~0.base, ~bvadd64(33bv64, ~#capmode_proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~ack_tx.base, #funAddr~ack_tx.offset, ~#capmode_proto~0.base, ~bvadd64(41bv64, ~#capmode_proto~0.offset), 8bv64);~ldv_retval_0~0 := 0bv32;~#set_impl~0.base, ~#set_impl~0.offset := 17bv64, 0bv64;call #Ultimate.allocInit(120bv64, 17bv64);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0bv32;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0bv64, 0bv64; {3132#true} is VALID [2022-02-20 21:53:35,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {3132#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet99#1, main_#t~ret100#1.base, main_#t~ret100#1.offset, main_#t~nondet101#1, main_#t~nondet102#1, main_#t~nondet103#1, main_#t~nondet104#1, main_#t~nondet105#1, main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset, main_#t~nondet107#1, main_#t~switch108#1, main_#t~nondet109#1, main_#t~switch110#1, main_#t~ret111#1, main_#t~ret112#1, main_#t~mem113#1, main_#t~ret114#1, main_#t~nondet115#1, main_#t~switch116#1, main_#t~ret117#1, main_~ldvarg7~0#1, main_~tmp~9#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~0#1, main_~ldvarg5~0#1, main_~tmp___2~0#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~9#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1bv64);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;main_~tmp~9#1 := main_#t~nondet99#1;havoc main_#t~nondet99#1;main_~ldvarg7~0#1 := main_~tmp~9#1; {3132#true} is VALID [2022-02-20 21:53:35,712 INFO L272 TraceCheckUtils]: 2: Hoare triple {3132#true} call main_#t~ret100#1.base, main_#t~ret100#1.offset := ldv_successful_zalloc(232bv64); {3132#true} is VALID [2022-02-20 21:53:35,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {3132#true} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {3132#true} is VALID [2022-02-20 21:53:35,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {3132#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1bv64, ~__size, ~__size); {3132#true} is VALID [2022-02-20 21:53:35,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {3132#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3132#true} is VALID [2022-02-20 21:53:35,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 21:53:35,713 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3132#true} {3132#true} #537#return; {3132#true} is VALID [2022-02-20 21:53:35,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {3132#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {3132#true} is VALID [2022-02-20 21:53:35,714 INFO L272 TraceCheckUtils]: 9: Hoare triple {3132#true} call assume_abort_if_not((if ~p~0.base != 0bv64 || ~p~0.offset != 0bv64 then 1bv32 else 0bv32)); {3132#true} is VALID [2022-02-20 21:53:35,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 21:53:35,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {3132#true} assume !(0bv32 == ~cond); {3132#true} is VALID [2022-02-20 21:53:35,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 21:53:35,714 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3132#true} {3132#true} #539#return; {3132#true} is VALID [2022-02-20 21:53:35,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {3132#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {3132#true} is VALID [2022-02-20 21:53:35,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 21:53:35,715 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3132#true} {3132#true} #543#return; {3132#true} is VALID [2022-02-20 21:53:35,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {3132#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret100#1.base, main_#t~ret100#1.offset;havoc main_#t~ret100#1.base, main_#t~ret100#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;main_~tmp___1~0#1 := main_#t~nondet101#1;havoc main_#t~nondet101#1;main_~ldvarg0~0#1 := main_~tmp___1~0#1;main_~tmp___2~0#1 := main_#t~nondet102#1;havoc main_#t~nondet102#1;main_~ldvarg5~0#1 := main_~tmp___2~0#1;main_~tmp___3~0#1 := main_#t~nondet103#1;havoc main_#t~nondet103#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;main_~tmp___4~0#1 := main_#t~nondet104#1;havoc main_#t~nondet104#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet105#1;havoc main_#t~nondet105#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0bv32; {3132#true} is VALID [2022-02-20 21:53:35,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {3132#true} assume { :end_inline_ldv_set_init } true; {3132#true} is VALID [2022-02-20 21:53:35,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {3132#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0bv32, 1bv64;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr141#1;#Ultimate.C_memset_#t~loopctr141#1 := 0bv64; {3132#true} is VALID [2022-02-20 21:53:35,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {3132#true} assume ~bvult64(#Ultimate.C_memset_#t~loopctr141#1, #Ultimate.C_memset_#amount#1);#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd64(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr141#1) := 0bv64], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd64(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr141#1) := ~zero_extendFrom8To64(#Ultimate.C_memset_#value#1[8:0])];#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd64(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr141#1) := #Ultimate.C_memset_#value#1[8:0]];#Ultimate.C_memset_#t~loopctr141#1 := ~bvadd64(1bv64, #Ultimate.C_memset_#t~loopctr141#1); {3132#true} is VALID [2022-02-20 21:53:35,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {3132#true} assume !~bvult64(#Ultimate.C_memset_#t~loopctr141#1, #Ultimate.C_memset_#amount#1); {3132#true} is VALID [2022-02-20 21:53:35,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {3132#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset;~ldv_state_variable_1~0 := 0bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 1bv32; {3203#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 21:53:35,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {3203#(= (_ bv1 32) ~ldv_state_variable_0~0)} main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0bv32 == main_~tmp___6~0#1; {3203#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 21:53:35,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {3203#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1bv32 == main_~tmp___6~0#1; {3203#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 21:53:35,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {3203#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume main_#t~switch108#1; {3203#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 21:53:35,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {3203#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume 0bv32 != ~ldv_state_variable_0~0;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0bv32 == main_~tmp___8~0#1; {3203#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 21:53:35,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {3203#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume main_#t~switch116#1; {3203#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 21:53:35,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {3203#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume 3bv32 == ~ldv_state_variable_0~0 && 0bv32 == ~ref_cnt~0;assume { :begin_inline_capmode_module_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;havoc arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset;arcnet_unregister_proto_~arg0#1.base, arcnet_unregister_proto_~arg0#1.offset := arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset; {3133#false} is VALID [2022-02-20 21:53:35,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {3133#false} assume { :end_inline_arcnet_unregister_proto } true; {3133#false} is VALID [2022-02-20 21:53:35,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {3133#false} assume { :end_inline_capmode_module_exit } true;~ldv_state_variable_0~0 := 2bv32; {3133#false} is VALID [2022-02-20 21:53:35,721 INFO L290 TraceCheckUtils]: 31: Hoare triple {3133#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret132#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0bv32 == ~last_index~0 then 1bv32 else 0bv32); {3133#false} is VALID [2022-02-20 21:53:35,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {3133#false} ldv_check_final_state_#t~ret132#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret132#1;havoc ldv_check_final_state_#t~ret132#1; {3133#false} is VALID [2022-02-20 21:53:35,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {3133#false} assume !(0bv32 != ldv_check_final_state_~tmp___7~6#1); {3133#false} is VALID [2022-02-20 21:53:35,721 INFO L272 TraceCheckUtils]: 34: Hoare triple {3133#false} call ldv_error(); {3133#false} is VALID [2022-02-20 21:53:35,721 INFO L290 TraceCheckUtils]: 35: Hoare triple {3133#false} assume !false; {3133#false} is VALID [2022-02-20 21:53:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 21:53:35,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:53:35,722 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:53:35,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99073584] [2022-02-20 21:53:35,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99073584] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:35,722 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:35,723 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 21:53:35,723 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126273781] [2022-02-20 21:53:35,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:35,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-02-20 21:53:35,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:35,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:35,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:35,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:53:35,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:53:35,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:53:35,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:53:35,770 INFO L87 Difference]: Start difference. First operand 218 states and 289 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:41,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:41,480 INFO L93 Difference]: Finished difference Result 614 states and 818 transitions. [2022-02-20 21:53:41,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:53:41,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-02-20 21:53:41,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:41,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 817 transitions. [2022-02-20 21:53:41,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:41,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 817 transitions. [2022-02-20 21:53:41,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 817 transitions. [2022-02-20 21:53:42,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 817 edges. 817 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:42,482 INFO L225 Difference]: With dead ends: 614 [2022-02-20 21:53:42,482 INFO L226 Difference]: Without dead ends: 405 [2022-02-20 21:53:42,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:53:42,483 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 254 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:53:42,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 594 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:53:42,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-02-20 21:53:42,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2022-02-20 21:53:42,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:53:42,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 405 states. Second operand has 405 states, 306 states have (on average 1.3006535947712419) internal successors, (398), 306 states have internal predecessors, (398), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-02-20 21:53:42,512 INFO L74 IsIncluded]: Start isIncluded. First operand 405 states. Second operand has 405 states, 306 states have (on average 1.3006535947712419) internal successors, (398), 306 states have internal predecessors, (398), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-02-20 21:53:42,513 INFO L87 Difference]: Start difference. First operand 405 states. Second operand has 405 states, 306 states have (on average 1.3006535947712419) internal successors, (398), 306 states have internal predecessors, (398), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-02-20 21:53:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:42,522 INFO L93 Difference]: Finished difference Result 405 states and 537 transitions. [2022-02-20 21:53:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 537 transitions. [2022-02-20 21:53:42,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:42,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:42,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 405 states, 306 states have (on average 1.3006535947712419) internal successors, (398), 306 states have internal predecessors, (398), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand 405 states. [2022-02-20 21:53:42,525 INFO L87 Difference]: Start difference. First operand has 405 states, 306 states have (on average 1.3006535947712419) internal successors, (398), 306 states have internal predecessors, (398), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand 405 states. [2022-02-20 21:53:42,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:42,546 INFO L93 Difference]: Finished difference Result 405 states and 537 transitions. [2022-02-20 21:53:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 537 transitions. [2022-02-20 21:53:42,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:42,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:42,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:53:42,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:53:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 306 states have (on average 1.3006535947712419) internal successors, (398), 306 states have internal predecessors, (398), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-02-20 21:53:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 537 transitions. [2022-02-20 21:53:42,559 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 537 transitions. Word has length 36 [2022-02-20 21:53:42,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:53:42,561 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 537 transitions. [2022-02-20 21:53:42,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:42,561 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 537 transitions. [2022-02-20 21:53:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 21:53:42,563 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:42,564 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:53:42,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 21:53:42,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 21:53:42,774 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:42,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:42,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1862511787, now seen corresponding path program 1 times [2022-02-20 21:53:42,775 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:53:42,775 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277935022] [2022-02-20 21:53:42,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:42,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:53:42,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:53:42,776 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 21:53:42,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 21:53:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:42,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 21:53:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:42,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:53:43,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {5450#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(103bv64, 2bv64);call #Ultimate.allocInit(41bv64, 3bv64);call #Ultimate.allocInit(2bv64, 4bv64);call write~init~intINTTYPE1(12bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 1bv64, 1bv64);call #Ultimate.allocInit(44bv64, 5bv64);call #Ultimate.allocInit(2bv64, 6bv64);call write~init~intINTTYPE1(14bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 1bv64, 1bv64);call #Ultimate.allocInit(35bv64, 7bv64);call #Ultimate.allocInit(2bv64, 8bv64);call write~init~intINTTYPE1(14bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 1bv64, 1bv64);call #Ultimate.allocInit(45bv64, 9bv64);call #Ultimate.allocInit(2bv64, 10bv64);call write~init~intINTTYPE1(12bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 1bv64, 1bv64);call #Ultimate.allocInit(43bv64, 11bv64);call #Ultimate.allocInit(2bv64, 12bv64);call write~init~intINTTYPE1(12bv8, 12bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 12bv64, 1bv64, 1bv64);call #Ultimate.allocInit(40bv64, 13bv64);call #Ultimate.allocInit(2bv64, 14bv64);call write~init~intINTTYPE1(14bv8, 14bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 14bv64, 1bv64, 1bv64);call #Ultimate.allocInit(54bv64, 15bv64);~LDV_IN_INTERRUPT~0 := 1bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_1~0 := 0bv32;~capmode_proto_group0~0.base, ~capmode_proto_group0~0.offset := 0bv64, 0bv64;~ldv_state_variable_0~0 := 0bv32;~capmode_proto_group1~0.base, ~capmode_proto_group1~0.offset := 0bv64, 0bv64;~#capmode_proto~0.base, ~#capmode_proto~0.offset := 16bv64, 0bv64;call #Ultimate.allocInit(49bv64, 16bv64);call write~init~intINTTYPE1(114bv8, ~#capmode_proto~0.base, ~#capmode_proto~0.offset, 1bv64);call write~init~intINTTYPE4(508bv32, ~#capmode_proto~0.base, ~bvadd64(1bv64, ~#capmode_proto~0.offset), 4bv64);call write~init~intINTTYPE4(0bv32, ~#capmode_proto~0.base, ~bvadd64(5bv64, ~#capmode_proto~0.offset), 4bv64);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#capmode_proto~0.base, ~bvadd64(9bv64, ~#capmode_proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#capmode_proto~0.base, ~bvadd64(17bv64, ~#capmode_proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#capmode_proto~0.base, ~bvadd64(25bv64, ~#capmode_proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#capmode_proto~0.base, ~bvadd64(33bv64, ~#capmode_proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~ack_tx.base, #funAddr~ack_tx.offset, ~#capmode_proto~0.base, ~bvadd64(41bv64, ~#capmode_proto~0.offset), 8bv64);~ldv_retval_0~0 := 0bv32;~#set_impl~0.base, ~#set_impl~0.offset := 17bv64, 0bv64;call #Ultimate.allocInit(120bv64, 17bv64);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0bv32;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0bv64, 0bv64; {5450#true} is VALID [2022-02-20 21:53:43,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {5450#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet99#1, main_#t~ret100#1.base, main_#t~ret100#1.offset, main_#t~nondet101#1, main_#t~nondet102#1, main_#t~nondet103#1, main_#t~nondet104#1, main_#t~nondet105#1, main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset, main_#t~nondet107#1, main_#t~switch108#1, main_#t~nondet109#1, main_#t~switch110#1, main_#t~ret111#1, main_#t~ret112#1, main_#t~mem113#1, main_#t~ret114#1, main_#t~nondet115#1, main_#t~switch116#1, main_#t~ret117#1, main_~ldvarg7~0#1, main_~tmp~9#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset, main_~ldvarg0~0#1, main_~tmp___1~0#1, main_~ldvarg5~0#1, main_~tmp___2~0#1, main_~ldvarg6~0#1, main_~tmp___3~0#1, main_~ldvarg1~0#1, main_~tmp___4~0#1, main_~ldvarg4~0#1, main_~tmp___5~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;havoc main_~ldvarg7~0#1;havoc main_~tmp~9#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___4~0#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___5~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1bv64);havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;main_~tmp~9#1 := main_#t~nondet99#1;havoc main_#t~nondet99#1;main_~ldvarg7~0#1 := main_~tmp~9#1; {5450#true} is VALID [2022-02-20 21:53:43,045 INFO L272 TraceCheckUtils]: 2: Hoare triple {5450#true} call main_#t~ret100#1.base, main_#t~ret100#1.offset := ldv_successful_zalloc(232bv64); {5450#true} is VALID [2022-02-20 21:53:43,046 INFO L290 TraceCheckUtils]: 3: Hoare triple {5450#true} ~__size := #in~__size;call #t~malloc22.base, #t~malloc22.offset := #Ultimate.allocOnHeap(~__size); {5450#true} is VALID [2022-02-20 21:53:43,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {5450#true} call #Ultimate.meminit(#t~malloc22.base, #t~malloc22.offset, 1bv64, ~__size, ~__size); {5450#true} is VALID [2022-02-20 21:53:43,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {5450#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5450#true} is VALID [2022-02-20 21:53:43,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {5450#true} assume true; {5450#true} is VALID [2022-02-20 21:53:43,046 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5450#true} {5450#true} #537#return; {5450#true} is VALID [2022-02-20 21:53:43,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {5450#true} ~p~0.base, ~p~0.offset := #t~malloc22.base, #t~malloc22.offset; {5450#true} is VALID [2022-02-20 21:53:43,046 INFO L272 TraceCheckUtils]: 9: Hoare triple {5450#true} call assume_abort_if_not((if ~p~0.base != 0bv64 || ~p~0.offset != 0bv64 then 1bv32 else 0bv32)); {5450#true} is VALID [2022-02-20 21:53:43,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {5450#true} ~cond := #in~cond; {5450#true} is VALID [2022-02-20 21:53:43,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {5450#true} assume !(0bv32 == ~cond); {5450#true} is VALID [2022-02-20 21:53:43,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {5450#true} assume true; {5450#true} is VALID [2022-02-20 21:53:43,047 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5450#true} {5450#true} #539#return; {5450#true} is VALID [2022-02-20 21:53:43,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {5450#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {5450#true} is VALID [2022-02-20 21:53:43,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {5450#true} assume true; {5450#true} is VALID [2022-02-20 21:53:43,048 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5450#true} {5450#true} #543#return; {5450#true} is VALID [2022-02-20 21:53:43,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {5450#true} main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset := main_#t~ret100#1.base, main_#t~ret100#1.offset;havoc main_#t~ret100#1.base, main_#t~ret100#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~5#1.base, main_~tmp___0~5#1.offset;main_~tmp___1~0#1 := main_#t~nondet101#1;havoc main_#t~nondet101#1;main_~ldvarg0~0#1 := main_~tmp___1~0#1;main_~tmp___2~0#1 := main_#t~nondet102#1;havoc main_#t~nondet102#1;main_~ldvarg5~0#1 := main_~tmp___2~0#1;main_~tmp___3~0#1 := main_#t~nondet103#1;havoc main_#t~nondet103#1;main_~ldvarg6~0#1 := main_~tmp___3~0#1;main_~tmp___4~0#1 := main_#t~nondet104#1;havoc main_#t~nondet104#1;main_~ldvarg1~0#1 := main_~tmp___4~0#1;main_~tmp___5~0#1 := main_#t~nondet105#1;havoc main_#t~nondet105#1;main_~ldvarg4~0#1 := main_~tmp___5~0#1;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0bv32; {5450#true} is VALID [2022-02-20 21:53:43,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {5450#true} assume { :end_inline_ldv_set_init } true; {5450#true} is VALID [2022-02-20 21:53:43,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {5450#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0bv32, 1bv64;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr141#1;#Ultimate.C_memset_#t~loopctr141#1 := 0bv64; {5450#true} is VALID [2022-02-20 21:53:43,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {5450#true} assume ~bvult64(#Ultimate.C_memset_#t~loopctr141#1, #Ultimate.C_memset_#amount#1);#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd64(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr141#1) := 0bv64], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd64(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr141#1) := ~zero_extendFrom8To64(#Ultimate.C_memset_#value#1[8:0])];#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd64(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr141#1) := #Ultimate.C_memset_#value#1[8:0]];#Ultimate.C_memset_#t~loopctr141#1 := ~bvadd64(1bv64, #Ultimate.C_memset_#t~loopctr141#1); {5450#true} is VALID [2022-02-20 21:53:43,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {5450#true} assume !~bvult64(#Ultimate.C_memset_#t~loopctr141#1, #Ultimate.C_memset_#amount#1); {5450#true} is VALID [2022-02-20 21:53:43,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {5450#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res106#1.base, main_#t~memset~res106#1.offset;~ldv_state_variable_1~0 := 0bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 1bv32; {5450#true} is VALID [2022-02-20 21:53:43,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {5450#true} main_~tmp___6~0#1 := main_#t~nondet107#1;havoc main_#t~nondet107#1;main_#t~switch108#1 := 0bv32 == main_~tmp___6~0#1; {5450#true} is VALID [2022-02-20 21:53:43,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {5450#true} assume !main_#t~switch108#1;main_#t~switch108#1 := main_#t~switch108#1 || 1bv32 == main_~tmp___6~0#1; {5450#true} is VALID [2022-02-20 21:53:43,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {5450#true} assume main_#t~switch108#1; {5450#true} is VALID [2022-02-20 21:53:43,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {5450#true} assume 0bv32 != ~ldv_state_variable_0~0;main_~tmp___8~0#1 := main_#t~nondet115#1;havoc main_#t~nondet115#1;main_#t~switch116#1 := 0bv32 == main_~tmp___8~0#1; {5450#true} is VALID [2022-02-20 21:53:43,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {5450#true} assume !main_#t~switch116#1;main_#t~switch116#1 := main_#t~switch116#1 || 1bv32 == main_~tmp___8~0#1; {5450#true} is VALID [2022-02-20 21:53:43,049 INFO L290 TraceCheckUtils]: 28: Hoare triple {5450#true} assume main_#t~switch116#1; {5450#true} is VALID [2022-02-20 21:53:43,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {5450#true} assume 1bv32 == ~ldv_state_variable_0~0;assume { :begin_inline_capmode_module_init } true;havoc capmode_module_init_#res#1;havoc capmode_module_init_#t~nondet96#1;havoc capmode_module_init_#t~nondet96#1;assume { :begin_inline_arcnet_cap_init } true;havoc arcnet_cap_init_#t~mem95#1.base, arcnet_cap_init_#t~mem95#1.offset, arcnet_cap_init_~count~0#1;havoc arcnet_cap_init_~count~0#1;arcnet_cap_init_~count~0#1 := 1bv32; {5542#(= (_ bv1 32) |ULTIMATE.start_arcnet_cap_init_~count~0#1|)} is VALID [2022-02-20 21:53:43,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {5542#(= (_ bv1 32) |ULTIMATE.start_arcnet_cap_init_~count~0#1|)} assume !~bvsle32(arcnet_cap_init_~count~0#1, 8bv32); {5451#false} is VALID [2022-02-20 21:53:43,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {5451#false} assume ~bvadd64(~arc_bcast_proto~0.base, ~arc_bcast_proto~0.offset) == ~bvadd64(~arc_proto_default~0.base, ~arc_proto_default~0.offset);~arc_bcast_proto~0.base, ~arc_bcast_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {5451#false} is VALID [2022-02-20 21:53:43,051 INFO L290 TraceCheckUtils]: 32: Hoare triple {5451#false} ~arc_proto_default~0.base, ~arc_proto_default~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset;~arc_raw_proto~0.base, ~arc_raw_proto~0.offset := ~#capmode_proto~0.base, ~#capmode_proto~0.offset; {5451#false} is VALID [2022-02-20 21:53:43,051 INFO L290 TraceCheckUtils]: 33: Hoare triple {5451#false} assume { :end_inline_arcnet_cap_init } true;capmode_module_init_#res#1 := 0bv32; {5451#false} is VALID [2022-02-20 21:53:43,051 INFO L290 TraceCheckUtils]: 34: Hoare triple {5451#false} main_#t~ret117#1 := capmode_module_init_#res#1;assume { :end_inline_capmode_module_init } true;~ldv_retval_0~0 := main_#t~ret117#1;havoc main_#t~ret117#1; {5451#false} is VALID [2022-02-20 21:53:43,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {5451#false} assume !(0bv32 == ~ldv_retval_0~0); {5451#false} is VALID [2022-02-20 21:53:43,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {5451#false} assume 0bv32 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2bv32; {5451#false} is VALID [2022-02-20 21:53:43,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {5451#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret132#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0bv32 == ~last_index~0 then 1bv32 else 0bv32); {5451#false} is VALID [2022-02-20 21:53:43,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {5451#false} ldv_check_final_state_#t~ret132#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret132#1;havoc ldv_check_final_state_#t~ret132#1; {5451#false} is VALID [2022-02-20 21:53:43,052 INFO L290 TraceCheckUtils]: 39: Hoare triple {5451#false} assume !(0bv32 != ldv_check_final_state_~tmp___7~6#1); {5451#false} is VALID [2022-02-20 21:53:43,052 INFO L272 TraceCheckUtils]: 40: Hoare triple {5451#false} call ldv_error(); {5451#false} is VALID [2022-02-20 21:53:43,052 INFO L290 TraceCheckUtils]: 41: Hoare triple {5451#false} assume !false; {5451#false} is VALID [2022-02-20 21:53:43,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 21:53:43,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:53:43,053 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:53:43,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1277935022] [2022-02-20 21:53:43,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1277935022] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:43,053 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:43,053 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 21:53:43,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391518800] [2022-02-20 21:53:43,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:43,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2022-02-20 21:53:43,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:43,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:53:43,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:43,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:53:43,092 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:53:43,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:53:43,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:53:43,092 INFO L87 Difference]: Start difference. First operand 405 states and 537 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)