./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--rfc1051.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--rfc1051.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 73b3ed2538f968a3e44c5d7fd04ec7d3b91dc8bba4b6c9eed0228eaab08d1208 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:52:48,541 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:52:48,543 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:52:48,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:52:48,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:52:48,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:52:48,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:52:48,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:52:48,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:52:48,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:52:48,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:52:48,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:52:48,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:52:48,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:52:48,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:52:48,583 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:52:48,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:52:48,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:52:48,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:52:48,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:52:48,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:52:48,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:52:48,591 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:52:48,592 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:52:48,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:52:48,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:52:48,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:52:48,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:52:48,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:52:48,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:52:48,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:52:48,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:52:48,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:52:48,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:52:48,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:52:48,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:52:48,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:52:48,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:52:48,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:52:48,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:52:48,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:52:48,603 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:48,621 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:52:48,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:52:48,621 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:52:48,622 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:52:48,622 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:52:48,623 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:52:48,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:52:48,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:52:48,624 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:52:48,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:52:48,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:52:48,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:52:48,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:52:48,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:52:48,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:52:48,625 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:52:48,626 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:52:48,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:52:48,626 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:52:48,626 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:52:48,626 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:52:48,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:52:48,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:52:48,627 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:52:48,627 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:52:48,628 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:52:48,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:52:48,628 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:52:48,628 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:52:48,629 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:52:48,629 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 -> 73b3ed2538f968a3e44c5d7fd04ec7d3b91dc8bba4b6c9eed0228eaab08d1208 [2022-02-20 21:52:48,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:52:48,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:52:48,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:52:48,892 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:52:48,893 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:52:48,894 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--rfc1051.ko-entry_point.cil.out.i [2022-02-20 21:52:48,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a656c661/5e543c20aa834248a9289e8344e91de7/FLAGf62b54c46 [2022-02-20 21:52:49,591 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:52:49,591 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--rfc1051.ko-entry_point.cil.out.i [2022-02-20 21:52:49,620 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a656c661/5e543c20aa834248a9289e8344e91de7/FLAGf62b54c46 [2022-02-20 21:52:49,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a656c661/5e543c20aa834248a9289e8344e91de7 [2022-02-20 21:52:49,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:52:49,940 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:52:49,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:52:49,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:52:49,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:52:49,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:52:49" (1/1) ... [2022-02-20 21:52:49,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b1c7fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:49, skipping insertion in model container [2022-02-20 21:52:49,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:52:49" (1/1) ... [2022-02-20 21:52:49,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:52:50,028 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:52:50,577 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--rfc1051.ko-entry_point.cil.out.i[153414,153427] [2022-02-20 21:52:50,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:52:50,812 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:52:50,920 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--rfc1051.ko-entry_point.cil.out.i[153414,153427] [2022-02-20 21:52:50,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:52:51,008 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:52:51,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:51 WrapperNode [2022-02-20 21:52:51,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:52:51,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:52:51,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:52:51,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:52:51,017 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:51" (1/1) ... [2022-02-20 21:52:51,052 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:51" (1/1) ... [2022-02-20 21:52:51,114 INFO L137 Inliner]: procedures = 84, calls = 171, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 522 [2022-02-20 21:52:51,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:52:51,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:52:51,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:52:51,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:52:51,124 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:51" (1/1) ... [2022-02-20 21:52:51,125 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:51" (1/1) ... [2022-02-20 21:52:51,143 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:51" (1/1) ... [2022-02-20 21:52:51,144 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:51" (1/1) ... [2022-02-20 21:52:51,197 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:51" (1/1) ... [2022-02-20 21:52:51,203 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:51" (1/1) ... [2022-02-20 21:52:51,221 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:51" (1/1) ... [2022-02-20 21:52:51,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:52:51,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:52:51,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:52:51,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:52:51,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:51" (1/1) ... [2022-02-20 21:52:51,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:52:51,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:52:51,272 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:51,274 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:51,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:52:51,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 21:52:51,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:52:51,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:52:51,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 21:52:51,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 21:52:51,306 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:52:51,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:52:51,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:52:51,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 21:52:51,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 21:52:51,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:52:51,307 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-02-20 21:52:51,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-02-20 21:52:51,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 21:52:51,307 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 21:52:51,307 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:52:51,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:52:51,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:52:51,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:52:51,308 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-02-20 21:52:51,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-02-20 21:52:51,309 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_zalloc [2022-02-20 21:52:51,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_zalloc [2022-02-20 21:52:51,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:52:51,309 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:52:51,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:52:51,309 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-02-20 21:52:51,309 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-02-20 21:52:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:52:51,310 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:52:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:52:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:52:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2022-02-20 21:52:51,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2022-02-20 21:52:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 21:52:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:52:51,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:52:51,541 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:52:51,542 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:52:51,665 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:52:52,274 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:52:52,282 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:52:52,283 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 21:52:52,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:52:52 BoogieIcfgContainer [2022-02-20 21:52:52,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:52:52,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:52:52,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:52:52,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:52:52,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:52:49" (1/3) ... [2022-02-20 21:52:52,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304d3f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:52:52, skipping insertion in model container [2022-02-20 21:52:52,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:52:51" (2/3) ... [2022-02-20 21:52:52,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304d3f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:52:52, skipping insertion in model container [2022-02-20 21:52:52,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:52:52" (3/3) ... [2022-02-20 21:52:52,296 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1051.ko-entry_point.cil.out.i [2022-02-20 21:52:52,301 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:52:52,301 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:52:52,353 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:52:52,358 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:52,358 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:52:52,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 146 states have (on average 1.4246575342465753) internal successors, (208), 151 states have internal predecessors, (208), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 21:52:52,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 21:52:52,390 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:52:52,391 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:52,391 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:52:52,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:52:52,398 INFO L85 PathProgramCache]: Analyzing trace with hash 995609139, now seen corresponding path program 1 times [2022-02-20 21:52:52,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:52:52,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881550727] [2022-02-20 21:52:52,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:52:52,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:52:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:52,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:52:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:52,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:52:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:52,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {210#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {186#true} is VALID [2022-02-20 21:52:52,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 21:52:52,718 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {186#true} {186#true} #491#return; {186#true} is VALID [2022-02-20 21:52:52,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:52:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:52,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {186#true} ~cond := #in~cond; {186#true} is VALID [2022-02-20 21:52:52,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#true} assume 0 == ~cond;assume false; {187#false} is VALID [2022-02-20 21:52:52,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {187#false} assume true; {187#false} is VALID [2022-02-20 21:52:52,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {187#false} {186#true} #493#return; {187#false} is VALID [2022-02-20 21:52:52,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {202#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {186#true} is VALID [2022-02-20 21:52:52,733 INFO L272 TraceCheckUtils]: 1: Hoare triple {186#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {210#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:52,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {186#true} is VALID [2022-02-20 21:52:52,733 INFO L290 TraceCheckUtils]: 3: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 21:52:52,734 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {186#true} {186#true} #491#return; {186#true} is VALID [2022-02-20 21:52:52,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {186#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {186#true} is VALID [2022-02-20 21:52:52,734 INFO L272 TraceCheckUtils]: 6: Hoare triple {186#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {186#true} is VALID [2022-02-20 21:52:52,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {186#true} ~cond := #in~cond; {186#true} is VALID [2022-02-20 21:52:52,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#true} assume 0 == ~cond;assume false; {187#false} is VALID [2022-02-20 21:52:52,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {187#false} assume true; {187#false} is VALID [2022-02-20 21:52:52,735 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {187#false} {186#true} #493#return; {187#false} is VALID [2022-02-20 21:52:52,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {187#false} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {187#false} is VALID [2022-02-20 21:52:52,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {187#false} assume true; {187#false} is VALID [2022-02-20 21:52:52,736 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {187#false} {186#true} #497#return; {187#false} is VALID [2022-02-20 21:52:52,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {186#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(71, 3);call #Ultimate.allocInit(41, 4);call #Ultimate.allocInit(2, 5);call write~init~int(12, 5, 0, 1);call write~init~int(0, 5, 1, 1);call #Ultimate.allocInit(54, 6);call #Ultimate.allocInit(2, 7);call write~init~int(12, 7, 0, 1);call write~init~int(0, 7, 1, 1);call #Ultimate.allocInit(45, 8);call #Ultimate.allocInit(2, 9);call write~init~int(12, 9, 0, 1);call write~init~int(0, 9, 1, 1);~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~rfc1051_proto_group0~0.base, ~rfc1051_proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~rfc1051_proto_group1~0.base, ~rfc1051_proto_group1~0.offset := 0, 0;~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset := 10, 0;call #Ultimate.allocInit(49, 10);call write~init~int(115, ~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset, 1);call write~init~int(507, ~#rfc1051_proto~0.base, 1 + ~#rfc1051_proto~0.offset, 4);call write~init~int(1, ~#rfc1051_proto~0.base, 5 + ~#rfc1051_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#rfc1051_proto~0.base, 9 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#rfc1051_proto~0.base, 17 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#rfc1051_proto~0.base, 25 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rfc1051_proto~0.base, 33 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rfc1051_proto~0.base, 41 + ~#rfc1051_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 11, 0;call #Ultimate.allocInit(120, 11);#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; {186#true} is VALID [2022-02-20 21:52:52,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet84#1, main_#t~nondet85#1, main_#t~ret86#1.base, main_#t~ret86#1.offset, main_#t~nondet87#1, main_#t~nondet88#1, main_#t~nondet89#1, main_#t~memset~res90#1.base, main_#t~memset~res90#1.offset, main_#t~nondet91#1, main_#t~switch92#1, main_#t~nondet93#1, main_#t~switch94#1, main_#t~ret95#1, main_#t~mem96#1, main_#t~ret97#1, main_#t~nondet98#1, main_#t~switch99#1, main_#t~ret100#1, main_~ldvarg1~0#1, main_~tmp~8#1, main_~ldvarg4~0#1, main_~tmp___0~3#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset, main_~ldvarg0~0#1, main_~tmp___2~0#1, main_~ldvarg5~0#1, main_~tmp___3~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~ldvarg6~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp~8#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___0~3#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___3~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~ldvarg6~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;assume -2147483648 <= main_#t~nondet84#1 && main_#t~nondet84#1 <= 2147483647;main_~tmp~8#1 := main_#t~nondet84#1;havoc main_#t~nondet84#1;main_~ldvarg1~0#1 := main_~tmp~8#1;main_~tmp___0~3#1 := main_#t~nondet85#1;havoc main_#t~nondet85#1;main_~ldvarg4~0#1 := main_~tmp___0~3#1; {186#true} is VALID [2022-02-20 21:52:52,738 INFO L272 TraceCheckUtils]: 2: Hoare triple {186#true} call main_#t~ret86#1.base, main_#t~ret86#1.offset := ldv_successful_zalloc(232); {202#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:52,739 INFO L290 TraceCheckUtils]: 3: Hoare triple {202#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {186#true} is VALID [2022-02-20 21:52:52,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {186#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {210#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:52,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {210#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {186#true} is VALID [2022-02-20 21:52:52,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 21:52:52,740 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {186#true} {186#true} #491#return; {186#true} is VALID [2022-02-20 21:52:52,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {186#true} is VALID [2022-02-20 21:52:52,741 INFO L272 TraceCheckUtils]: 9: Hoare triple {186#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {186#true} is VALID [2022-02-20 21:52:52,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {186#true} ~cond := #in~cond; {186#true} is VALID [2022-02-20 21:52:52,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {186#true} assume 0 == ~cond;assume false; {187#false} is VALID [2022-02-20 21:52:52,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {187#false} assume true; {187#false} is VALID [2022-02-20 21:52:52,742 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {187#false} {186#true} #493#return; {187#false} is VALID [2022-02-20 21:52:52,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {187#false} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {187#false} is VALID [2022-02-20 21:52:52,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {187#false} assume true; {187#false} is VALID [2022-02-20 21:52:52,743 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {187#false} {186#true} #497#return; {187#false} is VALID [2022-02-20 21:52:52,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {187#false} main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset := main_#t~ret86#1.base, main_#t~ret86#1.offset;havoc main_#t~ret86#1.base, main_#t~ret86#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset;assume -2147483648 <= main_#t~nondet87#1 && main_#t~nondet87#1 <= 2147483647;main_~tmp___2~0#1 := main_#t~nondet87#1;havoc main_#t~nondet87#1;main_~ldvarg0~0#1 := main_~tmp___2~0#1;assume -2147483648 <= main_#t~nondet88#1 && main_#t~nondet88#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet88#1;havoc main_#t~nondet88#1;main_~ldvarg5~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet89#1 && main_#t~nondet89#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet89#1;havoc main_#t~nondet89#1;main_~ldvarg6~0#1 := main_~tmp___4~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; {187#false} is VALID [2022-02-20 21:52:52,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {187#false} assume { :end_inline_ldv_set_init } true; {187#false} is VALID [2022-02-20 21:52:52,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {187#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~loopctr123#1;#Ultimate.C_memset_#t~loopctr123#1 := 0; {187#false} is VALID [2022-02-20 21:52:52,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {187#false} assume !(#Ultimate.C_memset_#t~loopctr123#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {187#false} is VALID [2022-02-20 21:52:52,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {187#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~res90#1.base, main_#t~memset~res90#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~res90#1.base, main_#t~memset~res90#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {187#false} is VALID [2022-02-20 21:52:52,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {187#false} assume -2147483648 <= main_#t~nondet91#1 && main_#t~nondet91#1 <= 2147483647;main_~tmp___5~0#1 := main_#t~nondet91#1;havoc main_#t~nondet91#1;main_#t~switch92#1 := 0 == main_~tmp___5~0#1; {187#false} is VALID [2022-02-20 21:52:52,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {187#false} assume !main_#t~switch92#1;main_#t~switch92#1 := main_#t~switch92#1 || 1 == main_~tmp___5~0#1; {187#false} is VALID [2022-02-20 21:52:52,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {187#false} assume main_#t~switch92#1; {187#false} is VALID [2022-02-20 21:52:52,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {187#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet98#1 && main_#t~nondet98#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet98#1;havoc main_#t~nondet98#1;main_#t~switch99#1 := 0 == main_~tmp___7~0#1; {187#false} is VALID [2022-02-20 21:52:52,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {187#false} assume main_#t~switch99#1; {187#false} is VALID [2022-02-20 21:52:52,746 INFO L290 TraceCheckUtils]: 27: Hoare triple {187#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_arcnet_rfc1051_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#rfc1051_proto~0.base, ~#rfc1051_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; {187#false} is VALID [2022-02-20 21:52:52,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {187#false} assume { :end_inline_arcnet_unregister_proto } true; {187#false} is VALID [2022-02-20 21:52:52,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {187#false} assume { :end_inline_arcnet_rfc1051_exit } true;~ldv_state_variable_0~0 := 2; {187#false} is VALID [2022-02-20 21:52:52,747 INFO L290 TraceCheckUtils]: 30: Hoare triple {187#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret114#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); {187#false} is VALID [2022-02-20 21:52:52,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {187#false} ldv_check_final_state_#t~ret114#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret114#1 && ldv_check_final_state_#t~ret114#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret114#1;havoc ldv_check_final_state_#t~ret114#1; {187#false} is VALID [2022-02-20 21:52:52,747 INFO L290 TraceCheckUtils]: 32: Hoare triple {187#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {187#false} is VALID [2022-02-20 21:52:52,748 INFO L272 TraceCheckUtils]: 33: Hoare triple {187#false} call ldv_error(); {187#false} is VALID [2022-02-20 21:52:52,748 INFO L290 TraceCheckUtils]: 34: Hoare triple {187#false} assume !false; {187#false} is VALID [2022-02-20 21:52:52,748 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:52,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:52:52,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881550727] [2022-02-20 21:52:52,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881550727] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:52:52,750 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:52:52,750 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:52:52,751 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745941392] [2022-02-20 21:52:52,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:52:52,756 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:52,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:52:52,766 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:52,804 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:52,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:52:52,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:52:52,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:52:52,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:52:52,839 INFO L87 Difference]: Start difference. First operand has 183 states, 146 states have (on average 1.4246575342465753) internal successors, (208), 151 states have internal predecessors, (208), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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:53,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:53,521 INFO L93 Difference]: Finished difference Result 373 states and 538 transitions. [2022-02-20 21:52:53,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 21:52:53,521 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:53,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:52:53,523 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:53,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2022-02-20 21:52:53,540 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:53,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2022-02-20 21:52:53,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 538 transitions. [2022-02-20 21:52:54,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 538 edges. 538 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:54,112 INFO L225 Difference]: With dead ends: 373 [2022-02-20 21:52:54,112 INFO L226 Difference]: Without dead ends: 185 [2022-02-20 21:52:54,115 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:54,118 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 64 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:52:54,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 383 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 21:52:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-02-20 21:52:54,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 173. [2022-02-20 21:52:54,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:52:54,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 173 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 141 states have internal predecessors, (191), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-02-20 21:52:54,160 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 173 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 141 states have internal predecessors, (191), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-02-20 21:52:54,164 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 173 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 141 states have internal predecessors, (191), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-02-20 21:52:54,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:54,182 INFO L93 Difference]: Finished difference Result 185 states and 252 transitions. [2022-02-20 21:52:54,182 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 252 transitions. [2022-02-20 21:52:54,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:54,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:54,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 141 states have internal predecessors, (191), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 185 states. [2022-02-20 21:52:54,190 INFO L87 Difference]: Start difference. First operand has 173 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 141 states have internal predecessors, (191), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 185 states. [2022-02-20 21:52:54,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:54,204 INFO L93 Difference]: Finished difference Result 185 states and 252 transitions. [2022-02-20 21:52:54,204 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 252 transitions. [2022-02-20 21:52:54,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:54,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:54,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:52:54,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:52:54,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 141 states have internal predecessors, (191), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-02-20 21:52:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 234 transitions. [2022-02-20 21:52:54,227 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 234 transitions. Word has length 35 [2022-02-20 21:52:54,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:52:54,229 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 234 transitions. [2022-02-20 21:52:54,229 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:54,230 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 234 transitions. [2022-02-20 21:52:54,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 21:52:54,232 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:52:54,232 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:54,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:52:54,233 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:52:54,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:52:54,233 INFO L85 PathProgramCache]: Analyzing trace with hash 861595633, now seen corresponding path program 1 times [2022-02-20 21:52:54,234 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:52:54,234 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474112135] [2022-02-20 21:52:54,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:52:54,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:52:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:54,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:52:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:54,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:52:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:54,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {1348#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1323#true} is VALID [2022-02-20 21:52:54,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {1323#true} assume true; {1323#true} is VALID [2022-02-20 21:52:54,371 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1323#true} {1323#true} #491#return; {1323#true} is VALID [2022-02-20 21:52:54,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:52:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:54,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {1323#true} ~cond := #in~cond; {1323#true} is VALID [2022-02-20 21:52:54,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {1323#true} assume !(0 == ~cond); {1323#true} is VALID [2022-02-20 21:52:54,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {1323#true} assume true; {1323#true} is VALID [2022-02-20 21:52:54,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1323#true} {1323#true} #493#return; {1323#true} is VALID [2022-02-20 21:52:54,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {1340#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {1323#true} is VALID [2022-02-20 21:52:54,383 INFO L272 TraceCheckUtils]: 1: Hoare triple {1323#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {1348#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:54,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {1348#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1323#true} is VALID [2022-02-20 21:52:54,384 INFO L290 TraceCheckUtils]: 3: Hoare triple {1323#true} assume true; {1323#true} is VALID [2022-02-20 21:52:54,384 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1323#true} {1323#true} #491#return; {1323#true} is VALID [2022-02-20 21:52:54,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {1323#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {1323#true} is VALID [2022-02-20 21:52:54,385 INFO L272 TraceCheckUtils]: 6: Hoare triple {1323#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {1323#true} is VALID [2022-02-20 21:52:54,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {1323#true} ~cond := #in~cond; {1323#true} is VALID [2022-02-20 21:52:54,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {1323#true} assume !(0 == ~cond); {1323#true} is VALID [2022-02-20 21:52:54,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {1323#true} assume true; {1323#true} is VALID [2022-02-20 21:52:54,389 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1323#true} {1323#true} #493#return; {1323#true} is VALID [2022-02-20 21:52:54,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {1323#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {1323#true} is VALID [2022-02-20 21:52:54,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {1323#true} assume true; {1323#true} is VALID [2022-02-20 21:52:54,390 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1323#true} {1323#true} #497#return; {1323#true} is VALID [2022-02-20 21:52:54,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {1323#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(71, 3);call #Ultimate.allocInit(41, 4);call #Ultimate.allocInit(2, 5);call write~init~int(12, 5, 0, 1);call write~init~int(0, 5, 1, 1);call #Ultimate.allocInit(54, 6);call #Ultimate.allocInit(2, 7);call write~init~int(12, 7, 0, 1);call write~init~int(0, 7, 1, 1);call #Ultimate.allocInit(45, 8);call #Ultimate.allocInit(2, 9);call write~init~int(12, 9, 0, 1);call write~init~int(0, 9, 1, 1);~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~rfc1051_proto_group0~0.base, ~rfc1051_proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~rfc1051_proto_group1~0.base, ~rfc1051_proto_group1~0.offset := 0, 0;~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset := 10, 0;call #Ultimate.allocInit(49, 10);call write~init~int(115, ~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset, 1);call write~init~int(507, ~#rfc1051_proto~0.base, 1 + ~#rfc1051_proto~0.offset, 4);call write~init~int(1, ~#rfc1051_proto~0.base, 5 + ~#rfc1051_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#rfc1051_proto~0.base, 9 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#rfc1051_proto~0.base, 17 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#rfc1051_proto~0.base, 25 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rfc1051_proto~0.base, 33 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rfc1051_proto~0.base, 41 + ~#rfc1051_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 11, 0;call #Ultimate.allocInit(120, 11);#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; {1323#true} is VALID [2022-02-20 21:52:54,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {1323#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet84#1, main_#t~nondet85#1, main_#t~ret86#1.base, main_#t~ret86#1.offset, main_#t~nondet87#1, main_#t~nondet88#1, main_#t~nondet89#1, main_#t~memset~res90#1.base, main_#t~memset~res90#1.offset, main_#t~nondet91#1, main_#t~switch92#1, main_#t~nondet93#1, main_#t~switch94#1, main_#t~ret95#1, main_#t~mem96#1, main_#t~ret97#1, main_#t~nondet98#1, main_#t~switch99#1, main_#t~ret100#1, main_~ldvarg1~0#1, main_~tmp~8#1, main_~ldvarg4~0#1, main_~tmp___0~3#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset, main_~ldvarg0~0#1, main_~tmp___2~0#1, main_~ldvarg5~0#1, main_~tmp___3~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~ldvarg6~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp~8#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___0~3#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___3~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~ldvarg6~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;assume -2147483648 <= main_#t~nondet84#1 && main_#t~nondet84#1 <= 2147483647;main_~tmp~8#1 := main_#t~nondet84#1;havoc main_#t~nondet84#1;main_~ldvarg1~0#1 := main_~tmp~8#1;main_~tmp___0~3#1 := main_#t~nondet85#1;havoc main_#t~nondet85#1;main_~ldvarg4~0#1 := main_~tmp___0~3#1; {1323#true} is VALID [2022-02-20 21:52:54,392 INFO L272 TraceCheckUtils]: 2: Hoare triple {1323#true} call main_#t~ret86#1.base, main_#t~ret86#1.offset := ldv_successful_zalloc(232); {1340#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:54,392 INFO L290 TraceCheckUtils]: 3: Hoare triple {1340#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {1323#true} is VALID [2022-02-20 21:52:54,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {1323#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {1348#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:54,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {1348#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1323#true} is VALID [2022-02-20 21:52:54,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {1323#true} assume true; {1323#true} is VALID [2022-02-20 21:52:54,394 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1323#true} {1323#true} #491#return; {1323#true} is VALID [2022-02-20 21:52:54,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {1323#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {1323#true} is VALID [2022-02-20 21:52:54,394 INFO L272 TraceCheckUtils]: 9: Hoare triple {1323#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {1323#true} is VALID [2022-02-20 21:52:54,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {1323#true} ~cond := #in~cond; {1323#true} is VALID [2022-02-20 21:52:54,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {1323#true} assume !(0 == ~cond); {1323#true} is VALID [2022-02-20 21:52:54,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {1323#true} assume true; {1323#true} is VALID [2022-02-20 21:52:54,395 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1323#true} {1323#true} #493#return; {1323#true} is VALID [2022-02-20 21:52:54,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {1323#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {1323#true} is VALID [2022-02-20 21:52:54,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {1323#true} assume true; {1323#true} is VALID [2022-02-20 21:52:54,396 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1323#true} {1323#true} #497#return; {1323#true} is VALID [2022-02-20 21:52:54,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {1323#true} main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset := main_#t~ret86#1.base, main_#t~ret86#1.offset;havoc main_#t~ret86#1.base, main_#t~ret86#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset;assume -2147483648 <= main_#t~nondet87#1 && main_#t~nondet87#1 <= 2147483647;main_~tmp___2~0#1 := main_#t~nondet87#1;havoc main_#t~nondet87#1;main_~ldvarg0~0#1 := main_~tmp___2~0#1;assume -2147483648 <= main_#t~nondet88#1 && main_#t~nondet88#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet88#1;havoc main_#t~nondet88#1;main_~ldvarg5~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet89#1 && main_#t~nondet89#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet89#1;havoc main_#t~nondet89#1;main_~ldvarg6~0#1 := main_~tmp___4~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; {1323#true} is VALID [2022-02-20 21:52:54,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {1323#true} assume { :end_inline_ldv_set_init } true; {1323#true} is VALID [2022-02-20 21:52:54,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {1323#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~loopctr123#1;#Ultimate.C_memset_#t~loopctr123#1 := 0; {1323#true} is VALID [2022-02-20 21:52:54,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {1323#true} assume !(#Ultimate.C_memset_#t~loopctr123#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {1323#true} is VALID [2022-02-20 21:52:54,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {1323#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~res90#1.base, main_#t~memset~res90#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~res90#1.base, main_#t~memset~res90#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {1339#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:52:54,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {1339#(= ~ldv_state_variable_0~0 1)} assume -2147483648 <= main_#t~nondet91#1 && main_#t~nondet91#1 <= 2147483647;main_~tmp___5~0#1 := main_#t~nondet91#1;havoc main_#t~nondet91#1;main_#t~switch92#1 := 0 == main_~tmp___5~0#1; {1339#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:52:54,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {1339#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch92#1;main_#t~switch92#1 := main_#t~switch92#1 || 1 == main_~tmp___5~0#1; {1339#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:52:54,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {1339#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch92#1; {1339#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:52:54,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {1339#(= ~ldv_state_variable_0~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet98#1 && main_#t~nondet98#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet98#1;havoc main_#t~nondet98#1;main_#t~switch99#1 := 0 == main_~tmp___7~0#1; {1339#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:52:54,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {1339#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch99#1; {1339#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:52:54,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {1339#(= ~ldv_state_variable_0~0 1)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_arcnet_rfc1051_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#rfc1051_proto~0.base, ~#rfc1051_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; {1324#false} is VALID [2022-02-20 21:52:54,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {1324#false} assume { :end_inline_arcnet_unregister_proto } true; {1324#false} is VALID [2022-02-20 21:52:54,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {1324#false} assume { :end_inline_arcnet_rfc1051_exit } true;~ldv_state_variable_0~0 := 2; {1324#false} is VALID [2022-02-20 21:52:54,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {1324#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret114#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); {1324#false} is VALID [2022-02-20 21:52:54,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {1324#false} ldv_check_final_state_#t~ret114#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret114#1 && ldv_check_final_state_#t~ret114#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret114#1;havoc ldv_check_final_state_#t~ret114#1; {1324#false} is VALID [2022-02-20 21:52:54,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {1324#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {1324#false} is VALID [2022-02-20 21:52:54,419 INFO L272 TraceCheckUtils]: 33: Hoare triple {1324#false} call ldv_error(); {1324#false} is VALID [2022-02-20 21:52:54,420 INFO L290 TraceCheckUtils]: 34: Hoare triple {1324#false} assume !false; {1324#false} is VALID [2022-02-20 21:52:54,421 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:54,421 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:52:54,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474112135] [2022-02-20 21:52:54,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474112135] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:52:54,422 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:52:54,422 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:52:54,422 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455328783] [2022-02-20 21:52:54,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:52:54,424 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:54,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:52:54,427 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:54,456 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:54,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:52:54,457 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:52:54,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:52:54,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:52:54,459 INFO L87 Difference]: Start difference. First operand 173 states and 234 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:55,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:55,745 INFO L93 Difference]: Finished difference Result 510 states and 698 transitions. [2022-02-20 21:52:55,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:52:55,746 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:55,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:52:55,746 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:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 698 transitions. [2022-02-20 21:52:55,757 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:55,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 698 transitions. [2022-02-20 21:52:55,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 698 transitions. [2022-02-20 21:52:56,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 698 edges. 698 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:56,371 INFO L225 Difference]: With dead ends: 510 [2022-02-20 21:52:56,372 INFO L226 Difference]: Without dead ends: 345 [2022-02-20 21:52:56,373 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:56,374 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 251 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 21:52:56,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 685 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 21:52:56,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-02-20 21:52:56,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 321. [2022-02-20 21:52:56,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:52:56,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 321 states, 262 states have (on average 1.3587786259541985) internal successors, (356), 262 states have internal predecessors, (356), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 21:52:56,402 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 321 states, 262 states have (on average 1.3587786259541985) internal successors, (356), 262 states have internal predecessors, (356), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 21:52:56,408 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 321 states, 262 states have (on average 1.3587786259541985) internal successors, (356), 262 states have internal predecessors, (356), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 21:52:56,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:56,423 INFO L93 Difference]: Finished difference Result 345 states and 471 transitions. [2022-02-20 21:52:56,423 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 471 transitions. [2022-02-20 21:52:56,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:56,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:56,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 321 states, 262 states have (on average 1.3587786259541985) internal successors, (356), 262 states have internal predecessors, (356), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 345 states. [2022-02-20 21:52:56,428 INFO L87 Difference]: Start difference. First operand has 321 states, 262 states have (on average 1.3587786259541985) internal successors, (356), 262 states have internal predecessors, (356), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 345 states. [2022-02-20 21:52:56,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:56,443 INFO L93 Difference]: Finished difference Result 345 states and 471 transitions. [2022-02-20 21:52:56,443 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 471 transitions. [2022-02-20 21:52:56,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:56,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:56,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:52:56,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:52:56,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 262 states have (on average 1.3587786259541985) internal successors, (356), 262 states have internal predecessors, (356), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 21:52:56,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 435 transitions. [2022-02-20 21:52:56,461 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 435 transitions. Word has length 35 [2022-02-20 21:52:56,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:52:56,461 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 435 transitions. [2022-02-20 21:52:56,462 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:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 435 transitions. [2022-02-20 21:52:56,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 21:52:56,463 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:52:56,463 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] [2022-02-20 21:52:56,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:52:56,464 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:52:56,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:52:56,464 INFO L85 PathProgramCache]: Analyzing trace with hash 32458826, now seen corresponding path program 1 times [2022-02-20 21:52:56,465 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:52:56,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184495957] [2022-02-20 21:52:56,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:52:56,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:52:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:56,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:52:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:56,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:52:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:56,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {3178#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3152#true} is VALID [2022-02-20 21:52:56,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {3152#true} assume true; {3152#true} is VALID [2022-02-20 21:52:56,617 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3152#true} {3152#true} #491#return; {3152#true} is VALID [2022-02-20 21:52:56,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:52:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:56,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~cond := #in~cond; {3152#true} is VALID [2022-02-20 21:52:56,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {3152#true} assume !(0 == ~cond); {3152#true} is VALID [2022-02-20 21:52:56,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {3152#true} assume true; {3152#true} is VALID [2022-02-20 21:52:56,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3152#true} {3152#true} #493#return; {3152#true} is VALID [2022-02-20 21:52:56,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {3170#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {3152#true} is VALID [2022-02-20 21:52:56,624 INFO L272 TraceCheckUtils]: 1: Hoare triple {3152#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {3178#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:56,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {3178#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3152#true} is VALID [2022-02-20 21:52:56,624 INFO L290 TraceCheckUtils]: 3: Hoare triple {3152#true} assume true; {3152#true} is VALID [2022-02-20 21:52:56,625 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3152#true} {3152#true} #491#return; {3152#true} is VALID [2022-02-20 21:52:56,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {3152#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {3152#true} is VALID [2022-02-20 21:52:56,625 INFO L272 TraceCheckUtils]: 6: Hoare triple {3152#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {3152#true} is VALID [2022-02-20 21:52:56,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {3152#true} ~cond := #in~cond; {3152#true} is VALID [2022-02-20 21:52:56,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {3152#true} assume !(0 == ~cond); {3152#true} is VALID [2022-02-20 21:52:56,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {3152#true} assume true; {3152#true} is VALID [2022-02-20 21:52:56,626 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3152#true} {3152#true} #493#return; {3152#true} is VALID [2022-02-20 21:52:56,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {3152#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {3152#true} is VALID [2022-02-20 21:52:56,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {3152#true} assume true; {3152#true} is VALID [2022-02-20 21:52:56,627 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3152#true} {3152#true} #497#return; {3152#true} is VALID [2022-02-20 21:52:56,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#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(71, 3);call #Ultimate.allocInit(41, 4);call #Ultimate.allocInit(2, 5);call write~init~int(12, 5, 0, 1);call write~init~int(0, 5, 1, 1);call #Ultimate.allocInit(54, 6);call #Ultimate.allocInit(2, 7);call write~init~int(12, 7, 0, 1);call write~init~int(0, 7, 1, 1);call #Ultimate.allocInit(45, 8);call #Ultimate.allocInit(2, 9);call write~init~int(12, 9, 0, 1);call write~init~int(0, 9, 1, 1);~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~rfc1051_proto_group0~0.base, ~rfc1051_proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~rfc1051_proto_group1~0.base, ~rfc1051_proto_group1~0.offset := 0, 0;~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset := 10, 0;call #Ultimate.allocInit(49, 10);call write~init~int(115, ~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset, 1);call write~init~int(507, ~#rfc1051_proto~0.base, 1 + ~#rfc1051_proto~0.offset, 4);call write~init~int(1, ~#rfc1051_proto~0.base, 5 + ~#rfc1051_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#rfc1051_proto~0.base, 9 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#rfc1051_proto~0.base, 17 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#rfc1051_proto~0.base, 25 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rfc1051_proto~0.base, 33 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rfc1051_proto~0.base, 41 + ~#rfc1051_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 11, 0;call #Ultimate.allocInit(120, 11);#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; {3152#true} is VALID [2022-02-20 21:52:56,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {3152#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet84#1, main_#t~nondet85#1, main_#t~ret86#1.base, main_#t~ret86#1.offset, main_#t~nondet87#1, main_#t~nondet88#1, main_#t~nondet89#1, main_#t~memset~res90#1.base, main_#t~memset~res90#1.offset, main_#t~nondet91#1, main_#t~switch92#1, main_#t~nondet93#1, main_#t~switch94#1, main_#t~ret95#1, main_#t~mem96#1, main_#t~ret97#1, main_#t~nondet98#1, main_#t~switch99#1, main_#t~ret100#1, main_~ldvarg1~0#1, main_~tmp~8#1, main_~ldvarg4~0#1, main_~tmp___0~3#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset, main_~ldvarg0~0#1, main_~tmp___2~0#1, main_~ldvarg5~0#1, main_~tmp___3~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~ldvarg6~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp~8#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___0~3#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___3~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~ldvarg6~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;assume -2147483648 <= main_#t~nondet84#1 && main_#t~nondet84#1 <= 2147483647;main_~tmp~8#1 := main_#t~nondet84#1;havoc main_#t~nondet84#1;main_~ldvarg1~0#1 := main_~tmp~8#1;main_~tmp___0~3#1 := main_#t~nondet85#1;havoc main_#t~nondet85#1;main_~ldvarg4~0#1 := main_~tmp___0~3#1; {3152#true} is VALID [2022-02-20 21:52:56,628 INFO L272 TraceCheckUtils]: 2: Hoare triple {3152#true} call main_#t~ret86#1.base, main_#t~ret86#1.offset := ldv_successful_zalloc(232); {3170#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:56,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {3170#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {3152#true} is VALID [2022-02-20 21:52:56,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {3152#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {3178#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:56,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {3178#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3152#true} is VALID [2022-02-20 21:52:56,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {3152#true} assume true; {3152#true} is VALID [2022-02-20 21:52:56,630 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3152#true} {3152#true} #491#return; {3152#true} is VALID [2022-02-20 21:52:56,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {3152#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {3152#true} is VALID [2022-02-20 21:52:56,631 INFO L272 TraceCheckUtils]: 9: Hoare triple {3152#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {3152#true} is VALID [2022-02-20 21:52:56,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {3152#true} ~cond := #in~cond; {3152#true} is VALID [2022-02-20 21:52:56,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {3152#true} assume !(0 == ~cond); {3152#true} is VALID [2022-02-20 21:52:56,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {3152#true} assume true; {3152#true} is VALID [2022-02-20 21:52:56,634 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3152#true} {3152#true} #493#return; {3152#true} is VALID [2022-02-20 21:52:56,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {3152#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {3152#true} is VALID [2022-02-20 21:52:56,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {3152#true} assume true; {3152#true} is VALID [2022-02-20 21:52:56,635 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3152#true} {3152#true} #497#return; {3152#true} is VALID [2022-02-20 21:52:56,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {3152#true} main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset := main_#t~ret86#1.base, main_#t~ret86#1.offset;havoc main_#t~ret86#1.base, main_#t~ret86#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset;assume -2147483648 <= main_#t~nondet87#1 && main_#t~nondet87#1 <= 2147483647;main_~tmp___2~0#1 := main_#t~nondet87#1;havoc main_#t~nondet87#1;main_~ldvarg0~0#1 := main_~tmp___2~0#1;assume -2147483648 <= main_#t~nondet88#1 && main_#t~nondet88#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet88#1;havoc main_#t~nondet88#1;main_~ldvarg5~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet89#1 && main_#t~nondet89#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet89#1;havoc main_#t~nondet89#1;main_~ldvarg6~0#1 := main_~tmp___4~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; {3152#true} is VALID [2022-02-20 21:52:56,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {3152#true} assume { :end_inline_ldv_set_init } true; {3152#true} is VALID [2022-02-20 21:52:56,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {3152#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~loopctr123#1;#Ultimate.C_memset_#t~loopctr123#1 := 0; {3152#true} is VALID [2022-02-20 21:52:56,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {3152#true} assume !(#Ultimate.C_memset_#t~loopctr123#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {3152#true} is VALID [2022-02-20 21:52:56,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {3152#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~res90#1.base, main_#t~memset~res90#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~res90#1.base, main_#t~memset~res90#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {3152#true} is VALID [2022-02-20 21:52:56,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {3152#true} assume -2147483648 <= main_#t~nondet91#1 && main_#t~nondet91#1 <= 2147483647;main_~tmp___5~0#1 := main_#t~nondet91#1;havoc main_#t~nondet91#1;main_#t~switch92#1 := 0 == main_~tmp___5~0#1; {3152#true} is VALID [2022-02-20 21:52:56,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {3152#true} assume !main_#t~switch92#1;main_#t~switch92#1 := main_#t~switch92#1 || 1 == main_~tmp___5~0#1; {3152#true} is VALID [2022-02-20 21:52:56,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {3152#true} assume main_#t~switch92#1; {3152#true} is VALID [2022-02-20 21:52:56,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {3152#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet98#1 && main_#t~nondet98#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet98#1;havoc main_#t~nondet98#1;main_#t~switch99#1 := 0 == main_~tmp___7~0#1; {3152#true} is VALID [2022-02-20 21:52:56,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {3152#true} assume !main_#t~switch99#1;main_#t~switch99#1 := main_#t~switch99#1 || 1 == main_~tmp___7~0#1; {3152#true} is VALID [2022-02-20 21:52:56,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {3152#true} assume main_#t~switch99#1; {3152#true} is VALID [2022-02-20 21:52:56,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {3152#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_arcnet_rfc1051_init } true;havoc arcnet_rfc1051_init_#res#1;havoc arcnet_rfc1051_init_#t~nondet26#1, arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset;havoc arcnet_rfc1051_init_#t~nondet26#1;call write~$Pointer$(~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset, ~#arc_proto_map~0.base, 1928 + ~#arc_proto_map~0.offset, 8);call arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1928 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset, ~#arc_proto_map~0.base, 1920 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset; {3152#true} is VALID [2022-02-20 21:52:56,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {3152#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 := ~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset; {3152#true} is VALID [2022-02-20 21:52:56,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {3152#true} arcnet_rfc1051_init_#res#1 := 0; {3168#(= |ULTIMATE.start_arcnet_rfc1051_init_#res#1| 0)} is VALID [2022-02-20 21:52:56,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {3168#(= |ULTIMATE.start_arcnet_rfc1051_init_#res#1| 0)} main_#t~ret100#1 := arcnet_rfc1051_init_#res#1;assume { :end_inline_arcnet_rfc1051_init } true;assume -2147483648 <= main_#t~ret100#1 && main_#t~ret100#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret100#1;havoc main_#t~ret100#1; {3169#(= ~ldv_retval_0~0 0)} is VALID [2022-02-20 21:52:56,640 INFO L290 TraceCheckUtils]: 32: Hoare triple {3169#(= ~ldv_retval_0~0 0)} assume !(0 == ~ldv_retval_0~0); {3153#false} is VALID [2022-02-20 21:52:56,640 INFO L290 TraceCheckUtils]: 33: Hoare triple {3153#false} assume 0 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2; {3153#false} is VALID [2022-02-20 21:52:56,640 INFO L290 TraceCheckUtils]: 34: Hoare triple {3153#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret114#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); {3153#false} is VALID [2022-02-20 21:52:56,641 INFO L290 TraceCheckUtils]: 35: Hoare triple {3153#false} ldv_check_final_state_#t~ret114#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret114#1 && ldv_check_final_state_#t~ret114#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret114#1;havoc ldv_check_final_state_#t~ret114#1; {3153#false} is VALID [2022-02-20 21:52:56,641 INFO L290 TraceCheckUtils]: 36: Hoare triple {3153#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {3153#false} is VALID [2022-02-20 21:52:56,641 INFO L272 TraceCheckUtils]: 37: Hoare triple {3153#false} call ldv_error(); {3153#false} is VALID [2022-02-20 21:52:56,641 INFO L290 TraceCheckUtils]: 38: Hoare triple {3153#false} assume !false; {3153#false} is VALID [2022-02-20 21:52:56,642 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:56,642 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:52:56,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184495957] [2022-02-20 21:52:56,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184495957] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:52:56,643 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:52:56,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:52:56,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187945893] [2022-02-20 21:52:56,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:52:56,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 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 39 [2022-02-20 21:52:56,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:52:56,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 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:56,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:56,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:52:56,673 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:52:56,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:52:56,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:52:56,674 INFO L87 Difference]: Start difference. First operand 321 states and 435 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 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,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:58,039 INFO L93 Difference]: Finished difference Result 657 states and 894 transitions. [2022-02-20 21:52:58,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 21:52:58,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 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 39 [2022-02-20 21:52:58,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:52:58,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 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,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 620 transitions. [2022-02-20 21:52:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 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,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 620 transitions. [2022-02-20 21:52:58,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 620 transitions. [2022-02-20 21:52:58,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 620 edges. 620 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:58,562 INFO L225 Difference]: With dead ends: 657 [2022-02-20 21:52:58,562 INFO L226 Difference]: Without dead ends: 344 [2022-02-20 21:52:58,563 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:52:58,564 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 406 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 21:52:58,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 732 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 21:52:58,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-02-20 21:52:58,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 320. [2022-02-20 21:52:58,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:52:58,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 344 states. Second operand has 320 states, 261 states have (on average 1.3486590038314177) internal successors, (352), 261 states have internal predecessors, (352), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 21:52:58,593 INFO L74 IsIncluded]: Start isIncluded. First operand 344 states. Second operand has 320 states, 261 states have (on average 1.3486590038314177) internal successors, (352), 261 states have internal predecessors, (352), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 21:52:58,594 INFO L87 Difference]: Start difference. First operand 344 states. Second operand has 320 states, 261 states have (on average 1.3486590038314177) internal successors, (352), 261 states have internal predecessors, (352), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 21:52:58,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:58,607 INFO L93 Difference]: Finished difference Result 344 states and 467 transitions. [2022-02-20 21:52:58,607 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 467 transitions. [2022-02-20 21:52:58,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:58,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:58,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 320 states, 261 states have (on average 1.3486590038314177) internal successors, (352), 261 states have internal predecessors, (352), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 344 states. [2022-02-20 21:52:58,611 INFO L87 Difference]: Start difference. First operand has 320 states, 261 states have (on average 1.3486590038314177) internal successors, (352), 261 states have internal predecessors, (352), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 344 states. [2022-02-20 21:52:58,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:58,623 INFO L93 Difference]: Finished difference Result 344 states and 467 transitions. [2022-02-20 21:52:58,624 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 467 transitions. [2022-02-20 21:52:58,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:58,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:58,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:52:58,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:52:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 261 states have (on average 1.3486590038314177) internal successors, (352), 261 states have internal predecessors, (352), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 21:52:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 431 transitions. [2022-02-20 21:52:58,639 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 431 transitions. Word has length 39 [2022-02-20 21:52:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:52:58,640 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 431 transitions. [2022-02-20 21:52:58,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 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,640 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 431 transitions. [2022-02-20 21:52:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 21:52:58,642 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:52:58,642 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 21:52:58,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:52:58,643 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:52:58,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:52:58,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1820755710, now seen corresponding path program 1 times [2022-02-20 21:52:58,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:52:58,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42892217] [2022-02-20 21:52:58,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:52:58,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:52:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:58,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:52:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:58,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:52:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:58,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {5230#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5175#true} is VALID [2022-02-20 21:52:58,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,762 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5175#true} {5175#true} #491#return; {5175#true} is VALID [2022-02-20 21:52:58,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:52:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:58,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {5175#true} ~cond := #in~cond; {5175#true} is VALID [2022-02-20 21:52:58,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {5175#true} assume !(0 == ~cond); {5175#true} is VALID [2022-02-20 21:52:58,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5175#true} {5175#true} #493#return; {5175#true} is VALID [2022-02-20 21:52:58,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {5222#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {5175#true} is VALID [2022-02-20 21:52:58,768 INFO L272 TraceCheckUtils]: 1: Hoare triple {5175#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {5230#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:58,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {5230#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5175#true} is VALID [2022-02-20 21:52:58,769 INFO L290 TraceCheckUtils]: 3: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,769 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5175#true} {5175#true} #491#return; {5175#true} is VALID [2022-02-20 21:52:58,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {5175#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {5175#true} is VALID [2022-02-20 21:52:58,769 INFO L272 TraceCheckUtils]: 6: Hoare triple {5175#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {5175#true} is VALID [2022-02-20 21:52:58,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {5175#true} ~cond := #in~cond; {5175#true} is VALID [2022-02-20 21:52:58,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {5175#true} assume !(0 == ~cond); {5175#true} is VALID [2022-02-20 21:52:58,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,770 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5175#true} {5175#true} #493#return; {5175#true} is VALID [2022-02-20 21:52:58,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {5175#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {5175#true} is VALID [2022-02-20 21:52:58,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,770 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5175#true} {5175#true} #497#return; {5175#true} is VALID [2022-02-20 21:52:58,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 21:52:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:58,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:52:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:58,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {5230#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5175#true} is VALID [2022-02-20 21:52:58,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5175#true} {5175#true} #491#return; {5175#true} is VALID [2022-02-20 21:52:58,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:52:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:58,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {5175#true} ~cond := #in~cond; {5175#true} is VALID [2022-02-20 21:52:58,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {5175#true} assume !(0 == ~cond); {5175#true} is VALID [2022-02-20 21:52:58,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5175#true} {5175#true} #493#return; {5175#true} is VALID [2022-02-20 21:52:58,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {5222#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {5175#true} is VALID [2022-02-20 21:52:58,793 INFO L272 TraceCheckUtils]: 1: Hoare triple {5175#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {5230#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:58,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {5230#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5175#true} is VALID [2022-02-20 21:52:58,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,793 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5175#true} {5175#true} #491#return; {5175#true} is VALID [2022-02-20 21:52:58,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {5175#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {5175#true} is VALID [2022-02-20 21:52:58,794 INFO L272 TraceCheckUtils]: 6: Hoare triple {5175#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {5175#true} is VALID [2022-02-20 21:52:58,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {5175#true} ~cond := #in~cond; {5175#true} is VALID [2022-02-20 21:52:58,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {5175#true} assume !(0 == ~cond); {5175#true} is VALID [2022-02-20 21:52:58,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,794 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5175#true} {5175#true} #493#return; {5175#true} is VALID [2022-02-20 21:52:58,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {5175#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {5175#true} is VALID [2022-02-20 21:52:58,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,795 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5175#true} {5191#(= ~last_index~0 0)} #529#return; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 21:52:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:58,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:52:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:58,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {5230#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5175#true} is VALID [2022-02-20 21:52:58,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,810 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5175#true} {5175#true} #491#return; {5175#true} is VALID [2022-02-20 21:52:58,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:52:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:58,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {5175#true} ~cond := #in~cond; {5175#true} is VALID [2022-02-20 21:52:58,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {5175#true} assume !(0 == ~cond); {5175#true} is VALID [2022-02-20 21:52:58,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5175#true} {5175#true} #493#return; {5175#true} is VALID [2022-02-20 21:52:58,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {5222#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {5175#true} is VALID [2022-02-20 21:52:58,816 INFO L272 TraceCheckUtils]: 1: Hoare triple {5175#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {5230#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:58,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {5230#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5175#true} is VALID [2022-02-20 21:52:58,817 INFO L290 TraceCheckUtils]: 3: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,817 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5175#true} {5175#true} #491#return; {5175#true} is VALID [2022-02-20 21:52:58,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {5175#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {5175#true} is VALID [2022-02-20 21:52:58,817 INFO L272 TraceCheckUtils]: 6: Hoare triple {5175#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {5175#true} is VALID [2022-02-20 21:52:58,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {5175#true} ~cond := #in~cond; {5175#true} is VALID [2022-02-20 21:52:58,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {5175#true} assume !(0 == ~cond); {5175#true} is VALID [2022-02-20 21:52:58,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,818 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5175#true} {5175#true} #493#return; {5175#true} is VALID [2022-02-20 21:52:58,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {5175#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {5175#true} is VALID [2022-02-20 21:52:58,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,819 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5175#true} {5191#(= ~last_index~0 0)} #531#return; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {5175#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(71, 3);call #Ultimate.allocInit(41, 4);call #Ultimate.allocInit(2, 5);call write~init~int(12, 5, 0, 1);call write~init~int(0, 5, 1, 1);call #Ultimate.allocInit(54, 6);call #Ultimate.allocInit(2, 7);call write~init~int(12, 7, 0, 1);call write~init~int(0, 7, 1, 1);call #Ultimate.allocInit(45, 8);call #Ultimate.allocInit(2, 9);call write~init~int(12, 9, 0, 1);call write~init~int(0, 9, 1, 1);~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~rfc1051_proto_group0~0.base, ~rfc1051_proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~rfc1051_proto_group1~0.base, ~rfc1051_proto_group1~0.offset := 0, 0;~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset := 10, 0;call #Ultimate.allocInit(49, 10);call write~init~int(115, ~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset, 1);call write~init~int(507, ~#rfc1051_proto~0.base, 1 + ~#rfc1051_proto~0.offset, 4);call write~init~int(1, ~#rfc1051_proto~0.base, 5 + ~#rfc1051_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#rfc1051_proto~0.base, 9 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#rfc1051_proto~0.base, 17 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#rfc1051_proto~0.base, 25 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rfc1051_proto~0.base, 33 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rfc1051_proto~0.base, 41 + ~#rfc1051_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 11, 0;call #Ultimate.allocInit(120, 11);#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; {5175#true} is VALID [2022-02-20 21:52:58,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {5175#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet84#1, main_#t~nondet85#1, main_#t~ret86#1.base, main_#t~ret86#1.offset, main_#t~nondet87#1, main_#t~nondet88#1, main_#t~nondet89#1, main_#t~memset~res90#1.base, main_#t~memset~res90#1.offset, main_#t~nondet91#1, main_#t~switch92#1, main_#t~nondet93#1, main_#t~switch94#1, main_#t~ret95#1, main_#t~mem96#1, main_#t~ret97#1, main_#t~nondet98#1, main_#t~switch99#1, main_#t~ret100#1, main_~ldvarg1~0#1, main_~tmp~8#1, main_~ldvarg4~0#1, main_~tmp___0~3#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset, main_~ldvarg0~0#1, main_~tmp___2~0#1, main_~ldvarg5~0#1, main_~tmp___3~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~ldvarg6~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp~8#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___0~3#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___3~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~ldvarg6~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;assume -2147483648 <= main_#t~nondet84#1 && main_#t~nondet84#1 <= 2147483647;main_~tmp~8#1 := main_#t~nondet84#1;havoc main_#t~nondet84#1;main_~ldvarg1~0#1 := main_~tmp~8#1;main_~tmp___0~3#1 := main_#t~nondet85#1;havoc main_#t~nondet85#1;main_~ldvarg4~0#1 := main_~tmp___0~3#1; {5175#true} is VALID [2022-02-20 21:52:58,820 INFO L272 TraceCheckUtils]: 2: Hoare triple {5175#true} call main_#t~ret86#1.base, main_#t~ret86#1.offset := ldv_successful_zalloc(232); {5222#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:58,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {5222#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {5175#true} is VALID [2022-02-20 21:52:58,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {5175#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {5230#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:58,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {5230#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5175#true} is VALID [2022-02-20 21:52:58,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,821 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5175#true} {5175#true} #491#return; {5175#true} is VALID [2022-02-20 21:52:58,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {5175#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {5175#true} is VALID [2022-02-20 21:52:58,822 INFO L272 TraceCheckUtils]: 9: Hoare triple {5175#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {5175#true} is VALID [2022-02-20 21:52:58,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {5175#true} ~cond := #in~cond; {5175#true} is VALID [2022-02-20 21:52:58,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {5175#true} assume !(0 == ~cond); {5175#true} is VALID [2022-02-20 21:52:58,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,822 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5175#true} {5175#true} #493#return; {5175#true} is VALID [2022-02-20 21:52:58,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {5175#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {5175#true} is VALID [2022-02-20 21:52:58,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,823 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5175#true} {5175#true} #497#return; {5175#true} is VALID [2022-02-20 21:52:58,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {5175#true} main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset := main_#t~ret86#1.base, main_#t~ret86#1.offset;havoc main_#t~ret86#1.base, main_#t~ret86#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset;assume -2147483648 <= main_#t~nondet87#1 && main_#t~nondet87#1 <= 2147483647;main_~tmp___2~0#1 := main_#t~nondet87#1;havoc main_#t~nondet87#1;main_~ldvarg0~0#1 := main_~tmp___2~0#1;assume -2147483648 <= main_#t~nondet88#1 && main_#t~nondet88#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet88#1;havoc main_#t~nondet88#1;main_~ldvarg5~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet89#1 && main_#t~nondet89#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet89#1;havoc main_#t~nondet89#1;main_~ldvarg6~0#1 := main_~tmp___4~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; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {5191#(= ~last_index~0 0)} assume { :end_inline_ldv_set_init } true; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {5191#(= ~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~loopctr123#1;#Ultimate.C_memset_#t~loopctr123#1 := 0; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {5191#(= ~last_index~0 0)} assume !(#Ultimate.C_memset_#t~loopctr123#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {5191#(= ~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~res90#1.base, main_#t~memset~res90#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~res90#1.base, main_#t~memset~res90#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {5191#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet91#1 && main_#t~nondet91#1 <= 2147483647;main_~tmp___5~0#1 := main_#t~nondet91#1;havoc main_#t~nondet91#1;main_#t~switch92#1 := 0 == main_~tmp___5~0#1; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {5191#(= ~last_index~0 0)} assume !main_#t~switch92#1;main_#t~switch92#1 := main_#t~switch92#1 || 1 == main_~tmp___5~0#1; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {5191#(= ~last_index~0 0)} assume main_#t~switch92#1; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {5191#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet98#1 && main_#t~nondet98#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet98#1;havoc main_#t~nondet98#1;main_#t~switch99#1 := 0 == main_~tmp___7~0#1; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,827 INFO L290 TraceCheckUtils]: 26: Hoare triple {5191#(= ~last_index~0 0)} assume !main_#t~switch99#1;main_#t~switch99#1 := main_#t~switch99#1 || 1 == main_~tmp___7~0#1; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {5191#(= ~last_index~0 0)} assume main_#t~switch99#1; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {5191#(= ~last_index~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_arcnet_rfc1051_init } true;havoc arcnet_rfc1051_init_#res#1;havoc arcnet_rfc1051_init_#t~nondet26#1, arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset;havoc arcnet_rfc1051_init_#t~nondet26#1;call write~$Pointer$(~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset, ~#arc_proto_map~0.base, 1928 + ~#arc_proto_map~0.offset, 8);call arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1928 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset, ~#arc_proto_map~0.base, 1920 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {5191#(= ~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 := ~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {5191#(= ~last_index~0 0)} arcnet_rfc1051_init_#res#1 := 0; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {5191#(= ~last_index~0 0)} main_#t~ret100#1 := arcnet_rfc1051_init_#res#1;assume { :end_inline_arcnet_rfc1051_init } true;assume -2147483648 <= main_#t~ret100#1 && main_#t~ret100#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret100#1;havoc main_#t~ret100#1; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,829 INFO L290 TraceCheckUtils]: 32: Hoare triple {5191#(= ~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~ret82#1.base, ldv_initialize_ArcProto_1_#t~ret82#1.offset, ldv_initialize_ArcProto_1_#t~ret83#1.base, ldv_initialize_ArcProto_1_#t~ret83#1.offset, ldv_initialize_ArcProto_1_~tmp~7#1.base, ldv_initialize_ArcProto_1_~tmp~7#1.offset, ldv_initialize_ArcProto_1_~tmp___0~2#1.base, ldv_initialize_ArcProto_1_~tmp___0~2#1.offset;havoc ldv_initialize_ArcProto_1_~tmp~7#1.base, ldv_initialize_ArcProto_1_~tmp~7#1.offset;havoc ldv_initialize_ArcProto_1_~tmp___0~2#1.base, ldv_initialize_ArcProto_1_~tmp___0~2#1.offset; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,830 INFO L272 TraceCheckUtils]: 33: Hoare triple {5191#(= ~last_index~0 0)} call ldv_initialize_ArcProto_1_#t~ret82#1.base, ldv_initialize_ArcProto_1_#t~ret82#1.offset := ldv_successful_zalloc(20); {5222#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:58,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {5222#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {5175#true} is VALID [2022-02-20 21:52:58,831 INFO L272 TraceCheckUtils]: 35: Hoare triple {5175#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {5230#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:58,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {5230#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5175#true} is VALID [2022-02-20 21:52:58,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,831 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5175#true} {5175#true} #491#return; {5175#true} is VALID [2022-02-20 21:52:58,831 INFO L290 TraceCheckUtils]: 39: Hoare triple {5175#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {5175#true} is VALID [2022-02-20 21:52:58,831 INFO L272 TraceCheckUtils]: 40: Hoare triple {5175#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {5175#true} is VALID [2022-02-20 21:52:58,832 INFO L290 TraceCheckUtils]: 41: Hoare triple {5175#true} ~cond := #in~cond; {5175#true} is VALID [2022-02-20 21:52:58,832 INFO L290 TraceCheckUtils]: 42: Hoare triple {5175#true} assume !(0 == ~cond); {5175#true} is VALID [2022-02-20 21:52:58,832 INFO L290 TraceCheckUtils]: 43: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,832 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5175#true} {5175#true} #493#return; {5175#true} is VALID [2022-02-20 21:52:58,832 INFO L290 TraceCheckUtils]: 45: Hoare triple {5175#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {5175#true} is VALID [2022-02-20 21:52:58,832 INFO L290 TraceCheckUtils]: 46: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,833 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5175#true} {5191#(= ~last_index~0 0)} #529#return; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,833 INFO L290 TraceCheckUtils]: 48: Hoare triple {5191#(= ~last_index~0 0)} ldv_initialize_ArcProto_1_~tmp~7#1.base, ldv_initialize_ArcProto_1_~tmp~7#1.offset := ldv_initialize_ArcProto_1_#t~ret82#1.base, ldv_initialize_ArcProto_1_#t~ret82#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret82#1.base, ldv_initialize_ArcProto_1_#t~ret82#1.offset;~rfc1051_proto_group0~0.base, ~rfc1051_proto_group0~0.offset := ldv_initialize_ArcProto_1_~tmp~7#1.base, ldv_initialize_ArcProto_1_~tmp~7#1.offset; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,834 INFO L272 TraceCheckUtils]: 49: Hoare triple {5191#(= ~last_index~0 0)} call ldv_initialize_ArcProto_1_#t~ret83#1.base, ldv_initialize_ArcProto_1_#t~ret83#1.offset := ldv_successful_zalloc(3264); {5222#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:58,834 INFO L290 TraceCheckUtils]: 50: Hoare triple {5222#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {5175#true} is VALID [2022-02-20 21:52:58,835 INFO L272 TraceCheckUtils]: 51: Hoare triple {5175#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {5230#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:52:58,835 INFO L290 TraceCheckUtils]: 52: Hoare triple {5230#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5175#true} is VALID [2022-02-20 21:52:58,835 INFO L290 TraceCheckUtils]: 53: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,835 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5175#true} {5175#true} #491#return; {5175#true} is VALID [2022-02-20 21:52:58,836 INFO L290 TraceCheckUtils]: 55: Hoare triple {5175#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {5175#true} is VALID [2022-02-20 21:52:58,836 INFO L272 TraceCheckUtils]: 56: Hoare triple {5175#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {5175#true} is VALID [2022-02-20 21:52:58,836 INFO L290 TraceCheckUtils]: 57: Hoare triple {5175#true} ~cond := #in~cond; {5175#true} is VALID [2022-02-20 21:52:58,836 INFO L290 TraceCheckUtils]: 58: Hoare triple {5175#true} assume !(0 == ~cond); {5175#true} is VALID [2022-02-20 21:52:58,836 INFO L290 TraceCheckUtils]: 59: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,836 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5175#true} {5175#true} #493#return; {5175#true} is VALID [2022-02-20 21:52:58,837 INFO L290 TraceCheckUtils]: 61: Hoare triple {5175#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {5175#true} is VALID [2022-02-20 21:52:58,837 INFO L290 TraceCheckUtils]: 62: Hoare triple {5175#true} assume true; {5175#true} is VALID [2022-02-20 21:52:58,837 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {5175#true} {5191#(= ~last_index~0 0)} #531#return; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,838 INFO L290 TraceCheckUtils]: 64: Hoare triple {5191#(= ~last_index~0 0)} ldv_initialize_ArcProto_1_~tmp___0~2#1.base, ldv_initialize_ArcProto_1_~tmp___0~2#1.offset := ldv_initialize_ArcProto_1_#t~ret83#1.base, ldv_initialize_ArcProto_1_#t~ret83#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret83#1.base, ldv_initialize_ArcProto_1_#t~ret83#1.offset;~rfc1051_proto_group1~0.base, ~rfc1051_proto_group1~0.offset := ldv_initialize_ArcProto_1_~tmp___0~2#1.base, ldv_initialize_ArcProto_1_~tmp___0~2#1.offset; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,838 INFO L290 TraceCheckUtils]: 65: Hoare triple {5191#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize_ArcProto_1 } true; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,838 INFO L290 TraceCheckUtils]: 66: Hoare triple {5191#(= ~last_index~0 0)} assume !(0 != ~ldv_retval_0~0); {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,839 INFO L290 TraceCheckUtils]: 67: Hoare triple {5191#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet91#1 && main_#t~nondet91#1 <= 2147483647;main_~tmp___5~0#1 := main_#t~nondet91#1;havoc main_#t~nondet91#1;main_#t~switch92#1 := 0 == main_~tmp___5~0#1; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,839 INFO L290 TraceCheckUtils]: 68: Hoare triple {5191#(= ~last_index~0 0)} assume !main_#t~switch92#1;main_#t~switch92#1 := main_#t~switch92#1 || 1 == main_~tmp___5~0#1; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,839 INFO L290 TraceCheckUtils]: 69: Hoare triple {5191#(= ~last_index~0 0)} assume main_#t~switch92#1; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,840 INFO L290 TraceCheckUtils]: 70: Hoare triple {5191#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet98#1 && main_#t~nondet98#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet98#1;havoc main_#t~nondet98#1;main_#t~switch99#1 := 0 == main_~tmp___7~0#1; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,840 INFO L290 TraceCheckUtils]: 71: Hoare triple {5191#(= ~last_index~0 0)} assume main_#t~switch99#1; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,840 INFO L290 TraceCheckUtils]: 72: Hoare triple {5191#(= ~last_index~0 0)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_arcnet_rfc1051_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#rfc1051_proto~0.base, ~#rfc1051_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; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,841 INFO L290 TraceCheckUtils]: 73: Hoare triple {5191#(= ~last_index~0 0)} assume { :end_inline_arcnet_unregister_proto } true; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,841 INFO L290 TraceCheckUtils]: 74: Hoare triple {5191#(= ~last_index~0 0)} assume { :end_inline_arcnet_rfc1051_exit } true;~ldv_state_variable_0~0 := 2; {5191#(= ~last_index~0 0)} is VALID [2022-02-20 21:52:58,842 INFO L290 TraceCheckUtils]: 75: Hoare triple {5191#(= ~last_index~0 0)} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret114#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); {5220#(<= 1 |ULTIMATE.start_ldv_set_is_empty_#res#1|)} is VALID [2022-02-20 21:52:58,842 INFO L290 TraceCheckUtils]: 76: Hoare triple {5220#(<= 1 |ULTIMATE.start_ldv_set_is_empty_#res#1|)} ldv_check_final_state_#t~ret114#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret114#1 && ldv_check_final_state_#t~ret114#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret114#1;havoc ldv_check_final_state_#t~ret114#1; {5221#(<= 1 |ULTIMATE.start_ldv_check_final_state_~tmp___7~6#1|)} is VALID [2022-02-20 21:52:58,843 INFO L290 TraceCheckUtils]: 77: Hoare triple {5221#(<= 1 |ULTIMATE.start_ldv_check_final_state_~tmp___7~6#1|)} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {5176#false} is VALID [2022-02-20 21:52:58,843 INFO L272 TraceCheckUtils]: 78: Hoare triple {5176#false} call ldv_error(); {5176#false} is VALID [2022-02-20 21:52:58,843 INFO L290 TraceCheckUtils]: 79: Hoare triple {5176#false} assume !false; {5176#false} is VALID [2022-02-20 21:52:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-02-20 21:52:58,844 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:52:58,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42892217] [2022-02-20 21:52:58,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42892217] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:52:58,844 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:52:58,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 21:52:58,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695319147] [2022-02-20 21:52:58,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:52:58,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 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 80 [2022-02-20 21:52:58,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:52:58,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 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:52:58,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:58,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 21:52:58,883 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:52:58,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 21:52:58,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:52:58,884 INFO L87 Difference]: Start difference. First operand 320 states and 431 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 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:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:00,597 INFO L93 Difference]: Finished difference Result 985 states and 1347 transitions. [2022-02-20 21:53:00,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 21:53:00,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 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 80 [2022-02-20 21:53:00,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 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:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 712 transitions. [2022-02-20 21:53:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 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:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 712 transitions. [2022-02-20 21:53:00,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 712 transitions. [2022-02-20 21:53:01,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 712 edges. 712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:01,184 INFO L225 Difference]: With dead ends: 985 [2022-02-20 21:53:01,185 INFO L226 Difference]: Without dead ends: 668 [2022-02-20 21:53:01,186 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:01,187 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 250 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 21:53:01,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 1077 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 21:53:01,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-02-20 21:53:01,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 616. [2022-02-20 21:53:01,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:53:01,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 668 states. Second operand has 616 states, 501 states have (on average 1.3512974051896207) internal successors, (677), 501 states have internal predecessors, (677), 78 states have call successors, (78), 37 states have call predecessors, (78), 36 states have return successors, (81), 77 states have call predecessors, (81), 77 states have call successors, (81) [2022-02-20 21:53:01,214 INFO L74 IsIncluded]: Start isIncluded. First operand 668 states. Second operand has 616 states, 501 states have (on average 1.3512974051896207) internal successors, (677), 501 states have internal predecessors, (677), 78 states have call successors, (78), 37 states have call predecessors, (78), 36 states have return successors, (81), 77 states have call predecessors, (81), 77 states have call successors, (81) [2022-02-20 21:53:01,216 INFO L87 Difference]: Start difference. First operand 668 states. Second operand has 616 states, 501 states have (on average 1.3512974051896207) internal successors, (677), 501 states have internal predecessors, (677), 78 states have call successors, (78), 37 states have call predecessors, (78), 36 states have return successors, (81), 77 states have call predecessors, (81), 77 states have call successors, (81) [2022-02-20 21:53:01,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:01,244 INFO L93 Difference]: Finished difference Result 668 states and 916 transitions. [2022-02-20 21:53:01,245 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 916 transitions. [2022-02-20 21:53:01,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:01,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:01,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 616 states, 501 states have (on average 1.3512974051896207) internal successors, (677), 501 states have internal predecessors, (677), 78 states have call successors, (78), 37 states have call predecessors, (78), 36 states have return successors, (81), 77 states have call predecessors, (81), 77 states have call successors, (81) Second operand 668 states. [2022-02-20 21:53:01,250 INFO L87 Difference]: Start difference. First operand has 616 states, 501 states have (on average 1.3512974051896207) internal successors, (677), 501 states have internal predecessors, (677), 78 states have call successors, (78), 37 states have call predecessors, (78), 36 states have return successors, (81), 77 states have call predecessors, (81), 77 states have call successors, (81) Second operand 668 states. [2022-02-20 21:53:01,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:01,280 INFO L93 Difference]: Finished difference Result 668 states and 916 transitions. [2022-02-20 21:53:01,280 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 916 transitions. [2022-02-20 21:53:01,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:01,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:01,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:53:01,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:53:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 501 states have (on average 1.3512974051896207) internal successors, (677), 501 states have internal predecessors, (677), 78 states have call successors, (78), 37 states have call predecessors, (78), 36 states have return successors, (81), 77 states have call predecessors, (81), 77 states have call successors, (81) [2022-02-20 21:53:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 836 transitions. [2022-02-20 21:53:01,313 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 836 transitions. Word has length 80 [2022-02-20 21:53:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:53:01,314 INFO L470 AbstractCegarLoop]: Abstraction has 616 states and 836 transitions. [2022-02-20 21:53:01,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 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,314 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 836 transitions. [2022-02-20 21:53:01,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-02-20 21:53:01,317 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:01,317 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 21:53:01,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 21:53:01,317 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:01,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:01,318 INFO L85 PathProgramCache]: Analyzing trace with hash 943577961, now seen corresponding path program 1 times [2022-02-20 21:53:01,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:53:01,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324182949] [2022-02-20 21:53:01,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:01,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:53:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:53:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {8795#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8714#true} is VALID [2022-02-20 21:53:01,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,466 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8714#true} {8714#true} #491#return; {8714#true} is VALID [2022-02-20 21:53:01,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {8714#true} ~cond := #in~cond; {8714#true} is VALID [2022-02-20 21:53:01,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {8714#true} assume !(0 == ~cond); {8714#true} is VALID [2022-02-20 21:53:01,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8714#true} {8714#true} #493#return; {8714#true} is VALID [2022-02-20 21:53:01,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {8787#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {8714#true} is VALID [2022-02-20 21:53:01,472 INFO L272 TraceCheckUtils]: 1: Hoare triple {8714#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {8795#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:01,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {8795#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8714#true} is VALID [2022-02-20 21:53:01,473 INFO L290 TraceCheckUtils]: 3: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,473 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8714#true} {8714#true} #491#return; {8714#true} is VALID [2022-02-20 21:53:01,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {8714#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {8714#true} is VALID [2022-02-20 21:53:01,473 INFO L272 TraceCheckUtils]: 6: Hoare triple {8714#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {8714#true} is VALID [2022-02-20 21:53:01,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {8714#true} ~cond := #in~cond; {8714#true} is VALID [2022-02-20 21:53:01,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {8714#true} assume !(0 == ~cond); {8714#true} is VALID [2022-02-20 21:53:01,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,474 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8714#true} {8714#true} #493#return; {8714#true} is VALID [2022-02-20 21:53:01,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {8714#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {8714#true} is VALID [2022-02-20 21:53:01,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,474 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {8714#true} {8714#true} #497#return; {8714#true} is VALID [2022-02-20 21:53:01,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 21:53:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {8795#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8714#true} is VALID [2022-02-20 21:53:01,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,486 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8714#true} {8714#true} #491#return; {8714#true} is VALID [2022-02-20 21:53:01,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {8714#true} ~cond := #in~cond; {8714#true} is VALID [2022-02-20 21:53:01,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {8714#true} assume !(0 == ~cond); {8714#true} is VALID [2022-02-20 21:53:01,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8714#true} {8714#true} #493#return; {8714#true} is VALID [2022-02-20 21:53:01,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {8787#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {8714#true} is VALID [2022-02-20 21:53:01,492 INFO L272 TraceCheckUtils]: 1: Hoare triple {8714#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {8795#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:01,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {8795#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8714#true} is VALID [2022-02-20 21:53:01,492 INFO L290 TraceCheckUtils]: 3: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,492 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8714#true} {8714#true} #491#return; {8714#true} is VALID [2022-02-20 21:53:01,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {8714#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {8714#true} is VALID [2022-02-20 21:53:01,493 INFO L272 TraceCheckUtils]: 6: Hoare triple {8714#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {8714#true} is VALID [2022-02-20 21:53:01,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {8714#true} ~cond := #in~cond; {8714#true} is VALID [2022-02-20 21:53:01,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {8714#true} assume !(0 == ~cond); {8714#true} is VALID [2022-02-20 21:53:01,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,493 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8714#true} {8714#true} #493#return; {8714#true} is VALID [2022-02-20 21:53:01,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {8714#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {8714#true} is VALID [2022-02-20 21:53:01,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,494 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {8714#true} {8714#true} #529#return; {8714#true} is VALID [2022-02-20 21:53:01,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 21:53:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {8795#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8714#true} is VALID [2022-02-20 21:53:01,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,506 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8714#true} {8714#true} #491#return; {8714#true} is VALID [2022-02-20 21:53:01,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {8714#true} ~cond := #in~cond; {8714#true} is VALID [2022-02-20 21:53:01,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {8714#true} assume !(0 == ~cond); {8714#true} is VALID [2022-02-20 21:53:01,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8714#true} {8714#true} #493#return; {8714#true} is VALID [2022-02-20 21:53:01,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {8787#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {8714#true} is VALID [2022-02-20 21:53:01,512 INFO L272 TraceCheckUtils]: 1: Hoare triple {8714#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {8795#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:01,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {8795#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8714#true} is VALID [2022-02-20 21:53:01,512 INFO L290 TraceCheckUtils]: 3: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,512 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8714#true} {8714#true} #491#return; {8714#true} is VALID [2022-02-20 21:53:01,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {8714#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {8714#true} is VALID [2022-02-20 21:53:01,513 INFO L272 TraceCheckUtils]: 6: Hoare triple {8714#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {8714#true} is VALID [2022-02-20 21:53:01,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {8714#true} ~cond := #in~cond; {8714#true} is VALID [2022-02-20 21:53:01,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {8714#true} assume !(0 == ~cond); {8714#true} is VALID [2022-02-20 21:53:01,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,513 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8714#true} {8714#true} #493#return; {8714#true} is VALID [2022-02-20 21:53:01,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {8714#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {8714#true} is VALID [2022-02-20 21:53:01,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,514 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {8714#true} {8714#true} #531#return; {8714#true} is VALID [2022-02-20 21:53:01,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-02-20 21:53:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {8714#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {8714#true} is VALID [2022-02-20 21:53:01,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8714#true} {8714#true} #511#return; {8714#true} is VALID [2022-02-20 21:53:01,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-02-20 21:53:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {8795#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8714#true} is VALID [2022-02-20 21:53:01,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8714#true} {8828#(not (= |ldv_successful_zalloc_#t~malloc18.base| 0))} #491#return; {8828#(not (= |ldv_successful_zalloc_#t~malloc18.base| 0))} is VALID [2022-02-20 21:53:01,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:01,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {8714#true} ~cond := #in~cond; {8714#true} is VALID [2022-02-20 21:53:01,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {8714#true} assume !(0 == ~cond); {8714#true} is VALID [2022-02-20 21:53:01,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8714#true} {8832#(not (= ldv_successful_zalloc_~p~0.base 0))} #493#return; {8832#(not (= ldv_successful_zalloc_~p~0.base 0))} is VALID [2022-02-20 21:53:01,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {8787#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {8828#(not (= |ldv_successful_zalloc_#t~malloc18.base| 0))} is VALID [2022-02-20 21:53:01,629 INFO L272 TraceCheckUtils]: 1: Hoare triple {8828#(not (= |ldv_successful_zalloc_#t~malloc18.base| 0))} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {8795#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:01,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {8795#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8714#true} is VALID [2022-02-20 21:53:01,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,630 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8714#true} {8828#(not (= |ldv_successful_zalloc_#t~malloc18.base| 0))} #491#return; {8828#(not (= |ldv_successful_zalloc_#t~malloc18.base| 0))} is VALID [2022-02-20 21:53:01,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {8828#(not (= |ldv_successful_zalloc_#t~malloc18.base| 0))} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {8832#(not (= ldv_successful_zalloc_~p~0.base 0))} is VALID [2022-02-20 21:53:01,630 INFO L272 TraceCheckUtils]: 6: Hoare triple {8832#(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)); {8714#true} is VALID [2022-02-20 21:53:01,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {8714#true} ~cond := #in~cond; {8714#true} is VALID [2022-02-20 21:53:01,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {8714#true} assume !(0 == ~cond); {8714#true} is VALID [2022-02-20 21:53:01,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,631 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8714#true} {8832#(not (= ldv_successful_zalloc_~p~0.base 0))} #493#return; {8832#(not (= ldv_successful_zalloc_~p~0.base 0))} is VALID [2022-02-20 21:53:01,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {8832#(not (= ldv_successful_zalloc_~p~0.base 0))} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {8837#(not (= |ldv_successful_zalloc_#res.base| 0))} is VALID [2022-02-20 21:53:01,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {8837#(not (= |ldv_successful_zalloc_#res.base| 0))} assume true; {8837#(not (= |ldv_successful_zalloc_#res.base| 0))} is VALID [2022-02-20 21:53:01,633 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {8837#(not (= |ldv_successful_zalloc_#res.base| 0))} {8714#true} #489#return; {8825#(not (= |ldv_skb_alloc_#t~ret110#1.base| 0))} is VALID [2022-02-20 21:53:01,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {8810#(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; {8714#true} is VALID [2022-02-20 21:53:01,634 INFO L272 TraceCheckUtils]: 1: Hoare triple {8714#true} call #t~ret110#1.base, #t~ret110#1.offset := ldv_successful_zalloc(248); {8787#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:01,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {8787#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {8828#(not (= |ldv_successful_zalloc_#t~malloc18.base| 0))} is VALID [2022-02-20 21:53:01,635 INFO L272 TraceCheckUtils]: 3: Hoare triple {8828#(not (= |ldv_successful_zalloc_#t~malloc18.base| 0))} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {8795#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:01,635 INFO L290 TraceCheckUtils]: 4: Hoare triple {8795#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8714#true} is VALID [2022-02-20 21:53:01,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,636 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8714#true} {8828#(not (= |ldv_successful_zalloc_#t~malloc18.base| 0))} #491#return; {8828#(not (= |ldv_successful_zalloc_#t~malloc18.base| 0))} is VALID [2022-02-20 21:53:01,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {8828#(not (= |ldv_successful_zalloc_#t~malloc18.base| 0))} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {8832#(not (= ldv_successful_zalloc_~p~0.base 0))} is VALID [2022-02-20 21:53:01,637 INFO L272 TraceCheckUtils]: 8: Hoare triple {8832#(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)); {8714#true} is VALID [2022-02-20 21:53:01,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {8714#true} ~cond := #in~cond; {8714#true} is VALID [2022-02-20 21:53:01,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {8714#true} assume !(0 == ~cond); {8714#true} is VALID [2022-02-20 21:53:01,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,638 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8714#true} {8832#(not (= ldv_successful_zalloc_~p~0.base 0))} #493#return; {8832#(not (= ldv_successful_zalloc_~p~0.base 0))} is VALID [2022-02-20 21:53:01,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {8832#(not (= ldv_successful_zalloc_~p~0.base 0))} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {8837#(not (= |ldv_successful_zalloc_#res.base| 0))} is VALID [2022-02-20 21:53:01,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {8837#(not (= |ldv_successful_zalloc_#res.base| 0))} assume true; {8837#(not (= |ldv_successful_zalloc_#res.base| 0))} is VALID [2022-02-20 21:53:01,639 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8837#(not (= |ldv_successful_zalloc_#res.base| 0))} {8714#true} #489#return; {8825#(not (= |ldv_skb_alloc_#t~ret110#1.base| 0))} is VALID [2022-02-20 21:53:01,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {8825#(not (= |ldv_skb_alloc_#t~ret110#1.base| 0))} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret110#1.base, #t~ret110#1.offset;havoc #t~ret110#1.base, #t~ret110#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {8826#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:01,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {8826#(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~mem105#1.base, ldv_set_add_#t~mem105#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; {8826#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:01,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {8826#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume !false; {8826#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:01,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {8826#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {8826#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:01,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {8826#(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; {8826#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:01,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {8826#(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; {8827#(not (= |ldv_skb_alloc_#res#1.base| 0))} is VALID [2022-02-20 21:53:01,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {8827#(not (= |ldv_skb_alloc_#res#1.base| 0))} assume true; {8827#(not (= |ldv_skb_alloc_#res#1.base| 0))} is VALID [2022-02-20 21:53:01,643 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8827#(not (= |ldv_skb_alloc_#res#1.base| 0))} {8714#true} #513#return; {8785#(not (= |ULTIMATE.start_ldv_alloc_skb_14_#t~ret101#1.base| 0))} is VALID [2022-02-20 21:53:01,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {8714#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(71, 3);call #Ultimate.allocInit(41, 4);call #Ultimate.allocInit(2, 5);call write~init~int(12, 5, 0, 1);call write~init~int(0, 5, 1, 1);call #Ultimate.allocInit(54, 6);call #Ultimate.allocInit(2, 7);call write~init~int(12, 7, 0, 1);call write~init~int(0, 7, 1, 1);call #Ultimate.allocInit(45, 8);call #Ultimate.allocInit(2, 9);call write~init~int(12, 9, 0, 1);call write~init~int(0, 9, 1, 1);~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~rfc1051_proto_group0~0.base, ~rfc1051_proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~rfc1051_proto_group1~0.base, ~rfc1051_proto_group1~0.offset := 0, 0;~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset := 10, 0;call #Ultimate.allocInit(49, 10);call write~init~int(115, ~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset, 1);call write~init~int(507, ~#rfc1051_proto~0.base, 1 + ~#rfc1051_proto~0.offset, 4);call write~init~int(1, ~#rfc1051_proto~0.base, 5 + ~#rfc1051_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#rfc1051_proto~0.base, 9 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#rfc1051_proto~0.base, 17 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#rfc1051_proto~0.base, 25 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rfc1051_proto~0.base, 33 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rfc1051_proto~0.base, 41 + ~#rfc1051_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 11, 0;call #Ultimate.allocInit(120, 11);#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; {8714#true} is VALID [2022-02-20 21:53:01,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {8714#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet84#1, main_#t~nondet85#1, main_#t~ret86#1.base, main_#t~ret86#1.offset, main_#t~nondet87#1, main_#t~nondet88#1, main_#t~nondet89#1, main_#t~memset~res90#1.base, main_#t~memset~res90#1.offset, main_#t~nondet91#1, main_#t~switch92#1, main_#t~nondet93#1, main_#t~switch94#1, main_#t~ret95#1, main_#t~mem96#1, main_#t~ret97#1, main_#t~nondet98#1, main_#t~switch99#1, main_#t~ret100#1, main_~ldvarg1~0#1, main_~tmp~8#1, main_~ldvarg4~0#1, main_~tmp___0~3#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset, main_~ldvarg0~0#1, main_~tmp___2~0#1, main_~ldvarg5~0#1, main_~tmp___3~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~ldvarg6~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp~8#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___0~3#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___3~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~ldvarg6~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;assume -2147483648 <= main_#t~nondet84#1 && main_#t~nondet84#1 <= 2147483647;main_~tmp~8#1 := main_#t~nondet84#1;havoc main_#t~nondet84#1;main_~ldvarg1~0#1 := main_~tmp~8#1;main_~tmp___0~3#1 := main_#t~nondet85#1;havoc main_#t~nondet85#1;main_~ldvarg4~0#1 := main_~tmp___0~3#1; {8714#true} is VALID [2022-02-20 21:53:01,644 INFO L272 TraceCheckUtils]: 2: Hoare triple {8714#true} call main_#t~ret86#1.base, main_#t~ret86#1.offset := ldv_successful_zalloc(232); {8787#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:01,644 INFO L290 TraceCheckUtils]: 3: Hoare triple {8787#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {8714#true} is VALID [2022-02-20 21:53:01,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {8714#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {8795#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:01,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {8795#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8714#true} is VALID [2022-02-20 21:53:01,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,645 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8714#true} {8714#true} #491#return; {8714#true} is VALID [2022-02-20 21:53:01,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {8714#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {8714#true} is VALID [2022-02-20 21:53:01,646 INFO L272 TraceCheckUtils]: 9: Hoare triple {8714#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {8714#true} is VALID [2022-02-20 21:53:01,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {8714#true} ~cond := #in~cond; {8714#true} is VALID [2022-02-20 21:53:01,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {8714#true} assume !(0 == ~cond); {8714#true} is VALID [2022-02-20 21:53:01,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,646 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {8714#true} {8714#true} #493#return; {8714#true} is VALID [2022-02-20 21:53:01,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {8714#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {8714#true} is VALID [2022-02-20 21:53:01,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,647 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8714#true} {8714#true} #497#return; {8714#true} is VALID [2022-02-20 21:53:01,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {8714#true} main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset := main_#t~ret86#1.base, main_#t~ret86#1.offset;havoc main_#t~ret86#1.base, main_#t~ret86#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset;assume -2147483648 <= main_#t~nondet87#1 && main_#t~nondet87#1 <= 2147483647;main_~tmp___2~0#1 := main_#t~nondet87#1;havoc main_#t~nondet87#1;main_~ldvarg0~0#1 := main_~tmp___2~0#1;assume -2147483648 <= main_#t~nondet88#1 && main_#t~nondet88#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet88#1;havoc main_#t~nondet88#1;main_~ldvarg5~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet89#1 && main_#t~nondet89#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet89#1;havoc main_#t~nondet89#1;main_~ldvarg6~0#1 := main_~tmp___4~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; {8714#true} is VALID [2022-02-20 21:53:01,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {8714#true} assume { :end_inline_ldv_set_init } true; {8714#true} is VALID [2022-02-20 21:53:01,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {8714#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~loopctr123#1;#Ultimate.C_memset_#t~loopctr123#1 := 0; {8714#true} is VALID [2022-02-20 21:53:01,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {8714#true} assume !(#Ultimate.C_memset_#t~loopctr123#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {8714#true} is VALID [2022-02-20 21:53:01,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {8714#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~res90#1.base, main_#t~memset~res90#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~res90#1.base, main_#t~memset~res90#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {8714#true} is VALID [2022-02-20 21:53:01,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {8714#true} assume -2147483648 <= main_#t~nondet91#1 && main_#t~nondet91#1 <= 2147483647;main_~tmp___5~0#1 := main_#t~nondet91#1;havoc main_#t~nondet91#1;main_#t~switch92#1 := 0 == main_~tmp___5~0#1; {8714#true} is VALID [2022-02-20 21:53:01,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {8714#true} assume !main_#t~switch92#1;main_#t~switch92#1 := main_#t~switch92#1 || 1 == main_~tmp___5~0#1; {8714#true} is VALID [2022-02-20 21:53:01,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {8714#true} assume main_#t~switch92#1; {8714#true} is VALID [2022-02-20 21:53:01,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {8714#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet98#1 && main_#t~nondet98#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet98#1;havoc main_#t~nondet98#1;main_#t~switch99#1 := 0 == main_~tmp___7~0#1; {8714#true} is VALID [2022-02-20 21:53:01,648 INFO L290 TraceCheckUtils]: 26: Hoare triple {8714#true} assume !main_#t~switch99#1;main_#t~switch99#1 := main_#t~switch99#1 || 1 == main_~tmp___7~0#1; {8714#true} is VALID [2022-02-20 21:53:01,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {8714#true} assume main_#t~switch99#1; {8714#true} is VALID [2022-02-20 21:53:01,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {8714#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_arcnet_rfc1051_init } true;havoc arcnet_rfc1051_init_#res#1;havoc arcnet_rfc1051_init_#t~nondet26#1, arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset;havoc arcnet_rfc1051_init_#t~nondet26#1;call write~$Pointer$(~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset, ~#arc_proto_map~0.base, 1928 + ~#arc_proto_map~0.offset, 8);call arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1928 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset, ~#arc_proto_map~0.base, 1920 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset; {8714#true} is VALID [2022-02-20 21:53:01,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {8714#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 := ~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset; {8714#true} is VALID [2022-02-20 21:53:01,649 INFO L290 TraceCheckUtils]: 30: Hoare triple {8714#true} arcnet_rfc1051_init_#res#1 := 0; {8714#true} is VALID [2022-02-20 21:53:01,649 INFO L290 TraceCheckUtils]: 31: Hoare triple {8714#true} main_#t~ret100#1 := arcnet_rfc1051_init_#res#1;assume { :end_inline_arcnet_rfc1051_init } true;assume -2147483648 <= main_#t~ret100#1 && main_#t~ret100#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret100#1;havoc main_#t~ret100#1; {8714#true} is VALID [2022-02-20 21:53:01,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {8714#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~ret82#1.base, ldv_initialize_ArcProto_1_#t~ret82#1.offset, ldv_initialize_ArcProto_1_#t~ret83#1.base, ldv_initialize_ArcProto_1_#t~ret83#1.offset, ldv_initialize_ArcProto_1_~tmp~7#1.base, ldv_initialize_ArcProto_1_~tmp~7#1.offset, ldv_initialize_ArcProto_1_~tmp___0~2#1.base, ldv_initialize_ArcProto_1_~tmp___0~2#1.offset;havoc ldv_initialize_ArcProto_1_~tmp~7#1.base, ldv_initialize_ArcProto_1_~tmp~7#1.offset;havoc ldv_initialize_ArcProto_1_~tmp___0~2#1.base, ldv_initialize_ArcProto_1_~tmp___0~2#1.offset; {8714#true} is VALID [2022-02-20 21:53:01,650 INFO L272 TraceCheckUtils]: 33: Hoare triple {8714#true} call ldv_initialize_ArcProto_1_#t~ret82#1.base, ldv_initialize_ArcProto_1_#t~ret82#1.offset := ldv_successful_zalloc(20); {8787#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:01,650 INFO L290 TraceCheckUtils]: 34: Hoare triple {8787#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {8714#true} is VALID [2022-02-20 21:53:01,651 INFO L272 TraceCheckUtils]: 35: Hoare triple {8714#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {8795#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:01,651 INFO L290 TraceCheckUtils]: 36: Hoare triple {8795#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8714#true} is VALID [2022-02-20 21:53:01,651 INFO L290 TraceCheckUtils]: 37: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,652 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8714#true} {8714#true} #491#return; {8714#true} is VALID [2022-02-20 21:53:01,652 INFO L290 TraceCheckUtils]: 39: Hoare triple {8714#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {8714#true} is VALID [2022-02-20 21:53:01,652 INFO L272 TraceCheckUtils]: 40: Hoare triple {8714#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {8714#true} is VALID [2022-02-20 21:53:01,652 INFO L290 TraceCheckUtils]: 41: Hoare triple {8714#true} ~cond := #in~cond; {8714#true} is VALID [2022-02-20 21:53:01,652 INFO L290 TraceCheckUtils]: 42: Hoare triple {8714#true} assume !(0 == ~cond); {8714#true} is VALID [2022-02-20 21:53:01,652 INFO L290 TraceCheckUtils]: 43: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,652 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8714#true} {8714#true} #493#return; {8714#true} is VALID [2022-02-20 21:53:01,653 INFO L290 TraceCheckUtils]: 45: Hoare triple {8714#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {8714#true} is VALID [2022-02-20 21:53:01,653 INFO L290 TraceCheckUtils]: 46: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,653 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8714#true} {8714#true} #529#return; {8714#true} is VALID [2022-02-20 21:53:01,653 INFO L290 TraceCheckUtils]: 48: Hoare triple {8714#true} ldv_initialize_ArcProto_1_~tmp~7#1.base, ldv_initialize_ArcProto_1_~tmp~7#1.offset := ldv_initialize_ArcProto_1_#t~ret82#1.base, ldv_initialize_ArcProto_1_#t~ret82#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret82#1.base, ldv_initialize_ArcProto_1_#t~ret82#1.offset;~rfc1051_proto_group0~0.base, ~rfc1051_proto_group0~0.offset := ldv_initialize_ArcProto_1_~tmp~7#1.base, ldv_initialize_ArcProto_1_~tmp~7#1.offset; {8714#true} is VALID [2022-02-20 21:53:01,654 INFO L272 TraceCheckUtils]: 49: Hoare triple {8714#true} call ldv_initialize_ArcProto_1_#t~ret83#1.base, ldv_initialize_ArcProto_1_#t~ret83#1.offset := ldv_successful_zalloc(3264); {8787#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:01,654 INFO L290 TraceCheckUtils]: 50: Hoare triple {8787#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {8714#true} is VALID [2022-02-20 21:53:01,655 INFO L272 TraceCheckUtils]: 51: Hoare triple {8714#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {8795#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:01,655 INFO L290 TraceCheckUtils]: 52: Hoare triple {8795#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8714#true} is VALID [2022-02-20 21:53:01,655 INFO L290 TraceCheckUtils]: 53: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,655 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8714#true} {8714#true} #491#return; {8714#true} is VALID [2022-02-20 21:53:01,655 INFO L290 TraceCheckUtils]: 55: Hoare triple {8714#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {8714#true} is VALID [2022-02-20 21:53:01,655 INFO L272 TraceCheckUtils]: 56: Hoare triple {8714#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {8714#true} is VALID [2022-02-20 21:53:01,655 INFO L290 TraceCheckUtils]: 57: Hoare triple {8714#true} ~cond := #in~cond; {8714#true} is VALID [2022-02-20 21:53:01,656 INFO L290 TraceCheckUtils]: 58: Hoare triple {8714#true} assume !(0 == ~cond); {8714#true} is VALID [2022-02-20 21:53:01,656 INFO L290 TraceCheckUtils]: 59: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,656 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8714#true} {8714#true} #493#return; {8714#true} is VALID [2022-02-20 21:53:01,656 INFO L290 TraceCheckUtils]: 61: Hoare triple {8714#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {8714#true} is VALID [2022-02-20 21:53:01,656 INFO L290 TraceCheckUtils]: 62: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,656 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8714#true} {8714#true} #531#return; {8714#true} is VALID [2022-02-20 21:53:01,657 INFO L290 TraceCheckUtils]: 64: Hoare triple {8714#true} ldv_initialize_ArcProto_1_~tmp___0~2#1.base, ldv_initialize_ArcProto_1_~tmp___0~2#1.offset := ldv_initialize_ArcProto_1_#t~ret83#1.base, ldv_initialize_ArcProto_1_#t~ret83#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret83#1.base, ldv_initialize_ArcProto_1_#t~ret83#1.offset;~rfc1051_proto_group1~0.base, ~rfc1051_proto_group1~0.offset := ldv_initialize_ArcProto_1_~tmp___0~2#1.base, ldv_initialize_ArcProto_1_~tmp___0~2#1.offset; {8714#true} is VALID [2022-02-20 21:53:01,657 INFO L290 TraceCheckUtils]: 65: Hoare triple {8714#true} assume { :end_inline_ldv_initialize_ArcProto_1 } true; {8714#true} is VALID [2022-02-20 21:53:01,657 INFO L290 TraceCheckUtils]: 66: Hoare triple {8714#true} assume !(0 != ~ldv_retval_0~0); {8714#true} is VALID [2022-02-20 21:53:01,657 INFO L290 TraceCheckUtils]: 67: Hoare triple {8714#true} assume -2147483648 <= main_#t~nondet91#1 && main_#t~nondet91#1 <= 2147483647;main_~tmp___5~0#1 := main_#t~nondet91#1;havoc main_#t~nondet91#1;main_#t~switch92#1 := 0 == main_~tmp___5~0#1; {8714#true} is VALID [2022-02-20 21:53:01,657 INFO L290 TraceCheckUtils]: 68: Hoare triple {8714#true} assume main_#t~switch92#1; {8714#true} is VALID [2022-02-20 21:53:01,657 INFO L290 TraceCheckUtils]: 69: Hoare triple {8714#true} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet93#1 && main_#t~nondet93#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet93#1;havoc main_#t~nondet93#1;main_#t~switch94#1 := 0 == main_~tmp___6~0#1; {8714#true} is VALID [2022-02-20 21:53:01,657 INFO L290 TraceCheckUtils]: 70: Hoare triple {8714#true} assume !main_#t~switch94#1;main_#t~switch94#1 := main_#t~switch94#1 || 1 == main_~tmp___6~0#1; {8714#true} is VALID [2022-02-20 21:53:01,658 INFO L290 TraceCheckUtils]: 71: Hoare triple {8714#true} assume !main_#t~switch94#1;main_#t~switch94#1 := main_#t~switch94#1 || 2 == main_~tmp___6~0#1; {8714#true} is VALID [2022-02-20 21:53:01,658 INFO L290 TraceCheckUtils]: 72: Hoare triple {8714#true} assume main_#t~switch94#1; {8714#true} is VALID [2022-02-20 21:53:01,658 INFO L290 TraceCheckUtils]: 73: Hoare triple {8714#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 := ~rfc1051_proto_group1~0.base, ~rfc1051_proto_group1~0.offset, main_~ldvarg1~0#1, ~rfc1051_proto_group0~0.base, ~rfc1051_proto_group0~0.offset, main_~ldvarg0~0#1;havoc rx_#t~ret39#1.base, rx_#t~ret39#1.offset, rx_#t~ret40#1.base, rx_#t~ret40#1.offset, rx_#t~nondet41#1, rx_#t~mem42#1, rx_#t~ret43#1.base, rx_#t~ret43#1.offset, rx_#t~mem44#1.base, rx_#t~mem44#1.offset, rx_#t~memcpy~res45#1.base, rx_#t~memcpy~res45#1.offset, rx_#t~memcpy~res46#1.base, rx_#t~memcpy~res46#1.offset, rx_#t~mem53#1.base, rx_#t~mem53#1.offset, rx_#t~ret54#1, rx_#t~ret55#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~1#1.base, rx_~pkt~1#1.offset, rx_~ofs~0#1, rx_~__len~0#1, rx_~__ret~0#1.base, rx_~__ret~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~1#1.base, rx_~pkt~1#1.offset;havoc rx_~ofs~0#1;havoc rx_~__len~0#1;havoc rx_~__ret~0#1.base, rx_~__ret~0#1.offset; {8714#true} is VALID [2022-02-20 21:53:01,658 INFO L272 TraceCheckUtils]: 74: Hoare triple {8714#true} call rx_#t~ret39#1.base, rx_#t~ret39#1.offset := netdev_priv(rx_~dev#1.base, rx_~dev#1.offset); {8714#true} is VALID [2022-02-20 21:53:01,658 INFO L290 TraceCheckUtils]: 75: Hoare triple {8714#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {8714#true} is VALID [2022-02-20 21:53:01,659 INFO L290 TraceCheckUtils]: 76: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,659 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {8714#true} {8714#true} #511#return; {8714#true} is VALID [2022-02-20 21:53:01,659 INFO L290 TraceCheckUtils]: 78: Hoare triple {8714#true} rx_~tmp~4#1.base, rx_~tmp~4#1.offset := rx_#t~ret39#1.base, rx_#t~ret39#1.offset;havoc rx_#t~ret39#1.base, rx_#t~ret39#1.offset;rx_~lp~0#1.base, rx_~lp~0#1.offset := rx_~tmp~4#1.base, rx_~tmp~4#1.offset;rx_~pkt~1#1.base, rx_~pkt~1#1.offset := rx_~pkthdr#1.base, rx_~pkthdr#1.offset; {8714#true} is VALID [2022-02-20 21:53:01,659 INFO L290 TraceCheckUtils]: 79: Hoare triple {8714#true} assume !(rx_~length#1 > 256);rx_~ofs~0#1 := 256 - rx_~length#1; {8714#true} is VALID [2022-02-20 21:53:01,659 INFO L290 TraceCheckUtils]: 80: Hoare triple {8714#true} assume { :begin_inline_ldv_alloc_skb_14 } true;ldv_alloc_skb_14_#in~size#1, ldv_alloc_skb_14_#in~priority#1 := 4 + rx_~length#1, 32;havoc ldv_alloc_skb_14_#res#1.base, ldv_alloc_skb_14_#res#1.offset;havoc ldv_alloc_skb_14_#t~ret101#1.base, ldv_alloc_skb_14_#t~ret101#1.offset, ldv_alloc_skb_14_#t~ret102#1.base, ldv_alloc_skb_14_#t~ret102#1.offset, ldv_alloc_skb_14_#t~mem103#1.base, ldv_alloc_skb_14_#t~mem103#1.offset, ldv_alloc_skb_14_~size#1, ldv_alloc_skb_14_~priority#1, ldv_alloc_skb_14_~tmp~9#1.base, ldv_alloc_skb_14_~tmp~9#1.offset;ldv_alloc_skb_14_~size#1 := ldv_alloc_skb_14_#in~size#1;ldv_alloc_skb_14_~priority#1 := ldv_alloc_skb_14_#in~priority#1;havoc ldv_alloc_skb_14_~tmp~9#1.base, ldv_alloc_skb_14_~tmp~9#1.offset; {8714#true} is VALID [2022-02-20 21:53:01,660 INFO L272 TraceCheckUtils]: 81: Hoare triple {8714#true} call ldv_alloc_skb_14_#t~ret101#1.base, ldv_alloc_skb_14_#t~ret101#1.offset := ldv_skb_alloc(); {8810#(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:01,660 INFO L290 TraceCheckUtils]: 82: Hoare triple {8810#(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; {8714#true} is VALID [2022-02-20 21:53:01,661 INFO L272 TraceCheckUtils]: 83: Hoare triple {8714#true} call #t~ret110#1.base, #t~ret110#1.offset := ldv_successful_zalloc(248); {8787#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:01,661 INFO L290 TraceCheckUtils]: 84: Hoare triple {8787#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {8828#(not (= |ldv_successful_zalloc_#t~malloc18.base| 0))} is VALID [2022-02-20 21:53:01,662 INFO L272 TraceCheckUtils]: 85: Hoare triple {8828#(not (= |ldv_successful_zalloc_#t~malloc18.base| 0))} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {8795#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:01,662 INFO L290 TraceCheckUtils]: 86: Hoare triple {8795#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8714#true} is VALID [2022-02-20 21:53:01,662 INFO L290 TraceCheckUtils]: 87: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,663 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {8714#true} {8828#(not (= |ldv_successful_zalloc_#t~malloc18.base| 0))} #491#return; {8828#(not (= |ldv_successful_zalloc_#t~malloc18.base| 0))} is VALID [2022-02-20 21:53:01,664 INFO L290 TraceCheckUtils]: 89: Hoare triple {8828#(not (= |ldv_successful_zalloc_#t~malloc18.base| 0))} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {8832#(not (= ldv_successful_zalloc_~p~0.base 0))} is VALID [2022-02-20 21:53:01,664 INFO L272 TraceCheckUtils]: 90: Hoare triple {8832#(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)); {8714#true} is VALID [2022-02-20 21:53:01,664 INFO L290 TraceCheckUtils]: 91: Hoare triple {8714#true} ~cond := #in~cond; {8714#true} is VALID [2022-02-20 21:53:01,664 INFO L290 TraceCheckUtils]: 92: Hoare triple {8714#true} assume !(0 == ~cond); {8714#true} is VALID [2022-02-20 21:53:01,664 INFO L290 TraceCheckUtils]: 93: Hoare triple {8714#true} assume true; {8714#true} is VALID [2022-02-20 21:53:01,665 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {8714#true} {8832#(not (= ldv_successful_zalloc_~p~0.base 0))} #493#return; {8832#(not (= ldv_successful_zalloc_~p~0.base 0))} is VALID [2022-02-20 21:53:01,665 INFO L290 TraceCheckUtils]: 95: Hoare triple {8832#(not (= ldv_successful_zalloc_~p~0.base 0))} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {8837#(not (= |ldv_successful_zalloc_#res.base| 0))} is VALID [2022-02-20 21:53:01,666 INFO L290 TraceCheckUtils]: 96: Hoare triple {8837#(not (= |ldv_successful_zalloc_#res.base| 0))} assume true; {8837#(not (= |ldv_successful_zalloc_#res.base| 0))} is VALID [2022-02-20 21:53:01,666 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {8837#(not (= |ldv_successful_zalloc_#res.base| 0))} {8714#true} #489#return; {8825#(not (= |ldv_skb_alloc_#t~ret110#1.base| 0))} is VALID [2022-02-20 21:53:01,667 INFO L290 TraceCheckUtils]: 98: Hoare triple {8825#(not (= |ldv_skb_alloc_#t~ret110#1.base| 0))} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret110#1.base, #t~ret110#1.offset;havoc #t~ret110#1.base, #t~ret110#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {8826#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:01,667 INFO L290 TraceCheckUtils]: 99: Hoare triple {8826#(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~mem105#1.base, ldv_set_add_#t~mem105#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; {8826#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:01,667 INFO L290 TraceCheckUtils]: 100: Hoare triple {8826#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume !false; {8826#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:01,668 INFO L290 TraceCheckUtils]: 101: Hoare triple {8826#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {8826#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:01,668 INFO L290 TraceCheckUtils]: 102: Hoare triple {8826#(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; {8826#(not (= |ldv_skb_alloc_~skb~1#1.base| 0))} is VALID [2022-02-20 21:53:01,668 INFO L290 TraceCheckUtils]: 103: Hoare triple {8826#(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; {8827#(not (= |ldv_skb_alloc_#res#1.base| 0))} is VALID [2022-02-20 21:53:01,669 INFO L290 TraceCheckUtils]: 104: Hoare triple {8827#(not (= |ldv_skb_alloc_#res#1.base| 0))} assume true; {8827#(not (= |ldv_skb_alloc_#res#1.base| 0))} is VALID [2022-02-20 21:53:01,669 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {8827#(not (= |ldv_skb_alloc_#res#1.base| 0))} {8714#true} #513#return; {8785#(not (= |ULTIMATE.start_ldv_alloc_skb_14_#t~ret101#1.base| 0))} is VALID [2022-02-20 21:53:01,670 INFO L290 TraceCheckUtils]: 106: Hoare triple {8785#(not (= |ULTIMATE.start_ldv_alloc_skb_14_#t~ret101#1.base| 0))} ldv_alloc_skb_14_~tmp~9#1.base, ldv_alloc_skb_14_~tmp~9#1.offset := ldv_alloc_skb_14_#t~ret101#1.base, ldv_alloc_skb_14_#t~ret101#1.offset;havoc ldv_alloc_skb_14_#t~ret101#1.base, ldv_alloc_skb_14_#t~ret101#1.offset; {8786#(not (= |ULTIMATE.start_ldv_alloc_skb_14_~tmp~9#1.base| 0))} is VALID [2022-02-20 21:53:01,670 INFO L290 TraceCheckUtils]: 107: Hoare triple {8786#(not (= |ULTIMATE.start_ldv_alloc_skb_14_~tmp~9#1.base| 0))} assume !(ldv_alloc_skb_14_~tmp~9#1.base != 0 || ldv_alloc_skb_14_~tmp~9#1.offset != 0); {8715#false} is VALID [2022-02-20 21:53:01,670 INFO L290 TraceCheckUtils]: 108: Hoare triple {8715#false} ldv_alloc_skb_14_#res#1.base, ldv_alloc_skb_14_#res#1.offset := ldv_alloc_skb_14_~tmp~9#1.base, ldv_alloc_skb_14_~tmp~9#1.offset; {8715#false} is VALID [2022-02-20 21:53:01,671 INFO L290 TraceCheckUtils]: 109: Hoare triple {8715#false} rx_#t~ret40#1.base, rx_#t~ret40#1.offset := ldv_alloc_skb_14_#res#1.base, ldv_alloc_skb_14_#res#1.offset;assume { :end_inline_ldv_alloc_skb_14 } true;rx_~skb~0#1.base, rx_~skb~0#1.offset := rx_#t~ret40#1.base, rx_#t~ret40#1.offset;havoc rx_#t~ret40#1.base, rx_#t~ret40#1.offset; {8715#false} is VALID [2022-02-20 21:53:01,671 INFO L290 TraceCheckUtils]: 110: Hoare triple {8715#false} assume 0 == (rx_~skb~0#1.base + rx_~skb~0#1.offset) % 18446744073709551616; {8715#false} is VALID [2022-02-20 21:53:01,671 INFO L290 TraceCheckUtils]: 111: Hoare triple {8715#false} assume 0 != ~arcnet_debug~0;havoc rx_#t~nondet41#1; {8715#false} is VALID [2022-02-20 21:53:01,671 INFO L290 TraceCheckUtils]: 112: Hoare triple {8715#false} call rx_#t~mem42#1 := read~int(rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);call write~int(1 + rx_#t~mem42#1, rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);havoc rx_#t~mem42#1; {8715#false} is VALID [2022-02-20 21:53:01,671 INFO L290 TraceCheckUtils]: 113: Hoare triple {8715#false} assume { :end_inline_rx } true;~ldv_state_variable_1~0 := 1; {8715#false} is VALID [2022-02-20 21:53:01,671 INFO L290 TraceCheckUtils]: 114: Hoare triple {8715#false} assume -2147483648 <= main_#t~nondet91#1 && main_#t~nondet91#1 <= 2147483647;main_~tmp___5~0#1 := main_#t~nondet91#1;havoc main_#t~nondet91#1;main_#t~switch92#1 := 0 == main_~tmp___5~0#1; {8715#false} is VALID [2022-02-20 21:53:01,671 INFO L290 TraceCheckUtils]: 115: Hoare triple {8715#false} assume !main_#t~switch92#1;main_#t~switch92#1 := main_#t~switch92#1 || 1 == main_~tmp___5~0#1; {8715#false} is VALID [2022-02-20 21:53:01,672 INFO L290 TraceCheckUtils]: 116: Hoare triple {8715#false} assume main_#t~switch92#1; {8715#false} is VALID [2022-02-20 21:53:01,672 INFO L290 TraceCheckUtils]: 117: Hoare triple {8715#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet98#1 && main_#t~nondet98#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet98#1;havoc main_#t~nondet98#1;main_#t~switch99#1 := 0 == main_~tmp___7~0#1; {8715#false} is VALID [2022-02-20 21:53:01,672 INFO L290 TraceCheckUtils]: 118: Hoare triple {8715#false} assume main_#t~switch99#1; {8715#false} is VALID [2022-02-20 21:53:01,672 INFO L290 TraceCheckUtils]: 119: Hoare triple {8715#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_arcnet_rfc1051_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#rfc1051_proto~0.base, ~#rfc1051_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; {8715#false} is VALID [2022-02-20 21:53:01,672 INFO L290 TraceCheckUtils]: 120: Hoare triple {8715#false} assume { :end_inline_arcnet_unregister_proto } true; {8715#false} is VALID [2022-02-20 21:53:01,672 INFO L290 TraceCheckUtils]: 121: Hoare triple {8715#false} assume { :end_inline_arcnet_rfc1051_exit } true;~ldv_state_variable_0~0 := 2; {8715#false} is VALID [2022-02-20 21:53:01,672 INFO L290 TraceCheckUtils]: 122: Hoare triple {8715#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret114#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); {8715#false} is VALID [2022-02-20 21:53:01,673 INFO L290 TraceCheckUtils]: 123: Hoare triple {8715#false} ldv_check_final_state_#t~ret114#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret114#1 && ldv_check_final_state_#t~ret114#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret114#1;havoc ldv_check_final_state_#t~ret114#1; {8715#false} is VALID [2022-02-20 21:53:01,673 INFO L290 TraceCheckUtils]: 124: Hoare triple {8715#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {8715#false} is VALID [2022-02-20 21:53:01,673 INFO L272 TraceCheckUtils]: 125: Hoare triple {8715#false} call ldv_error(); {8715#false} is VALID [2022-02-20 21:53:01,673 INFO L290 TraceCheckUtils]: 126: Hoare triple {8715#false} assume !false; {8715#false} is VALID [2022-02-20 21:53:01,674 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-02-20 21:53:01,674 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:53:01,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324182949] [2022-02-20 21:53:01,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324182949] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:01,674 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:01,674 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 21:53:01,675 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724248550] [2022-02-20 21:53:01,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:01,675 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 127 [2022-02-20 21:53:01,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:01,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-02-20 21:53:01,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:01,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 21:53:01,755 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:53:01,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 21:53:01,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-02-20 21:53:01,756 INFO L87 Difference]: Start difference. First operand 616 states and 836 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-02-20 21:53:04,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:04,879 INFO L93 Difference]: Finished difference Result 1382 states and 1911 transitions. [2022-02-20 21:53:04,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 21:53:04,880 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 127 [2022-02-20 21:53:04,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:04,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-02-20 21:53:04,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 573 transitions. [2022-02-20 21:53:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-02-20 21:53:04,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 573 transitions. [2022-02-20 21:53:04,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 573 transitions. [2022-02-20 21:53:05,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 573 edges. 573 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:05,340 INFO L225 Difference]: With dead ends: 1382 [2022-02-20 21:53:05,340 INFO L226 Difference]: Without dead ends: 774 [2022-02-20 21:53:05,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-02-20 21:53:05,342 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 169 mSDsluCounter, 2232 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 2530 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 21:53:05,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 2530 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 21:53:05,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-02-20 21:53:05,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 620. [2022-02-20 21:53:05,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:53:05,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 774 states. Second operand has 620 states, 503 states have (on average 1.333996023856859) internal successors, (671), 505 states have internal predecessors, (671), 78 states have call successors, (78), 37 states have call predecessors, (78), 38 states have return successors, (83), 77 states have call predecessors, (83), 77 states have call successors, (83) [2022-02-20 21:53:05,378 INFO L74 IsIncluded]: Start isIncluded. First operand 774 states. Second operand has 620 states, 503 states have (on average 1.333996023856859) internal successors, (671), 505 states have internal predecessors, (671), 78 states have call successors, (78), 37 states have call predecessors, (78), 38 states have return successors, (83), 77 states have call predecessors, (83), 77 states have call successors, (83) [2022-02-20 21:53:05,379 INFO L87 Difference]: Start difference. First operand 774 states. Second operand has 620 states, 503 states have (on average 1.333996023856859) internal successors, (671), 505 states have internal predecessors, (671), 78 states have call successors, (78), 37 states have call predecessors, (78), 38 states have return successors, (83), 77 states have call predecessors, (83), 77 states have call successors, (83) [2022-02-20 21:53:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:05,416 INFO L93 Difference]: Finished difference Result 774 states and 1073 transitions. [2022-02-20 21:53:05,416 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1073 transitions. [2022-02-20 21:53:05,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:05,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:05,421 INFO L74 IsIncluded]: Start isIncluded. First operand has 620 states, 503 states have (on average 1.333996023856859) internal successors, (671), 505 states have internal predecessors, (671), 78 states have call successors, (78), 37 states have call predecessors, (78), 38 states have return successors, (83), 77 states have call predecessors, (83), 77 states have call successors, (83) Second operand 774 states. [2022-02-20 21:53:05,422 INFO L87 Difference]: Start difference. First operand has 620 states, 503 states have (on average 1.333996023856859) internal successors, (671), 505 states have internal predecessors, (671), 78 states have call successors, (78), 37 states have call predecessors, (78), 38 states have return successors, (83), 77 states have call predecessors, (83), 77 states have call successors, (83) Second operand 774 states. [2022-02-20 21:53:05,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:05,459 INFO L93 Difference]: Finished difference Result 774 states and 1073 transitions. [2022-02-20 21:53:05,460 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1073 transitions. [2022-02-20 21:53:05,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:05,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:05,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:53:05,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:53:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 503 states have (on average 1.333996023856859) internal successors, (671), 505 states have internal predecessors, (671), 78 states have call successors, (78), 37 states have call predecessors, (78), 38 states have return successors, (83), 77 states have call predecessors, (83), 77 states have call successors, (83) [2022-02-20 21:53:05,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 832 transitions. [2022-02-20 21:53:05,493 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 832 transitions. Word has length 127 [2022-02-20 21:53:05,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:53:05,493 INFO L470 AbstractCegarLoop]: Abstraction has 620 states and 832 transitions. [2022-02-20 21:53:05,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-02-20 21:53:05,494 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 832 transitions. [2022-02-20 21:53:05,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-02-20 21:53:05,497 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:05,497 INFO L514 BasicCegarLoop]: trace histogram [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:05,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 21:53:05,497 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:05,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:05,498 INFO L85 PathProgramCache]: Analyzing trace with hash 872950130, now seen corresponding path program 1 times [2022-02-20 21:53:05,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:53:05,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504033690] [2022-02-20 21:53:05,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:05,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:53:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:05,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:53:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:05,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:05,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {13116#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {13032#true} is VALID [2022-02-20 21:53:05,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,727 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13032#true} {13032#true} #491#return; {13032#true} is VALID [2022-02-20 21:53:05,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:05,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {13032#true} ~cond := #in~cond; {13032#true} is VALID [2022-02-20 21:53:05,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {13032#true} assume !(0 == ~cond); {13032#true} is VALID [2022-02-20 21:53:05,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13032#true} {13032#true} #493#return; {13032#true} is VALID [2022-02-20 21:53:05,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {13108#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {13032#true} is VALID [2022-02-20 21:53:05,741 INFO L272 TraceCheckUtils]: 1: Hoare triple {13032#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {13116#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:05,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {13116#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {13032#true} is VALID [2022-02-20 21:53:05,741 INFO L290 TraceCheckUtils]: 3: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,741 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13032#true} {13032#true} #491#return; {13032#true} is VALID [2022-02-20 21:53:05,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {13032#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {13032#true} is VALID [2022-02-20 21:53:05,741 INFO L272 TraceCheckUtils]: 6: Hoare triple {13032#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {13032#true} is VALID [2022-02-20 21:53:05,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {13032#true} ~cond := #in~cond; {13032#true} is VALID [2022-02-20 21:53:05,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {13032#true} assume !(0 == ~cond); {13032#true} is VALID [2022-02-20 21:53:05,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,742 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13032#true} {13032#true} #493#return; {13032#true} is VALID [2022-02-20 21:53:05,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {13032#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {13032#true} is VALID [2022-02-20 21:53:05,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,742 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {13032#true} {13032#true} #497#return; {13032#true} is VALID [2022-02-20 21:53:05,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 21:53:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:05,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:05,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {13116#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {13032#true} is VALID [2022-02-20 21:53:05,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,760 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13032#true} {13032#true} #491#return; {13032#true} is VALID [2022-02-20 21:53:05,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:05,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {13032#true} ~cond := #in~cond; {13032#true} is VALID [2022-02-20 21:53:05,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {13032#true} assume !(0 == ~cond); {13032#true} is VALID [2022-02-20 21:53:05,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13032#true} {13032#true} #493#return; {13032#true} is VALID [2022-02-20 21:53:05,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {13108#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {13032#true} is VALID [2022-02-20 21:53:05,765 INFO L272 TraceCheckUtils]: 1: Hoare triple {13032#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {13116#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:05,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {13116#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {13032#true} is VALID [2022-02-20 21:53:05,766 INFO L290 TraceCheckUtils]: 3: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,766 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13032#true} {13032#true} #491#return; {13032#true} is VALID [2022-02-20 21:53:05,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {13032#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {13032#true} is VALID [2022-02-20 21:53:05,766 INFO L272 TraceCheckUtils]: 6: Hoare triple {13032#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {13032#true} is VALID [2022-02-20 21:53:05,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {13032#true} ~cond := #in~cond; {13032#true} is VALID [2022-02-20 21:53:05,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {13032#true} assume !(0 == ~cond); {13032#true} is VALID [2022-02-20 21:53:05,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,767 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13032#true} {13032#true} #493#return; {13032#true} is VALID [2022-02-20 21:53:05,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {13032#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {13032#true} is VALID [2022-02-20 21:53:05,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,767 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {13032#true} {13033#false} #529#return; {13033#false} is VALID [2022-02-20 21:53:05,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 21:53:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:05,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:05,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {13116#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {13032#true} is VALID [2022-02-20 21:53:05,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13032#true} {13032#true} #491#return; {13032#true} is VALID [2022-02-20 21:53:05,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:05,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {13032#true} ~cond := #in~cond; {13032#true} is VALID [2022-02-20 21:53:05,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {13032#true} assume !(0 == ~cond); {13032#true} is VALID [2022-02-20 21:53:05,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13032#true} {13032#true} #493#return; {13032#true} is VALID [2022-02-20 21:53:05,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {13108#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {13032#true} is VALID [2022-02-20 21:53:05,793 INFO L272 TraceCheckUtils]: 1: Hoare triple {13032#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {13116#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:05,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {13116#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {13032#true} is VALID [2022-02-20 21:53:05,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,793 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13032#true} {13032#true} #491#return; {13032#true} is VALID [2022-02-20 21:53:05,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {13032#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {13032#true} is VALID [2022-02-20 21:53:05,794 INFO L272 TraceCheckUtils]: 6: Hoare triple {13032#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {13032#true} is VALID [2022-02-20 21:53:05,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {13032#true} ~cond := #in~cond; {13032#true} is VALID [2022-02-20 21:53:05,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {13032#true} assume !(0 == ~cond); {13032#true} is VALID [2022-02-20 21:53:05,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,794 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13032#true} {13032#true} #493#return; {13032#true} is VALID [2022-02-20 21:53:05,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {13032#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {13032#true} is VALID [2022-02-20 21:53:05,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,795 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {13032#true} {13033#false} #531#return; {13033#false} is VALID [2022-02-20 21:53:05,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-02-20 21:53:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:05,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {13032#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {13032#true} is VALID [2022-02-20 21:53:05,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,800 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13032#true} {13033#false} #511#return; {13033#false} is VALID [2022-02-20 21:53:05,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-02-20 21:53:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:05,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:05,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:05,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {13116#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {13032#true} is VALID [2022-02-20 21:53:05,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13032#true} {13032#true} #491#return; {13032#true} is VALID [2022-02-20 21:53:05,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 21:53:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:05,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {13032#true} ~cond := #in~cond; {13032#true} is VALID [2022-02-20 21:53:05,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {13032#true} assume !(0 == ~cond); {13032#true} is VALID [2022-02-20 21:53:05,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13032#true} {13032#true} #493#return; {13032#true} is VALID [2022-02-20 21:53:05,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {13108#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {13032#true} is VALID [2022-02-20 21:53:05,846 INFO L272 TraceCheckUtils]: 1: Hoare triple {13032#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {13116#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:05,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {13116#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {13032#true} is VALID [2022-02-20 21:53:05,846 INFO L290 TraceCheckUtils]: 3: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,846 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13032#true} {13032#true} #491#return; {13032#true} is VALID [2022-02-20 21:53:05,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {13032#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {13032#true} is VALID [2022-02-20 21:53:05,847 INFO L272 TraceCheckUtils]: 6: Hoare triple {13032#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {13032#true} is VALID [2022-02-20 21:53:05,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {13032#true} ~cond := #in~cond; {13032#true} is VALID [2022-02-20 21:53:05,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {13032#true} assume !(0 == ~cond); {13032#true} is VALID [2022-02-20 21:53:05,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,847 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13032#true} {13032#true} #493#return; {13032#true} is VALID [2022-02-20 21:53:05,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {13032#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {13032#true} is VALID [2022-02-20 21:53:05,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,848 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {13032#true} {13032#true} #489#return; {13032#true} is VALID [2022-02-20 21:53:05,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {13131#(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; {13032#true} is VALID [2022-02-20 21:53:05,849 INFO L272 TraceCheckUtils]: 1: Hoare triple {13032#true} call #t~ret110#1.base, #t~ret110#1.offset := ldv_successful_zalloc(248); {13108#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:05,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {13108#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {13032#true} is VALID [2022-02-20 21:53:05,850 INFO L272 TraceCheckUtils]: 3: Hoare triple {13032#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {13116#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:05,850 INFO L290 TraceCheckUtils]: 4: Hoare triple {13116#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {13032#true} is VALID [2022-02-20 21:53:05,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,850 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {13032#true} {13032#true} #491#return; {13032#true} is VALID [2022-02-20 21:53:05,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {13032#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {13032#true} is VALID [2022-02-20 21:53:05,850 INFO L272 TraceCheckUtils]: 8: Hoare triple {13032#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {13032#true} is VALID [2022-02-20 21:53:05,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {13032#true} ~cond := #in~cond; {13032#true} is VALID [2022-02-20 21:53:05,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {13032#true} assume !(0 == ~cond); {13032#true} is VALID [2022-02-20 21:53:05,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,851 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13032#true} {13032#true} #493#return; {13032#true} is VALID [2022-02-20 21:53:05,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {13032#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {13032#true} is VALID [2022-02-20 21:53:05,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,851 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13032#true} {13032#true} #489#return; {13032#true} is VALID [2022-02-20 21:53:05,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {13032#true} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret110#1.base, #t~ret110#1.offset;havoc #t~ret110#1.base, #t~ret110#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {13032#true} is VALID [2022-02-20 21:53:05,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {13032#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~mem105#1.base, ldv_set_add_#t~mem105#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; {13032#true} is VALID [2022-02-20 21:53:05,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {13032#true} assume !false; {13032#true} is VALID [2022-02-20 21:53:05,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {13032#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {13032#true} is VALID [2022-02-20 21:53:05,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {13032#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; {13032#true} is VALID [2022-02-20 21:53:05,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {13032#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {13032#true} is VALID [2022-02-20 21:53:05,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,855 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13032#true} {13033#false} #513#return; {13033#false} is VALID [2022-02-20 21:53:05,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-02-20 21:53:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:05,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {13153#(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~nondet19 && #t~nondet19 <= 2147483647;~tmp___0~0 := #t~nondet19;havoc #t~nondet19; {13032#true} is VALID [2022-02-20 21:53:05,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {13032#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {13032#true} is VALID [2022-02-20 21:53:05,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13032#true} {13033#false} #515#return; {13033#false} is VALID [2022-02-20 21:53:05,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {13032#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(71, 3);call #Ultimate.allocInit(41, 4);call #Ultimate.allocInit(2, 5);call write~init~int(12, 5, 0, 1);call write~init~int(0, 5, 1, 1);call #Ultimate.allocInit(54, 6);call #Ultimate.allocInit(2, 7);call write~init~int(12, 7, 0, 1);call write~init~int(0, 7, 1, 1);call #Ultimate.allocInit(45, 8);call #Ultimate.allocInit(2, 9);call write~init~int(12, 9, 0, 1);call write~init~int(0, 9, 1, 1);~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~rfc1051_proto_group0~0.base, ~rfc1051_proto_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~rfc1051_proto_group1~0.base, ~rfc1051_proto_group1~0.offset := 0, 0;~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset := 10, 0;call #Ultimate.allocInit(49, 10);call write~init~int(115, ~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset, 1);call write~init~int(507, ~#rfc1051_proto~0.base, 1 + ~#rfc1051_proto~0.offset, 4);call write~init~int(1, ~#rfc1051_proto~0.base, 5 + ~#rfc1051_proto~0.offset, 4);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#rfc1051_proto~0.base, 9 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#rfc1051_proto~0.base, 17 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#rfc1051_proto~0.base, 25 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rfc1051_proto~0.base, 33 + ~#rfc1051_proto~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rfc1051_proto~0.base, 41 + ~#rfc1051_proto~0.offset, 8);~ldv_retval_0~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 11, 0;call #Ultimate.allocInit(120, 11);#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; {13032#true} is VALID [2022-02-20 21:53:05,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {13032#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet84#1, main_#t~nondet85#1, main_#t~ret86#1.base, main_#t~ret86#1.offset, main_#t~nondet87#1, main_#t~nondet88#1, main_#t~nondet89#1, main_#t~memset~res90#1.base, main_#t~memset~res90#1.offset, main_#t~nondet91#1, main_#t~switch92#1, main_#t~nondet93#1, main_#t~switch94#1, main_#t~ret95#1, main_#t~mem96#1, main_#t~ret97#1, main_#t~nondet98#1, main_#t~switch99#1, main_#t~ret100#1, main_~ldvarg1~0#1, main_~tmp~8#1, main_~ldvarg4~0#1, main_~tmp___0~3#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset, main_~ldvarg0~0#1, main_~tmp___2~0#1, main_~ldvarg5~0#1, main_~tmp___3~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~ldvarg6~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp~8#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___0~3#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___3~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~ldvarg6~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;assume -2147483648 <= main_#t~nondet84#1 && main_#t~nondet84#1 <= 2147483647;main_~tmp~8#1 := main_#t~nondet84#1;havoc main_#t~nondet84#1;main_~ldvarg1~0#1 := main_~tmp~8#1;main_~tmp___0~3#1 := main_#t~nondet85#1;havoc main_#t~nondet85#1;main_~ldvarg4~0#1 := main_~tmp___0~3#1; {13032#true} is VALID [2022-02-20 21:53:05,874 INFO L272 TraceCheckUtils]: 2: Hoare triple {13032#true} call main_#t~ret86#1.base, main_#t~ret86#1.offset := ldv_successful_zalloc(232); {13108#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:05,874 INFO L290 TraceCheckUtils]: 3: Hoare triple {13108#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {13032#true} is VALID [2022-02-20 21:53:05,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {13032#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {13116#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:05,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {13116#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {13032#true} is VALID [2022-02-20 21:53:05,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,875 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13032#true} {13032#true} #491#return; {13032#true} is VALID [2022-02-20 21:53:05,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {13032#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {13032#true} is VALID [2022-02-20 21:53:05,876 INFO L272 TraceCheckUtils]: 9: Hoare triple {13032#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {13032#true} is VALID [2022-02-20 21:53:05,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {13032#true} ~cond := #in~cond; {13032#true} is VALID [2022-02-20 21:53:05,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {13032#true} assume !(0 == ~cond); {13032#true} is VALID [2022-02-20 21:53:05,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,876 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {13032#true} {13032#true} #493#return; {13032#true} is VALID [2022-02-20 21:53:05,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {13032#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {13032#true} is VALID [2022-02-20 21:53:05,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,876 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13032#true} {13032#true} #497#return; {13032#true} is VALID [2022-02-20 21:53:05,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {13032#true} main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset := main_#t~ret86#1.base, main_#t~ret86#1.offset;havoc main_#t~ret86#1.base, main_#t~ret86#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset;assume -2147483648 <= main_#t~nondet87#1 && main_#t~nondet87#1 <= 2147483647;main_~tmp___2~0#1 := main_#t~nondet87#1;havoc main_#t~nondet87#1;main_~ldvarg0~0#1 := main_~tmp___2~0#1;assume -2147483648 <= main_#t~nondet88#1 && main_#t~nondet88#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet88#1;havoc main_#t~nondet88#1;main_~ldvarg5~0#1 := main_~tmp___3~0#1;assume -2147483648 <= main_#t~nondet89#1 && main_#t~nondet89#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet89#1;havoc main_#t~nondet89#1;main_~ldvarg6~0#1 := main_~tmp___4~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; {13032#true} is VALID [2022-02-20 21:53:05,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {13032#true} assume { :end_inline_ldv_set_init } true; {13032#true} is VALID [2022-02-20 21:53:05,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {13032#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~loopctr123#1;#Ultimate.C_memset_#t~loopctr123#1 := 0; {13048#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr123#1| 0) (= (+ (- 1) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) 0))} is VALID [2022-02-20 21:53:05,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {13048#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr123#1| 0) (= (+ (- 1) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) 0))} assume !(#Ultimate.C_memset_#t~loopctr123#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {13033#false} is VALID [2022-02-20 21:53:05,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {13033#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~res90#1.base, main_#t~memset~res90#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~res90#1.base, main_#t~memset~res90#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {13033#false} is VALID [2022-02-20 21:53:05,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {13033#false} assume -2147483648 <= main_#t~nondet91#1 && main_#t~nondet91#1 <= 2147483647;main_~tmp___5~0#1 := main_#t~nondet91#1;havoc main_#t~nondet91#1;main_#t~switch92#1 := 0 == main_~tmp___5~0#1; {13033#false} is VALID [2022-02-20 21:53:05,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {13033#false} assume !main_#t~switch92#1;main_#t~switch92#1 := main_#t~switch92#1 || 1 == main_~tmp___5~0#1; {13033#false} is VALID [2022-02-20 21:53:05,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {13033#false} assume main_#t~switch92#1; {13033#false} is VALID [2022-02-20 21:53:05,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {13033#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet98#1 && main_#t~nondet98#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet98#1;havoc main_#t~nondet98#1;main_#t~switch99#1 := 0 == main_~tmp___7~0#1; {13033#false} is VALID [2022-02-20 21:53:05,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {13033#false} assume !main_#t~switch99#1;main_#t~switch99#1 := main_#t~switch99#1 || 1 == main_~tmp___7~0#1; {13033#false} is VALID [2022-02-20 21:53:05,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {13033#false} assume main_#t~switch99#1; {13033#false} is VALID [2022-02-20 21:53:05,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {13033#false} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_arcnet_rfc1051_init } true;havoc arcnet_rfc1051_init_#res#1;havoc arcnet_rfc1051_init_#t~nondet26#1, arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset;havoc arcnet_rfc1051_init_#t~nondet26#1;call write~$Pointer$(~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset, ~#arc_proto_map~0.base, 1928 + ~#arc_proto_map~0.offset, 8);call arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset := read~$Pointer$(~#arc_proto_map~0.base, 1928 + ~#arc_proto_map~0.offset, 8);call write~$Pointer$(arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset, ~#arc_proto_map~0.base, 1920 + ~#arc_proto_map~0.offset, 8);havoc arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset; {13033#false} is VALID [2022-02-20 21:53:05,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {13033#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 := ~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset; {13033#false} is VALID [2022-02-20 21:53:05,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {13033#false} arcnet_rfc1051_init_#res#1 := 0; {13033#false} is VALID [2022-02-20 21:53:05,879 INFO L290 TraceCheckUtils]: 31: Hoare triple {13033#false} main_#t~ret100#1 := arcnet_rfc1051_init_#res#1;assume { :end_inline_arcnet_rfc1051_init } true;assume -2147483648 <= main_#t~ret100#1 && main_#t~ret100#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret100#1;havoc main_#t~ret100#1; {13033#false} is VALID [2022-02-20 21:53:05,879 INFO L290 TraceCheckUtils]: 32: Hoare triple {13033#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~ret82#1.base, ldv_initialize_ArcProto_1_#t~ret82#1.offset, ldv_initialize_ArcProto_1_#t~ret83#1.base, ldv_initialize_ArcProto_1_#t~ret83#1.offset, ldv_initialize_ArcProto_1_~tmp~7#1.base, ldv_initialize_ArcProto_1_~tmp~7#1.offset, ldv_initialize_ArcProto_1_~tmp___0~2#1.base, ldv_initialize_ArcProto_1_~tmp___0~2#1.offset;havoc ldv_initialize_ArcProto_1_~tmp~7#1.base, ldv_initialize_ArcProto_1_~tmp~7#1.offset;havoc ldv_initialize_ArcProto_1_~tmp___0~2#1.base, ldv_initialize_ArcProto_1_~tmp___0~2#1.offset; {13033#false} is VALID [2022-02-20 21:53:05,880 INFO L272 TraceCheckUtils]: 33: Hoare triple {13033#false} call ldv_initialize_ArcProto_1_#t~ret82#1.base, ldv_initialize_ArcProto_1_#t~ret82#1.offset := ldv_successful_zalloc(20); {13108#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:05,880 INFO L290 TraceCheckUtils]: 34: Hoare triple {13108#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {13032#true} is VALID [2022-02-20 21:53:05,881 INFO L272 TraceCheckUtils]: 35: Hoare triple {13032#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {13116#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:05,881 INFO L290 TraceCheckUtils]: 36: Hoare triple {13116#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {13032#true} is VALID [2022-02-20 21:53:05,881 INFO L290 TraceCheckUtils]: 37: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,881 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13032#true} {13032#true} #491#return; {13032#true} is VALID [2022-02-20 21:53:05,881 INFO L290 TraceCheckUtils]: 39: Hoare triple {13032#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {13032#true} is VALID [2022-02-20 21:53:05,895 INFO L272 TraceCheckUtils]: 40: Hoare triple {13032#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {13032#true} is VALID [2022-02-20 21:53:05,895 INFO L290 TraceCheckUtils]: 41: Hoare triple {13032#true} ~cond := #in~cond; {13032#true} is VALID [2022-02-20 21:53:05,895 INFO L290 TraceCheckUtils]: 42: Hoare triple {13032#true} assume !(0 == ~cond); {13032#true} is VALID [2022-02-20 21:53:05,895 INFO L290 TraceCheckUtils]: 43: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,896 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13032#true} {13032#true} #493#return; {13032#true} is VALID [2022-02-20 21:53:05,896 INFO L290 TraceCheckUtils]: 45: Hoare triple {13032#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {13032#true} is VALID [2022-02-20 21:53:05,896 INFO L290 TraceCheckUtils]: 46: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,896 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13032#true} {13033#false} #529#return; {13033#false} is VALID [2022-02-20 21:53:05,896 INFO L290 TraceCheckUtils]: 48: Hoare triple {13033#false} ldv_initialize_ArcProto_1_~tmp~7#1.base, ldv_initialize_ArcProto_1_~tmp~7#1.offset := ldv_initialize_ArcProto_1_#t~ret82#1.base, ldv_initialize_ArcProto_1_#t~ret82#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret82#1.base, ldv_initialize_ArcProto_1_#t~ret82#1.offset;~rfc1051_proto_group0~0.base, ~rfc1051_proto_group0~0.offset := ldv_initialize_ArcProto_1_~tmp~7#1.base, ldv_initialize_ArcProto_1_~tmp~7#1.offset; {13033#false} is VALID [2022-02-20 21:53:05,896 INFO L272 TraceCheckUtils]: 49: Hoare triple {13033#false} call ldv_initialize_ArcProto_1_#t~ret83#1.base, ldv_initialize_ArcProto_1_#t~ret83#1.offset := ldv_successful_zalloc(3264); {13108#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:05,896 INFO L290 TraceCheckUtils]: 50: Hoare triple {13108#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {13032#true} is VALID [2022-02-20 21:53:05,898 INFO L272 TraceCheckUtils]: 51: Hoare triple {13032#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {13116#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:05,898 INFO L290 TraceCheckUtils]: 52: Hoare triple {13116#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {13032#true} is VALID [2022-02-20 21:53:05,898 INFO L290 TraceCheckUtils]: 53: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,899 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13032#true} {13032#true} #491#return; {13032#true} is VALID [2022-02-20 21:53:05,899 INFO L290 TraceCheckUtils]: 55: Hoare triple {13032#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {13032#true} is VALID [2022-02-20 21:53:05,899 INFO L272 TraceCheckUtils]: 56: Hoare triple {13032#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {13032#true} is VALID [2022-02-20 21:53:05,899 INFO L290 TraceCheckUtils]: 57: Hoare triple {13032#true} ~cond := #in~cond; {13032#true} is VALID [2022-02-20 21:53:05,899 INFO L290 TraceCheckUtils]: 58: Hoare triple {13032#true} assume !(0 == ~cond); {13032#true} is VALID [2022-02-20 21:53:05,899 INFO L290 TraceCheckUtils]: 59: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,899 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13032#true} {13032#true} #493#return; {13032#true} is VALID [2022-02-20 21:53:05,900 INFO L290 TraceCheckUtils]: 61: Hoare triple {13032#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {13032#true} is VALID [2022-02-20 21:53:05,900 INFO L290 TraceCheckUtils]: 62: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,900 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13032#true} {13033#false} #531#return; {13033#false} is VALID [2022-02-20 21:53:05,900 INFO L290 TraceCheckUtils]: 64: Hoare triple {13033#false} ldv_initialize_ArcProto_1_~tmp___0~2#1.base, ldv_initialize_ArcProto_1_~tmp___0~2#1.offset := ldv_initialize_ArcProto_1_#t~ret83#1.base, ldv_initialize_ArcProto_1_#t~ret83#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret83#1.base, ldv_initialize_ArcProto_1_#t~ret83#1.offset;~rfc1051_proto_group1~0.base, ~rfc1051_proto_group1~0.offset := ldv_initialize_ArcProto_1_~tmp___0~2#1.base, ldv_initialize_ArcProto_1_~tmp___0~2#1.offset; {13033#false} is VALID [2022-02-20 21:53:05,900 INFO L290 TraceCheckUtils]: 65: Hoare triple {13033#false} assume { :end_inline_ldv_initialize_ArcProto_1 } true; {13033#false} is VALID [2022-02-20 21:53:05,900 INFO L290 TraceCheckUtils]: 66: Hoare triple {13033#false} assume !(0 != ~ldv_retval_0~0); {13033#false} is VALID [2022-02-20 21:53:05,900 INFO L290 TraceCheckUtils]: 67: Hoare triple {13033#false} assume -2147483648 <= main_#t~nondet91#1 && main_#t~nondet91#1 <= 2147483647;main_~tmp___5~0#1 := main_#t~nondet91#1;havoc main_#t~nondet91#1;main_#t~switch92#1 := 0 == main_~tmp___5~0#1; {13033#false} is VALID [2022-02-20 21:53:05,901 INFO L290 TraceCheckUtils]: 68: Hoare triple {13033#false} assume main_#t~switch92#1; {13033#false} is VALID [2022-02-20 21:53:05,901 INFO L290 TraceCheckUtils]: 69: Hoare triple {13033#false} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet93#1 && main_#t~nondet93#1 <= 2147483647;main_~tmp___6~0#1 := main_#t~nondet93#1;havoc main_#t~nondet93#1;main_#t~switch94#1 := 0 == main_~tmp___6~0#1; {13033#false} is VALID [2022-02-20 21:53:05,901 INFO L290 TraceCheckUtils]: 70: Hoare triple {13033#false} assume !main_#t~switch94#1;main_#t~switch94#1 := main_#t~switch94#1 || 1 == main_~tmp___6~0#1; {13033#false} is VALID [2022-02-20 21:53:05,901 INFO L290 TraceCheckUtils]: 71: Hoare triple {13033#false} assume !main_#t~switch94#1;main_#t~switch94#1 := main_#t~switch94#1 || 2 == main_~tmp___6~0#1; {13033#false} is VALID [2022-02-20 21:53:05,901 INFO L290 TraceCheckUtils]: 72: Hoare triple {13033#false} assume main_#t~switch94#1; {13033#false} is VALID [2022-02-20 21:53:05,901 INFO L290 TraceCheckUtils]: 73: Hoare triple {13033#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 := ~rfc1051_proto_group1~0.base, ~rfc1051_proto_group1~0.offset, main_~ldvarg1~0#1, ~rfc1051_proto_group0~0.base, ~rfc1051_proto_group0~0.offset, main_~ldvarg0~0#1;havoc rx_#t~ret39#1.base, rx_#t~ret39#1.offset, rx_#t~ret40#1.base, rx_#t~ret40#1.offset, rx_#t~nondet41#1, rx_#t~mem42#1, rx_#t~ret43#1.base, rx_#t~ret43#1.offset, rx_#t~mem44#1.base, rx_#t~mem44#1.offset, rx_#t~memcpy~res45#1.base, rx_#t~memcpy~res45#1.offset, rx_#t~memcpy~res46#1.base, rx_#t~memcpy~res46#1.offset, rx_#t~mem53#1.base, rx_#t~mem53#1.offset, rx_#t~ret54#1, rx_#t~ret55#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~1#1.base, rx_~pkt~1#1.offset, rx_~ofs~0#1, rx_~__len~0#1, rx_~__ret~0#1.base, rx_~__ret~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~1#1.base, rx_~pkt~1#1.offset;havoc rx_~ofs~0#1;havoc rx_~__len~0#1;havoc rx_~__ret~0#1.base, rx_~__ret~0#1.offset; {13033#false} is VALID [2022-02-20 21:53:05,901 INFO L272 TraceCheckUtils]: 74: Hoare triple {13033#false} call rx_#t~ret39#1.base, rx_#t~ret39#1.offset := netdev_priv(rx_~dev#1.base, rx_~dev#1.offset); {13032#true} is VALID [2022-02-20 21:53:05,901 INFO L290 TraceCheckUtils]: 75: Hoare triple {13032#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {13032#true} is VALID [2022-02-20 21:53:05,902 INFO L290 TraceCheckUtils]: 76: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,902 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {13032#true} {13033#false} #511#return; {13033#false} is VALID [2022-02-20 21:53:05,902 INFO L290 TraceCheckUtils]: 78: Hoare triple {13033#false} rx_~tmp~4#1.base, rx_~tmp~4#1.offset := rx_#t~ret39#1.base, rx_#t~ret39#1.offset;havoc rx_#t~ret39#1.base, rx_#t~ret39#1.offset;rx_~lp~0#1.base, rx_~lp~0#1.offset := rx_~tmp~4#1.base, rx_~tmp~4#1.offset;rx_~pkt~1#1.base, rx_~pkt~1#1.offset := rx_~pkthdr#1.base, rx_~pkthdr#1.offset; {13033#false} is VALID [2022-02-20 21:53:05,902 INFO L290 TraceCheckUtils]: 79: Hoare triple {13033#false} assume !(rx_~length#1 > 256);rx_~ofs~0#1 := 256 - rx_~length#1; {13033#false} is VALID [2022-02-20 21:53:05,902 INFO L290 TraceCheckUtils]: 80: Hoare triple {13033#false} assume { :begin_inline_ldv_alloc_skb_14 } true;ldv_alloc_skb_14_#in~size#1, ldv_alloc_skb_14_#in~priority#1 := 4 + rx_~length#1, 32;havoc ldv_alloc_skb_14_#res#1.base, ldv_alloc_skb_14_#res#1.offset;havoc ldv_alloc_skb_14_#t~ret101#1.base, ldv_alloc_skb_14_#t~ret101#1.offset, ldv_alloc_skb_14_#t~ret102#1.base, ldv_alloc_skb_14_#t~ret102#1.offset, ldv_alloc_skb_14_#t~mem103#1.base, ldv_alloc_skb_14_#t~mem103#1.offset, ldv_alloc_skb_14_~size#1, ldv_alloc_skb_14_~priority#1, ldv_alloc_skb_14_~tmp~9#1.base, ldv_alloc_skb_14_~tmp~9#1.offset;ldv_alloc_skb_14_~size#1 := ldv_alloc_skb_14_#in~size#1;ldv_alloc_skb_14_~priority#1 := ldv_alloc_skb_14_#in~priority#1;havoc ldv_alloc_skb_14_~tmp~9#1.base, ldv_alloc_skb_14_~tmp~9#1.offset; {13033#false} is VALID [2022-02-20 21:53:05,902 INFO L272 TraceCheckUtils]: 81: Hoare triple {13033#false} call ldv_alloc_skb_14_#t~ret101#1.base, ldv_alloc_skb_14_#t~ret101#1.offset := ldv_skb_alloc(); {13131#(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:05,902 INFO L290 TraceCheckUtils]: 82: Hoare triple {13131#(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; {13032#true} is VALID [2022-02-20 21:53:05,903 INFO L272 TraceCheckUtils]: 83: Hoare triple {13032#true} call #t~ret110#1.base, #t~ret110#1.offset := ldv_successful_zalloc(248); {13108#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:05,903 INFO L290 TraceCheckUtils]: 84: Hoare triple {13108#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {13032#true} is VALID [2022-02-20 21:53:05,904 INFO L272 TraceCheckUtils]: 85: Hoare triple {13032#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~__size, ~__size); {13116#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 21:53:05,904 INFO L290 TraceCheckUtils]: 86: Hoare triple {13116#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {13032#true} is VALID [2022-02-20 21:53:05,904 INFO L290 TraceCheckUtils]: 87: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,904 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13032#true} {13032#true} #491#return; {13032#true} is VALID [2022-02-20 21:53:05,905 INFO L290 TraceCheckUtils]: 89: Hoare triple {13032#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {13032#true} is VALID [2022-02-20 21:53:05,905 INFO L272 TraceCheckUtils]: 90: Hoare triple {13032#true} call assume_abort_if_not((if ~p~0.base != 0 || ~p~0.offset != 0 then 1 else 0)); {13032#true} is VALID [2022-02-20 21:53:05,905 INFO L290 TraceCheckUtils]: 91: Hoare triple {13032#true} ~cond := #in~cond; {13032#true} is VALID [2022-02-20 21:53:05,905 INFO L290 TraceCheckUtils]: 92: Hoare triple {13032#true} assume !(0 == ~cond); {13032#true} is VALID [2022-02-20 21:53:05,905 INFO L290 TraceCheckUtils]: 93: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,905 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {13032#true} {13032#true} #493#return; {13032#true} is VALID [2022-02-20 21:53:05,905 INFO L290 TraceCheckUtils]: 95: Hoare triple {13032#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {13032#true} is VALID [2022-02-20 21:53:05,906 INFO L290 TraceCheckUtils]: 96: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,906 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {13032#true} {13032#true} #489#return; {13032#true} is VALID [2022-02-20 21:53:05,906 INFO L290 TraceCheckUtils]: 98: Hoare triple {13032#true} ~tmp___7~2#1.base, ~tmp___7~2#1.offset := #t~ret110#1.base, #t~ret110#1.offset;havoc #t~ret110#1.base, #t~ret110#1.offset;~skb~1#1.base, ~skb~1#1.offset := ~tmp___7~2#1.base, ~tmp___7~2#1.offset; {13032#true} is VALID [2022-02-20 21:53:05,906 INFO L290 TraceCheckUtils]: 99: Hoare triple {13032#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~mem105#1.base, ldv_set_add_#t~mem105#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; {13032#true} is VALID [2022-02-20 21:53:05,906 INFO L290 TraceCheckUtils]: 100: Hoare triple {13032#true} assume !false; {13032#true} is VALID [2022-02-20 21:53:05,906 INFO L290 TraceCheckUtils]: 101: Hoare triple {13032#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {13032#true} is VALID [2022-02-20 21:53:05,906 INFO L290 TraceCheckUtils]: 102: Hoare triple {13032#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; {13032#true} is VALID [2022-02-20 21:53:05,907 INFO L290 TraceCheckUtils]: 103: Hoare triple {13032#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~1#1.base, ~skb~1#1.offset; {13032#true} is VALID [2022-02-20 21:53:05,907 INFO L290 TraceCheckUtils]: 104: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,907 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {13032#true} {13033#false} #513#return; {13033#false} is VALID [2022-02-20 21:53:05,907 INFO L290 TraceCheckUtils]: 106: Hoare triple {13033#false} ldv_alloc_skb_14_~tmp~9#1.base, ldv_alloc_skb_14_~tmp~9#1.offset := ldv_alloc_skb_14_#t~ret101#1.base, ldv_alloc_skb_14_#t~ret101#1.offset;havoc ldv_alloc_skb_14_#t~ret101#1.base, ldv_alloc_skb_14_#t~ret101#1.offset; {13033#false} is VALID [2022-02-20 21:53:05,907 INFO L290 TraceCheckUtils]: 107: Hoare triple {13033#false} assume ldv_alloc_skb_14_~tmp~9#1.base != 0 || ldv_alloc_skb_14_~tmp~9#1.offset != 0; {13033#false} is VALID [2022-02-20 21:53:05,907 INFO L272 TraceCheckUtils]: 108: Hoare triple {13033#false} call ldv_alloc_skb_14_#t~ret102#1.base, ldv_alloc_skb_14_#t~ret102#1.offset := ldv_malloc(ldv_alloc_skb_14_~size#1 % 4294967296); {13153#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:05,907 INFO L290 TraceCheckUtils]: 109: Hoare triple {13153#(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~nondet19 && #t~nondet19 <= 2147483647;~tmp___0~0 := #t~nondet19;havoc #t~nondet19; {13032#true} is VALID [2022-02-20 21:53:05,908 INFO L290 TraceCheckUtils]: 110: Hoare triple {13032#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {13032#true} is VALID [2022-02-20 21:53:05,908 INFO L290 TraceCheckUtils]: 111: Hoare triple {13032#true} assume true; {13032#true} is VALID [2022-02-20 21:53:05,908 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {13032#true} {13033#false} #515#return; {13033#false} is VALID [2022-02-20 21:53:05,908 INFO L290 TraceCheckUtils]: 113: Hoare triple {13033#false} call write~$Pointer$(ldv_alloc_skb_14_#t~ret102#1.base, ldv_alloc_skb_14_#t~ret102#1.offset, ldv_alloc_skb_14_~tmp~9#1.base, 224 + ldv_alloc_skb_14_~tmp~9#1.offset, 8);havoc ldv_alloc_skb_14_#t~ret102#1.base, ldv_alloc_skb_14_#t~ret102#1.offset;call ldv_alloc_skb_14_#t~mem103#1.base, ldv_alloc_skb_14_#t~mem103#1.offset := read~$Pointer$(ldv_alloc_skb_14_~tmp~9#1.base, 224 + ldv_alloc_skb_14_~tmp~9#1.offset, 8);call write~$Pointer$(ldv_alloc_skb_14_#t~mem103#1.base, ldv_alloc_skb_14_#t~mem103#1.offset, ldv_alloc_skb_14_~tmp~9#1.base, 232 + ldv_alloc_skb_14_~tmp~9#1.offset, 8);havoc ldv_alloc_skb_14_#t~mem103#1.base, ldv_alloc_skb_14_#t~mem103#1.offset; {13033#false} is VALID [2022-02-20 21:53:05,908 INFO L290 TraceCheckUtils]: 114: Hoare triple {13033#false} ldv_alloc_skb_14_#res#1.base, ldv_alloc_skb_14_#res#1.offset := ldv_alloc_skb_14_~tmp~9#1.base, ldv_alloc_skb_14_~tmp~9#1.offset; {13033#false} is VALID [2022-02-20 21:53:05,908 INFO L290 TraceCheckUtils]: 115: Hoare triple {13033#false} rx_#t~ret40#1.base, rx_#t~ret40#1.offset := ldv_alloc_skb_14_#res#1.base, ldv_alloc_skb_14_#res#1.offset;assume { :end_inline_ldv_alloc_skb_14 } true;rx_~skb~0#1.base, rx_~skb~0#1.offset := rx_#t~ret40#1.base, rx_#t~ret40#1.offset;havoc rx_#t~ret40#1.base, rx_#t~ret40#1.offset; {13033#false} is VALID [2022-02-20 21:53:05,908 INFO L290 TraceCheckUtils]: 116: Hoare triple {13033#false} assume 0 == (rx_~skb~0#1.base + rx_~skb~0#1.offset) % 18446744073709551616; {13033#false} is VALID [2022-02-20 21:53:05,909 INFO L290 TraceCheckUtils]: 117: Hoare triple {13033#false} assume 0 != ~arcnet_debug~0;havoc rx_#t~nondet41#1; {13033#false} is VALID [2022-02-20 21:53:05,909 INFO L290 TraceCheckUtils]: 118: Hoare triple {13033#false} call rx_#t~mem42#1 := read~int(rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);call write~int(1 + rx_#t~mem42#1, rx_~dev#1.base, 308 + rx_~dev#1.offset, 8);havoc rx_#t~mem42#1; {13033#false} is VALID [2022-02-20 21:53:05,909 INFO L290 TraceCheckUtils]: 119: Hoare triple {13033#false} assume { :end_inline_rx } true;~ldv_state_variable_1~0 := 1; {13033#false} is VALID [2022-02-20 21:53:05,909 INFO L290 TraceCheckUtils]: 120: Hoare triple {13033#false} assume -2147483648 <= main_#t~nondet91#1 && main_#t~nondet91#1 <= 2147483647;main_~tmp___5~0#1 := main_#t~nondet91#1;havoc main_#t~nondet91#1;main_#t~switch92#1 := 0 == main_~tmp___5~0#1; {13033#false} is VALID [2022-02-20 21:53:05,909 INFO L290 TraceCheckUtils]: 121: Hoare triple {13033#false} assume !main_#t~switch92#1;main_#t~switch92#1 := main_#t~switch92#1 || 1 == main_~tmp___5~0#1; {13033#false} is VALID [2022-02-20 21:53:05,909 INFO L290 TraceCheckUtils]: 122: Hoare triple {13033#false} assume main_#t~switch92#1; {13033#false} is VALID [2022-02-20 21:53:05,913 INFO L290 TraceCheckUtils]: 123: Hoare triple {13033#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet98#1 && main_#t~nondet98#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet98#1;havoc main_#t~nondet98#1;main_#t~switch99#1 := 0 == main_~tmp___7~0#1; {13033#false} is VALID [2022-02-20 21:53:05,916 INFO L290 TraceCheckUtils]: 124: Hoare triple {13033#false} assume main_#t~switch99#1; {13033#false} is VALID [2022-02-20 21:53:05,917 INFO L290 TraceCheckUtils]: 125: Hoare triple {13033#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_arcnet_rfc1051_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#rfc1051_proto~0.base, ~#rfc1051_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; {13033#false} is VALID [2022-02-20 21:53:05,917 INFO L290 TraceCheckUtils]: 126: Hoare triple {13033#false} assume { :end_inline_arcnet_unregister_proto } true; {13033#false} is VALID [2022-02-20 21:53:05,917 INFO L290 TraceCheckUtils]: 127: Hoare triple {13033#false} assume { :end_inline_arcnet_rfc1051_exit } true;~ldv_state_variable_0~0 := 2; {13033#false} is VALID [2022-02-20 21:53:05,917 INFO L290 TraceCheckUtils]: 128: Hoare triple {13033#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret114#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); {13033#false} is VALID [2022-02-20 21:53:05,917 INFO L290 TraceCheckUtils]: 129: Hoare triple {13033#false} ldv_check_final_state_#t~ret114#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret114#1 && ldv_check_final_state_#t~ret114#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret114#1;havoc ldv_check_final_state_#t~ret114#1; {13033#false} is VALID [2022-02-20 21:53:05,917 INFO L290 TraceCheckUtils]: 130: Hoare triple {13033#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {13033#false} is VALID [2022-02-20 21:53:05,917 INFO L272 TraceCheckUtils]: 131: Hoare triple {13033#false} call ldv_error(); {13033#false} is VALID [2022-02-20 21:53:05,918 INFO L290 TraceCheckUtils]: 132: Hoare triple {13033#false} assume !false; {13033#false} is VALID [2022-02-20 21:53:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-02-20 21:53:05,918 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:53:05,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504033690] [2022-02-20 21:53:05,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504033690] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:05,920 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:05,920 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 21:53:05,921 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066733941] [2022-02-20 21:53:05,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:05,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 133 [2022-02-20 21:53:05,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:05,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:53:05,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:05,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 21:53:05,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:53:05,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 21:53:05,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:53:05,998 INFO L87 Difference]: Start difference. First operand 620 states and 832 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:53:07,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:07,044 INFO L93 Difference]: Finished difference Result 1270 states and 1717 transitions. [2022-02-20 21:53:07,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:53:07,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 133 [2022-02-20 21:53:07,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:07,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:53:07,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 473 transitions. [2022-02-20 21:53:07,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:53:07,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 473 transitions. [2022-02-20 21:53:07,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 473 transitions. [2022-02-20 21:53:07,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:07,458 INFO L225 Difference]: With dead ends: 1270 [2022-02-20 21:53:07,459 INFO L226 Difference]: Without dead ends: 657 [2022-02-20 21:53:07,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 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:07,462 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 103 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 21:53:07,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 664 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 21:53:07,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2022-02-20 21:53:07,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 621. [2022-02-20 21:53:07,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:53:07,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 657 states. Second operand has 621 states, 504 states have (on average 1.3333333333333333) internal successors, (672), 506 states have internal predecessors, (672), 78 states have call successors, (78), 37 states have call predecessors, (78), 38 states have return successors, (83), 77 states have call predecessors, (83), 77 states have call successors, (83) [2022-02-20 21:53:07,489 INFO L74 IsIncluded]: Start isIncluded. First operand 657 states. Second operand has 621 states, 504 states have (on average 1.3333333333333333) internal successors, (672), 506 states have internal predecessors, (672), 78 states have call successors, (78), 37 states have call predecessors, (78), 38 states have return successors, (83), 77 states have call predecessors, (83), 77 states have call successors, (83) [2022-02-20 21:53:07,490 INFO L87 Difference]: Start difference. First operand 657 states. Second operand has 621 states, 504 states have (on average 1.3333333333333333) internal successors, (672), 506 states have internal predecessors, (672), 78 states have call successors, (78), 37 states have call predecessors, (78), 38 states have return successors, (83), 77 states have call predecessors, (83), 77 states have call successors, (83) [2022-02-20 21:53:07,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:07,516 INFO L93 Difference]: Finished difference Result 657 states and 893 transitions. [2022-02-20 21:53:07,516 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 893 transitions. [2022-02-20 21:53:07,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:07,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:07,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 621 states, 504 states have (on average 1.3333333333333333) internal successors, (672), 506 states have internal predecessors, (672), 78 states have call successors, (78), 37 states have call predecessors, (78), 38 states have return successors, (83), 77 states have call predecessors, (83), 77 states have call successors, (83) Second operand 657 states. [2022-02-20 21:53:07,521 INFO L87 Difference]: Start difference. First operand has 621 states, 504 states have (on average 1.3333333333333333) internal successors, (672), 506 states have internal predecessors, (672), 78 states have call successors, (78), 37 states have call predecessors, (78), 38 states have return successors, (83), 77 states have call predecessors, (83), 77 states have call successors, (83) Second operand 657 states. [2022-02-20 21:53:07,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:07,548 INFO L93 Difference]: Finished difference Result 657 states and 893 transitions. [2022-02-20 21:53:07,548 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 893 transitions. [2022-02-20 21:53:07,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:07,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:07,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:53:07,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:53:07,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 504 states have (on average 1.3333333333333333) internal successors, (672), 506 states have internal predecessors, (672), 78 states have call successors, (78), 37 states have call predecessors, (78), 38 states have return successors, (83), 77 states have call predecessors, (83), 77 states have call successors, (83) [2022-02-20 21:53:07,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 833 transitions. [2022-02-20 21:53:07,581 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 833 transitions. Word has length 133 [2022-02-20 21:53:07,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:53:07,582 INFO L470 AbstractCegarLoop]: Abstraction has 621 states and 833 transitions. [2022-02-20 21:53:07,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:53:07,582 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 833 transitions. [2022-02-20 21:53:07,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-20 21:53:07,584 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:07,584 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 21:53:07,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 21:53:07,585 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:07,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:07,586 INFO L85 PathProgramCache]: Analyzing trace with hash 123812154, now seen corresponding path program 1 times [2022-02-20 21:53:07,586 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:53:07,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297174790] [2022-02-20 21:53:07,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:07,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:53:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 21:53:07,718 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 21:53:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 21:53:07,867 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 21:53:07,867 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 21:53:07,868 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 21:53:07,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 21:53:07,872 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:53:07,874 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 21:53:07,895 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,896 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,896 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,897 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,897 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,897 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,898 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,898 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,898 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,898 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,899 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,899 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,899 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,900 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,900 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,900 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,901 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,901 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,901 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,901 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,902 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,902 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,902 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,902 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,902 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,903 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,903 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,903 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,903 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,904 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,904 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,904 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,904 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,905 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,905 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,905 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,905 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,905 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,906 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,906 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,906 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,906 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,907 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,907 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,907 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,907 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,908 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,908 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,908 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,908 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,908 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,909 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,909 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,909 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,912 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,912 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,912 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,912 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,913 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,913 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,913 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,913 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,916 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,916 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,916 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,916 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,917 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,917 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,917 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,917 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,918 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,918 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,918 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,918 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,918 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,919 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,919 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,919 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,919 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,919 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,920 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,920 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,920 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,920 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,920 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,921 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,921 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,921 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,921 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,921 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,922 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,922 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,922 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,922 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,923 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,923 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,923 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,923 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,923 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,924 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,924 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,924 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,924 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,924 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,925 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,925 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,926 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,926 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,926 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,926 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,926 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,927 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,927 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,927 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,927 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,928 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,928 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,928 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,928 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,929 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,929 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,929 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,934 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,934 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,934 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,935 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,935 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,935 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,935 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,936 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,936 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,936 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,936 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,936 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,937 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,938 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,938 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,938 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,938 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,939 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,939 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,939 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,939 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,940 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,940 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,940 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,940 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,941 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,941 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,941 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,941 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,941 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,942 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,942 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,942 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,942 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,943 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,943 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,943 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,943 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,944 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,944 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,944 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,944 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,945 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,945 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,945 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,946 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,946 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,946 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,946 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,946 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,947 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,947 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,947 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,947 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,948 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,948 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,948 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,948 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,949 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,949 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,949 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,949 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,950 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,950 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,950 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,950 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,951 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,951 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,951 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,951 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,952 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,952 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,952 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,952 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,953 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,953 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,953 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,953 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,954 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,954 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,954 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,954 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,955 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,955 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,955 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,955 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:07,956 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-02-20 21:53:07,956 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-02-20 21:53:08,002 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret86 := ldv_successful_zalloc(232); [2022-02-20 21:53:08,003 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:08,007 INFO L158 Benchmark]: Toolchain (without parser) took 18066.62ms. Allocated memory was 98.6MB in the beginning and 232.8MB in the end (delta: 134.2MB). Free memory was 64.0MB in the beginning and 99.2MB in the end (delta: -35.2MB). Peak memory consumption was 98.2MB. Max. memory is 16.1GB. [2022-02-20 21:53:08,007 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 98.6MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 21:53:08,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1068.49ms. Allocated memory was 98.6MB in the beginning and 138.4MB in the end (delta: 39.8MB). Free memory was 63.8MB in the beginning and 68.0MB in the end (delta: -4.3MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2022-02-20 21:53:08,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.72ms. Allocated memory is still 138.4MB. Free memory was 67.3MB in the beginning and 61.8MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 21:53:08,008 INFO L158 Benchmark]: Boogie Preprocessor took 117.85ms. Allocated memory is still 138.4MB. Free memory was 61.8MB in the beginning and 93.4MB in the end (delta: -31.6MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2022-02-20 21:53:08,008 INFO L158 Benchmark]: RCFGBuilder took 1051.12ms. Allocated memory was 138.4MB in the beginning and 184.5MB in the end (delta: 46.1MB). Free memory was 93.4MB in the beginning and 119.1MB in the end (delta: -25.7MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2022-02-20 21:53:08,009 INFO L158 Benchmark]: TraceAbstraction took 15718.04ms. Allocated memory was 184.5MB in the beginning and 232.8MB in the end (delta: 48.2MB). Free memory was 117.9MB in the beginning and 99.2MB in the end (delta: 18.6MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2022-02-20 21:53:08,010 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.20ms. Allocated memory is still 98.6MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1068.49ms. Allocated memory was 98.6MB in the beginning and 138.4MB in the end (delta: 39.8MB). Free memory was 63.8MB in the beginning and 68.0MB in the end (delta: -4.3MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.72ms. Allocated memory is still 138.4MB. Free memory was 67.3MB in the beginning and 61.8MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.85ms. Allocated memory is still 138.4MB. Free memory was 61.8MB in the beginning and 93.4MB in the end (delta: -31.6MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1051.12ms. Allocated memory was 138.4MB in the beginning and 184.5MB in the end (delta: 46.1MB). Free memory was 93.4MB in the beginning and 119.1MB in the end (delta: -25.7MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15718.04ms. Allocated memory was 184.5MB in the beginning and 232.8MB in the end (delta: 48.2MB). Free memory was 117.9MB in the beginning and 99.2MB in the end (delta: 18.6MB). Peak memory consumption was 66.7MB. 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_#res#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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_#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 * 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:08,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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--rfc1051.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 73b3ed2538f968a3e44c5d7fd04ec7d3b91dc8bba4b6c9eed0228eaab08d1208 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:53:09,916 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:53:09,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:53:09,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:53:09,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:53:09,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:53:09,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:53:09,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:53:09,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:53:09,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:53:09,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:53:09,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:53:09,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:53:09,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:53:09,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:53:09,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:53:09,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:53:09,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:53:09,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:53:09,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:53:09,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:53:09,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:53:09,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:53:09,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:53:10,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:53:10,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:53:10,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:53:10,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:53:10,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:53:10,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:53:10,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:53:10,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:53:10,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:53:10,010 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:53:10,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:53:10,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:53:10,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:53:10,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:53:10,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:53:10,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:53:10,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:53:10,015 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:10,062 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:53:10,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:53:10,064 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:53:10,064 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:53:10,065 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:53:10,065 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:53:10,066 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:53:10,066 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:53:10,066 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:53:10,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:53:10,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:53:10,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:53:10,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:53:10,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:53:10,068 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 21:53:10,068 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 21:53:10,069 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 21:53:10,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:53:10,069 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:53:10,069 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:53:10,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:53:10,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:53:10,070 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:53:10,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:53:10,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:53:10,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:53:10,071 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:53:10,071 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 21:53:10,071 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 21:53:10,071 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:53:10,071 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:53:10,071 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:53:10,072 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 21:53:10,072 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 -> 73b3ed2538f968a3e44c5d7fd04ec7d3b91dc8bba4b6c9eed0228eaab08d1208 [2022-02-20 21:53:10,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:53:10,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:53:10,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:53:10,380 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:53:10,382 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:53:10,383 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--rfc1051.ko-entry_point.cil.out.i [2022-02-20 21:53:10,434 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df2f48069/7b2dacedefdc4314b70109793fa3a797/FLAGff24308e1 [2022-02-20 21:53:11,097 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:53:11,097 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--rfc1051.ko-entry_point.cil.out.i [2022-02-20 21:53:11,128 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df2f48069/7b2dacedefdc4314b70109793fa3a797/FLAGff24308e1 [2022-02-20 21:53:11,428 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df2f48069/7b2dacedefdc4314b70109793fa3a797 [2022-02-20 21:53:11,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:53:11,433 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:53:11,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:53:11,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:53:11,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:53:11,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:53:11" (1/1) ... [2022-02-20 21:53:11,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@748112ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:11, skipping insertion in model container [2022-02-20 21:53:11,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:53:11" (1/1) ... [2022-02-20 21:53:11,457 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:53:11,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:53:12,104 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--rfc1051.ko-entry_point.cil.out.i[153414,153427] [2022-02-20 21:53:12,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:53:12,287 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 21:53:12,313 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:53:12,395 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--rfc1051.ko-entry_point.cil.out.i[153414,153427] [2022-02-20 21:53:12,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:53:12,433 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:53:12,563 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--rfc1051.ko-entry_point.cil.out.i[153414,153427] [2022-02-20 21:53:12,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:53:12,640 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:53:12,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:12 WrapperNode [2022-02-20 21:53:12,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:53:12,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:53:12,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:53:12,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:53:12,648 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:12" (1/1) ... [2022-02-20 21:53:12,684 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:12" (1/1) ... [2022-02-20 21:53:12,744 INFO L137 Inliner]: procedures = 97, calls = 171, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 509 [2022-02-20 21:53:12,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:53:12,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:53:12,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:53:12,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:53:12,759 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:12" (1/1) ... [2022-02-20 21:53:12,759 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:12" (1/1) ... [2022-02-20 21:53:12,778 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:12" (1/1) ... [2022-02-20 21:53:12,780 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:12" (1/1) ... [2022-02-20 21:53:12,814 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:12" (1/1) ... [2022-02-20 21:53:12,820 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:12" (1/1) ... [2022-02-20 21:53:12,824 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:12" (1/1) ... [2022-02-20 21:53:12,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:53:12,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:53:12,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:53:12,848 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:53:12,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:12" (1/1) ... [2022-02-20 21:53:12,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:53:12,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:53:12,884 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:12,906 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:12,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-02-20 21:53:12,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-02-20 21:53:12,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 21:53:12,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 21:53:12,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 21:53:12,922 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:53:12,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:53:12,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 21:53:12,922 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 21:53:12,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 21:53:12,922 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 21:53:12,923 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:53:12,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:53:12,923 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:12,923 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:12,923 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-02-20 21:53:12,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-02-20 21:53:12,924 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:53:12,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:53:12,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-02-20 21:53:12,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2022-02-20 21:53:12,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-02-20 21:53:12,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2022-02-20 21:53:12,925 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:53:12,925 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:53:12,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:53:12,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:53:12,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:53:12,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:53:12,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2022-02-20 21:53:12,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2022-02-20 21:53:12,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2022-02-20 21:53:12,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:53:12,926 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-02-20 21:53:12,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-02-20 21:53:12,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-02-20 21:53:12,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-02-20 21:53:12,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-02-20 21:53:12,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:53:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 21:53:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:53:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 21:53:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-02-20 21:53:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_zalloc [2022-02-20 21:53:12,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_zalloc [2022-02-20 21:53:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-02-20 21:53:12,929 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-02-20 21:53:12,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2022-02-20 21:53:12,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:53:12,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:53:13,229 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:53:13,230 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:53:13,361 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:53:17,256 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:53:17,265 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:53:17,266 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 21:53:17,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:53:17 BoogieIcfgContainer [2022-02-20 21:53:17,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:53:17,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:53:17,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:53:17,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:53:17,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:53:11" (1/3) ... [2022-02-20 21:53:17,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9a0817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:53:17, skipping insertion in model container [2022-02-20 21:53:17,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:12" (2/3) ... [2022-02-20 21:53:17,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9a0817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:53:17, skipping insertion in model container [2022-02-20 21:53:17,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:53:17" (3/3) ... [2022-02-20 21:53:17,274 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1051.ko-entry_point.cil.out.i [2022-02-20 21:53:17,278 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:53:17,279 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:53:17,319 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:53:17,324 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:17,324 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:53:17,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 146 states have (on average 1.4246575342465753) internal successors, (208), 151 states have internal predecessors, (208), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 21:53:17,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 21:53:17,353 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:17,353 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:17,354 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:17,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:17,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2020398219, now seen corresponding path program 1 times [2022-02-20 21:53:17,370 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:53:17,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894441373] [2022-02-20 21:53:17,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:17,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:53:17,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:53:17,375 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:17,379 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:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:17,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 21:53:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:17,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:53:17,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {186#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(71bv64, 3bv64);call #Ultimate.allocInit(41bv64, 4bv64);call #Ultimate.allocInit(2bv64, 5bv64);call write~init~intINTTYPE1(12bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 1bv64, 1bv64);call #Ultimate.allocInit(54bv64, 6bv64);call #Ultimate.allocInit(2bv64, 7bv64);call write~init~intINTTYPE1(12bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 1bv64, 1bv64);call #Ultimate.allocInit(45bv64, 8bv64);call #Ultimate.allocInit(2bv64, 9bv64);call write~init~intINTTYPE1(12bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 1bv64, 1bv64);~ldv_state_variable_1~0 := 0bv32;~LDV_IN_INTERRUPT~0 := 1bv32;~rfc1051_proto_group0~0.base, ~rfc1051_proto_group0~0.offset := 0bv64, 0bv64;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 0bv32;~rfc1051_proto_group1~0.base, ~rfc1051_proto_group1~0.offset := 0bv64, 0bv64;~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(49bv64, 10bv64);call write~init~intINTTYPE1(115bv8, ~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset, 1bv64);call write~init~intINTTYPE4(507bv32, ~#rfc1051_proto~0.base, ~bvadd64(1bv64, ~#rfc1051_proto~0.offset), 4bv64);call write~init~intINTTYPE4(1bv32, ~#rfc1051_proto~0.base, ~bvadd64(5bv64, ~#rfc1051_proto~0.offset), 4bv64);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#rfc1051_proto~0.base, ~bvadd64(9bv64, ~#rfc1051_proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#rfc1051_proto~0.base, ~bvadd64(17bv64, ~#rfc1051_proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#rfc1051_proto~0.base, ~bvadd64(25bv64, ~#rfc1051_proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#rfc1051_proto~0.base, ~bvadd64(33bv64, ~#rfc1051_proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#rfc1051_proto~0.base, ~bvadd64(41bv64, ~#rfc1051_proto~0.offset), 8bv64);~ldv_retval_0~0 := 0bv32;~#set_impl~0.base, ~#set_impl~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(120bv64, 11bv64);#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; {186#true} is VALID [2022-02-20 21:53:17,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet84#1, main_#t~nondet85#1, main_#t~ret86#1.base, main_#t~ret86#1.offset, main_#t~nondet87#1, main_#t~nondet88#1, main_#t~nondet89#1, main_#t~memset~res90#1.base, main_#t~memset~res90#1.offset, main_#t~nondet91#1, main_#t~switch92#1, main_#t~nondet93#1, main_#t~switch94#1, main_#t~ret95#1, main_#t~mem96#1, main_#t~ret97#1, main_#t~nondet98#1, main_#t~switch99#1, main_#t~ret100#1, main_~ldvarg1~0#1, main_~tmp~8#1, main_~ldvarg4~0#1, main_~tmp___0~3#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset, main_~ldvarg0~0#1, main_~tmp___2~0#1, main_~ldvarg5~0#1, main_~tmp___3~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~ldvarg6~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp~8#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___0~3#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___3~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1bv64);havoc main_~ldvarg6~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;main_~tmp~8#1 := main_#t~nondet84#1;havoc main_#t~nondet84#1;main_~ldvarg1~0#1 := main_~tmp~8#1;main_~tmp___0~3#1 := main_#t~nondet85#1;havoc main_#t~nondet85#1;main_~ldvarg4~0#1 := main_~tmp___0~3#1; {186#true} is VALID [2022-02-20 21:53:17,843 INFO L272 TraceCheckUtils]: 2: Hoare triple {186#true} call main_#t~ret86#1.base, main_#t~ret86#1.offset := ldv_successful_zalloc(232bv64); {186#true} is VALID [2022-02-20 21:53:17,843 INFO L290 TraceCheckUtils]: 3: Hoare triple {186#true} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {186#true} is VALID [2022-02-20 21:53:17,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {186#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1bv64, ~__size, ~__size); {186#true} is VALID [2022-02-20 21:53:17,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {186#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {186#true} is VALID [2022-02-20 21:53:17,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 21:53:17,844 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {186#true} {186#true} #491#return; {186#true} is VALID [2022-02-20 21:53:17,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {186#true} is VALID [2022-02-20 21:53:17,844 INFO L272 TraceCheckUtils]: 9: Hoare triple {186#true} call assume_abort_if_not((if ~p~0.base != 0bv64 || ~p~0.offset != 0bv64 then 1bv32 else 0bv32)); {186#true} is VALID [2022-02-20 21:53:17,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {186#true} ~cond := #in~cond; {186#true} is VALID [2022-02-20 21:53:17,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {186#true} assume !(0bv32 == ~cond); {186#true} is VALID [2022-02-20 21:53:17,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 21:53:17,845 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {186#true} {186#true} #493#return; {186#true} is VALID [2022-02-20 21:53:17,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {186#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {186#true} is VALID [2022-02-20 21:53:17,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 21:53:17,846 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {186#true} {186#true} #497#return; {186#true} is VALID [2022-02-20 21:53:17,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {186#true} main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset := main_#t~ret86#1.base, main_#t~ret86#1.offset;havoc main_#t~ret86#1.base, main_#t~ret86#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset;main_~tmp___2~0#1 := main_#t~nondet87#1;havoc main_#t~nondet87#1;main_~ldvarg0~0#1 := main_~tmp___2~0#1;main_~tmp___3~0#1 := main_#t~nondet88#1;havoc main_#t~nondet88#1;main_~ldvarg5~0#1 := main_~tmp___3~0#1;main_~tmp___4~0#1 := main_#t~nondet89#1;havoc main_#t~nondet89#1;main_~ldvarg6~0#1 := main_~tmp___4~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; {186#true} is VALID [2022-02-20 21:53:17,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {186#true} assume { :end_inline_ldv_set_init } true; {186#true} is VALID [2022-02-20 21:53:17,848 INFO L290 TraceCheckUtils]: 19: Hoare triple {186#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~loopctr123#1;#Ultimate.C_memset_#t~loopctr123#1 := 0bv64; {248#(and (= (_ bv0 64) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr123#1|) (= (_ bv1 64) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 21:53:17,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {248#(and (= (_ bv0 64) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr123#1|) (= (_ bv1 64) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume !~bvult64(#Ultimate.C_memset_#t~loopctr123#1, #Ultimate.C_memset_#amount#1); {187#false} is VALID [2022-02-20 21:53:17,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {187#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~res90#1.base, main_#t~memset~res90#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~res90#1.base, main_#t~memset~res90#1.offset;~ldv_state_variable_1~0 := 0bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 1bv32; {187#false} is VALID [2022-02-20 21:53:17,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {187#false} main_~tmp___5~0#1 := main_#t~nondet91#1;havoc main_#t~nondet91#1;main_#t~switch92#1 := 0bv32 == main_~tmp___5~0#1; {187#false} is VALID [2022-02-20 21:53:17,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {187#false} assume !main_#t~switch92#1;main_#t~switch92#1 := main_#t~switch92#1 || 1bv32 == main_~tmp___5~0#1; {187#false} is VALID [2022-02-20 21:53:17,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {187#false} assume main_#t~switch92#1; {187#false} is VALID [2022-02-20 21:53:17,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {187#false} assume 0bv32 != ~ldv_state_variable_0~0;main_~tmp___7~0#1 := main_#t~nondet98#1;havoc main_#t~nondet98#1;main_#t~switch99#1 := 0bv32 == main_~tmp___7~0#1; {187#false} is VALID [2022-02-20 21:53:17,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {187#false} assume main_#t~switch99#1; {187#false} is VALID [2022-02-20 21:53:17,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {187#false} assume 3bv32 == ~ldv_state_variable_0~0 && 0bv32 == ~ref_cnt~0;assume { :begin_inline_arcnet_rfc1051_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#rfc1051_proto~0.base, ~#rfc1051_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; {187#false} is VALID [2022-02-20 21:53:17,851 INFO L290 TraceCheckUtils]: 28: Hoare triple {187#false} assume { :end_inline_arcnet_unregister_proto } true; {187#false} is VALID [2022-02-20 21:53:17,851 INFO L290 TraceCheckUtils]: 29: Hoare triple {187#false} assume { :end_inline_arcnet_rfc1051_exit } true;~ldv_state_variable_0~0 := 2bv32; {187#false} is VALID [2022-02-20 21:53:17,851 INFO L290 TraceCheckUtils]: 30: Hoare triple {187#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret114#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); {187#false} is VALID [2022-02-20 21:53:17,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {187#false} ldv_check_final_state_#t~ret114#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~ret114#1;havoc ldv_check_final_state_#t~ret114#1; {187#false} is VALID [2022-02-20 21:53:17,852 INFO L290 TraceCheckUtils]: 32: Hoare triple {187#false} assume !(0bv32 != ldv_check_final_state_~tmp___7~6#1); {187#false} is VALID [2022-02-20 21:53:17,852 INFO L272 TraceCheckUtils]: 33: Hoare triple {187#false} call ldv_error(); {187#false} is VALID [2022-02-20 21:53:17,852 INFO L290 TraceCheckUtils]: 34: Hoare triple {187#false} assume !false; {187#false} is VALID [2022-02-20 21:53:17,853 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:17,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:53:17,854 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:53:17,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894441373] [2022-02-20 21:53:17,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894441373] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:17,855 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:17,855 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 21:53:17,856 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705010526] [2022-02-20 21:53:17,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:17,861 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:17,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:17,865 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:17,911 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:17,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:53:17,912 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:53:17,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:53:17,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:53:17,937 INFO L87 Difference]: Start difference. First operand has 183 states, 146 states have (on average 1.4246575342465753) internal successors, (208), 151 states have internal predecessors, (208), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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:24,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:24,784 INFO L93 Difference]: Finished difference Result 362 states and 520 transitions. [2022-02-20 21:53:24,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:53:24,785 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:24,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:24,786 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:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2022-02-20 21:53:24,806 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:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2022-02-20 21:53:24,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 520 transitions. [2022-02-20 21:53:25,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 520 edges. 520 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:25,640 INFO L225 Difference]: With dead ends: 362 [2022-02-20 21:53:25,640 INFO L226 Difference]: Without dead ends: 174 [2022-02-20 21:53:25,643 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:25,646 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 0 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 486 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:25,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 486 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:25,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-02-20 21:53:25,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-02-20 21:53:25,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:53:25,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 174 states, 142 states have (on average 1.352112676056338) internal successors, (192), 142 states have internal predecessors, (192), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-02-20 21:53:25,688 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 174 states, 142 states have (on average 1.352112676056338) internal successors, (192), 142 states have internal predecessors, (192), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-02-20 21:53:25,689 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 174 states, 142 states have (on average 1.352112676056338) internal successors, (192), 142 states have internal predecessors, (192), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-02-20 21:53:25,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:25,705 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2022-02-20 21:53:25,705 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-02-20 21:53:25,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:25,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:25,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 142 states have (on average 1.352112676056338) internal successors, (192), 142 states have internal predecessors, (192), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 174 states. [2022-02-20 21:53:25,714 INFO L87 Difference]: Start difference. First operand has 174 states, 142 states have (on average 1.352112676056338) internal successors, (192), 142 states have internal predecessors, (192), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 174 states. [2022-02-20 21:53:25,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:25,724 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2022-02-20 21:53:25,724 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-02-20 21:53:25,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:25,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:25,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:53:25,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:53:25,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 142 states have (on average 1.352112676056338) internal successors, (192), 142 states have internal predecessors, (192), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-02-20 21:53:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2022-02-20 21:53:25,741 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 235 transitions. Word has length 35 [2022-02-20 21:53:25,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:53:25,741 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 235 transitions. [2022-02-20 21:53:25,741 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:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-02-20 21:53:25,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 21:53:25,743 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:25,744 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:25,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 21:53:25,955 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:25,956 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:25,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:25,960 INFO L85 PathProgramCache]: Analyzing trace with hash 21026425, now seen corresponding path program 1 times [2022-02-20 21:53:25,961 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:53:25,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111920383] [2022-02-20 21:53:25,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:25,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:53:25,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:53:25,962 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:25,964 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:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:26,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 21:53:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:26,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:53:26,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {1370#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(71bv64, 3bv64);call #Ultimate.allocInit(41bv64, 4bv64);call #Ultimate.allocInit(2bv64, 5bv64);call write~init~intINTTYPE1(12bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 1bv64, 1bv64);call #Ultimate.allocInit(54bv64, 6bv64);call #Ultimate.allocInit(2bv64, 7bv64);call write~init~intINTTYPE1(12bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 1bv64, 1bv64);call #Ultimate.allocInit(45bv64, 8bv64);call #Ultimate.allocInit(2bv64, 9bv64);call write~init~intINTTYPE1(12bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 1bv64, 1bv64);~ldv_state_variable_1~0 := 0bv32;~LDV_IN_INTERRUPT~0 := 1bv32;~rfc1051_proto_group0~0.base, ~rfc1051_proto_group0~0.offset := 0bv64, 0bv64;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 0bv32;~rfc1051_proto_group1~0.base, ~rfc1051_proto_group1~0.offset := 0bv64, 0bv64;~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(49bv64, 10bv64);call write~init~intINTTYPE1(115bv8, ~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset, 1bv64);call write~init~intINTTYPE4(507bv32, ~#rfc1051_proto~0.base, ~bvadd64(1bv64, ~#rfc1051_proto~0.offset), 4bv64);call write~init~intINTTYPE4(1bv32, ~#rfc1051_proto~0.base, ~bvadd64(5bv64, ~#rfc1051_proto~0.offset), 4bv64);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#rfc1051_proto~0.base, ~bvadd64(9bv64, ~#rfc1051_proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#rfc1051_proto~0.base, ~bvadd64(17bv64, ~#rfc1051_proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#rfc1051_proto~0.base, ~bvadd64(25bv64, ~#rfc1051_proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#rfc1051_proto~0.base, ~bvadd64(33bv64, ~#rfc1051_proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#rfc1051_proto~0.base, ~bvadd64(41bv64, ~#rfc1051_proto~0.offset), 8bv64);~ldv_retval_0~0 := 0bv32;~#set_impl~0.base, ~#set_impl~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(120bv64, 11bv64);#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; {1370#true} is VALID [2022-02-20 21:53:26,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {1370#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet84#1, main_#t~nondet85#1, main_#t~ret86#1.base, main_#t~ret86#1.offset, main_#t~nondet87#1, main_#t~nondet88#1, main_#t~nondet89#1, main_#t~memset~res90#1.base, main_#t~memset~res90#1.offset, main_#t~nondet91#1, main_#t~switch92#1, main_#t~nondet93#1, main_#t~switch94#1, main_#t~ret95#1, main_#t~mem96#1, main_#t~ret97#1, main_#t~nondet98#1, main_#t~switch99#1, main_#t~ret100#1, main_~ldvarg1~0#1, main_~tmp~8#1, main_~ldvarg4~0#1, main_~tmp___0~3#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset, main_~ldvarg0~0#1, main_~tmp___2~0#1, main_~ldvarg5~0#1, main_~tmp___3~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~ldvarg6~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp~8#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___0~3#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___3~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1bv64);havoc main_~ldvarg6~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;main_~tmp~8#1 := main_#t~nondet84#1;havoc main_#t~nondet84#1;main_~ldvarg1~0#1 := main_~tmp~8#1;main_~tmp___0~3#1 := main_#t~nondet85#1;havoc main_#t~nondet85#1;main_~ldvarg4~0#1 := main_~tmp___0~3#1; {1370#true} is VALID [2022-02-20 21:53:26,277 INFO L272 TraceCheckUtils]: 2: Hoare triple {1370#true} call main_#t~ret86#1.base, main_#t~ret86#1.offset := ldv_successful_zalloc(232bv64); {1370#true} is VALID [2022-02-20 21:53:26,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {1370#true} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {1370#true} is VALID [2022-02-20 21:53:26,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {1370#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1bv64, ~__size, ~__size); {1370#true} is VALID [2022-02-20 21:53:26,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {1370#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1370#true} is VALID [2022-02-20 21:53:26,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {1370#true} assume true; {1370#true} is VALID [2022-02-20 21:53:26,278 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1370#true} {1370#true} #491#return; {1370#true} is VALID [2022-02-20 21:53:26,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {1370#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {1370#true} is VALID [2022-02-20 21:53:26,278 INFO L272 TraceCheckUtils]: 9: Hoare triple {1370#true} call assume_abort_if_not((if ~p~0.base != 0bv64 || ~p~0.offset != 0bv64 then 1bv32 else 0bv32)); {1370#true} is VALID [2022-02-20 21:53:26,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {1370#true} ~cond := #in~cond; {1370#true} is VALID [2022-02-20 21:53:26,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {1370#true} assume !(0bv32 == ~cond); {1370#true} is VALID [2022-02-20 21:53:26,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {1370#true} assume true; {1370#true} is VALID [2022-02-20 21:53:26,279 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1370#true} {1370#true} #493#return; {1370#true} is VALID [2022-02-20 21:53:26,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {1370#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {1370#true} is VALID [2022-02-20 21:53:26,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {1370#true} assume true; {1370#true} is VALID [2022-02-20 21:53:26,280 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1370#true} {1370#true} #497#return; {1370#true} is VALID [2022-02-20 21:53:26,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {1370#true} main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset := main_#t~ret86#1.base, main_#t~ret86#1.offset;havoc main_#t~ret86#1.base, main_#t~ret86#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset;main_~tmp___2~0#1 := main_#t~nondet87#1;havoc main_#t~nondet87#1;main_~ldvarg0~0#1 := main_~tmp___2~0#1;main_~tmp___3~0#1 := main_#t~nondet88#1;havoc main_#t~nondet88#1;main_~ldvarg5~0#1 := main_~tmp___3~0#1;main_~tmp___4~0#1 := main_#t~nondet89#1;havoc main_#t~nondet89#1;main_~ldvarg6~0#1 := main_~tmp___4~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; {1370#true} is VALID [2022-02-20 21:53:26,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {1370#true} assume { :end_inline_ldv_set_init } true; {1370#true} is VALID [2022-02-20 21:53:26,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {1370#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~loopctr123#1;#Ultimate.C_memset_#t~loopctr123#1 := 0bv64; {1370#true} is VALID [2022-02-20 21:53:26,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {1370#true} assume ~bvult64(#Ultimate.C_memset_#t~loopctr123#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd64(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr123#1) := #Ultimate.C_memset_#value#1[8:0]];#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~loopctr123#1) := 0bv64], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd64(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr123#1) := ~zero_extendFrom8To64(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr123#1 := ~bvadd64(1bv64, #Ultimate.C_memset_#t~loopctr123#1); {1370#true} is VALID [2022-02-20 21:53:26,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {1370#true} assume !~bvult64(#Ultimate.C_memset_#t~loopctr123#1, #Ultimate.C_memset_#amount#1); {1370#true} is VALID [2022-02-20 21:53:26,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {1370#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~res90#1.base, main_#t~memset~res90#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~res90#1.base, main_#t~memset~res90#1.offset;~ldv_state_variable_1~0 := 0bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 1bv32; {1441#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 21:53:26,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {1441#(= (_ bv1 32) ~ldv_state_variable_0~0)} main_~tmp___5~0#1 := main_#t~nondet91#1;havoc main_#t~nondet91#1;main_#t~switch92#1 := 0bv32 == main_~tmp___5~0#1; {1441#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 21:53:26,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {1441#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume !main_#t~switch92#1;main_#t~switch92#1 := main_#t~switch92#1 || 1bv32 == main_~tmp___5~0#1; {1441#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 21:53:26,285 INFO L290 TraceCheckUtils]: 25: Hoare triple {1441#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume main_#t~switch92#1; {1441#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 21:53:26,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {1441#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume 0bv32 != ~ldv_state_variable_0~0;main_~tmp___7~0#1 := main_#t~nondet98#1;havoc main_#t~nondet98#1;main_#t~switch99#1 := 0bv32 == main_~tmp___7~0#1; {1441#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 21:53:26,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {1441#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume main_#t~switch99#1; {1441#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 21:53:26,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {1441#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume 3bv32 == ~ldv_state_variable_0~0 && 0bv32 == ~ref_cnt~0;assume { :begin_inline_arcnet_rfc1051_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#rfc1051_proto~0.base, ~#rfc1051_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; {1371#false} is VALID [2022-02-20 21:53:26,287 INFO L290 TraceCheckUtils]: 29: Hoare triple {1371#false} assume { :end_inline_arcnet_unregister_proto } true; {1371#false} is VALID [2022-02-20 21:53:26,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {1371#false} assume { :end_inline_arcnet_rfc1051_exit } true;~ldv_state_variable_0~0 := 2bv32; {1371#false} is VALID [2022-02-20 21:53:26,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {1371#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret114#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); {1371#false} is VALID [2022-02-20 21:53:26,287 INFO L290 TraceCheckUtils]: 32: Hoare triple {1371#false} ldv_check_final_state_#t~ret114#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~ret114#1;havoc ldv_check_final_state_#t~ret114#1; {1371#false} is VALID [2022-02-20 21:53:26,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {1371#false} assume !(0bv32 != ldv_check_final_state_~tmp___7~6#1); {1371#false} is VALID [2022-02-20 21:53:26,288 INFO L272 TraceCheckUtils]: 34: Hoare triple {1371#false} call ldv_error(); {1371#false} is VALID [2022-02-20 21:53:26,288 INFO L290 TraceCheckUtils]: 35: Hoare triple {1371#false} assume !false; {1371#false} is VALID [2022-02-20 21:53:26,288 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:26,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:53:26,289 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:53:26,289 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111920383] [2022-02-20 21:53:26,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111920383] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:26,289 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:26,290 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 21:53:26,290 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358980603] [2022-02-20 21:53:26,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:26,291 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:26,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:26,292 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:26,335 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:26,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:53:26,336 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:53:26,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:53:26,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:53:26,337 INFO L87 Difference]: Start difference. First operand 174 states and 235 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:33,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:33,509 INFO L93 Difference]: Finished difference Result 487 states and 663 transitions. [2022-02-20 21:53:33,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:53:33,509 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:33,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:33,510 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:33,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2022-02-20 21:53:33,519 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:33,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2022-02-20 21:53:33,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 662 transitions. [2022-02-20 21:53:34,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 662 edges. 662 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:34,483 INFO L225 Difference]: With dead ends: 487 [2022-02-20 21:53:34,484 INFO L226 Difference]: Without dead ends: 322 [2022-02-20 21:53:34,484 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:34,485 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 200 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 478 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:34,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 478 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:34,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-02-20 21:53:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2022-02-20 21:53:34,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:53:34,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 322 states. Second operand has 322 states, 263 states have (on average 1.3574144486692015) internal successors, (357), 263 states have internal predecessors, (357), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 21:53:34,508 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand has 322 states, 263 states have (on average 1.3574144486692015) internal successors, (357), 263 states have internal predecessors, (357), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 21:53:34,509 INFO L87 Difference]: Start difference. First operand 322 states. Second operand has 322 states, 263 states have (on average 1.3574144486692015) internal successors, (357), 263 states have internal predecessors, (357), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 21:53:34,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:34,520 INFO L93 Difference]: Finished difference Result 322 states and 436 transitions. [2022-02-20 21:53:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 436 transitions. [2022-02-20 21:53:34,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:34,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:34,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 322 states, 263 states have (on average 1.3574144486692015) internal successors, (357), 263 states have internal predecessors, (357), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 322 states. [2022-02-20 21:53:34,524 INFO L87 Difference]: Start difference. First operand has 322 states, 263 states have (on average 1.3574144486692015) internal successors, (357), 263 states have internal predecessors, (357), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 322 states. [2022-02-20 21:53:34,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:34,536 INFO L93 Difference]: Finished difference Result 322 states and 436 transitions. [2022-02-20 21:53:34,536 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 436 transitions. [2022-02-20 21:53:34,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:34,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:34,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:53:34,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:53:34,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 263 states have (on average 1.3574144486692015) internal successors, (357), 263 states have internal predecessors, (357), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 21:53:34,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 436 transitions. [2022-02-20 21:53:34,551 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 436 transitions. Word has length 36 [2022-02-20 21:53:34,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:53:34,551 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 436 transitions. [2022-02-20 21:53:34,552 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:34,552 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 436 transitions. [2022-02-20 21:53:34,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 21:53:34,553 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:34,553 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] [2022-02-20 21:53:34,567 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:34,765 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:34,766 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:34,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:34,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1989051346, now seen corresponding path program 1 times [2022-02-20 21:53:34,766 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:53:34,767 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027139886] [2022-02-20 21:53:34,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:34,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:53:34,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:53:34,768 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:34,770 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:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:34,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 21:53:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:34,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:53:35,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {3203#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(71bv64, 3bv64);call #Ultimate.allocInit(41bv64, 4bv64);call #Ultimate.allocInit(2bv64, 5bv64);call write~init~intINTTYPE1(12bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 1bv64, 1bv64);call #Ultimate.allocInit(54bv64, 6bv64);call #Ultimate.allocInit(2bv64, 7bv64);call write~init~intINTTYPE1(12bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 1bv64, 1bv64);call #Ultimate.allocInit(45bv64, 8bv64);call #Ultimate.allocInit(2bv64, 9bv64);call write~init~intINTTYPE1(12bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 1bv64, 1bv64);~ldv_state_variable_1~0 := 0bv32;~LDV_IN_INTERRUPT~0 := 1bv32;~rfc1051_proto_group0~0.base, ~rfc1051_proto_group0~0.offset := 0bv64, 0bv64;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 0bv32;~rfc1051_proto_group1~0.base, ~rfc1051_proto_group1~0.offset := 0bv64, 0bv64;~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(49bv64, 10bv64);call write~init~intINTTYPE1(115bv8, ~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset, 1bv64);call write~init~intINTTYPE4(507bv32, ~#rfc1051_proto~0.base, ~bvadd64(1bv64, ~#rfc1051_proto~0.offset), 4bv64);call write~init~intINTTYPE4(1bv32, ~#rfc1051_proto~0.base, ~bvadd64(5bv64, ~#rfc1051_proto~0.offset), 4bv64);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#rfc1051_proto~0.base, ~bvadd64(9bv64, ~#rfc1051_proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#rfc1051_proto~0.base, ~bvadd64(17bv64, ~#rfc1051_proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#rfc1051_proto~0.base, ~bvadd64(25bv64, ~#rfc1051_proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#rfc1051_proto~0.base, ~bvadd64(33bv64, ~#rfc1051_proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#rfc1051_proto~0.base, ~bvadd64(41bv64, ~#rfc1051_proto~0.offset), 8bv64);~ldv_retval_0~0 := 0bv32;~#set_impl~0.base, ~#set_impl~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(120bv64, 11bv64);#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; {3203#true} is VALID [2022-02-20 21:53:35,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {3203#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet84#1, main_#t~nondet85#1, main_#t~ret86#1.base, main_#t~ret86#1.offset, main_#t~nondet87#1, main_#t~nondet88#1, main_#t~nondet89#1, main_#t~memset~res90#1.base, main_#t~memset~res90#1.offset, main_#t~nondet91#1, main_#t~switch92#1, main_#t~nondet93#1, main_#t~switch94#1, main_#t~ret95#1, main_#t~mem96#1, main_#t~ret97#1, main_#t~nondet98#1, main_#t~switch99#1, main_#t~ret100#1, main_~ldvarg1~0#1, main_~tmp~8#1, main_~ldvarg4~0#1, main_~tmp___0~3#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset, main_~ldvarg0~0#1, main_~tmp___2~0#1, main_~ldvarg5~0#1, main_~tmp___3~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~ldvarg6~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp~8#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___0~3#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___3~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1bv64);havoc main_~ldvarg6~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;main_~tmp~8#1 := main_#t~nondet84#1;havoc main_#t~nondet84#1;main_~ldvarg1~0#1 := main_~tmp~8#1;main_~tmp___0~3#1 := main_#t~nondet85#1;havoc main_#t~nondet85#1;main_~ldvarg4~0#1 := main_~tmp___0~3#1; {3203#true} is VALID [2022-02-20 21:53:35,078 INFO L272 TraceCheckUtils]: 2: Hoare triple {3203#true} call main_#t~ret86#1.base, main_#t~ret86#1.offset := ldv_successful_zalloc(232bv64); {3203#true} is VALID [2022-02-20 21:53:35,078 INFO L290 TraceCheckUtils]: 3: Hoare triple {3203#true} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {3203#true} is VALID [2022-02-20 21:53:35,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {3203#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1bv64, ~__size, ~__size); {3203#true} is VALID [2022-02-20 21:53:35,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {3203#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3203#true} is VALID [2022-02-20 21:53:35,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {3203#true} assume true; {3203#true} is VALID [2022-02-20 21:53:35,079 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3203#true} {3203#true} #491#return; {3203#true} is VALID [2022-02-20 21:53:35,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {3203#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {3203#true} is VALID [2022-02-20 21:53:35,079 INFO L272 TraceCheckUtils]: 9: Hoare triple {3203#true} call assume_abort_if_not((if ~p~0.base != 0bv64 || ~p~0.offset != 0bv64 then 1bv32 else 0bv32)); {3203#true} is VALID [2022-02-20 21:53:35,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {3203#true} ~cond := #in~cond; {3203#true} is VALID [2022-02-20 21:53:35,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {3203#true} assume !(0bv32 == ~cond); {3203#true} is VALID [2022-02-20 21:53:35,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {3203#true} assume true; {3203#true} is VALID [2022-02-20 21:53:35,081 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3203#true} {3203#true} #493#return; {3203#true} is VALID [2022-02-20 21:53:35,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {3203#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {3203#true} is VALID [2022-02-20 21:53:35,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {3203#true} assume true; {3203#true} is VALID [2022-02-20 21:53:35,082 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3203#true} {3203#true} #497#return; {3203#true} is VALID [2022-02-20 21:53:35,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {3203#true} main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset := main_#t~ret86#1.base, main_#t~ret86#1.offset;havoc main_#t~ret86#1.base, main_#t~ret86#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset;main_~tmp___2~0#1 := main_#t~nondet87#1;havoc main_#t~nondet87#1;main_~ldvarg0~0#1 := main_~tmp___2~0#1;main_~tmp___3~0#1 := main_#t~nondet88#1;havoc main_#t~nondet88#1;main_~ldvarg5~0#1 := main_~tmp___3~0#1;main_~tmp___4~0#1 := main_#t~nondet89#1;havoc main_#t~nondet89#1;main_~ldvarg6~0#1 := main_~tmp___4~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; {3203#true} is VALID [2022-02-20 21:53:35,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {3203#true} assume { :end_inline_ldv_set_init } true; {3203#true} is VALID [2022-02-20 21:53:35,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {3203#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~loopctr123#1;#Ultimate.C_memset_#t~loopctr123#1 := 0bv64; {3203#true} is VALID [2022-02-20 21:53:35,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {3203#true} assume ~bvult64(#Ultimate.C_memset_#t~loopctr123#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd64(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr123#1) := #Ultimate.C_memset_#value#1[8:0]];#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~loopctr123#1) := 0bv64], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd64(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr123#1) := ~zero_extendFrom8To64(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr123#1 := ~bvadd64(1bv64, #Ultimate.C_memset_#t~loopctr123#1); {3203#true} is VALID [2022-02-20 21:53:35,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {3203#true} assume !~bvult64(#Ultimate.C_memset_#t~loopctr123#1, #Ultimate.C_memset_#amount#1); {3203#true} is VALID [2022-02-20 21:53:35,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {3203#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~res90#1.base, main_#t~memset~res90#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~res90#1.base, main_#t~memset~res90#1.offset;~ldv_state_variable_1~0 := 0bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 1bv32; {3203#true} is VALID [2022-02-20 21:53:35,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {3203#true} main_~tmp___5~0#1 := main_#t~nondet91#1;havoc main_#t~nondet91#1;main_#t~switch92#1 := 0bv32 == main_~tmp___5~0#1; {3203#true} is VALID [2022-02-20 21:53:35,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {3203#true} assume !main_#t~switch92#1;main_#t~switch92#1 := main_#t~switch92#1 || 1bv32 == main_~tmp___5~0#1; {3203#true} is VALID [2022-02-20 21:53:35,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {3203#true} assume main_#t~switch92#1; {3203#true} is VALID [2022-02-20 21:53:35,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {3203#true} assume 0bv32 != ~ldv_state_variable_0~0;main_~tmp___7~0#1 := main_#t~nondet98#1;havoc main_#t~nondet98#1;main_#t~switch99#1 := 0bv32 == main_~tmp___7~0#1; {3203#true} is VALID [2022-02-20 21:53:35,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {3203#true} assume !main_#t~switch99#1;main_#t~switch99#1 := main_#t~switch99#1 || 1bv32 == main_~tmp___7~0#1; {3203#true} is VALID [2022-02-20 21:53:35,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {3203#true} assume main_#t~switch99#1; {3203#true} is VALID [2022-02-20 21:53:35,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {3203#true} assume 1bv32 == ~ldv_state_variable_0~0;assume { :begin_inline_arcnet_rfc1051_init } true;havoc arcnet_rfc1051_init_#res#1;havoc arcnet_rfc1051_init_#t~nondet26#1, arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset;havoc arcnet_rfc1051_init_#t~nondet26#1;call write~$Pointer$(~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset, ~#arc_proto_map~0.base, ~bvadd64(1928bv64, ~#arc_proto_map~0.offset), 8bv64);call arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~bvadd64(1928bv64, ~#arc_proto_map~0.offset), 8bv64);call write~$Pointer$(arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset, ~#arc_proto_map~0.base, ~bvadd64(1920bv64, ~#arc_proto_map~0.offset), 8bv64);havoc arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset; {3203#true} is VALID [2022-02-20 21:53:35,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {3203#true} 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 := ~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset; {3203#true} is VALID [2022-02-20 21:53:35,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {3203#true} arcnet_rfc1051_init_#res#1 := 0bv32; {3301#(= |ULTIMATE.start_arcnet_rfc1051_init_#res#1| (_ bv0 32))} is VALID [2022-02-20 21:53:35,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {3301#(= |ULTIMATE.start_arcnet_rfc1051_init_#res#1| (_ bv0 32))} main_#t~ret100#1 := arcnet_rfc1051_init_#res#1;assume { :end_inline_arcnet_rfc1051_init } true;~ldv_retval_0~0 := main_#t~ret100#1;havoc main_#t~ret100#1; {3305#(= (_ bv0 32) ~ldv_retval_0~0)} is VALID [2022-02-20 21:53:35,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {3305#(= (_ bv0 32) ~ldv_retval_0~0)} assume !(0bv32 == ~ldv_retval_0~0); {3305#(= (_ bv0 32) ~ldv_retval_0~0)} is VALID [2022-02-20 21:53:35,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {3305#(= (_ bv0 32) ~ldv_retval_0~0)} assume 0bv32 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2bv32; {3204#false} is VALID [2022-02-20 21:53:35,089 INFO L290 TraceCheckUtils]: 35: Hoare triple {3204#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret114#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); {3204#false} is VALID [2022-02-20 21:53:35,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {3204#false} ldv_check_final_state_#t~ret114#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~ret114#1;havoc ldv_check_final_state_#t~ret114#1; {3204#false} is VALID [2022-02-20 21:53:35,090 INFO L290 TraceCheckUtils]: 37: Hoare triple {3204#false} assume !(0bv32 != ldv_check_final_state_~tmp___7~6#1); {3204#false} is VALID [2022-02-20 21:53:35,091 INFO L272 TraceCheckUtils]: 38: Hoare triple {3204#false} call ldv_error(); {3204#false} is VALID [2022-02-20 21:53:35,091 INFO L290 TraceCheckUtils]: 39: Hoare triple {3204#false} assume !false; {3204#false} is VALID [2022-02-20 21:53:35,091 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,091 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:53:35,091 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:53:35,091 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027139886] [2022-02-20 21:53:35,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027139886] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:35,092 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:35,092 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:53:35,092 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190879568] [2022-02-20 21:53:35,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:35,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 40 [2022-02-20 21:53:35,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:35,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:35,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:53:35,133 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:53:35,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:53:35,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:53:35,135 INFO L87 Difference]: Start difference. First operand 322 states and 436 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:44,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:44,177 INFO L93 Difference]: Finished difference Result 634 states and 859 transitions. [2022-02-20 21:53:44,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 21:53:44,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 40 [2022-02-20 21:53:44,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:44,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 596 transitions. [2022-02-20 21:53:44,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 596 transitions. [2022-02-20 21:53:44,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 596 transitions. [2022-02-20 21:53:45,037 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:45,045 INFO L225 Difference]: With dead ends: 634 [2022-02-20 21:53:45,045 INFO L226 Difference]: Without dead ends: 321 [2022-02-20 21:53:45,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:53:45,047 INFO L933 BasicCegarLoop]: 351 mSDtfsCounter, 363 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:53:45,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 579 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 21:53:45,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-02-20 21:53:45,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2022-02-20 21:53:45,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:53:45,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 321 states, 262 states have (on average 1.3473282442748091) internal successors, (353), 262 states have internal predecessors, (353), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 21:53:45,067 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 321 states, 262 states have (on average 1.3473282442748091) internal successors, (353), 262 states have internal predecessors, (353), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 21:53:45,068 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 321 states, 262 states have (on average 1.3473282442748091) internal successors, (353), 262 states have internal predecessors, (353), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 21:53:45,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:45,080 INFO L93 Difference]: Finished difference Result 321 states and 432 transitions. [2022-02-20 21:53:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 432 transitions. [2022-02-20 21:53:45,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:45,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:45,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 321 states, 262 states have (on average 1.3473282442748091) internal successors, (353), 262 states have internal predecessors, (353), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 321 states. [2022-02-20 21:53:45,084 INFO L87 Difference]: Start difference. First operand has 321 states, 262 states have (on average 1.3473282442748091) internal successors, (353), 262 states have internal predecessors, (353), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 321 states. [2022-02-20 21:53:45,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:45,094 INFO L93 Difference]: Finished difference Result 321 states and 432 transitions. [2022-02-20 21:53:45,094 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 432 transitions. [2022-02-20 21:53:45,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:45,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:45,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:53:45,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:53:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 262 states have (on average 1.3473282442748091) internal successors, (353), 262 states have internal predecessors, (353), 40 states have call successors, (40), 19 states have call predecessors, (40), 18 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 21:53:45,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 432 transitions. [2022-02-20 21:53:45,108 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 432 transitions. Word has length 40 [2022-02-20 21:53:45,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:53:45,108 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 432 transitions. [2022-02-20 21:53:45,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:45,109 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 432 transitions. [2022-02-20 21:53:45,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-20 21:53:45,110 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:45,111 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 21:53:45,123 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:45,321 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:45,322 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:45,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:45,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1384341438, now seen corresponding path program 1 times [2022-02-20 21:53:45,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:53:45,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563691650] [2022-02-20 21:53:45,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:45,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:53:45,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:53:45,324 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:45,325 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:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:45,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 21:53:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:45,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:53:45,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {5242#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(71bv64, 3bv64);call #Ultimate.allocInit(41bv64, 4bv64);call #Ultimate.allocInit(2bv64, 5bv64);call write~init~intINTTYPE1(12bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 1bv64, 1bv64);call #Ultimate.allocInit(54bv64, 6bv64);call #Ultimate.allocInit(2bv64, 7bv64);call write~init~intINTTYPE1(12bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 1bv64, 1bv64);call #Ultimate.allocInit(45bv64, 8bv64);call #Ultimate.allocInit(2bv64, 9bv64);call write~init~intINTTYPE1(12bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 1bv64, 1bv64);~ldv_state_variable_1~0 := 0bv32;~LDV_IN_INTERRUPT~0 := 1bv32;~rfc1051_proto_group0~0.base, ~rfc1051_proto_group0~0.offset := 0bv64, 0bv64;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 0bv32;~rfc1051_proto_group1~0.base, ~rfc1051_proto_group1~0.offset := 0bv64, 0bv64;~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(49bv64, 10bv64);call write~init~intINTTYPE1(115bv8, ~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset, 1bv64);call write~init~intINTTYPE4(507bv32, ~#rfc1051_proto~0.base, ~bvadd64(1bv64, ~#rfc1051_proto~0.offset), 4bv64);call write~init~intINTTYPE4(1bv32, ~#rfc1051_proto~0.base, ~bvadd64(5bv64, ~#rfc1051_proto~0.offset), 4bv64);call write~init~$Pointer$(#funAddr~rx.base, #funAddr~rx.offset, ~#rfc1051_proto~0.base, ~bvadd64(9bv64, ~#rfc1051_proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~build_header.base, #funAddr~build_header.offset, ~#rfc1051_proto~0.base, ~bvadd64(17bv64, ~#rfc1051_proto~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~prepare_tx.base, #funAddr~prepare_tx.offset, ~#rfc1051_proto~0.base, ~bvadd64(25bv64, ~#rfc1051_proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#rfc1051_proto~0.base, ~bvadd64(33bv64, ~#rfc1051_proto~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#rfc1051_proto~0.base, ~bvadd64(41bv64, ~#rfc1051_proto~0.offset), 8bv64);~ldv_retval_0~0 := 0bv32;~#set_impl~0.base, ~#set_impl~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(120bv64, 11bv64);#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; {5242#true} is VALID [2022-02-20 21:53:45,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {5242#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet84#1, main_#t~nondet85#1, main_#t~ret86#1.base, main_#t~ret86#1.offset, main_#t~nondet87#1, main_#t~nondet88#1, main_#t~nondet89#1, main_#t~memset~res90#1.base, main_#t~memset~res90#1.offset, main_#t~nondet91#1, main_#t~switch92#1, main_#t~nondet93#1, main_#t~switch94#1, main_#t~ret95#1, main_#t~mem96#1, main_#t~ret97#1, main_#t~nondet98#1, main_#t~switch99#1, main_#t~ret100#1, main_~ldvarg1~0#1, main_~tmp~8#1, main_~ldvarg4~0#1, main_~tmp___0~3#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset, main_~ldvarg0~0#1, main_~tmp___2~0#1, main_~ldvarg5~0#1, main_~tmp___3~0#1, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~ldvarg6~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1;havoc main_~ldvarg1~0#1;havoc main_~tmp~8#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___0~3#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset;havoc main_~ldvarg0~0#1;havoc main_~tmp___2~0#1;havoc main_~ldvarg5~0#1;havoc main_~tmp___3~0#1;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(1bv64);havoc main_~ldvarg6~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;main_~tmp~8#1 := main_#t~nondet84#1;havoc main_#t~nondet84#1;main_~ldvarg1~0#1 := main_~tmp~8#1;main_~tmp___0~3#1 := main_#t~nondet85#1;havoc main_#t~nondet85#1;main_~ldvarg4~0#1 := main_~tmp___0~3#1; {5242#true} is VALID [2022-02-20 21:53:45,922 INFO L272 TraceCheckUtils]: 2: Hoare triple {5242#true} call main_#t~ret86#1.base, main_#t~ret86#1.offset := ldv_successful_zalloc(232bv64); {5242#true} is VALID [2022-02-20 21:53:45,922 INFO L290 TraceCheckUtils]: 3: Hoare triple {5242#true} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {5242#true} is VALID [2022-02-20 21:53:45,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {5242#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1bv64, ~__size, ~__size); {5242#true} is VALID [2022-02-20 21:53:45,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {5242#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5242#true} is VALID [2022-02-20 21:53:45,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {5242#true} assume true; {5242#true} is VALID [2022-02-20 21:53:45,923 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5242#true} {5242#true} #491#return; {5242#true} is VALID [2022-02-20 21:53:45,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {5242#true} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {5242#true} is VALID [2022-02-20 21:53:45,923 INFO L272 TraceCheckUtils]: 9: Hoare triple {5242#true} call assume_abort_if_not((if ~p~0.base != 0bv64 || ~p~0.offset != 0bv64 then 1bv32 else 0bv32)); {5242#true} is VALID [2022-02-20 21:53:45,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {5242#true} ~cond := #in~cond; {5242#true} is VALID [2022-02-20 21:53:45,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {5242#true} assume !(0bv32 == ~cond); {5242#true} is VALID [2022-02-20 21:53:45,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {5242#true} assume true; {5242#true} is VALID [2022-02-20 21:53:45,924 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5242#true} {5242#true} #493#return; {5242#true} is VALID [2022-02-20 21:53:45,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {5242#true} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {5242#true} is VALID [2022-02-20 21:53:45,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {5242#true} assume true; {5242#true} is VALID [2022-02-20 21:53:45,924 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5242#true} {5242#true} #497#return; {5242#true} is VALID [2022-02-20 21:53:45,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {5242#true} main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset := main_#t~ret86#1.base, main_#t~ret86#1.offset;havoc main_#t~ret86#1.base, main_#t~ret86#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___1~0#1.base, main_~tmp___1~0#1.offset;main_~tmp___2~0#1 := main_#t~nondet87#1;havoc main_#t~nondet87#1;main_~ldvarg0~0#1 := main_~tmp___2~0#1;main_~tmp___3~0#1 := main_#t~nondet88#1;havoc main_#t~nondet88#1;main_~ldvarg5~0#1 := main_~tmp___3~0#1;main_~tmp___4~0#1 := main_#t~nondet89#1;havoc main_#t~nondet89#1;main_~ldvarg6~0#1 := main_~tmp___4~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; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume { :end_inline_ldv_set_init } true; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} 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~loopctr123#1;#Ultimate.C_memset_#t~loopctr123#1 := 0bv64; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume ~bvult64(#Ultimate.C_memset_#t~loopctr123#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd64(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr123#1) := #Ultimate.C_memset_#value#1[8:0]];#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~loopctr123#1) := 0bv64], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd64(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr123#1) := ~zero_extendFrom8To64(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr123#1 := ~bvadd64(1bv64, #Ultimate.C_memset_#t~loopctr123#1); {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume !~bvult64(#Ultimate.C_memset_#t~loopctr123#1, #Ultimate.C_memset_#amount#1); {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} 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~res90#1.base, main_#t~memset~res90#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~res90#1.base, main_#t~memset~res90#1.offset;~ldv_state_variable_1~0 := 0bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 1bv32; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} main_~tmp___5~0#1 := main_#t~nondet91#1;havoc main_#t~nondet91#1;main_#t~switch92#1 := 0bv32 == main_~tmp___5~0#1; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume !main_#t~switch92#1;main_#t~switch92#1 := main_#t~switch92#1 || 1bv32 == main_~tmp___5~0#1; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume main_#t~switch92#1; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume 0bv32 != ~ldv_state_variable_0~0;main_~tmp___7~0#1 := main_#t~nondet98#1;havoc main_#t~nondet98#1;main_#t~switch99#1 := 0bv32 == main_~tmp___7~0#1; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,940 INFO L290 TraceCheckUtils]: 27: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume !main_#t~switch99#1;main_#t~switch99#1 := main_#t~switch99#1 || 1bv32 == main_~tmp___7~0#1; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume main_#t~switch99#1; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume 1bv32 == ~ldv_state_variable_0~0;assume { :begin_inline_arcnet_rfc1051_init } true;havoc arcnet_rfc1051_init_#res#1;havoc arcnet_rfc1051_init_#t~nondet26#1, arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset;havoc arcnet_rfc1051_init_#t~nondet26#1;call write~$Pointer$(~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset, ~#arc_proto_map~0.base, ~bvadd64(1928bv64, ~#arc_proto_map~0.offset), 8bv64);call arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset := read~$Pointer$(~#arc_proto_map~0.base, ~bvadd64(1928bv64, ~#arc_proto_map~0.offset), 8bv64);call write~$Pointer$(arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset, ~#arc_proto_map~0.base, ~bvadd64(1920bv64, ~#arc_proto_map~0.offset), 8bv64);havoc arcnet_rfc1051_init_#t~mem27#1.base, arcnet_rfc1051_init_#t~mem27#1.offset; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} 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 := ~#rfc1051_proto~0.base, ~#rfc1051_proto~0.offset; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,942 INFO L290 TraceCheckUtils]: 31: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} arcnet_rfc1051_init_#res#1 := 0bv32; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,942 INFO L290 TraceCheckUtils]: 32: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} main_#t~ret100#1 := arcnet_rfc1051_init_#res#1;assume { :end_inline_arcnet_rfc1051_init } true;~ldv_retval_0~0 := main_#t~ret100#1;havoc main_#t~ret100#1; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,943 INFO L290 TraceCheckUtils]: 33: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume 0bv32 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3bv32;~ldv_state_variable_1~0 := 1bv32;assume { :begin_inline_ldv_initialize_ArcProto_1 } true;havoc ldv_initialize_ArcProto_1_#t~ret82#1.base, ldv_initialize_ArcProto_1_#t~ret82#1.offset, ldv_initialize_ArcProto_1_#t~ret83#1.base, ldv_initialize_ArcProto_1_#t~ret83#1.offset, ldv_initialize_ArcProto_1_~tmp~7#1.base, ldv_initialize_ArcProto_1_~tmp~7#1.offset, ldv_initialize_ArcProto_1_~tmp___0~2#1.base, ldv_initialize_ArcProto_1_~tmp___0~2#1.offset;havoc ldv_initialize_ArcProto_1_~tmp~7#1.base, ldv_initialize_ArcProto_1_~tmp~7#1.offset;havoc ldv_initialize_ArcProto_1_~tmp___0~2#1.base, ldv_initialize_ArcProto_1_~tmp___0~2#1.offset; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,943 INFO L272 TraceCheckUtils]: 34: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} call ldv_initialize_ArcProto_1_#t~ret82#1.base, ldv_initialize_ArcProto_1_#t~ret82#1.offset := ldv_successful_zalloc(20bv64); {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,944 INFO L290 TraceCheckUtils]: 35: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,945 INFO L272 TraceCheckUtils]: 36: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1bv64, ~__size, ~__size); {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,945 INFO L290 TraceCheckUtils]: 37: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,945 INFO L290 TraceCheckUtils]: 38: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume true; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,946 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5298#(= ~last_index~0 (_ bv0 32))} {5298#(= ~last_index~0 (_ bv0 32))} #491#return; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,947 INFO L290 TraceCheckUtils]: 40: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,947 INFO L272 TraceCheckUtils]: 41: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} call assume_abort_if_not((if ~p~0.base != 0bv64 || ~p~0.offset != 0bv64 then 1bv32 else 0bv32)); {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,948 INFO L290 TraceCheckUtils]: 42: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} ~cond := #in~cond; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,948 INFO L290 TraceCheckUtils]: 43: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume !(0bv32 == ~cond); {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,949 INFO L290 TraceCheckUtils]: 44: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume true; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,949 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5298#(= ~last_index~0 (_ bv0 32))} {5298#(= ~last_index~0 (_ bv0 32))} #493#return; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,950 INFO L290 TraceCheckUtils]: 46: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,950 INFO L290 TraceCheckUtils]: 47: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume true; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,951 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5298#(= ~last_index~0 (_ bv0 32))} {5298#(= ~last_index~0 (_ bv0 32))} #529#return; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,951 INFO L290 TraceCheckUtils]: 49: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} ldv_initialize_ArcProto_1_~tmp~7#1.base, ldv_initialize_ArcProto_1_~tmp~7#1.offset := ldv_initialize_ArcProto_1_#t~ret82#1.base, ldv_initialize_ArcProto_1_#t~ret82#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret82#1.base, ldv_initialize_ArcProto_1_#t~ret82#1.offset;~rfc1051_proto_group0~0.base, ~rfc1051_proto_group0~0.offset := ldv_initialize_ArcProto_1_~tmp~7#1.base, ldv_initialize_ArcProto_1_~tmp~7#1.offset; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,952 INFO L272 TraceCheckUtils]: 50: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} call ldv_initialize_ArcProto_1_#t~ret83#1.base, ldv_initialize_ArcProto_1_#t~ret83#1.offset := ldv_successful_zalloc(3264bv64); {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,952 INFO L290 TraceCheckUtils]: 51: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} ~__size := #in~__size;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~__size); {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,953 INFO L272 TraceCheckUtils]: 52: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1bv64, ~__size, ~__size); {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,954 INFO L290 TraceCheckUtils]: 53: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,954 INFO L290 TraceCheckUtils]: 54: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume true; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,955 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5298#(= ~last_index~0 (_ bv0 32))} {5298#(= ~last_index~0 (_ bv0 32))} #491#return; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,956 INFO L290 TraceCheckUtils]: 56: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} ~p~0.base, ~p~0.offset := #t~malloc18.base, #t~malloc18.offset; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,956 INFO L272 TraceCheckUtils]: 57: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} call assume_abort_if_not((if ~p~0.base != 0bv64 || ~p~0.offset != 0bv64 then 1bv32 else 0bv32)); {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,957 INFO L290 TraceCheckUtils]: 58: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} ~cond := #in~cond; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,957 INFO L290 TraceCheckUtils]: 59: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume !(0bv32 == ~cond); {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,957 INFO L290 TraceCheckUtils]: 60: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume true; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,958 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {5298#(= ~last_index~0 (_ bv0 32))} {5298#(= ~last_index~0 (_ bv0 32))} #493#return; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,958 INFO L290 TraceCheckUtils]: 62: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} #res.base, #res.offset := ~p~0.base, ~p~0.offset; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,959 INFO L290 TraceCheckUtils]: 63: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume true; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,959 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5298#(= ~last_index~0 (_ bv0 32))} {5298#(= ~last_index~0 (_ bv0 32))} #531#return; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,961 INFO L290 TraceCheckUtils]: 65: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} ldv_initialize_ArcProto_1_~tmp___0~2#1.base, ldv_initialize_ArcProto_1_~tmp___0~2#1.offset := ldv_initialize_ArcProto_1_#t~ret83#1.base, ldv_initialize_ArcProto_1_#t~ret83#1.offset;havoc ldv_initialize_ArcProto_1_#t~ret83#1.base, ldv_initialize_ArcProto_1_#t~ret83#1.offset;~rfc1051_proto_group1~0.base, ~rfc1051_proto_group1~0.offset := ldv_initialize_ArcProto_1_~tmp___0~2#1.base, ldv_initialize_ArcProto_1_~tmp___0~2#1.offset; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,961 INFO L290 TraceCheckUtils]: 66: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume { :end_inline_ldv_initialize_ArcProto_1 } true; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,962 INFO L290 TraceCheckUtils]: 67: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume !(0bv32 != ~ldv_retval_0~0); {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,962 INFO L290 TraceCheckUtils]: 68: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} main_~tmp___5~0#1 := main_#t~nondet91#1;havoc main_#t~nondet91#1;main_#t~switch92#1 := 0bv32 == main_~tmp___5~0#1; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,962 INFO L290 TraceCheckUtils]: 69: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume !main_#t~switch92#1;main_#t~switch92#1 := main_#t~switch92#1 || 1bv32 == main_~tmp___5~0#1; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,963 INFO L290 TraceCheckUtils]: 70: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume main_#t~switch92#1; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,966 INFO L290 TraceCheckUtils]: 71: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume 0bv32 != ~ldv_state_variable_0~0;main_~tmp___7~0#1 := main_#t~nondet98#1;havoc main_#t~nondet98#1;main_#t~switch99#1 := 0bv32 == main_~tmp___7~0#1; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,966 INFO L290 TraceCheckUtils]: 72: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume main_#t~switch99#1; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,967 INFO L290 TraceCheckUtils]: 73: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume 3bv32 == ~ldv_state_variable_0~0 && 0bv32 == ~ref_cnt~0;assume { :begin_inline_arcnet_rfc1051_exit } true;assume { :begin_inline_arcnet_unregister_proto } true;arcnet_unregister_proto_#in~arg0#1.base, arcnet_unregister_proto_#in~arg0#1.offset := ~#rfc1051_proto~0.base, ~#rfc1051_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; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,967 INFO L290 TraceCheckUtils]: 74: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume { :end_inline_arcnet_unregister_proto } true; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,967 INFO L290 TraceCheckUtils]: 75: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume { :end_inline_arcnet_rfc1051_exit } true;~ldv_state_variable_0~0 := 2bv32; {5298#(= ~last_index~0 (_ bv0 32))} is VALID [2022-02-20 21:53:45,968 INFO L290 TraceCheckUtils]: 76: Hoare triple {5298#(= ~last_index~0 (_ bv0 32))} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret114#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); {5476#(= |ULTIMATE.start_ldv_set_is_empty_#res#1| (_ bv1 32))} is VALID [2022-02-20 21:53:45,968 INFO L290 TraceCheckUtils]: 77: Hoare triple {5476#(= |ULTIMATE.start_ldv_set_is_empty_#res#1| (_ bv1 32))} ldv_check_final_state_#t~ret114#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~ret114#1;havoc ldv_check_final_state_#t~ret114#1; {5480#(= |ULTIMATE.start_ldv_check_final_state_~tmp___7~6#1| (_ bv1 32))} is VALID [2022-02-20 21:53:45,969 INFO L290 TraceCheckUtils]: 78: Hoare triple {5480#(= |ULTIMATE.start_ldv_check_final_state_~tmp___7~6#1| (_ bv1 32))} assume !(0bv32 != ldv_check_final_state_~tmp___7~6#1); {5243#false} is VALID [2022-02-20 21:53:45,969 INFO L272 TraceCheckUtils]: 79: Hoare triple {5243#false} call ldv_error(); {5243#false} is VALID [2022-02-20 21:53:45,969 INFO L290 TraceCheckUtils]: 80: Hoare triple {5243#false} assume !false; {5243#false} is VALID [2022-02-20 21:53:45,969 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-20 21:53:45,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:53:45,970 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:53:45,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563691650] [2022-02-20 21:53:45,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563691650] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:45,970 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:45,970 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:53:45,971 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792345729] [2022-02-20 21:53:45,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:45,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 81 [2022-02-20 21:53:45,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:45,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 21:53:46,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:46,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:53:46,035 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:53:46,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:53:46,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:53:46,036 INFO L87 Difference]: Start difference. First operand 321 states and 432 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)