./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--wan--x25_asy.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--wan--x25_asy.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 1cccbd170603672b3f74a5336cc730c4afa341837cef68e5226707c3c82e670c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:53:33,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:53:33,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:53:33,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:53:33,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:53:33,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:53:33,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:53:33,741 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:53:33,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:53:33,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:53:33,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:53:33,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:53:33,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:53:33,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:53:33,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:53:33,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:53:33,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:53:33,756 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:53:33,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:53:33,764 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:53:33,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:53:33,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:53:33,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:53:33,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:53:33,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:53:33,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:53:33,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:53:33,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:53:33,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:53:33,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:53:33,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:53:33,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:53:33,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:53:33,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:53:33,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:53:33,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:53:33,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:53:33,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:53:33,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:53:33,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:53:33,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:53:33,774 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:53:33,787 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:53:33,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:53:33,792 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:53:33,792 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:53:33,793 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:53:33,793 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:53:33,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:53:33,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:53:33,794 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:53:33,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:53:33,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:53:33,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:53:33,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:53:33,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:53:33,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:53:33,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:53:33,795 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:53:33,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:53:33,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:53:33,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:53:33,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:53:33,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:53:33,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:53:33,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:53:33,796 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:53:33,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:53:33,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:53:33,797 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:53:33,797 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:53:33,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:53:33,797 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 -> 1cccbd170603672b3f74a5336cc730c4afa341837cef68e5226707c3c82e670c [2022-02-20 21:53:33,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:53:33,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:53:33,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:53:33,987 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:53:33,987 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:53:33,988 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--wan--x25_asy.ko-entry_point.cil.out.i [2022-02-20 21:53:34,044 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae96c1be/4391aed0b9b54b228fc97bd3627e32a8/FLAG415f58c25 [2022-02-20 21:53:34,610 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:53:34,611 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--wan--x25_asy.ko-entry_point.cil.out.i [2022-02-20 21:53:34,641 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae96c1be/4391aed0b9b54b228fc97bd3627e32a8/FLAG415f58c25 [2022-02-20 21:53:35,059 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae96c1be/4391aed0b9b54b228fc97bd3627e32a8 [2022-02-20 21:53:35,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:53:35,070 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:53:35,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:53:35,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:53:35,085 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:53:35,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:53:35" (1/1) ... [2022-02-20 21:53:35,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3007ed3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:35, skipping insertion in model container [2022-02-20 21:53:35,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:53:35" (1/1) ... [2022-02-20 21:53:35,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:53:35,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:53:35,708 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--wan--x25_asy.ko-entry_point.cil.out.i[158694,158707] [2022-02-20 21:53:36,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:53:36,058 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:53:36,151 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--wan--x25_asy.ko-entry_point.cil.out.i[158694,158707] [2022-02-20 21:53:36,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:53:36,330 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:53:36,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:36 WrapperNode [2022-02-20 21:53:36,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:53:36,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:53:36,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:53:36,334 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:53:36,340 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:36" (1/1) ... [2022-02-20 21:53:36,381 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:36" (1/1) ... [2022-02-20 21:53:36,475 INFO L137 Inliner]: procedures = 181, calls = 601, calls flagged for inlining = 90, calls inlined = 85, statements flattened = 2002 [2022-02-20 21:53:36,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:53:36,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:53:36,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:53:36,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:53:36,483 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:36" (1/1) ... [2022-02-20 21:53:36,484 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:36" (1/1) ... [2022-02-20 21:53:36,507 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:36" (1/1) ... [2022-02-20 21:53:36,514 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:36" (1/1) ... [2022-02-20 21:53:36,558 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:36" (1/1) ... [2022-02-20 21:53:36,566 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:36" (1/1) ... [2022-02-20 21:53:36,588 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:36" (1/1) ... [2022-02-20 21:53:36,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:53:36,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:53:36,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:53:36,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:53:36,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:36" (1/1) ... [2022-02-20 21:53:36,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:53:36,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:53:36,645 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:36,651 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:36,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_alloc_skb_14 [2022-02-20 21:53:36,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_alloc_skb_14 [2022-02-20 21:53:36,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 21:53:36,673 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-02-20 21:53:36,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 21:53:36,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 21:53:36,673 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:53:36,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:53:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:53:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-02-20 21:53:36,674 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-02-20 21:53:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 21:53:36,674 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 21:53:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-02-20 21:53:36,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-02-20 21:53:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:53:36,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:53:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-02-20 21:53:36,675 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-02-20 21:53:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure x25_asy_data_transmit [2022-02-20 21:53:36,675 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_asy_data_transmit [2022-02-20 21:53:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-02-20 21:53:36,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-02-20 21:53:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 21:53:36,676 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 21:53:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure x25_asy_ioctl [2022-02-20 21:53:36,676 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_asy_ioctl [2022-02-20 21:53:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:53:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure x25_asy_timeout [2022-02-20 21:53:36,676 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_asy_timeout [2022-02-20 21:53:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:53:36,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:53:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 21:53:36,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 21:53:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-02-20 21:53:36,677 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-02-20 21:53:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:53:36,677 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:53:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-02-20 21:53:36,678 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-02-20 21:53:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:53:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-02-20 21:53:36,678 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-02-20 21:53:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-02-20 21:53:36,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-02-20 21:53:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:53:36,679 INFO L130 BoogieDeclarations]: Found specification of procedure x25_asy_change_mtu [2022-02-20 21:53:36,679 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_asy_change_mtu [2022-02-20 21:53:36,679 INFO L130 BoogieDeclarations]: Found specification of procedure x25_type_trans [2022-02-20 21:53:36,679 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_type_trans [2022-02-20 21:53:36,679 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2022-02-20 21:53:36,679 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2022-02-20 21:53:36,679 INFO L130 BoogieDeclarations]: Found specification of procedure x25_asy_unlock [2022-02-20 21:53:36,679 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_asy_unlock [2022-02-20 21:53:36,679 INFO L130 BoogieDeclarations]: Found specification of procedure x25_asy_compat_ioctl [2022-02-20 21:53:36,680 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_asy_compat_ioctl [2022-02-20 21:53:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:53:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:53:36,681 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-02-20 21:53:36,681 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-02-20 21:53:36,681 INFO L130 BoogieDeclarations]: Found specification of procedure x25_asy_data_indication [2022-02-20 21:53:36,681 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_asy_data_indication [2022-02-20 21:53:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-02-20 21:53:36,682 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-02-20 21:53:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:53:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-02-20 21:53:36,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-02-20 21:53:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure x25_asy_disconnected [2022-02-20 21:53:36,682 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_asy_disconnected [2022-02-20 21:53:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-02-20 21:53:36,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-02-20 21:53:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:53:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-02-20 21:53:36,683 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-02-20 21:53:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:53:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-02-20 21:53:36,684 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-02-20 21:53:36,684 INFO L130 BoogieDeclarations]: Found specification of procedure x25_asy_connected [2022-02-20 21:53:36,684 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_asy_connected [2022-02-20 21:53:36,684 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-02-20 21:53:36,684 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-02-20 21:53:36,684 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-02-20 21:53:36,684 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-02-20 21:53:36,684 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-02-20 21:53:36,684 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-02-20 21:53:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-02-20 21:53:36,685 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-02-20 21:53:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-02-20 21:53:36,685 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-02-20 21:53:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-02-20 21:53:36,685 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-02-20 21:53:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:53:36,686 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-02-20 21:53:36,686 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-02-20 21:53:36,686 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-02-20 21:53:36,686 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-02-20 21:53:36,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 21:53:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 21:53:36,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 21:53:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:53:36,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:53:36,688 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-02-20 21:53:36,688 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-02-20 21:53:37,064 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:53:37,078 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:53:37,289 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:53:38,400 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:53:38,419 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:53:38,419 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 21:53:38,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:53:38 BoogieIcfgContainer [2022-02-20 21:53:38,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:53:38,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:53:38,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:53:38,426 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:53:38,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:53:35" (1/3) ... [2022-02-20 21:53:38,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ee2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:53:38, skipping insertion in model container [2022-02-20 21:53:38,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:36" (2/3) ... [2022-02-20 21:53:38,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ee2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:53:38, skipping insertion in model container [2022-02-20 21:53:38,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:53:38" (3/3) ... [2022-02-20 21:53:38,429 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--x25_asy.ko-entry_point.cil.out.i [2022-02-20 21:53:38,435 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:53:38,435 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:53:38,479 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:53:38,485 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:38,485 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:53:38,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 726 states, 530 states have (on average 1.3716981132075472) internal successors, (727), 546 states have internal predecessors, (727), 152 states have call successors, (152), 43 states have call predecessors, (152), 42 states have return successors, (147), 145 states have call predecessors, (147), 147 states have call successors, (147) [2022-02-20 21:53:38,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 21:53:38,539 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:38,551 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,552 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:38,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:38,555 INFO L85 PathProgramCache]: Analyzing trace with hash 135613019, now seen corresponding path program 1 times [2022-02-20 21:53:38,561 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:53:38,561 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743181136] [2022-02-20 21:53:38,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:38,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:53:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:38,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:53:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:38,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {729#true} is VALID [2022-02-20 21:53:38,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {729#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {729#true} is VALID [2022-02-20 21:53:38,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {729#true} assume true; {729#true} is VALID [2022-02-20 21:53:38,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {729#true} {729#true} #1799#return; {729#true} is VALID [2022-02-20 21:53:38,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:53:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:38,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {729#true} is VALID [2022-02-20 21:53:38,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {729#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {729#true} is VALID [2022-02-20 21:53:38,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {729#true} assume true; {729#true} is VALID [2022-02-20 21:53:38,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {729#true} {729#true} #1801#return; {729#true} is VALID [2022-02-20 21:53:38,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:53:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:38,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {729#true} is VALID [2022-02-20 21:53:38,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {729#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {729#true} is VALID [2022-02-20 21:53:38,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {729#true} assume true; {729#true} is VALID [2022-02-20 21:53:38,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {729#true} {729#true} #1803#return; {729#true} is VALID [2022-02-20 21:53:38,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:53:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:38,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {729#true} is VALID [2022-02-20 21:53:38,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {729#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {729#true} is VALID [2022-02-20 21:53:38,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {729#true} assume true; {729#true} is VALID [2022-02-20 21:53:38,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {729#true} {729#true} #1805#return; {729#true} is VALID [2022-02-20 21:53:38,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 21:53:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:38,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {729#true} is VALID [2022-02-20 21:53:38,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {729#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {729#true} is VALID [2022-02-20 21:53:38,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {729#true} assume true; {729#true} is VALID [2022-02-20 21:53:38,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {729#true} {729#true} #1807#return; {729#true} is VALID [2022-02-20 21:53:38,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 21:53:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:38,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {756#(= |old(#valid)| |#valid|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call ULTIMATE.dealloc(~p.base, ~p.offset); {729#true} is VALID [2022-02-20 21:53:38,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {729#true} assume true; {729#true} is VALID [2022-02-20 21:53:38,966 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {729#true} {730#false} #1899#return; {730#false} is VALID [2022-02-20 21:53:38,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {729#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(100, 2);call #Ultimate.allocInit(26, 3);call #Ultimate.allocInit(72, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(43, 6);call #Ultimate.allocInit(14, 7);call #Ultimate.allocInit(36, 8);call #Ultimate.allocInit(33, 9);call #Ultimate.allocInit(34, 10);call #Ultimate.allocInit(44, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(17, 13);call #Ultimate.allocInit(13, 14);call #Ultimate.allocInit(30, 15);call #Ultimate.allocInit(32, 16);call #Ultimate.allocInit(35, 17);call #Ultimate.allocInit(29, 18);call #Ultimate.allocInit(12, 19);call #Ultimate.allocInit(15, 20);call #Ultimate.allocInit(15, 21);call #Ultimate.allocInit(52, 22);call #Ultimate.allocInit(20, 23);call #Ultimate.allocInit(5, 24);call write~init~int(88, 24, 0, 1);call write~init~int(46, 24, 1, 1);call write~init~int(50, 24, 2, 1);call write~init~int(53, 24, 3, 1);call write~init~int(0, 24, 4, 1);call #Ultimate.allocInit(69, 25);~ldv_state_variable_3~0 := 0;~x25_ldisc_group1~0.base, ~x25_ldisc_group1~0.offset := 0, 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~x25_asy_netdev_ops_group1~0.base, ~x25_asy_netdev_ops_group1~0.offset := 0, 0;~x25_asy_callbacks_group0~0.base, ~x25_asy_callbacks_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~x25_asy_callbacks_group1~0.base, ~x25_asy_callbacks_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~x25_asy_devs~0.base, ~x25_asy_devs~0.offset := 0, 0;~x25_asy_maxdev~0 := 256;~#x25_asy_callbacks~0.base, ~#x25_asy_callbacks~0.offset := 26, 0;call #Ultimate.allocInit(48, 26);call write~init~$Pointer$(#funAddr~x25_asy_connected.base, #funAddr~x25_asy_connected.offset, ~#x25_asy_callbacks~0.base, ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_connected.base, #funAddr~x25_asy_connected.offset, ~#x25_asy_callbacks~0.base, 8 + ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_disconnected.base, #funAddr~x25_asy_disconnected.offset, ~#x25_asy_callbacks~0.base, 16 + ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_disconnected.base, #funAddr~x25_asy_disconnected.offset, ~#x25_asy_callbacks~0.base, 24 + ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_data_indication.base, #funAddr~x25_asy_data_indication.offset, ~#x25_asy_callbacks~0.base, 32 + ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_data_transmit.base, #funAddr~x25_asy_data_transmit.offset, ~#x25_asy_callbacks~0.base, 40 + ~#x25_asy_callbacks~0.offset, 8);~#x25_asy_netdev_ops~0.base, ~#x25_asy_netdev_ops~0.offset := 27, 0;call #Ultimate.allocInit(480, 27);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 8 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_open_dev.base, #funAddr~x25_asy_open_dev.offset, ~#x25_asy_netdev_ops~0.base, 16 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_close.base, #funAddr~x25_asy_close.offset, ~#x25_asy_netdev_ops~0.base, 24 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_xmit.base, #funAddr~x25_asy_xmit.offset, ~#x25_asy_netdev_ops~0.base, 32 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 40 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 48 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 56 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 64 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 72 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 80 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 88 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_change_mtu.base, #funAddr~x25_asy_change_mtu.offset, ~#x25_asy_netdev_ops~0.base, 96 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 104 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_timeout.base, #funAddr~x25_asy_timeout.offset, ~#x25_asy_netdev_ops~0.base, 112 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 120 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 128 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 136 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 144 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 152 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 160 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 168 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 176 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 184 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 192 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 200 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 208 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 216 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 224 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 232 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 240 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 248 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 256 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 264 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 272 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 280 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 288 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 296 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 304 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 312 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 320 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 328 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 336 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 344 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 352 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 360 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 368 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 376 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 384 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 392 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 400 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 408 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 416 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 424 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 432 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 440 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 448 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 456 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 464 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 472 + ~#x25_asy_netdev_ops~0.offset, 8);~#x25_ldisc~0.base, ~#x25_ldisc~0.offset := 28, 0;call #Ultimate.allocInit(160, 28);call write~init~int(21507, ~#x25_ldisc~0.base, ~#x25_ldisc~0.offset, 4);call write~init~$Pointer$(24, 0, ~#x25_ldisc~0.base, 4 + ~#x25_ldisc~0.offset, 8);call write~init~int(0, ~#x25_ldisc~0.base, 12 + ~#x25_ldisc~0.offset, 4);call write~init~int(0, ~#x25_ldisc~0.base, 16 + ~#x25_ldisc~0.offset, 4);call write~init~$Pointer$(#funAddr~x25_asy_open_tty.base, #funAddr~x25_asy_open_tty.offset, ~#x25_ldisc~0.base, 20 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_close_tty.base, #funAddr~x25_asy_close_tty.offset, ~#x25_ldisc~0.base, 28 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 36 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 44 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 52 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 60 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_ioctl.base, #funAddr~x25_asy_ioctl.offset, ~#x25_ldisc~0.base, 68 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_compat_ioctl.base, #funAddr~x25_asy_compat_ioctl.offset, ~#x25_ldisc~0.base, 76 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 84 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 92 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 100 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_receive_buf.base, #funAddr~x25_asy_receive_buf.offset, ~#x25_ldisc~0.base, 108 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_write_wakeup.base, #funAddr~x25_asy_write_wakeup.offset, ~#x25_ldisc~0.base, 116 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 124 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 132 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 140 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#x25_ldisc~0.base, 148 + ~#x25_ldisc~0.offset, 8);call write~init~int(0, ~#x25_ldisc~0.base, 156 + ~#x25_ldisc~0.offset, 4);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 29, 0;call #Ultimate.allocInit(120, 29);#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; {729#true} is VALID [2022-02-20 21:53:38,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {729#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset, main_#t~nondet328#1, main_#t~nondet329#1, main_#t~ret330#1.base, main_#t~ret330#1.offset, main_#t~nondet331#1, main_#t~ret332#1.base, main_#t~ret332#1.offset, main_#t~nondet333#1, main_#t~nondet334#1, main_#t~ret335#1.base, main_#t~ret335#1.offset, main_#t~nondet336#1, main_#t~nondet337#1, main_#t~nondet338#1, main_#t~nondet339#1, main_#t~nondet340#1, main_#t~ret341#1.base, main_#t~ret341#1.offset, main_#t~nondet342#1, main_#t~switch343#1, main_#t~nondet344#1, main_#t~switch345#1, main_#t~ret346#1, main_#t~ret347#1, main_#t~ret348#1, main_#t~ret349#1, main_#t~ret350#1, main_#t~nondet351#1, main_#t~switch352#1, main_#t~ret353#1, main_#t~nondet354#1, main_#t~switch355#1, main_#t~ret356#1, main_#t~ret357#1, main_#t~ret358#1, main_#t~nondet359#1, main_#t~switch360#1, main_#t~ret361#1, main_#t~ret362#1, main_#t~ret363#1, main_#t~ret364#1, main_#t~ret365#1, main_#t~ret366#1, main_#t~ret367#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp~39#1.base, main_~tmp~39#1.offset, main_~ldvarg3~0#1, main_~tmp___0~20#1, main_~ldvarg0~0#1, main_~tmp___1~10#1, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset, main_~ldvarg6~0#1, main_~tmp___3~2#1, main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset, main_~tmp___4~2#1.base, main_~tmp___4~2#1.offset, main_~ldvarg1~0#1, main_~tmp___5~1#1, main_~ldvarg4~0#1, main_~tmp___6~1#1, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___7~1#1.base, main_~tmp___7~1#1.offset, main_~ldvarg11~0#1, main_~tmp___8~0#1, main_~ldvarg10~0#1, main_~tmp___9~0#1, main_~ldvarg12~0#1, main_~tmp___10~0#1, main_~ldvarg9~0#1, main_~tmp___11~0#1, main_~ldvarg14~0#1, main_~tmp___12~0#1, main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset, main_~tmp___13~0#1.base, main_~tmp___13~0#1.offset, main_~tmp___14~0#1, main_~tmp___15~0#1, main_~tmp___16~0#1, main_~tmp___17~0#1, main_~tmp___18~0#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp~39#1.base, main_~tmp~39#1.offset;havoc main_~ldvarg3~0#1;havoc main_~tmp___0~20#1;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~10#1;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~2#1;havoc main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset;havoc main_~tmp___4~2#1.base, main_~tmp___4~2#1.offset;havoc main_~ldvarg1~0#1;havoc main_~tmp___5~1#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___6~1#1;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___7~1#1.base, main_~tmp___7~1#1.offset;havoc main_~ldvarg11~0#1;havoc main_~tmp___8~0#1;havoc main_~ldvarg10~0#1;havoc main_~tmp___9~0#1;havoc main_~ldvarg12~0#1;havoc main_~tmp___10~0#1;havoc main_~ldvarg9~0#1;havoc main_~tmp___11~0#1;havoc main_~ldvarg14~0#1;havoc main_~tmp___12~0#1;havoc main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset;havoc main_~tmp___13~0#1.base, main_~tmp___13~0#1.offset;havoc main_~tmp___14~0#1;havoc main_~tmp___15~0#1;havoc main_~tmp___16~0#1;havoc main_~tmp___17~0#1;havoc main_~tmp___18~0#1; {729#true} is VALID [2022-02-20 21:53:38,968 INFO L272 TraceCheckUtils]: 2: Hoare triple {729#true} call main_#t~ret327#1.base, main_#t~ret327#1.offset := ldv_zalloc(1); {755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:38,968 INFO L290 TraceCheckUtils]: 3: Hoare triple {755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {729#true} is VALID [2022-02-20 21:53:38,968 INFO L290 TraceCheckUtils]: 4: Hoare triple {729#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {729#true} is VALID [2022-02-20 21:53:38,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {729#true} assume true; {729#true} is VALID [2022-02-20 21:53:38,969 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {729#true} {729#true} #1799#return; {729#true} is VALID [2022-02-20 21:53:38,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {729#true} main_~tmp~39#1.base, main_~tmp~39#1.offset := main_#t~ret327#1.base, main_#t~ret327#1.offset;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp~39#1.base, main_~tmp~39#1.offset;main_~tmp___0~20#1 := main_#t~nondet328#1;havoc main_#t~nondet328#1;main_~ldvarg3~0#1 := main_~tmp___0~20#1;main_~tmp___1~10#1 := main_#t~nondet329#1;havoc main_#t~nondet329#1;main_~ldvarg0~0#1 := main_~tmp___1~10#1; {729#true} is VALID [2022-02-20 21:53:38,969 INFO L272 TraceCheckUtils]: 8: Hoare triple {729#true} call main_#t~ret330#1.base, main_#t~ret330#1.offset := ldv_zalloc(512); {755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:38,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {729#true} is VALID [2022-02-20 21:53:38,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {729#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {729#true} is VALID [2022-02-20 21:53:38,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {729#true} assume true; {729#true} is VALID [2022-02-20 21:53:38,970 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {729#true} {729#true} #1801#return; {729#true} is VALID [2022-02-20 21:53:38,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {729#true} main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset := main_#t~ret330#1.base, main_#t~ret330#1.offset;havoc main_#t~ret330#1.base, main_#t~ret330#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset;assume -2147483648 <= main_#t~nondet331#1 && main_#t~nondet331#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet331#1;havoc main_#t~nondet331#1;main_~ldvarg6~0#1 := main_~tmp___3~2#1; {729#true} is VALID [2022-02-20 21:53:38,971 INFO L272 TraceCheckUtils]: 14: Hoare triple {729#true} call main_#t~ret332#1.base, main_#t~ret332#1.offset := ldv_zalloc(1); {755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:38,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {729#true} is VALID [2022-02-20 21:53:38,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {729#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {729#true} is VALID [2022-02-20 21:53:38,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {729#true} assume true; {729#true} is VALID [2022-02-20 21:53:38,971 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {729#true} {729#true} #1803#return; {729#true} is VALID [2022-02-20 21:53:38,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {729#true} main_~tmp___4~2#1.base, main_~tmp___4~2#1.offset := main_#t~ret332#1.base, main_#t~ret332#1.offset;havoc main_#t~ret332#1.base, main_#t~ret332#1.offset;main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset := main_~tmp___4~2#1.base, main_~tmp___4~2#1.offset;main_~tmp___5~1#1 := main_#t~nondet333#1;havoc main_#t~nondet333#1;main_~ldvarg1~0#1 := main_~tmp___5~1#1;main_~tmp___6~1#1 := main_#t~nondet334#1;havoc main_#t~nondet334#1;main_~ldvarg4~0#1 := main_~tmp___6~1#1; {729#true} is VALID [2022-02-20 21:53:38,972 INFO L272 TraceCheckUtils]: 20: Hoare triple {729#true} call main_#t~ret335#1.base, main_#t~ret335#1.offset := ldv_zalloc(512); {755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:38,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {729#true} is VALID [2022-02-20 21:53:38,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {729#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {729#true} is VALID [2022-02-20 21:53:38,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {729#true} assume true; {729#true} is VALID [2022-02-20 21:53:38,973 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {729#true} {729#true} #1805#return; {729#true} is VALID [2022-02-20 21:53:38,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {729#true} main_~tmp___7~1#1.base, main_~tmp___7~1#1.offset := main_#t~ret335#1.base, main_#t~ret335#1.offset;havoc main_#t~ret335#1.base, main_#t~ret335#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___7~1#1.base, main_~tmp___7~1#1.offset;assume -2147483648 <= main_#t~nondet336#1 && main_#t~nondet336#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet336#1;havoc main_#t~nondet336#1;main_~ldvarg11~0#1 := main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet337#1 && main_#t~nondet337#1 <= 2147483647;main_~tmp___9~0#1 := main_#t~nondet337#1;havoc main_#t~nondet337#1;main_~ldvarg10~0#1 := main_~tmp___9~0#1;assume -2147483648 <= main_#t~nondet338#1 && main_#t~nondet338#1 <= 2147483647;main_~tmp___10~0#1 := main_#t~nondet338#1;havoc main_#t~nondet338#1;main_~ldvarg12~0#1 := main_~tmp___10~0#1;assume -2147483648 <= main_#t~nondet339#1 && main_#t~nondet339#1 <= 2147483647;main_~tmp___11~0#1 := main_#t~nondet339#1;havoc main_#t~nondet339#1;main_~ldvarg9~0#1 := main_~tmp___11~0#1;assume -2147483648 <= main_#t~nondet340#1 && main_#t~nondet340#1 <= 2147483647;main_~tmp___12~0#1 := main_#t~nondet340#1;havoc main_#t~nondet340#1;main_~ldvarg14~0#1 := main_~tmp___12~0#1; {729#true} is VALID [2022-02-20 21:53:38,974 INFO L272 TraceCheckUtils]: 26: Hoare triple {729#true} call main_#t~ret341#1.base, main_#t~ret341#1.offset := ldv_zalloc(232); {755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:38,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {729#true} is VALID [2022-02-20 21:53:38,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {729#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {729#true} is VALID [2022-02-20 21:53:38,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {729#true} assume true; {729#true} is VALID [2022-02-20 21:53:38,974 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {729#true} {729#true} #1807#return; {729#true} is VALID [2022-02-20 21:53:38,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {729#true} main_~tmp___13~0#1.base, main_~tmp___13~0#1.offset := main_#t~ret341#1.base, main_#t~ret341#1.offset;havoc main_#t~ret341#1.base, main_#t~ret341#1.offset;main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset := main_~tmp___13~0#1.base, main_~tmp___13~0#1.offset;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; {729#true} is VALID [2022-02-20 21:53:38,975 INFO L290 TraceCheckUtils]: 32: Hoare triple {729#true} assume { :end_inline_ldv_set_init } true; {729#true} is VALID [2022-02-20 21:53:38,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {729#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {751#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:53:38,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {751#(= ~ldv_state_variable_0~0 1)} assume -2147483648 <= main_#t~nondet342#1 && main_#t~nondet342#1 <= 2147483647;main_~tmp___14~0#1 := main_#t~nondet342#1;havoc main_#t~nondet342#1;main_#t~switch343#1 := 0 == main_~tmp___14~0#1; {751#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:53:38,978 INFO L290 TraceCheckUtils]: 35: Hoare triple {751#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch343#1;main_#t~switch343#1 := main_#t~switch343#1 || 1 == main_~tmp___14~0#1; {751#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:53:38,979 INFO L290 TraceCheckUtils]: 36: Hoare triple {751#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch343#1; {751#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:53:38,979 INFO L290 TraceCheckUtils]: 37: Hoare triple {751#(= ~ldv_state_variable_0~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet351#1 && main_#t~nondet351#1 <= 2147483647;main_~tmp___16~0#1 := main_#t~nondet351#1;havoc main_#t~nondet351#1;main_#t~switch352#1 := 0 == main_~tmp___16~0#1; {751#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:53:38,979 INFO L290 TraceCheckUtils]: 38: Hoare triple {751#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch352#1; {751#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:53:38,980 INFO L290 TraceCheckUtils]: 39: Hoare triple {751#(= ~ldv_state_variable_0~0 1)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_exit_x25_asy } true;havoc exit_x25_asy_#t~mem318#1.base, exit_x25_asy_#t~mem318#1.offset, exit_x25_asy_#t~ret319#1.base, exit_x25_asy_#t~ret319#1.offset, exit_x25_asy_#t~mem320#1.base, exit_x25_asy_#t~mem320#1.offset, exit_x25_asy_#t~mem321#1.base, exit_x25_asy_#t~mem321#1.offset, exit_x25_asy_#t~ret322#1, exit_x25_asy_~dev~2#1.base, exit_x25_asy_~dev~2#1.offset, exit_x25_asy_~i~1#1, exit_x25_asy_~sl~16#1.base, exit_x25_asy_~sl~16#1.offset, exit_x25_asy_~tmp~35#1.base, exit_x25_asy_~tmp~35#1.offset;havoc exit_x25_asy_~dev~2#1.base, exit_x25_asy_~dev~2#1.offset;havoc exit_x25_asy_~i~1#1;havoc exit_x25_asy_~sl~16#1.base, exit_x25_asy_~sl~16#1.offset;havoc exit_x25_asy_~tmp~35#1.base, exit_x25_asy_~tmp~35#1.offset;exit_x25_asy_~i~1#1 := 0; {730#false} is VALID [2022-02-20 21:53:38,980 INFO L290 TraceCheckUtils]: 40: Hoare triple {730#false} assume !(exit_x25_asy_~i~1#1 < ~x25_asy_maxdev~0); {730#false} is VALID [2022-02-20 21:53:38,980 INFO L272 TraceCheckUtils]: 41: Hoare triple {730#false} call kfree(~x25_asy_devs~0.base, ~x25_asy_devs~0.offset); {756#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 21:53:38,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {756#(= |old(#valid)| |#valid|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call ULTIMATE.dealloc(~p.base, ~p.offset); {729#true} is VALID [2022-02-20 21:53:38,980 INFO L290 TraceCheckUtils]: 43: Hoare triple {729#true} assume true; {729#true} is VALID [2022-02-20 21:53:38,981 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {729#true} {730#false} #1899#return; {730#false} is VALID [2022-02-20 21:53:38,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {730#false} assume { :begin_inline_tty_unregister_ldisc } true;tty_unregister_ldisc_#in~arg0#1 := 6;havoc tty_unregister_ldisc_#res#1;havoc tty_unregister_ldisc_#t~nondet408#1, tty_unregister_ldisc_~arg0#1;tty_unregister_ldisc_~arg0#1 := tty_unregister_ldisc_#in~arg0#1;assume -2147483648 <= tty_unregister_ldisc_#t~nondet408#1 && tty_unregister_ldisc_#t~nondet408#1 <= 2147483647;tty_unregister_ldisc_#res#1 := tty_unregister_ldisc_#t~nondet408#1;havoc tty_unregister_ldisc_#t~nondet408#1; {730#false} is VALID [2022-02-20 21:53:38,981 INFO L290 TraceCheckUtils]: 46: Hoare triple {730#false} exit_x25_asy_#t~ret322#1 := tty_unregister_ldisc_#res#1;assume { :end_inline_tty_unregister_ldisc } true;assume -2147483648 <= exit_x25_asy_#t~ret322#1 && exit_x25_asy_#t~ret322#1 <= 2147483647;havoc exit_x25_asy_#t~ret322#1; {730#false} is VALID [2022-02-20 21:53:38,982 INFO L290 TraceCheckUtils]: 47: Hoare triple {730#false} assume { :end_inline_exit_x25_asy } true;~ldv_state_variable_0~0 := 2; {730#false} is VALID [2022-02-20 21:53:38,982 INFO L290 TraceCheckUtils]: 48: Hoare triple {730#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret383#1, ldv_check_final_state_~tmp___7~7#1;havoc ldv_check_final_state_~tmp___7~7#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); {730#false} is VALID [2022-02-20 21:53:38,982 INFO L290 TraceCheckUtils]: 49: Hoare triple {730#false} ldv_check_final_state_#t~ret383#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret383#1 && ldv_check_final_state_#t~ret383#1 <= 2147483647;ldv_check_final_state_~tmp___7~7#1 := ldv_check_final_state_#t~ret383#1;havoc ldv_check_final_state_#t~ret383#1; {730#false} is VALID [2022-02-20 21:53:38,982 INFO L290 TraceCheckUtils]: 50: Hoare triple {730#false} assume !(0 != ldv_check_final_state_~tmp___7~7#1); {730#false} is VALID [2022-02-20 21:53:38,982 INFO L272 TraceCheckUtils]: 51: Hoare triple {730#false} call ldv_error(); {730#false} is VALID [2022-02-20 21:53:38,982 INFO L290 TraceCheckUtils]: 52: Hoare triple {730#false} assume !false; {730#false} is VALID [2022-02-20 21:53:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 21:53:38,983 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:53:38,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743181136] [2022-02-20 21:53:38,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743181136] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:38,984 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:38,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:53:38,986 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651195936] [2022-02-20 21:53:38,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:38,990 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 53 [2022-02-20 21:53:38,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:38,994 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:53:39,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:39,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:53:39,033 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:53:39,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:53:39,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:53:39,055 INFO L87 Difference]: Start difference. First operand has 726 states, 530 states have (on average 1.3716981132075472) internal successors, (727), 546 states have internal predecessors, (727), 152 states have call successors, (152), 43 states have call predecessors, (152), 42 states have return successors, (147), 145 states have call predecessors, (147), 147 states have call successors, (147) 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:53:44,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:44,837 INFO L93 Difference]: Finished difference Result 2353 states and 3522 transitions. [2022-02-20 21:53:44,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:53:44,837 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 53 [2022-02-20 21:53:44,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:44,838 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:53:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3522 transitions. [2022-02-20 21:53:44,954 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:53:45,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3522 transitions. [2022-02-20 21:53:45,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 3522 transitions. [2022-02-20 21:53:47,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3522 edges. 3522 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:47,809 INFO L225 Difference]: With dead ends: 2353 [2022-02-20 21:53:47,809 INFO L226 Difference]: Without dead ends: 1614 [2022-02-20 21:53:47,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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:53:47,821 INFO L933 BasicCegarLoop]: 1129 mSDtfsCounter, 1854 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 938 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1989 SdHoareTripleChecker+Valid, 2381 SdHoareTripleChecker+Invalid, 1813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 938 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-20 21:53:47,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1989 Valid, 2381 Invalid, 1813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [938 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-20 21:53:47,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2022-02-20 21:53:47,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1368. [2022-02-20 21:53:47,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:53:47,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1614 states. Second operand has 1368 states, 1006 states have (on average 1.3538767395626243) internal successors, (1362), 1024 states have internal predecessors, (1362), 279 states have call successors, (279), 83 states have call predecessors, (279), 82 states have return successors, (278), 274 states have call predecessors, (278), 278 states have call successors, (278) [2022-02-20 21:53:47,939 INFO L74 IsIncluded]: Start isIncluded. First operand 1614 states. Second operand has 1368 states, 1006 states have (on average 1.3538767395626243) internal successors, (1362), 1024 states have internal predecessors, (1362), 279 states have call successors, (279), 83 states have call predecessors, (279), 82 states have return successors, (278), 274 states have call predecessors, (278), 278 states have call successors, (278) [2022-02-20 21:53:47,941 INFO L87 Difference]: Start difference. First operand 1614 states. Second operand has 1368 states, 1006 states have (on average 1.3538767395626243) internal successors, (1362), 1024 states have internal predecessors, (1362), 279 states have call successors, (279), 83 states have call predecessors, (279), 82 states have return successors, (278), 274 states have call predecessors, (278), 278 states have call successors, (278) [2022-02-20 21:53:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:48,035 INFO L93 Difference]: Finished difference Result 1614 states and 2346 transitions. [2022-02-20 21:53:48,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2346 transitions. [2022-02-20 21:53:48,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:48,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:48,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 1368 states, 1006 states have (on average 1.3538767395626243) internal successors, (1362), 1024 states have internal predecessors, (1362), 279 states have call successors, (279), 83 states have call predecessors, (279), 82 states have return successors, (278), 274 states have call predecessors, (278), 278 states have call successors, (278) Second operand 1614 states. [2022-02-20 21:53:48,053 INFO L87 Difference]: Start difference. First operand has 1368 states, 1006 states have (on average 1.3538767395626243) internal successors, (1362), 1024 states have internal predecessors, (1362), 279 states have call successors, (279), 83 states have call predecessors, (279), 82 states have return successors, (278), 274 states have call predecessors, (278), 278 states have call successors, (278) Second operand 1614 states. [2022-02-20 21:53:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:48,144 INFO L93 Difference]: Finished difference Result 1614 states and 2346 transitions. [2022-02-20 21:53:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2346 transitions. [2022-02-20 21:53:48,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:48,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:48,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:53:48,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:53:48,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 1006 states have (on average 1.3538767395626243) internal successors, (1362), 1024 states have internal predecessors, (1362), 279 states have call successors, (279), 83 states have call predecessors, (279), 82 states have return successors, (278), 274 states have call predecessors, (278), 278 states have call successors, (278) [2022-02-20 21:53:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1919 transitions. [2022-02-20 21:53:48,245 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1919 transitions. Word has length 53 [2022-02-20 21:53:48,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:53:48,245 INFO L470 AbstractCegarLoop]: Abstraction has 1368 states and 1919 transitions. [2022-02-20 21:53:48,246 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:53:48,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1919 transitions. [2022-02-20 21:53:48,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 21:53:48,248 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:48,248 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:53:48,248 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:48,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:48,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1669594221, now seen corresponding path program 1 times [2022-02-20 21:53:48,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:53:48,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275347639] [2022-02-20 21:53:48,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:48,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:53:48,318 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 21:53:48,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [90550256] [2022-02-20 21:53:48,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:48,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:53:48,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:53:48,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 21:53:48,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 21:53:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:48,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 21:53:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:48,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:53:48,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {9181#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(100, 2);call #Ultimate.allocInit(26, 3);call #Ultimate.allocInit(72, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(43, 6);call #Ultimate.allocInit(14, 7);call #Ultimate.allocInit(36, 8);call #Ultimate.allocInit(33, 9);call #Ultimate.allocInit(34, 10);call #Ultimate.allocInit(44, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(17, 13);call #Ultimate.allocInit(13, 14);call #Ultimate.allocInit(30, 15);call #Ultimate.allocInit(32, 16);call #Ultimate.allocInit(35, 17);call #Ultimate.allocInit(29, 18);call #Ultimate.allocInit(12, 19);call #Ultimate.allocInit(15, 20);call #Ultimate.allocInit(15, 21);call #Ultimate.allocInit(52, 22);call #Ultimate.allocInit(20, 23);call #Ultimate.allocInit(5, 24);call write~init~int(88, 24, 0, 1);call write~init~int(46, 24, 1, 1);call write~init~int(50, 24, 2, 1);call write~init~int(53, 24, 3, 1);call write~init~int(0, 24, 4, 1);call #Ultimate.allocInit(69, 25);~ldv_state_variable_3~0 := 0;~x25_ldisc_group1~0.base, ~x25_ldisc_group1~0.offset := 0, 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~x25_asy_netdev_ops_group1~0.base, ~x25_asy_netdev_ops_group1~0.offset := 0, 0;~x25_asy_callbacks_group0~0.base, ~x25_asy_callbacks_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~x25_asy_callbacks_group1~0.base, ~x25_asy_callbacks_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~x25_asy_devs~0.base, ~x25_asy_devs~0.offset := 0, 0;~x25_asy_maxdev~0 := 256;~#x25_asy_callbacks~0.base, ~#x25_asy_callbacks~0.offset := 26, 0;call #Ultimate.allocInit(48, 26);call write~init~$Pointer$(#funAddr~x25_asy_connected.base, #funAddr~x25_asy_connected.offset, ~#x25_asy_callbacks~0.base, ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_connected.base, #funAddr~x25_asy_connected.offset, ~#x25_asy_callbacks~0.base, 8 + ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_disconnected.base, #funAddr~x25_asy_disconnected.offset, ~#x25_asy_callbacks~0.base, 16 + ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_disconnected.base, #funAddr~x25_asy_disconnected.offset, ~#x25_asy_callbacks~0.base, 24 + ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_data_indication.base, #funAddr~x25_asy_data_indication.offset, ~#x25_asy_callbacks~0.base, 32 + ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_data_transmit.base, #funAddr~x25_asy_data_transmit.offset, ~#x25_asy_callbacks~0.base, 40 + ~#x25_asy_callbacks~0.offset, 8);~#x25_asy_netdev_ops~0.base, ~#x25_asy_netdev_ops~0.offset := 27, 0;call #Ultimate.allocInit(480, 27);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 8 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_open_dev.base, #funAddr~x25_asy_open_dev.offset, ~#x25_asy_netdev_ops~0.base, 16 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_close.base, #funAddr~x25_asy_close.offset, ~#x25_asy_netdev_ops~0.base, 24 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_xmit.base, #funAddr~x25_asy_xmit.offset, ~#x25_asy_netdev_ops~0.base, 32 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 40 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 48 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 56 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 64 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 72 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 80 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 88 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_change_mtu.base, #funAddr~x25_asy_change_mtu.offset, ~#x25_asy_netdev_ops~0.base, 96 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 104 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_timeout.base, #funAddr~x25_asy_timeout.offset, ~#x25_asy_netdev_ops~0.base, 112 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 120 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 128 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 136 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 144 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 152 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 160 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 168 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 176 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 184 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 192 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 200 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 208 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 216 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 224 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 232 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 240 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 248 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 256 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 264 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 272 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 280 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 288 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 296 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 304 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 312 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 320 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 328 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 336 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 344 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 352 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 360 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 368 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 376 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 384 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 392 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 400 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 408 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 416 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 424 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 432 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 440 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 448 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 456 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 464 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 472 + ~#x25_asy_netdev_ops~0.offset, 8);~#x25_ldisc~0.base, ~#x25_ldisc~0.offset := 28, 0;call #Ultimate.allocInit(160, 28);call write~init~int(21507, ~#x25_ldisc~0.base, ~#x25_ldisc~0.offset, 4);call write~init~$Pointer$(24, 0, ~#x25_ldisc~0.base, 4 + ~#x25_ldisc~0.offset, 8);call write~init~int(0, ~#x25_ldisc~0.base, 12 + ~#x25_ldisc~0.offset, 4);call write~init~int(0, ~#x25_ldisc~0.base, 16 + ~#x25_ldisc~0.offset, 4);call write~init~$Pointer$(#funAddr~x25_asy_open_tty.base, #funAddr~x25_asy_open_tty.offset, ~#x25_ldisc~0.base, 20 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_close_tty.base, #funAddr~x25_asy_close_tty.offset, ~#x25_ldisc~0.base, 28 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 36 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 44 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 52 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 60 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_ioctl.base, #funAddr~x25_asy_ioctl.offset, ~#x25_ldisc~0.base, 68 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_compat_ioctl.base, #funAddr~x25_asy_compat_ioctl.offset, ~#x25_ldisc~0.base, 76 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 84 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 92 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 100 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_receive_buf.base, #funAddr~x25_asy_receive_buf.offset, ~#x25_ldisc~0.base, 108 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_write_wakeup.base, #funAddr~x25_asy_write_wakeup.offset, ~#x25_ldisc~0.base, 116 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 124 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 132 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 140 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#x25_ldisc~0.base, 148 + ~#x25_ldisc~0.offset, 8);call write~init~int(0, ~#x25_ldisc~0.base, 156 + ~#x25_ldisc~0.offset, 4);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 29, 0;call #Ultimate.allocInit(120, 29);#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; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset, main_#t~nondet328#1, main_#t~nondet329#1, main_#t~ret330#1.base, main_#t~ret330#1.offset, main_#t~nondet331#1, main_#t~ret332#1.base, main_#t~ret332#1.offset, main_#t~nondet333#1, main_#t~nondet334#1, main_#t~ret335#1.base, main_#t~ret335#1.offset, main_#t~nondet336#1, main_#t~nondet337#1, main_#t~nondet338#1, main_#t~nondet339#1, main_#t~nondet340#1, main_#t~ret341#1.base, main_#t~ret341#1.offset, main_#t~nondet342#1, main_#t~switch343#1, main_#t~nondet344#1, main_#t~switch345#1, main_#t~ret346#1, main_#t~ret347#1, main_#t~ret348#1, main_#t~ret349#1, main_#t~ret350#1, main_#t~nondet351#1, main_#t~switch352#1, main_#t~ret353#1, main_#t~nondet354#1, main_#t~switch355#1, main_#t~ret356#1, main_#t~ret357#1, main_#t~ret358#1, main_#t~nondet359#1, main_#t~switch360#1, main_#t~ret361#1, main_#t~ret362#1, main_#t~ret363#1, main_#t~ret364#1, main_#t~ret365#1, main_#t~ret366#1, main_#t~ret367#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp~39#1.base, main_~tmp~39#1.offset, main_~ldvarg3~0#1, main_~tmp___0~20#1, main_~ldvarg0~0#1, main_~tmp___1~10#1, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset, main_~ldvarg6~0#1, main_~tmp___3~2#1, main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset, main_~tmp___4~2#1.base, main_~tmp___4~2#1.offset, main_~ldvarg1~0#1, main_~tmp___5~1#1, main_~ldvarg4~0#1, main_~tmp___6~1#1, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___7~1#1.base, main_~tmp___7~1#1.offset, main_~ldvarg11~0#1, main_~tmp___8~0#1, main_~ldvarg10~0#1, main_~tmp___9~0#1, main_~ldvarg12~0#1, main_~tmp___10~0#1, main_~ldvarg9~0#1, main_~tmp___11~0#1, main_~ldvarg14~0#1, main_~tmp___12~0#1, main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset, main_~tmp___13~0#1.base, main_~tmp___13~0#1.offset, main_~tmp___14~0#1, main_~tmp___15~0#1, main_~tmp___16~0#1, main_~tmp___17~0#1, main_~tmp___18~0#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp~39#1.base, main_~tmp~39#1.offset;havoc main_~ldvarg3~0#1;havoc main_~tmp___0~20#1;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~10#1;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~2#1;havoc main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset;havoc main_~tmp___4~2#1.base, main_~tmp___4~2#1.offset;havoc main_~ldvarg1~0#1;havoc main_~tmp___5~1#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___6~1#1;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___7~1#1.base, main_~tmp___7~1#1.offset;havoc main_~ldvarg11~0#1;havoc main_~tmp___8~0#1;havoc main_~ldvarg10~0#1;havoc main_~tmp___9~0#1;havoc main_~ldvarg12~0#1;havoc main_~tmp___10~0#1;havoc main_~ldvarg9~0#1;havoc main_~tmp___11~0#1;havoc main_~ldvarg14~0#1;havoc main_~tmp___12~0#1;havoc main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset;havoc main_~tmp___13~0#1.base, main_~tmp___13~0#1.offset;havoc main_~tmp___14~0#1;havoc main_~tmp___15~0#1;havoc main_~tmp___16~0#1;havoc main_~tmp___17~0#1;havoc main_~tmp___18~0#1; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,906 INFO L272 TraceCheckUtils]: 2: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} call main_#t~ret327#1.base, main_#t~ret327#1.offset := ldv_zalloc(1); {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,906 INFO L290 TraceCheckUtils]: 3: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,906 INFO L290 TraceCheckUtils]: 4: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} assume true; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,909 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9186#(<= 256 ~x25_asy_maxdev~0)} {9186#(<= 256 ~x25_asy_maxdev~0)} #1799#return; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} main_~tmp~39#1.base, main_~tmp~39#1.offset := main_#t~ret327#1.base, main_#t~ret327#1.offset;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp~39#1.base, main_~tmp~39#1.offset;main_~tmp___0~20#1 := main_#t~nondet328#1;havoc main_#t~nondet328#1;main_~ldvarg3~0#1 := main_~tmp___0~20#1;main_~tmp___1~10#1 := main_#t~nondet329#1;havoc main_#t~nondet329#1;main_~ldvarg0~0#1 := main_~tmp___1~10#1; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,909 INFO L272 TraceCheckUtils]: 8: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} call main_#t~ret330#1.base, main_#t~ret330#1.offset := ldv_zalloc(512); {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} assume true; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,911 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9186#(<= 256 ~x25_asy_maxdev~0)} {9186#(<= 256 ~x25_asy_maxdev~0)} #1801#return; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset := main_#t~ret330#1.base, main_#t~ret330#1.offset;havoc main_#t~ret330#1.base, main_#t~ret330#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset;assume -2147483648 <= main_#t~nondet331#1 && main_#t~nondet331#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet331#1;havoc main_#t~nondet331#1;main_~ldvarg6~0#1 := main_~tmp___3~2#1; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,912 INFO L272 TraceCheckUtils]: 14: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} call main_#t~ret332#1.base, main_#t~ret332#1.offset := ldv_zalloc(1); {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} assume true; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,914 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9186#(<= 256 ~x25_asy_maxdev~0)} {9186#(<= 256 ~x25_asy_maxdev~0)} #1803#return; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} main_~tmp___4~2#1.base, main_~tmp___4~2#1.offset := main_#t~ret332#1.base, main_#t~ret332#1.offset;havoc main_#t~ret332#1.base, main_#t~ret332#1.offset;main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset := main_~tmp___4~2#1.base, main_~tmp___4~2#1.offset;main_~tmp___5~1#1 := main_#t~nondet333#1;havoc main_#t~nondet333#1;main_~ldvarg1~0#1 := main_~tmp___5~1#1;main_~tmp___6~1#1 := main_#t~nondet334#1;havoc main_#t~nondet334#1;main_~ldvarg4~0#1 := main_~tmp___6~1#1; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,914 INFO L272 TraceCheckUtils]: 20: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} call main_#t~ret335#1.base, main_#t~ret335#1.offset := ldv_zalloc(512); {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} assume true; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,918 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9186#(<= 256 ~x25_asy_maxdev~0)} {9186#(<= 256 ~x25_asy_maxdev~0)} #1805#return; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} main_~tmp___7~1#1.base, main_~tmp___7~1#1.offset := main_#t~ret335#1.base, main_#t~ret335#1.offset;havoc main_#t~ret335#1.base, main_#t~ret335#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___7~1#1.base, main_~tmp___7~1#1.offset;assume -2147483648 <= main_#t~nondet336#1 && main_#t~nondet336#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet336#1;havoc main_#t~nondet336#1;main_~ldvarg11~0#1 := main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet337#1 && main_#t~nondet337#1 <= 2147483647;main_~tmp___9~0#1 := main_#t~nondet337#1;havoc main_#t~nondet337#1;main_~ldvarg10~0#1 := main_~tmp___9~0#1;assume -2147483648 <= main_#t~nondet338#1 && main_#t~nondet338#1 <= 2147483647;main_~tmp___10~0#1 := main_#t~nondet338#1;havoc main_#t~nondet338#1;main_~ldvarg12~0#1 := main_~tmp___10~0#1;assume -2147483648 <= main_#t~nondet339#1 && main_#t~nondet339#1 <= 2147483647;main_~tmp___11~0#1 := main_#t~nondet339#1;havoc main_#t~nondet339#1;main_~ldvarg9~0#1 := main_~tmp___11~0#1;assume -2147483648 <= main_#t~nondet340#1 && main_#t~nondet340#1 <= 2147483647;main_~tmp___12~0#1 := main_#t~nondet340#1;havoc main_#t~nondet340#1;main_~ldvarg14~0#1 := main_~tmp___12~0#1; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,918 INFO L272 TraceCheckUtils]: 26: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} call main_#t~ret341#1.base, main_#t~ret341#1.offset := ldv_zalloc(232); {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} assume true; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,920 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9186#(<= 256 ~x25_asy_maxdev~0)} {9186#(<= 256 ~x25_asy_maxdev~0)} #1807#return; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} main_~tmp___13~0#1.base, main_~tmp___13~0#1.offset := main_#t~ret341#1.base, main_#t~ret341#1.offset;havoc main_#t~ret341#1.base, main_#t~ret341#1.offset;main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset := main_~tmp___13~0#1.base, main_~tmp___13~0#1.offset;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; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,922 INFO L290 TraceCheckUtils]: 32: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} assume { :end_inline_ldv_set_init } true; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,922 INFO L290 TraceCheckUtils]: 34: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} assume -2147483648 <= main_#t~nondet342#1 && main_#t~nondet342#1 <= 2147483647;main_~tmp___14~0#1 := main_#t~nondet342#1;havoc main_#t~nondet342#1;main_#t~switch343#1 := 0 == main_~tmp___14~0#1; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,924 INFO L290 TraceCheckUtils]: 35: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} assume !main_#t~switch343#1;main_#t~switch343#1 := main_#t~switch343#1 || 1 == main_~tmp___14~0#1; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,924 INFO L290 TraceCheckUtils]: 36: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} assume main_#t~switch343#1; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,939 INFO L290 TraceCheckUtils]: 37: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet351#1 && main_#t~nondet351#1 <= 2147483647;main_~tmp___16~0#1 := main_#t~nondet351#1;havoc main_#t~nondet351#1;main_#t~switch352#1 := 0 == main_~tmp___16~0#1; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,939 INFO L290 TraceCheckUtils]: 38: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} assume !main_#t~switch352#1;main_#t~switch352#1 := main_#t~switch352#1 || 1 == main_~tmp___16~0#1; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,940 INFO L290 TraceCheckUtils]: 39: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} assume main_#t~switch352#1; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,940 INFO L290 TraceCheckUtils]: 40: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_init_x25_asy } true;havoc init_x25_asy_#res#1;havoc init_x25_asy_#t~nondet315#1, init_x25_asy_#t~ret316#1.base, init_x25_asy_#t~ret316#1.offset, init_x25_asy_#t~ret317#1, init_x25_asy_~tmp~34#1.base, init_x25_asy_~tmp~34#1.offset, init_x25_asy_~tmp___0~18#1;havoc init_x25_asy_~tmp~34#1.base, init_x25_asy_~tmp~34#1.offset;havoc init_x25_asy_~tmp___0~18#1; {9186#(<= 256 ~x25_asy_maxdev~0)} is VALID [2022-02-20 21:53:48,941 INFO L290 TraceCheckUtils]: 41: Hoare triple {9186#(<= 256 ~x25_asy_maxdev~0)} assume ~x25_asy_maxdev~0 <= 3;~x25_asy_maxdev~0 := 4; {9182#false} is VALID [2022-02-20 21:53:48,941 INFO L290 TraceCheckUtils]: 42: Hoare triple {9182#false} havoc init_x25_asy_#t~nondet315#1;assume { :begin_inline_kcalloc } true;kcalloc_#in~n#1, kcalloc_#in~size#1, kcalloc_#in~flags#1 := ~x25_asy_maxdev~0, 8, 208;havoc kcalloc_#res#1.base, kcalloc_#res#1.offset;havoc kcalloc_#t~ret20#1.base, kcalloc_#t~ret20#1.offset, kcalloc_~n#1, kcalloc_~size#1, kcalloc_~flags#1, kcalloc_~tmp~1#1.base, kcalloc_~tmp~1#1.offset;kcalloc_~n#1 := kcalloc_#in~n#1;kcalloc_~size#1 := kcalloc_#in~size#1;kcalloc_~flags#1 := kcalloc_#in~flags#1;havoc kcalloc_~tmp~1#1.base, kcalloc_~tmp~1#1.offset;assume { :begin_inline_kmalloc_array } true;kmalloc_array_#in~n#1, kmalloc_array_#in~size#1, kmalloc_array_#in~flags#1 := kcalloc_~n#1, kcalloc_~size#1, ~bitwiseOr(kcalloc_~flags#1, 32768);havoc kmalloc_array_#res#1.base, kmalloc_array_#res#1.offset;havoc kmalloc_array_#t~ret19#1.base, kmalloc_array_#t~ret19#1.offset, kmalloc_array_~n#1, kmalloc_array_~size#1, kmalloc_array_~flags#1, kmalloc_array_~tmp~0#1.base, kmalloc_array_~tmp~0#1.offset;kmalloc_array_~n#1 := kmalloc_array_#in~n#1;kmalloc_array_~size#1 := kmalloc_array_#in~size#1;kmalloc_array_~flags#1 := kmalloc_array_#in~flags#1;havoc kmalloc_array_~tmp~0#1.base, kmalloc_array_~tmp~0#1.offset; {9182#false} is VALID [2022-02-20 21:53:48,941 INFO L290 TraceCheckUtils]: 43: Hoare triple {9182#false} assume 0 != kmalloc_array_~size#1 % 18446744073709551616 && 18446744073709551615 / (kmalloc_array_~size#1 % 18446744073709551616) % 18446744073709551616 < kmalloc_array_~n#1 % 18446744073709551616;kmalloc_array_#res#1.base, kmalloc_array_#res#1.offset := 0, 0; {9182#false} is VALID [2022-02-20 21:53:48,941 INFO L290 TraceCheckUtils]: 44: Hoare triple {9182#false} kcalloc_#t~ret20#1.base, kcalloc_#t~ret20#1.offset := kmalloc_array_#res#1.base, kmalloc_array_#res#1.offset;assume { :end_inline_kmalloc_array } true;kcalloc_~tmp~1#1.base, kcalloc_~tmp~1#1.offset := kcalloc_#t~ret20#1.base, kcalloc_#t~ret20#1.offset;havoc kcalloc_#t~ret20#1.base, kcalloc_#t~ret20#1.offset;kcalloc_#res#1.base, kcalloc_#res#1.offset := kcalloc_~tmp~1#1.base, kcalloc_~tmp~1#1.offset; {9182#false} is VALID [2022-02-20 21:53:48,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {9182#false} init_x25_asy_#t~ret316#1.base, init_x25_asy_#t~ret316#1.offset := kcalloc_#res#1.base, kcalloc_#res#1.offset;assume { :end_inline_kcalloc } true;init_x25_asy_~tmp~34#1.base, init_x25_asy_~tmp~34#1.offset := init_x25_asy_#t~ret316#1.base, init_x25_asy_#t~ret316#1.offset;havoc init_x25_asy_#t~ret316#1.base, init_x25_asy_#t~ret316#1.offset;~x25_asy_devs~0.base, ~x25_asy_devs~0.offset := init_x25_asy_~tmp~34#1.base, init_x25_asy_~tmp~34#1.offset; {9182#false} is VALID [2022-02-20 21:53:48,941 INFO L290 TraceCheckUtils]: 46: Hoare triple {9182#false} assume 0 == (~x25_asy_devs~0.base + ~x25_asy_devs~0.offset) % 18446744073709551616;init_x25_asy_#res#1 := -12; {9182#false} is VALID [2022-02-20 21:53:48,941 INFO L290 TraceCheckUtils]: 47: Hoare triple {9182#false} main_#t~ret353#1 := init_x25_asy_#res#1;assume { :end_inline_init_x25_asy } true;assume -2147483648 <= main_#t~ret353#1 && main_#t~ret353#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret353#1;havoc main_#t~ret353#1; {9182#false} is VALID [2022-02-20 21:53:48,941 INFO L290 TraceCheckUtils]: 48: Hoare triple {9182#false} assume !(0 == ~ldv_retval_1~0); {9182#false} is VALID [2022-02-20 21:53:48,941 INFO L290 TraceCheckUtils]: 49: Hoare triple {9182#false} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {9182#false} is VALID [2022-02-20 21:53:48,941 INFO L290 TraceCheckUtils]: 50: Hoare triple {9182#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret383#1, ldv_check_final_state_~tmp___7~7#1;havoc ldv_check_final_state_~tmp___7~7#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); {9182#false} is VALID [2022-02-20 21:53:48,942 INFO L290 TraceCheckUtils]: 51: Hoare triple {9182#false} ldv_check_final_state_#t~ret383#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret383#1 && ldv_check_final_state_#t~ret383#1 <= 2147483647;ldv_check_final_state_~tmp___7~7#1 := ldv_check_final_state_#t~ret383#1;havoc ldv_check_final_state_#t~ret383#1; {9182#false} is VALID [2022-02-20 21:53:48,942 INFO L290 TraceCheckUtils]: 52: Hoare triple {9182#false} assume !(0 != ldv_check_final_state_~tmp___7~7#1); {9182#false} is VALID [2022-02-20 21:53:48,942 INFO L272 TraceCheckUtils]: 53: Hoare triple {9182#false} call ldv_error(); {9182#false} is VALID [2022-02-20 21:53:48,942 INFO L290 TraceCheckUtils]: 54: Hoare triple {9182#false} assume !false; {9182#false} is VALID [2022-02-20 21:53:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 21:53:48,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:53:48,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:53:48,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275347639] [2022-02-20 21:53:48,942 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 21:53:48,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90550256] [2022-02-20 21:53:48,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90550256] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:48,943 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:48,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 21:53:48,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110892839] [2022-02-20 21:53:48,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:48,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2022-02-20 21:53:48,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:48,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 21:53:48,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:48,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:53:48,978 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:53:48,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:53:48,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:53:48,979 INFO L87 Difference]: Start difference. First operand 1368 states and 1919 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 21:53:50,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:50,492 INFO L93 Difference]: Finished difference Result 2722 states and 3819 transitions. [2022-02-20 21:53:50,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:53:50,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2022-02-20 21:53:50,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 21:53:50,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1983 transitions. [2022-02-20 21:53:50,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 21:53:50,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1983 transitions. [2022-02-20 21:53:50,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1983 transitions. [2022-02-20 21:53:51,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1983 edges. 1983 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:52,038 INFO L225 Difference]: With dead ends: 2722 [2022-02-20 21:53:52,038 INFO L226 Difference]: Without dead ends: 1368 [2022-02-20 21:53:52,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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:52,047 INFO L933 BasicCegarLoop]: 992 mSDtfsCounter, 971 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:53:52,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [971 Valid, 992 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:53:52,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2022-02-20 21:53:52,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1368. [2022-02-20 21:53:52,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:53:52,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1368 states. Second operand has 1368 states, 1006 states have (on average 1.3528827037773359) internal successors, (1361), 1024 states have internal predecessors, (1361), 279 states have call successors, (279), 83 states have call predecessors, (279), 82 states have return successors, (278), 274 states have call predecessors, (278), 278 states have call successors, (278) [2022-02-20 21:53:52,327 INFO L74 IsIncluded]: Start isIncluded. First operand 1368 states. Second operand has 1368 states, 1006 states have (on average 1.3528827037773359) internal successors, (1361), 1024 states have internal predecessors, (1361), 279 states have call successors, (279), 83 states have call predecessors, (279), 82 states have return successors, (278), 274 states have call predecessors, (278), 278 states have call successors, (278) [2022-02-20 21:53:52,330 INFO L87 Difference]: Start difference. First operand 1368 states. Second operand has 1368 states, 1006 states have (on average 1.3528827037773359) internal successors, (1361), 1024 states have internal predecessors, (1361), 279 states have call successors, (279), 83 states have call predecessors, (279), 82 states have return successors, (278), 274 states have call predecessors, (278), 278 states have call successors, (278) [2022-02-20 21:53:52,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:52,385 INFO L93 Difference]: Finished difference Result 1368 states and 1918 transitions. [2022-02-20 21:53:52,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1918 transitions. [2022-02-20 21:53:52,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:52,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:52,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 1368 states, 1006 states have (on average 1.3528827037773359) internal successors, (1361), 1024 states have internal predecessors, (1361), 279 states have call successors, (279), 83 states have call predecessors, (279), 82 states have return successors, (278), 274 states have call predecessors, (278), 278 states have call successors, (278) Second operand 1368 states. [2022-02-20 21:53:52,394 INFO L87 Difference]: Start difference. First operand has 1368 states, 1006 states have (on average 1.3528827037773359) internal successors, (1361), 1024 states have internal predecessors, (1361), 279 states have call successors, (279), 83 states have call predecessors, (279), 82 states have return successors, (278), 274 states have call predecessors, (278), 278 states have call successors, (278) Second operand 1368 states. [2022-02-20 21:53:52,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:52,450 INFO L93 Difference]: Finished difference Result 1368 states and 1918 transitions. [2022-02-20 21:53:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1918 transitions. [2022-02-20 21:53:52,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:52,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:52,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:53:52,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:53:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 1006 states have (on average 1.3528827037773359) internal successors, (1361), 1024 states have internal predecessors, (1361), 279 states have call successors, (279), 83 states have call predecessors, (279), 82 states have return successors, (278), 274 states have call predecessors, (278), 278 states have call successors, (278) [2022-02-20 21:53:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1918 transitions. [2022-02-20 21:53:52,557 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1918 transitions. Word has length 55 [2022-02-20 21:53:52,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:53:52,558 INFO L470 AbstractCegarLoop]: Abstraction has 1368 states and 1918 transitions. [2022-02-20 21:53:52,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 21:53:52,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1918 transitions. [2022-02-20 21:53:52,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 21:53:52,561 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:52,561 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 21:53:52,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:53:52,783 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:52,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:52,783 INFO L85 PathProgramCache]: Analyzing trace with hash 658476971, now seen corresponding path program 1 times [2022-02-20 21:53:52,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:53:52,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028995174] [2022-02-20 21:53:52,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:52,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:53:52,837 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 21:53:52,839 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2104304244] [2022-02-20 21:53:52,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:52,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:53:52,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:53:52,841 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 21:53:52,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 21:53:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:53,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 21:53:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:53,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:53:53,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {17811#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(100, 2);call #Ultimate.allocInit(26, 3);call #Ultimate.allocInit(72, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(43, 6);call #Ultimate.allocInit(14, 7);call #Ultimate.allocInit(36, 8);call #Ultimate.allocInit(33, 9);call #Ultimate.allocInit(34, 10);call #Ultimate.allocInit(44, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(17, 13);call #Ultimate.allocInit(13, 14);call #Ultimate.allocInit(30, 15);call #Ultimate.allocInit(32, 16);call #Ultimate.allocInit(35, 17);call #Ultimate.allocInit(29, 18);call #Ultimate.allocInit(12, 19);call #Ultimate.allocInit(15, 20);call #Ultimate.allocInit(15, 21);call #Ultimate.allocInit(52, 22);call #Ultimate.allocInit(20, 23);call #Ultimate.allocInit(5, 24);call write~init~int(88, 24, 0, 1);call write~init~int(46, 24, 1, 1);call write~init~int(50, 24, 2, 1);call write~init~int(53, 24, 3, 1);call write~init~int(0, 24, 4, 1);call #Ultimate.allocInit(69, 25);~ldv_state_variable_3~0 := 0;~x25_ldisc_group1~0.base, ~x25_ldisc_group1~0.offset := 0, 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~x25_asy_netdev_ops_group1~0.base, ~x25_asy_netdev_ops_group1~0.offset := 0, 0;~x25_asy_callbacks_group0~0.base, ~x25_asy_callbacks_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~x25_asy_callbacks_group1~0.base, ~x25_asy_callbacks_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~x25_asy_devs~0.base, ~x25_asy_devs~0.offset := 0, 0;~x25_asy_maxdev~0 := 256;~#x25_asy_callbacks~0.base, ~#x25_asy_callbacks~0.offset := 26, 0;call #Ultimate.allocInit(48, 26);call write~init~$Pointer$(#funAddr~x25_asy_connected.base, #funAddr~x25_asy_connected.offset, ~#x25_asy_callbacks~0.base, ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_connected.base, #funAddr~x25_asy_connected.offset, ~#x25_asy_callbacks~0.base, 8 + ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_disconnected.base, #funAddr~x25_asy_disconnected.offset, ~#x25_asy_callbacks~0.base, 16 + ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_disconnected.base, #funAddr~x25_asy_disconnected.offset, ~#x25_asy_callbacks~0.base, 24 + ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_data_indication.base, #funAddr~x25_asy_data_indication.offset, ~#x25_asy_callbacks~0.base, 32 + ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_data_transmit.base, #funAddr~x25_asy_data_transmit.offset, ~#x25_asy_callbacks~0.base, 40 + ~#x25_asy_callbacks~0.offset, 8);~#x25_asy_netdev_ops~0.base, ~#x25_asy_netdev_ops~0.offset := 27, 0;call #Ultimate.allocInit(480, 27);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 8 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_open_dev.base, #funAddr~x25_asy_open_dev.offset, ~#x25_asy_netdev_ops~0.base, 16 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_close.base, #funAddr~x25_asy_close.offset, ~#x25_asy_netdev_ops~0.base, 24 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_xmit.base, #funAddr~x25_asy_xmit.offset, ~#x25_asy_netdev_ops~0.base, 32 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 40 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 48 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 56 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 64 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 72 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 80 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 88 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_change_mtu.base, #funAddr~x25_asy_change_mtu.offset, ~#x25_asy_netdev_ops~0.base, 96 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 104 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_timeout.base, #funAddr~x25_asy_timeout.offset, ~#x25_asy_netdev_ops~0.base, 112 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 120 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 128 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 136 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 144 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 152 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 160 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 168 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 176 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 184 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 192 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 200 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 208 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 216 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 224 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 232 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 240 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 248 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 256 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 264 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 272 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 280 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 288 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 296 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 304 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 312 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 320 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 328 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 336 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 344 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 352 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 360 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 368 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 376 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 384 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 392 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 400 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 408 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 416 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 424 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 432 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 440 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 448 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 456 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 464 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 472 + ~#x25_asy_netdev_ops~0.offset, 8);~#x25_ldisc~0.base, ~#x25_ldisc~0.offset := 28, 0;call #Ultimate.allocInit(160, 28);call write~init~int(21507, ~#x25_ldisc~0.base, ~#x25_ldisc~0.offset, 4);call write~init~$Pointer$(24, 0, ~#x25_ldisc~0.base, 4 + ~#x25_ldisc~0.offset, 8);call write~init~int(0, ~#x25_ldisc~0.base, 12 + ~#x25_ldisc~0.offset, 4);call write~init~int(0, ~#x25_ldisc~0.base, 16 + ~#x25_ldisc~0.offset, 4);call write~init~$Pointer$(#funAddr~x25_asy_open_tty.base, #funAddr~x25_asy_open_tty.offset, ~#x25_ldisc~0.base, 20 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_close_tty.base, #funAddr~x25_asy_close_tty.offset, ~#x25_ldisc~0.base, 28 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 36 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 44 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 52 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 60 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_ioctl.base, #funAddr~x25_asy_ioctl.offset, ~#x25_ldisc~0.base, 68 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_compat_ioctl.base, #funAddr~x25_asy_compat_ioctl.offset, ~#x25_ldisc~0.base, 76 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 84 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 92 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 100 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_receive_buf.base, #funAddr~x25_asy_receive_buf.offset, ~#x25_ldisc~0.base, 108 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_write_wakeup.base, #funAddr~x25_asy_write_wakeup.offset, ~#x25_ldisc~0.base, 116 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 124 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 132 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 140 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#x25_ldisc~0.base, 148 + ~#x25_ldisc~0.offset, 8);call write~init~int(0, ~#x25_ldisc~0.base, 156 + ~#x25_ldisc~0.offset, 4);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 29, 0;call #Ultimate.allocInit(120, 29);#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; {17811#true} is VALID [2022-02-20 21:53:53,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {17811#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset, main_#t~nondet328#1, main_#t~nondet329#1, main_#t~ret330#1.base, main_#t~ret330#1.offset, main_#t~nondet331#1, main_#t~ret332#1.base, main_#t~ret332#1.offset, main_#t~nondet333#1, main_#t~nondet334#1, main_#t~ret335#1.base, main_#t~ret335#1.offset, main_#t~nondet336#1, main_#t~nondet337#1, main_#t~nondet338#1, main_#t~nondet339#1, main_#t~nondet340#1, main_#t~ret341#1.base, main_#t~ret341#1.offset, main_#t~nondet342#1, main_#t~switch343#1, main_#t~nondet344#1, main_#t~switch345#1, main_#t~ret346#1, main_#t~ret347#1, main_#t~ret348#1, main_#t~ret349#1, main_#t~ret350#1, main_#t~nondet351#1, main_#t~switch352#1, main_#t~ret353#1, main_#t~nondet354#1, main_#t~switch355#1, main_#t~ret356#1, main_#t~ret357#1, main_#t~ret358#1, main_#t~nondet359#1, main_#t~switch360#1, main_#t~ret361#1, main_#t~ret362#1, main_#t~ret363#1, main_#t~ret364#1, main_#t~ret365#1, main_#t~ret366#1, main_#t~ret367#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp~39#1.base, main_~tmp~39#1.offset, main_~ldvarg3~0#1, main_~tmp___0~20#1, main_~ldvarg0~0#1, main_~tmp___1~10#1, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset, main_~ldvarg6~0#1, main_~tmp___3~2#1, main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset, main_~tmp___4~2#1.base, main_~tmp___4~2#1.offset, main_~ldvarg1~0#1, main_~tmp___5~1#1, main_~ldvarg4~0#1, main_~tmp___6~1#1, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___7~1#1.base, main_~tmp___7~1#1.offset, main_~ldvarg11~0#1, main_~tmp___8~0#1, main_~ldvarg10~0#1, main_~tmp___9~0#1, main_~ldvarg12~0#1, main_~tmp___10~0#1, main_~ldvarg9~0#1, main_~tmp___11~0#1, main_~ldvarg14~0#1, main_~tmp___12~0#1, main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset, main_~tmp___13~0#1.base, main_~tmp___13~0#1.offset, main_~tmp___14~0#1, main_~tmp___15~0#1, main_~tmp___16~0#1, main_~tmp___17~0#1, main_~tmp___18~0#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp~39#1.base, main_~tmp~39#1.offset;havoc main_~ldvarg3~0#1;havoc main_~tmp___0~20#1;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~10#1;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~2#1;havoc main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset;havoc main_~tmp___4~2#1.base, main_~tmp___4~2#1.offset;havoc main_~ldvarg1~0#1;havoc main_~tmp___5~1#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___6~1#1;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___7~1#1.base, main_~tmp___7~1#1.offset;havoc main_~ldvarg11~0#1;havoc main_~tmp___8~0#1;havoc main_~ldvarg10~0#1;havoc main_~tmp___9~0#1;havoc main_~ldvarg12~0#1;havoc main_~tmp___10~0#1;havoc main_~ldvarg9~0#1;havoc main_~tmp___11~0#1;havoc main_~ldvarg14~0#1;havoc main_~tmp___12~0#1;havoc main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset;havoc main_~tmp___13~0#1.base, main_~tmp___13~0#1.offset;havoc main_~tmp___14~0#1;havoc main_~tmp___15~0#1;havoc main_~tmp___16~0#1;havoc main_~tmp___17~0#1;havoc main_~tmp___18~0#1; {17811#true} is VALID [2022-02-20 21:53:53,323 INFO L272 TraceCheckUtils]: 2: Hoare triple {17811#true} call main_#t~ret327#1.base, main_#t~ret327#1.offset := ldv_zalloc(1); {17811#true} is VALID [2022-02-20 21:53:53,324 INFO L290 TraceCheckUtils]: 3: Hoare triple {17811#true} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {17811#true} is VALID [2022-02-20 21:53:53,324 INFO L290 TraceCheckUtils]: 4: Hoare triple {17811#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {17811#true} is VALID [2022-02-20 21:53:53,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {17811#true} assume true; {17811#true} is VALID [2022-02-20 21:53:53,324 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {17811#true} {17811#true} #1799#return; {17811#true} is VALID [2022-02-20 21:53:53,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {17811#true} main_~tmp~39#1.base, main_~tmp~39#1.offset := main_#t~ret327#1.base, main_#t~ret327#1.offset;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp~39#1.base, main_~tmp~39#1.offset;main_~tmp___0~20#1 := main_#t~nondet328#1;havoc main_#t~nondet328#1;main_~ldvarg3~0#1 := main_~tmp___0~20#1;main_~tmp___1~10#1 := main_#t~nondet329#1;havoc main_#t~nondet329#1;main_~ldvarg0~0#1 := main_~tmp___1~10#1; {17811#true} is VALID [2022-02-20 21:53:53,324 INFO L272 TraceCheckUtils]: 8: Hoare triple {17811#true} call main_#t~ret330#1.base, main_#t~ret330#1.offset := ldv_zalloc(512); {17811#true} is VALID [2022-02-20 21:53:53,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {17811#true} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {17811#true} is VALID [2022-02-20 21:53:53,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {17811#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {17811#true} is VALID [2022-02-20 21:53:53,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {17811#true} assume true; {17811#true} is VALID [2022-02-20 21:53:53,324 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {17811#true} {17811#true} #1801#return; {17811#true} is VALID [2022-02-20 21:53:53,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {17811#true} main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset := main_#t~ret330#1.base, main_#t~ret330#1.offset;havoc main_#t~ret330#1.base, main_#t~ret330#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset;assume -2147483648 <= main_#t~nondet331#1 && main_#t~nondet331#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet331#1;havoc main_#t~nondet331#1;main_~ldvarg6~0#1 := main_~tmp___3~2#1; {17811#true} is VALID [2022-02-20 21:53:53,325 INFO L272 TraceCheckUtils]: 14: Hoare triple {17811#true} call main_#t~ret332#1.base, main_#t~ret332#1.offset := ldv_zalloc(1); {17811#true} is VALID [2022-02-20 21:53:53,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {17811#true} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {17811#true} is VALID [2022-02-20 21:53:53,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {17811#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {17811#true} is VALID [2022-02-20 21:53:53,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {17811#true} assume true; {17811#true} is VALID [2022-02-20 21:53:53,325 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17811#true} {17811#true} #1803#return; {17811#true} is VALID [2022-02-20 21:53:53,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {17811#true} main_~tmp___4~2#1.base, main_~tmp___4~2#1.offset := main_#t~ret332#1.base, main_#t~ret332#1.offset;havoc main_#t~ret332#1.base, main_#t~ret332#1.offset;main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset := main_~tmp___4~2#1.base, main_~tmp___4~2#1.offset;main_~tmp___5~1#1 := main_#t~nondet333#1;havoc main_#t~nondet333#1;main_~ldvarg1~0#1 := main_~tmp___5~1#1;main_~tmp___6~1#1 := main_#t~nondet334#1;havoc main_#t~nondet334#1;main_~ldvarg4~0#1 := main_~tmp___6~1#1; {17811#true} is VALID [2022-02-20 21:53:53,325 INFO L272 TraceCheckUtils]: 20: Hoare triple {17811#true} call main_#t~ret335#1.base, main_#t~ret335#1.offset := ldv_zalloc(512); {17811#true} is VALID [2022-02-20 21:53:53,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {17811#true} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {17811#true} is VALID [2022-02-20 21:53:53,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {17811#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {17811#true} is VALID [2022-02-20 21:53:53,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {17811#true} assume true; {17811#true} is VALID [2022-02-20 21:53:53,325 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {17811#true} {17811#true} #1805#return; {17811#true} is VALID [2022-02-20 21:53:53,325 INFO L290 TraceCheckUtils]: 25: Hoare triple {17811#true} main_~tmp___7~1#1.base, main_~tmp___7~1#1.offset := main_#t~ret335#1.base, main_#t~ret335#1.offset;havoc main_#t~ret335#1.base, main_#t~ret335#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___7~1#1.base, main_~tmp___7~1#1.offset;assume -2147483648 <= main_#t~nondet336#1 && main_#t~nondet336#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet336#1;havoc main_#t~nondet336#1;main_~ldvarg11~0#1 := main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet337#1 && main_#t~nondet337#1 <= 2147483647;main_~tmp___9~0#1 := main_#t~nondet337#1;havoc main_#t~nondet337#1;main_~ldvarg10~0#1 := main_~tmp___9~0#1;assume -2147483648 <= main_#t~nondet338#1 && main_#t~nondet338#1 <= 2147483647;main_~tmp___10~0#1 := main_#t~nondet338#1;havoc main_#t~nondet338#1;main_~ldvarg12~0#1 := main_~tmp___10~0#1;assume -2147483648 <= main_#t~nondet339#1 && main_#t~nondet339#1 <= 2147483647;main_~tmp___11~0#1 := main_#t~nondet339#1;havoc main_#t~nondet339#1;main_~ldvarg9~0#1 := main_~tmp___11~0#1;assume -2147483648 <= main_#t~nondet340#1 && main_#t~nondet340#1 <= 2147483647;main_~tmp___12~0#1 := main_#t~nondet340#1;havoc main_#t~nondet340#1;main_~ldvarg14~0#1 := main_~tmp___12~0#1; {17811#true} is VALID [2022-02-20 21:53:53,325 INFO L272 TraceCheckUtils]: 26: Hoare triple {17811#true} call main_#t~ret341#1.base, main_#t~ret341#1.offset := ldv_zalloc(232); {17811#true} is VALID [2022-02-20 21:53:53,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {17811#true} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {17811#true} is VALID [2022-02-20 21:53:53,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {17811#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {17811#true} is VALID [2022-02-20 21:53:53,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {17811#true} assume true; {17811#true} is VALID [2022-02-20 21:53:53,326 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {17811#true} {17811#true} #1807#return; {17811#true} is VALID [2022-02-20 21:53:53,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {17811#true} main_~tmp___13~0#1.base, main_~tmp___13~0#1.offset := main_#t~ret341#1.base, main_#t~ret341#1.offset;havoc main_#t~ret341#1.base, main_#t~ret341#1.offset;main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset := main_~tmp___13~0#1.base, main_~tmp___13~0#1.offset;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; {17909#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:53,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {17909#(= ~last_index~0 0)} assume { :end_inline_ldv_set_init } true; {17909#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:53,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {17909#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {17909#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:53,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {17909#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet342#1 && main_#t~nondet342#1 <= 2147483647;main_~tmp___14~0#1 := main_#t~nondet342#1;havoc main_#t~nondet342#1;main_#t~switch343#1 := 0 == main_~tmp___14~0#1; {17909#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:53,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {17909#(= ~last_index~0 0)} assume !main_#t~switch343#1;main_#t~switch343#1 := main_#t~switch343#1 || 1 == main_~tmp___14~0#1; {17909#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:53,327 INFO L290 TraceCheckUtils]: 36: Hoare triple {17909#(= ~last_index~0 0)} assume main_#t~switch343#1; {17909#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:53,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {17909#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet351#1 && main_#t~nondet351#1 <= 2147483647;main_~tmp___16~0#1 := main_#t~nondet351#1;havoc main_#t~nondet351#1;main_#t~switch352#1 := 0 == main_~tmp___16~0#1; {17909#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:53,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {17909#(= ~last_index~0 0)} assume !main_#t~switch352#1;main_#t~switch352#1 := main_#t~switch352#1 || 1 == main_~tmp___16~0#1; {17909#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:53,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {17909#(= ~last_index~0 0)} assume main_#t~switch352#1; {17909#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:53,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {17909#(= ~last_index~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_init_x25_asy } true;havoc init_x25_asy_#res#1;havoc init_x25_asy_#t~nondet315#1, init_x25_asy_#t~ret316#1.base, init_x25_asy_#t~ret316#1.offset, init_x25_asy_#t~ret317#1, init_x25_asy_~tmp~34#1.base, init_x25_asy_~tmp~34#1.offset, init_x25_asy_~tmp___0~18#1;havoc init_x25_asy_~tmp~34#1.base, init_x25_asy_~tmp~34#1.offset;havoc init_x25_asy_~tmp___0~18#1; {17909#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:53,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {17909#(= ~last_index~0 0)} assume !(~x25_asy_maxdev~0 <= 3); {17909#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:53,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {17909#(= ~last_index~0 0)} havoc init_x25_asy_#t~nondet315#1;assume { :begin_inline_kcalloc } true;kcalloc_#in~n#1, kcalloc_#in~size#1, kcalloc_#in~flags#1 := ~x25_asy_maxdev~0, 8, 208;havoc kcalloc_#res#1.base, kcalloc_#res#1.offset;havoc kcalloc_#t~ret20#1.base, kcalloc_#t~ret20#1.offset, kcalloc_~n#1, kcalloc_~size#1, kcalloc_~flags#1, kcalloc_~tmp~1#1.base, kcalloc_~tmp~1#1.offset;kcalloc_~n#1 := kcalloc_#in~n#1;kcalloc_~size#1 := kcalloc_#in~size#1;kcalloc_~flags#1 := kcalloc_#in~flags#1;havoc kcalloc_~tmp~1#1.base, kcalloc_~tmp~1#1.offset;assume { :begin_inline_kmalloc_array } true;kmalloc_array_#in~n#1, kmalloc_array_#in~size#1, kmalloc_array_#in~flags#1 := kcalloc_~n#1, kcalloc_~size#1, ~bitwiseOr(kcalloc_~flags#1, 32768);havoc kmalloc_array_#res#1.base, kmalloc_array_#res#1.offset;havoc kmalloc_array_#t~ret19#1.base, kmalloc_array_#t~ret19#1.offset, kmalloc_array_~n#1, kmalloc_array_~size#1, kmalloc_array_~flags#1, kmalloc_array_~tmp~0#1.base, kmalloc_array_~tmp~0#1.offset;kmalloc_array_~n#1 := kmalloc_array_#in~n#1;kmalloc_array_~size#1 := kmalloc_array_#in~size#1;kmalloc_array_~flags#1 := kmalloc_array_#in~flags#1;havoc kmalloc_array_~tmp~0#1.base, kmalloc_array_~tmp~0#1.offset; {17909#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:53,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {17909#(= ~last_index~0 0)} assume 0 != kmalloc_array_~size#1 % 18446744073709551616 && 18446744073709551615 / (kmalloc_array_~size#1 % 18446744073709551616) % 18446744073709551616 < kmalloc_array_~n#1 % 18446744073709551616;kmalloc_array_#res#1.base, kmalloc_array_#res#1.offset := 0, 0; {17909#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:53,330 INFO L290 TraceCheckUtils]: 44: Hoare triple {17909#(= ~last_index~0 0)} kcalloc_#t~ret20#1.base, kcalloc_#t~ret20#1.offset := kmalloc_array_#res#1.base, kmalloc_array_#res#1.offset;assume { :end_inline_kmalloc_array } true;kcalloc_~tmp~1#1.base, kcalloc_~tmp~1#1.offset := kcalloc_#t~ret20#1.base, kcalloc_#t~ret20#1.offset;havoc kcalloc_#t~ret20#1.base, kcalloc_#t~ret20#1.offset;kcalloc_#res#1.base, kcalloc_#res#1.offset := kcalloc_~tmp~1#1.base, kcalloc_~tmp~1#1.offset; {17909#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:53,330 INFO L290 TraceCheckUtils]: 45: Hoare triple {17909#(= ~last_index~0 0)} init_x25_asy_#t~ret316#1.base, init_x25_asy_#t~ret316#1.offset := kcalloc_#res#1.base, kcalloc_#res#1.offset;assume { :end_inline_kcalloc } true;init_x25_asy_~tmp~34#1.base, init_x25_asy_~tmp~34#1.offset := init_x25_asy_#t~ret316#1.base, init_x25_asy_#t~ret316#1.offset;havoc init_x25_asy_#t~ret316#1.base, init_x25_asy_#t~ret316#1.offset;~x25_asy_devs~0.base, ~x25_asy_devs~0.offset := init_x25_asy_~tmp~34#1.base, init_x25_asy_~tmp~34#1.offset; {17909#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:53,330 INFO L290 TraceCheckUtils]: 46: Hoare triple {17909#(= ~last_index~0 0)} assume 0 == (~x25_asy_devs~0.base + ~x25_asy_devs~0.offset) % 18446744073709551616;init_x25_asy_#res#1 := -12; {17909#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:53,331 INFO L290 TraceCheckUtils]: 47: Hoare triple {17909#(= ~last_index~0 0)} main_#t~ret353#1 := init_x25_asy_#res#1;assume { :end_inline_init_x25_asy } true;assume -2147483648 <= main_#t~ret353#1 && main_#t~ret353#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret353#1;havoc main_#t~ret353#1; {17909#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:53,331 INFO L290 TraceCheckUtils]: 48: Hoare triple {17909#(= ~last_index~0 0)} assume !(0 == ~ldv_retval_1~0); {17909#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:53,331 INFO L290 TraceCheckUtils]: 49: Hoare triple {17909#(= ~last_index~0 0)} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {17909#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:53,333 INFO L290 TraceCheckUtils]: 50: Hoare triple {17909#(= ~last_index~0 0)} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret383#1, ldv_check_final_state_~tmp___7~7#1;havoc ldv_check_final_state_~tmp___7~7#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); {17967#(<= 1 |ULTIMATE.start_ldv_set_is_empty_#res#1|)} is VALID [2022-02-20 21:53:53,333 INFO L290 TraceCheckUtils]: 51: Hoare triple {17967#(<= 1 |ULTIMATE.start_ldv_set_is_empty_#res#1|)} ldv_check_final_state_#t~ret383#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret383#1 && ldv_check_final_state_#t~ret383#1 <= 2147483647;ldv_check_final_state_~tmp___7~7#1 := ldv_check_final_state_#t~ret383#1;havoc ldv_check_final_state_#t~ret383#1; {17971#(<= 1 |ULTIMATE.start_ldv_check_final_state_~tmp___7~7#1|)} is VALID [2022-02-20 21:53:53,334 INFO L290 TraceCheckUtils]: 52: Hoare triple {17971#(<= 1 |ULTIMATE.start_ldv_check_final_state_~tmp___7~7#1|)} assume !(0 != ldv_check_final_state_~tmp___7~7#1); {17812#false} is VALID [2022-02-20 21:53:53,334 INFO L272 TraceCheckUtils]: 53: Hoare triple {17812#false} call ldv_error(); {17812#false} is VALID [2022-02-20 21:53:53,334 INFO L290 TraceCheckUtils]: 54: Hoare triple {17812#false} assume !false; {17812#false} is VALID [2022-02-20 21:53:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 21:53:53,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:53:53,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:53:53,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028995174] [2022-02-20 21:53:53,335 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 21:53:53,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104304244] [2022-02-20 21:53:53,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104304244] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:53,335 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:53,335 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:53:53,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683462543] [2022-02-20 21:53:53,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:53,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2022-02-20 21:53:53,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:53,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 21:53:53,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:53,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:53:53,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:53:53,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:53:53,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:53:53,375 INFO L87 Difference]: Start difference. First operand 1368 states and 1918 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 21:53:57,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:57,538 INFO L93 Difference]: Finished difference Result 4073 states and 5792 transitions. [2022-02-20 21:53:57,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:53:57,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2022-02-20 21:53:57,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 21:53:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2999 transitions. [2022-02-20 21:53:57,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 21:53:57,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2999 transitions. [2022-02-20 21:53:57,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 2999 transitions. [2022-02-20 21:53:59,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2999 edges. 2999 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:59,966 INFO L225 Difference]: With dead ends: 4073 [2022-02-20 21:53:59,966 INFO L226 Difference]: Without dead ends: 2695 [2022-02-20 21:53:59,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:53:59,971 INFO L933 BasicCegarLoop]: 1229 mSDtfsCounter, 975 mSDsluCounter, 3456 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 4685 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:53:59,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [975 Valid, 4685 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:53:59,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states. [2022-02-20 21:54:00,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2687. [2022-02-20 21:54:00,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:54:00,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2695 states. Second operand has 2687 states, 1975 states have (on average 1.3544303797468353) internal successors, (2675), 2011 states have internal predecessors, (2675), 547 states have call successors, (547), 165 states have call predecessors, (547), 164 states have return successors, (602), 538 states have call predecessors, (602), 546 states have call successors, (602) [2022-02-20 21:54:00,568 INFO L74 IsIncluded]: Start isIncluded. First operand 2695 states. Second operand has 2687 states, 1975 states have (on average 1.3544303797468353) internal successors, (2675), 2011 states have internal predecessors, (2675), 547 states have call successors, (547), 165 states have call predecessors, (547), 164 states have return successors, (602), 538 states have call predecessors, (602), 546 states have call successors, (602) [2022-02-20 21:54:00,571 INFO L87 Difference]: Start difference. First operand 2695 states. Second operand has 2687 states, 1975 states have (on average 1.3544303797468353) internal successors, (2675), 2011 states have internal predecessors, (2675), 547 states have call successors, (547), 165 states have call predecessors, (547), 164 states have return successors, (602), 538 states have call predecessors, (602), 546 states have call successors, (602) [2022-02-20 21:54:00,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:00,762 INFO L93 Difference]: Finished difference Result 2695 states and 3834 transitions. [2022-02-20 21:54:00,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3834 transitions. [2022-02-20 21:54:00,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:00,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:00,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 2687 states, 1975 states have (on average 1.3544303797468353) internal successors, (2675), 2011 states have internal predecessors, (2675), 547 states have call successors, (547), 165 states have call predecessors, (547), 164 states have return successors, (602), 538 states have call predecessors, (602), 546 states have call successors, (602) Second operand 2695 states. [2022-02-20 21:54:00,775 INFO L87 Difference]: Start difference. First operand has 2687 states, 1975 states have (on average 1.3544303797468353) internal successors, (2675), 2011 states have internal predecessors, (2675), 547 states have call successors, (547), 165 states have call predecessors, (547), 164 states have return successors, (602), 538 states have call predecessors, (602), 546 states have call successors, (602) Second operand 2695 states. [2022-02-20 21:54:00,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:00,965 INFO L93 Difference]: Finished difference Result 2695 states and 3834 transitions. [2022-02-20 21:54:00,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3834 transitions. [2022-02-20 21:54:00,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:00,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:00,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:54:00,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:54:00,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2687 states, 1975 states have (on average 1.3544303797468353) internal successors, (2675), 2011 states have internal predecessors, (2675), 547 states have call successors, (547), 165 states have call predecessors, (547), 164 states have return successors, (602), 538 states have call predecessors, (602), 546 states have call successors, (602) [2022-02-20 21:54:01,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 3824 transitions. [2022-02-20 21:54:01,280 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 3824 transitions. Word has length 55 [2022-02-20 21:54:01,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:54:01,280 INFO L470 AbstractCegarLoop]: Abstraction has 2687 states and 3824 transitions. [2022-02-20 21:54:01,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 21:54:01,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 3824 transitions. [2022-02-20 21:54:01,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-02-20 21:54:01,285 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:54:01,285 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2022-02-20 21:54:01,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 21:54:01,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 21:54:01,499 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:54:01,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:54:01,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1631345663, now seen corresponding path program 1 times [2022-02-20 21:54:01,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:54:01,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422613988] [2022-02-20 21:54:01,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:54:01,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:54:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:01,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:54:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:01,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {32875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {32832#true} is VALID [2022-02-20 21:54:01,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {32832#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {32832#true} is VALID [2022-02-20 21:54:01,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {32832#true} assume true; {32832#true} is VALID [2022-02-20 21:54:01,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32832#true} {32832#true} #1799#return; {32832#true} is VALID [2022-02-20 21:54:01,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:54:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:01,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {32875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {32832#true} is VALID [2022-02-20 21:54:01,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {32832#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {32832#true} is VALID [2022-02-20 21:54:01,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {32832#true} assume true; {32832#true} is VALID [2022-02-20 21:54:01,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32832#true} {32832#true} #1801#return; {32832#true} is VALID [2022-02-20 21:54:01,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:54:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:01,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {32875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {32832#true} is VALID [2022-02-20 21:54:01,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {32832#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {32832#true} is VALID [2022-02-20 21:54:01,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {32832#true} assume true; {32832#true} is VALID [2022-02-20 21:54:01,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32832#true} {32832#true} #1803#return; {32832#true} is VALID [2022-02-20 21:54:01,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:54:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:01,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {32875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {32832#true} is VALID [2022-02-20 21:54:01,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {32832#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {32832#true} is VALID [2022-02-20 21:54:01,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {32832#true} assume true; {32832#true} is VALID [2022-02-20 21:54:01,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32832#true} {32832#true} #1805#return; {32832#true} is VALID [2022-02-20 21:54:01,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 21:54:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:01,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {32875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {32832#true} is VALID [2022-02-20 21:54:01,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {32832#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {32832#true} is VALID [2022-02-20 21:54:01,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {32832#true} assume true; {32832#true} is VALID [2022-02-20 21:54:01,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32832#true} {32832#true} #1807#return; {32832#true} is VALID [2022-02-20 21:54:01,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:54:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:01,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:01,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:01,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {32876#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~3;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~3 := 0; {32832#true} is VALID [2022-02-20 21:54:01,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {32832#true} assume !false; {32832#true} is VALID [2022-02-20 21:54:01,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {32832#true} assume !(~i~3 < ~last_index~0); {32832#true} is VALID [2022-02-20 21:54:01,711 INFO L290 TraceCheckUtils]: 3: Hoare triple {32832#true} assume -1 != ~deleted_index~0;~i~3 := 1 + ~deleted_index~0; {32832#true} is VALID [2022-02-20 21:54:01,711 INFO L290 TraceCheckUtils]: 4: Hoare triple {32832#true} assume !false; {32832#true} is VALID [2022-02-20 21:54:01,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {32832#true} assume !(~i~3 < ~last_index~0); {32832#true} is VALID [2022-02-20 21:54:01,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {32832#true} ~last_index~0 := ~last_index~0 - 1; {32832#true} is VALID [2022-02-20 21:54:01,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {32832#true} assume true; {32832#true} is VALID [2022-02-20 21:54:01,711 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {32832#true} {32832#true} #1673#return; {32832#true} is VALID [2022-02-20 21:54:01,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {32876#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {32832#true} is VALID [2022-02-20 21:54:01,713 INFO L272 TraceCheckUtils]: 1: Hoare triple {32832#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {32876#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:01,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {32876#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~3;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~3 := 0; {32832#true} is VALID [2022-02-20 21:54:01,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {32832#true} assume !false; {32832#true} is VALID [2022-02-20 21:54:01,713 INFO L290 TraceCheckUtils]: 4: Hoare triple {32832#true} assume !(~i~3 < ~last_index~0); {32832#true} is VALID [2022-02-20 21:54:01,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {32832#true} assume -1 != ~deleted_index~0;~i~3 := 1 + ~deleted_index~0; {32832#true} is VALID [2022-02-20 21:54:01,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {32832#true} assume !false; {32832#true} is VALID [2022-02-20 21:54:01,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {32832#true} assume !(~i~3 < ~last_index~0); {32832#true} is VALID [2022-02-20 21:54:01,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {32832#true} ~last_index~0 := ~last_index~0 - 1; {32832#true} is VALID [2022-02-20 21:54:01,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {32832#true} assume true; {32832#true} is VALID [2022-02-20 21:54:01,714 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32832#true} {32832#true} #1673#return; {32832#true} is VALID [2022-02-20 21:54:01,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {32832#true} #res := 0; {32832#true} is VALID [2022-02-20 21:54:01,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {32832#true} assume true; {32832#true} is VALID [2022-02-20 21:54:01,714 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {32832#true} {32832#true} #1709#return; {32832#true} is VALID [2022-02-20 21:54:01,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {32876#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;havoc ~tmp~21#1;assume { :begin_inline_ldv_netif_rx_21 } true;ldv_netif_rx_21_#in~ldv_func_arg1#1.base, ldv_netif_rx_21_#in~ldv_func_arg1#1.offset := ~skb#1.base, ~skb#1.offset;havoc ldv_netif_rx_21_#res#1;havoc ldv_netif_rx_21_#t~ret371#1, ldv_netif_rx_21_~ldv_func_arg1#1.base, ldv_netif_rx_21_~ldv_func_arg1#1.offset, ldv_netif_rx_21_~tmp~43#1;ldv_netif_rx_21_~ldv_func_arg1#1.base, ldv_netif_rx_21_~ldv_func_arg1#1.offset := ldv_netif_rx_21_#in~ldv_func_arg1#1.base, ldv_netif_rx_21_#in~ldv_func_arg1#1.offset;havoc ldv_netif_rx_21_~tmp~43#1; {32832#true} is VALID [2022-02-20 21:54:01,715 INFO L272 TraceCheckUtils]: 1: Hoare triple {32832#true} call ldv_netif_rx_21_#t~ret371#1 := ldv_skb_free_int(ldv_netif_rx_21_~ldv_func_arg1#1.base, ldv_netif_rx_21_~ldv_func_arg1#1.offset); {32876#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:01,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {32876#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {32832#true} is VALID [2022-02-20 21:54:01,716 INFO L272 TraceCheckUtils]: 3: Hoare triple {32832#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {32876#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:01,716 INFO L290 TraceCheckUtils]: 4: Hoare triple {32876#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~3;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~3 := 0; {32832#true} is VALID [2022-02-20 21:54:01,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {32832#true} assume !false; {32832#true} is VALID [2022-02-20 21:54:01,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {32832#true} assume !(~i~3 < ~last_index~0); {32832#true} is VALID [2022-02-20 21:54:01,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {32832#true} assume -1 != ~deleted_index~0;~i~3 := 1 + ~deleted_index~0; {32832#true} is VALID [2022-02-20 21:54:01,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {32832#true} assume !false; {32832#true} is VALID [2022-02-20 21:54:01,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {32832#true} assume !(~i~3 < ~last_index~0); {32832#true} is VALID [2022-02-20 21:54:01,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {32832#true} ~last_index~0 := ~last_index~0 - 1; {32832#true} is VALID [2022-02-20 21:54:01,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {32832#true} assume true; {32832#true} is VALID [2022-02-20 21:54:01,717 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {32832#true} {32832#true} #1673#return; {32832#true} is VALID [2022-02-20 21:54:01,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {32832#true} #res := 0; {32832#true} is VALID [2022-02-20 21:54:01,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {32832#true} assume true; {32832#true} is VALID [2022-02-20 21:54:01,718 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32832#true} {32832#true} #1709#return; {32832#true} is VALID [2022-02-20 21:54:01,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {32832#true} assume -2147483648 <= ldv_netif_rx_21_#t~ret371#1 && ldv_netif_rx_21_#t~ret371#1 <= 2147483647;ldv_netif_rx_21_~tmp~43#1 := ldv_netif_rx_21_#t~ret371#1;havoc ldv_netif_rx_21_#t~ret371#1;ldv_netif_rx_21_#res#1 := ldv_netif_rx_21_~tmp~43#1; {32832#true} is VALID [2022-02-20 21:54:01,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {32832#true} #t~ret214#1 := ldv_netif_rx_21_#res#1;assume { :end_inline_ldv_netif_rx_21 } true;assume -2147483648 <= #t~ret214#1 && #t~ret214#1 <= 2147483647;~tmp~21#1 := #t~ret214#1;havoc #t~ret214#1;#res#1 := ~tmp~21#1; {32832#true} is VALID [2022-02-20 21:54:01,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {32832#true} assume true; {32832#true} is VALID [2022-02-20 21:54:01,718 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {32832#true} {32833#false} #1927#return; {32833#false} is VALID [2022-02-20 21:54:01,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {32832#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(100, 2);call #Ultimate.allocInit(26, 3);call #Ultimate.allocInit(72, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(43, 6);call #Ultimate.allocInit(14, 7);call #Ultimate.allocInit(36, 8);call #Ultimate.allocInit(33, 9);call #Ultimate.allocInit(34, 10);call #Ultimate.allocInit(44, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(17, 13);call #Ultimate.allocInit(13, 14);call #Ultimate.allocInit(30, 15);call #Ultimate.allocInit(32, 16);call #Ultimate.allocInit(35, 17);call #Ultimate.allocInit(29, 18);call #Ultimate.allocInit(12, 19);call #Ultimate.allocInit(15, 20);call #Ultimate.allocInit(15, 21);call #Ultimate.allocInit(52, 22);call #Ultimate.allocInit(20, 23);call #Ultimate.allocInit(5, 24);call write~init~int(88, 24, 0, 1);call write~init~int(46, 24, 1, 1);call write~init~int(50, 24, 2, 1);call write~init~int(53, 24, 3, 1);call write~init~int(0, 24, 4, 1);call #Ultimate.allocInit(69, 25);~ldv_state_variable_3~0 := 0;~x25_ldisc_group1~0.base, ~x25_ldisc_group1~0.offset := 0, 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~x25_asy_netdev_ops_group1~0.base, ~x25_asy_netdev_ops_group1~0.offset := 0, 0;~x25_asy_callbacks_group0~0.base, ~x25_asy_callbacks_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~x25_asy_callbacks_group1~0.base, ~x25_asy_callbacks_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~x25_asy_devs~0.base, ~x25_asy_devs~0.offset := 0, 0;~x25_asy_maxdev~0 := 256;~#x25_asy_callbacks~0.base, ~#x25_asy_callbacks~0.offset := 26, 0;call #Ultimate.allocInit(48, 26);call write~init~$Pointer$(#funAddr~x25_asy_connected.base, #funAddr~x25_asy_connected.offset, ~#x25_asy_callbacks~0.base, ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_connected.base, #funAddr~x25_asy_connected.offset, ~#x25_asy_callbacks~0.base, 8 + ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_disconnected.base, #funAddr~x25_asy_disconnected.offset, ~#x25_asy_callbacks~0.base, 16 + ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_disconnected.base, #funAddr~x25_asy_disconnected.offset, ~#x25_asy_callbacks~0.base, 24 + ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_data_indication.base, #funAddr~x25_asy_data_indication.offset, ~#x25_asy_callbacks~0.base, 32 + ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_data_transmit.base, #funAddr~x25_asy_data_transmit.offset, ~#x25_asy_callbacks~0.base, 40 + ~#x25_asy_callbacks~0.offset, 8);~#x25_asy_netdev_ops~0.base, ~#x25_asy_netdev_ops~0.offset := 27, 0;call #Ultimate.allocInit(480, 27);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 8 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_open_dev.base, #funAddr~x25_asy_open_dev.offset, ~#x25_asy_netdev_ops~0.base, 16 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_close.base, #funAddr~x25_asy_close.offset, ~#x25_asy_netdev_ops~0.base, 24 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_xmit.base, #funAddr~x25_asy_xmit.offset, ~#x25_asy_netdev_ops~0.base, 32 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 40 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 48 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 56 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 64 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 72 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 80 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 88 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_change_mtu.base, #funAddr~x25_asy_change_mtu.offset, ~#x25_asy_netdev_ops~0.base, 96 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 104 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_timeout.base, #funAddr~x25_asy_timeout.offset, ~#x25_asy_netdev_ops~0.base, 112 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 120 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 128 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 136 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 144 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 152 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 160 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 168 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 176 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 184 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 192 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 200 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 208 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 216 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 224 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 232 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 240 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 248 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 256 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 264 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 272 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 280 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 288 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 296 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 304 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 312 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 320 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 328 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 336 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 344 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 352 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 360 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 368 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 376 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 384 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 392 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 400 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 408 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 416 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 424 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 432 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 440 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 448 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 456 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 464 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 472 + ~#x25_asy_netdev_ops~0.offset, 8);~#x25_ldisc~0.base, ~#x25_ldisc~0.offset := 28, 0;call #Ultimate.allocInit(160, 28);call write~init~int(21507, ~#x25_ldisc~0.base, ~#x25_ldisc~0.offset, 4);call write~init~$Pointer$(24, 0, ~#x25_ldisc~0.base, 4 + ~#x25_ldisc~0.offset, 8);call write~init~int(0, ~#x25_ldisc~0.base, 12 + ~#x25_ldisc~0.offset, 4);call write~init~int(0, ~#x25_ldisc~0.base, 16 + ~#x25_ldisc~0.offset, 4);call write~init~$Pointer$(#funAddr~x25_asy_open_tty.base, #funAddr~x25_asy_open_tty.offset, ~#x25_ldisc~0.base, 20 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_close_tty.base, #funAddr~x25_asy_close_tty.offset, ~#x25_ldisc~0.base, 28 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 36 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 44 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 52 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 60 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_ioctl.base, #funAddr~x25_asy_ioctl.offset, ~#x25_ldisc~0.base, 68 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_compat_ioctl.base, #funAddr~x25_asy_compat_ioctl.offset, ~#x25_ldisc~0.base, 76 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 84 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 92 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 100 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_receive_buf.base, #funAddr~x25_asy_receive_buf.offset, ~#x25_ldisc~0.base, 108 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_write_wakeup.base, #funAddr~x25_asy_write_wakeup.offset, ~#x25_ldisc~0.base, 116 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 124 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 132 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 140 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#x25_ldisc~0.base, 148 + ~#x25_ldisc~0.offset, 8);call write~init~int(0, ~#x25_ldisc~0.base, 156 + ~#x25_ldisc~0.offset, 4);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 29, 0;call #Ultimate.allocInit(120, 29);#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; {32832#true} is VALID [2022-02-20 21:54:01,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {32832#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset, main_#t~nondet328#1, main_#t~nondet329#1, main_#t~ret330#1.base, main_#t~ret330#1.offset, main_#t~nondet331#1, main_#t~ret332#1.base, main_#t~ret332#1.offset, main_#t~nondet333#1, main_#t~nondet334#1, main_#t~ret335#1.base, main_#t~ret335#1.offset, main_#t~nondet336#1, main_#t~nondet337#1, main_#t~nondet338#1, main_#t~nondet339#1, main_#t~nondet340#1, main_#t~ret341#1.base, main_#t~ret341#1.offset, main_#t~nondet342#1, main_#t~switch343#1, main_#t~nondet344#1, main_#t~switch345#1, main_#t~ret346#1, main_#t~ret347#1, main_#t~ret348#1, main_#t~ret349#1, main_#t~ret350#1, main_#t~nondet351#1, main_#t~switch352#1, main_#t~ret353#1, main_#t~nondet354#1, main_#t~switch355#1, main_#t~ret356#1, main_#t~ret357#1, main_#t~ret358#1, main_#t~nondet359#1, main_#t~switch360#1, main_#t~ret361#1, main_#t~ret362#1, main_#t~ret363#1, main_#t~ret364#1, main_#t~ret365#1, main_#t~ret366#1, main_#t~ret367#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp~39#1.base, main_~tmp~39#1.offset, main_~ldvarg3~0#1, main_~tmp___0~20#1, main_~ldvarg0~0#1, main_~tmp___1~10#1, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset, main_~ldvarg6~0#1, main_~tmp___3~2#1, main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset, main_~tmp___4~2#1.base, main_~tmp___4~2#1.offset, main_~ldvarg1~0#1, main_~tmp___5~1#1, main_~ldvarg4~0#1, main_~tmp___6~1#1, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___7~1#1.base, main_~tmp___7~1#1.offset, main_~ldvarg11~0#1, main_~tmp___8~0#1, main_~ldvarg10~0#1, main_~tmp___9~0#1, main_~ldvarg12~0#1, main_~tmp___10~0#1, main_~ldvarg9~0#1, main_~tmp___11~0#1, main_~ldvarg14~0#1, main_~tmp___12~0#1, main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset, main_~tmp___13~0#1.base, main_~tmp___13~0#1.offset, main_~tmp___14~0#1, main_~tmp___15~0#1, main_~tmp___16~0#1, main_~tmp___17~0#1, main_~tmp___18~0#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp~39#1.base, main_~tmp~39#1.offset;havoc main_~ldvarg3~0#1;havoc main_~tmp___0~20#1;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~10#1;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~2#1;havoc main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset;havoc main_~tmp___4~2#1.base, main_~tmp___4~2#1.offset;havoc main_~ldvarg1~0#1;havoc main_~tmp___5~1#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___6~1#1;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___7~1#1.base, main_~tmp___7~1#1.offset;havoc main_~ldvarg11~0#1;havoc main_~tmp___8~0#1;havoc main_~ldvarg10~0#1;havoc main_~tmp___9~0#1;havoc main_~ldvarg12~0#1;havoc main_~tmp___10~0#1;havoc main_~ldvarg9~0#1;havoc main_~tmp___11~0#1;havoc main_~ldvarg14~0#1;havoc main_~tmp___12~0#1;havoc main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset;havoc main_~tmp___13~0#1.base, main_~tmp___13~0#1.offset;havoc main_~tmp___14~0#1;havoc main_~tmp___15~0#1;havoc main_~tmp___16~0#1;havoc main_~tmp___17~0#1;havoc main_~tmp___18~0#1; {32832#true} is VALID [2022-02-20 21:54:01,723 INFO L272 TraceCheckUtils]: 2: Hoare triple {32832#true} call main_#t~ret327#1.base, main_#t~ret327#1.offset := ldv_zalloc(1); {32875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:01,724 INFO L290 TraceCheckUtils]: 3: Hoare triple {32875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {32832#true} is VALID [2022-02-20 21:54:01,724 INFO L290 TraceCheckUtils]: 4: Hoare triple {32832#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {32832#true} is VALID [2022-02-20 21:54:01,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {32832#true} assume true; {32832#true} is VALID [2022-02-20 21:54:01,724 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {32832#true} {32832#true} #1799#return; {32832#true} is VALID [2022-02-20 21:54:01,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {32832#true} main_~tmp~39#1.base, main_~tmp~39#1.offset := main_#t~ret327#1.base, main_#t~ret327#1.offset;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp~39#1.base, main_~tmp~39#1.offset;main_~tmp___0~20#1 := main_#t~nondet328#1;havoc main_#t~nondet328#1;main_~ldvarg3~0#1 := main_~tmp___0~20#1;main_~tmp___1~10#1 := main_#t~nondet329#1;havoc main_#t~nondet329#1;main_~ldvarg0~0#1 := main_~tmp___1~10#1; {32832#true} is VALID [2022-02-20 21:54:01,725 INFO L272 TraceCheckUtils]: 8: Hoare triple {32832#true} call main_#t~ret330#1.base, main_#t~ret330#1.offset := ldv_zalloc(512); {32875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:01,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {32875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {32832#true} is VALID [2022-02-20 21:54:01,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {32832#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {32832#true} is VALID [2022-02-20 21:54:01,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {32832#true} assume true; {32832#true} is VALID [2022-02-20 21:54:01,725 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {32832#true} {32832#true} #1801#return; {32832#true} is VALID [2022-02-20 21:54:01,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {32832#true} main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset := main_#t~ret330#1.base, main_#t~ret330#1.offset;havoc main_#t~ret330#1.base, main_#t~ret330#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset;assume -2147483648 <= main_#t~nondet331#1 && main_#t~nondet331#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet331#1;havoc main_#t~nondet331#1;main_~ldvarg6~0#1 := main_~tmp___3~2#1; {32832#true} is VALID [2022-02-20 21:54:01,726 INFO L272 TraceCheckUtils]: 14: Hoare triple {32832#true} call main_#t~ret332#1.base, main_#t~ret332#1.offset := ldv_zalloc(1); {32875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:01,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {32875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {32832#true} is VALID [2022-02-20 21:54:01,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {32832#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {32832#true} is VALID [2022-02-20 21:54:01,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {32832#true} assume true; {32832#true} is VALID [2022-02-20 21:54:01,726 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {32832#true} {32832#true} #1803#return; {32832#true} is VALID [2022-02-20 21:54:01,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {32832#true} main_~tmp___4~2#1.base, main_~tmp___4~2#1.offset := main_#t~ret332#1.base, main_#t~ret332#1.offset;havoc main_#t~ret332#1.base, main_#t~ret332#1.offset;main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset := main_~tmp___4~2#1.base, main_~tmp___4~2#1.offset;main_~tmp___5~1#1 := main_#t~nondet333#1;havoc main_#t~nondet333#1;main_~ldvarg1~0#1 := main_~tmp___5~1#1;main_~tmp___6~1#1 := main_#t~nondet334#1;havoc main_#t~nondet334#1;main_~ldvarg4~0#1 := main_~tmp___6~1#1; {32832#true} is VALID [2022-02-20 21:54:01,727 INFO L272 TraceCheckUtils]: 20: Hoare triple {32832#true} call main_#t~ret335#1.base, main_#t~ret335#1.offset := ldv_zalloc(512); {32875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:01,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {32875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {32832#true} is VALID [2022-02-20 21:54:01,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {32832#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {32832#true} is VALID [2022-02-20 21:54:01,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {32832#true} assume true; {32832#true} is VALID [2022-02-20 21:54:01,727 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {32832#true} {32832#true} #1805#return; {32832#true} is VALID [2022-02-20 21:54:01,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {32832#true} main_~tmp___7~1#1.base, main_~tmp___7~1#1.offset := main_#t~ret335#1.base, main_#t~ret335#1.offset;havoc main_#t~ret335#1.base, main_#t~ret335#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___7~1#1.base, main_~tmp___7~1#1.offset;assume -2147483648 <= main_#t~nondet336#1 && main_#t~nondet336#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet336#1;havoc main_#t~nondet336#1;main_~ldvarg11~0#1 := main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet337#1 && main_#t~nondet337#1 <= 2147483647;main_~tmp___9~0#1 := main_#t~nondet337#1;havoc main_#t~nondet337#1;main_~ldvarg10~0#1 := main_~tmp___9~0#1;assume -2147483648 <= main_#t~nondet338#1 && main_#t~nondet338#1 <= 2147483647;main_~tmp___10~0#1 := main_#t~nondet338#1;havoc main_#t~nondet338#1;main_~ldvarg12~0#1 := main_~tmp___10~0#1;assume -2147483648 <= main_#t~nondet339#1 && main_#t~nondet339#1 <= 2147483647;main_~tmp___11~0#1 := main_#t~nondet339#1;havoc main_#t~nondet339#1;main_~ldvarg9~0#1 := main_~tmp___11~0#1;assume -2147483648 <= main_#t~nondet340#1 && main_#t~nondet340#1 <= 2147483647;main_~tmp___12~0#1 := main_#t~nondet340#1;havoc main_#t~nondet340#1;main_~ldvarg14~0#1 := main_~tmp___12~0#1; {32832#true} is VALID [2022-02-20 21:54:01,728 INFO L272 TraceCheckUtils]: 26: Hoare triple {32832#true} call main_#t~ret341#1.base, main_#t~ret341#1.offset := ldv_zalloc(232); {32875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:01,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {32875#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {32832#true} is VALID [2022-02-20 21:54:01,728 INFO L290 TraceCheckUtils]: 28: Hoare triple {32832#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {32832#true} is VALID [2022-02-20 21:54:01,728 INFO L290 TraceCheckUtils]: 29: Hoare triple {32832#true} assume true; {32832#true} is VALID [2022-02-20 21:54:01,728 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {32832#true} {32832#true} #1807#return; {32832#true} is VALID [2022-02-20 21:54:01,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {32832#true} main_~tmp___13~0#1.base, main_~tmp___13~0#1.offset := main_#t~ret341#1.base, main_#t~ret341#1.offset;havoc main_#t~ret341#1.base, main_#t~ret341#1.offset;main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset := main_~tmp___13~0#1.base, main_~tmp___13~0#1.offset;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; {32832#true} is VALID [2022-02-20 21:54:01,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {32832#true} assume { :end_inline_ldv_set_init } true; {32832#true} is VALID [2022-02-20 21:54:01,729 INFO L290 TraceCheckUtils]: 33: Hoare triple {32832#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {32854#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 21:54:01,729 INFO L290 TraceCheckUtils]: 34: Hoare triple {32854#(= ~ldv_state_variable_3~0 0)} assume -2147483648 <= main_#t~nondet342#1 && main_#t~nondet342#1 <= 2147483647;main_~tmp___14~0#1 := main_#t~nondet342#1;havoc main_#t~nondet342#1;main_#t~switch343#1 := 0 == main_~tmp___14~0#1; {32854#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 21:54:01,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {32854#(= ~ldv_state_variable_3~0 0)} assume !main_#t~switch343#1;main_#t~switch343#1 := main_#t~switch343#1 || 1 == main_~tmp___14~0#1; {32854#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 21:54:01,730 INFO L290 TraceCheckUtils]: 36: Hoare triple {32854#(= ~ldv_state_variable_3~0 0)} assume !main_#t~switch343#1;main_#t~switch343#1 := main_#t~switch343#1 || 2 == main_~tmp___14~0#1; {32854#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 21:54:01,730 INFO L290 TraceCheckUtils]: 37: Hoare triple {32854#(= ~ldv_state_variable_3~0 0)} assume main_#t~switch343#1; {32854#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 21:54:01,730 INFO L290 TraceCheckUtils]: 38: Hoare triple {32854#(= ~ldv_state_variable_3~0 0)} assume 0 != ~ldv_state_variable_3~0;assume -2147483648 <= main_#t~nondet354#1 && main_#t~nondet354#1 <= 2147483647;main_~tmp___17~0#1 := main_#t~nondet354#1;havoc main_#t~nondet354#1;main_#t~switch355#1 := 0 == main_~tmp___17~0#1; {32833#false} is VALID [2022-02-20 21:54:01,730 INFO L290 TraceCheckUtils]: 39: Hoare triple {32833#false} assume !main_#t~switch355#1;main_#t~switch355#1 := main_#t~switch355#1 || 1 == main_~tmp___17~0#1; {32833#false} is VALID [2022-02-20 21:54:01,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {32833#false} assume !main_#t~switch355#1;main_#t~switch355#1 := main_#t~switch355#1 || 2 == main_~tmp___17~0#1; {32833#false} is VALID [2022-02-20 21:54:01,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {32833#false} assume !main_#t~switch355#1;main_#t~switch355#1 := main_#t~switch355#1 || 3 == main_~tmp___17~0#1; {32833#false} is VALID [2022-02-20 21:54:01,731 INFO L290 TraceCheckUtils]: 42: Hoare triple {32833#false} assume !main_#t~switch355#1;main_#t~switch355#1 := main_#t~switch355#1 || 4 == main_~tmp___17~0#1; {32833#false} is VALID [2022-02-20 21:54:01,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {32833#false} assume main_#t~switch355#1; {32833#false} is VALID [2022-02-20 21:54:01,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {32833#false} assume !(1 == ~ldv_state_variable_3~0); {32833#false} is VALID [2022-02-20 21:54:01,731 INFO L290 TraceCheckUtils]: 45: Hoare triple {32833#false} assume 2 == ~ldv_state_variable_3~0; {32833#false} is VALID [2022-02-20 21:54:01,731 INFO L272 TraceCheckUtils]: 46: Hoare triple {32833#false} call main_#t~ret357#1 := x25_asy_data_indication(~x25_asy_callbacks_group1~0.base, ~x25_asy_callbacks_group1~0.offset, ~x25_asy_callbacks_group0~0.base, ~x25_asy_callbacks_group0~0.offset); {32876#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:01,731 INFO L290 TraceCheckUtils]: 47: Hoare triple {32876#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;havoc ~tmp~21#1;assume { :begin_inline_ldv_netif_rx_21 } true;ldv_netif_rx_21_#in~ldv_func_arg1#1.base, ldv_netif_rx_21_#in~ldv_func_arg1#1.offset := ~skb#1.base, ~skb#1.offset;havoc ldv_netif_rx_21_#res#1;havoc ldv_netif_rx_21_#t~ret371#1, ldv_netif_rx_21_~ldv_func_arg1#1.base, ldv_netif_rx_21_~ldv_func_arg1#1.offset, ldv_netif_rx_21_~tmp~43#1;ldv_netif_rx_21_~ldv_func_arg1#1.base, ldv_netif_rx_21_~ldv_func_arg1#1.offset := ldv_netif_rx_21_#in~ldv_func_arg1#1.base, ldv_netif_rx_21_#in~ldv_func_arg1#1.offset;havoc ldv_netif_rx_21_~tmp~43#1; {32832#true} is VALID [2022-02-20 21:54:01,732 INFO L272 TraceCheckUtils]: 48: Hoare triple {32832#true} call ldv_netif_rx_21_#t~ret371#1 := ldv_skb_free_int(ldv_netif_rx_21_~ldv_func_arg1#1.base, ldv_netif_rx_21_~ldv_func_arg1#1.offset); {32876#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:01,732 INFO L290 TraceCheckUtils]: 49: Hoare triple {32876#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {32832#true} is VALID [2022-02-20 21:54:01,732 INFO L272 TraceCheckUtils]: 50: Hoare triple {32832#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {32876#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:01,733 INFO L290 TraceCheckUtils]: 51: Hoare triple {32876#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~3;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~3 := 0; {32832#true} is VALID [2022-02-20 21:54:01,733 INFO L290 TraceCheckUtils]: 52: Hoare triple {32832#true} assume !false; {32832#true} is VALID [2022-02-20 21:54:01,733 INFO L290 TraceCheckUtils]: 53: Hoare triple {32832#true} assume !(~i~3 < ~last_index~0); {32832#true} is VALID [2022-02-20 21:54:01,733 INFO L290 TraceCheckUtils]: 54: Hoare triple {32832#true} assume -1 != ~deleted_index~0;~i~3 := 1 + ~deleted_index~0; {32832#true} is VALID [2022-02-20 21:54:01,733 INFO L290 TraceCheckUtils]: 55: Hoare triple {32832#true} assume !false; {32832#true} is VALID [2022-02-20 21:54:01,733 INFO L290 TraceCheckUtils]: 56: Hoare triple {32832#true} assume !(~i~3 < ~last_index~0); {32832#true} is VALID [2022-02-20 21:54:01,733 INFO L290 TraceCheckUtils]: 57: Hoare triple {32832#true} ~last_index~0 := ~last_index~0 - 1; {32832#true} is VALID [2022-02-20 21:54:01,733 INFO L290 TraceCheckUtils]: 58: Hoare triple {32832#true} assume true; {32832#true} is VALID [2022-02-20 21:54:01,734 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32832#true} {32832#true} #1673#return; {32832#true} is VALID [2022-02-20 21:54:01,734 INFO L290 TraceCheckUtils]: 60: Hoare triple {32832#true} #res := 0; {32832#true} is VALID [2022-02-20 21:54:01,734 INFO L290 TraceCheckUtils]: 61: Hoare triple {32832#true} assume true; {32832#true} is VALID [2022-02-20 21:54:01,734 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {32832#true} {32832#true} #1709#return; {32832#true} is VALID [2022-02-20 21:54:01,734 INFO L290 TraceCheckUtils]: 63: Hoare triple {32832#true} assume -2147483648 <= ldv_netif_rx_21_#t~ret371#1 && ldv_netif_rx_21_#t~ret371#1 <= 2147483647;ldv_netif_rx_21_~tmp~43#1 := ldv_netif_rx_21_#t~ret371#1;havoc ldv_netif_rx_21_#t~ret371#1;ldv_netif_rx_21_#res#1 := ldv_netif_rx_21_~tmp~43#1; {32832#true} is VALID [2022-02-20 21:54:01,734 INFO L290 TraceCheckUtils]: 64: Hoare triple {32832#true} #t~ret214#1 := ldv_netif_rx_21_#res#1;assume { :end_inline_ldv_netif_rx_21 } true;assume -2147483648 <= #t~ret214#1 && #t~ret214#1 <= 2147483647;~tmp~21#1 := #t~ret214#1;havoc #t~ret214#1;#res#1 := ~tmp~21#1; {32832#true} is VALID [2022-02-20 21:54:01,734 INFO L290 TraceCheckUtils]: 65: Hoare triple {32832#true} assume true; {32832#true} is VALID [2022-02-20 21:54:01,734 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {32832#true} {32833#false} #1927#return; {32833#false} is VALID [2022-02-20 21:54:01,735 INFO L290 TraceCheckUtils]: 67: Hoare triple {32833#false} assume -2147483648 <= main_#t~ret357#1 && main_#t~ret357#1 <= 2147483647;havoc main_#t~ret357#1;~ldv_state_variable_3~0 := 2; {32833#false} is VALID [2022-02-20 21:54:01,735 INFO L290 TraceCheckUtils]: 68: Hoare triple {32833#false} assume -2147483648 <= main_#t~nondet342#1 && main_#t~nondet342#1 <= 2147483647;main_~tmp___14~0#1 := main_#t~nondet342#1;havoc main_#t~nondet342#1;main_#t~switch343#1 := 0 == main_~tmp___14~0#1; {32833#false} is VALID [2022-02-20 21:54:01,736 INFO L290 TraceCheckUtils]: 69: Hoare triple {32833#false} assume !main_#t~switch343#1;main_#t~switch343#1 := main_#t~switch343#1 || 1 == main_~tmp___14~0#1; {32833#false} is VALID [2022-02-20 21:54:01,736 INFO L290 TraceCheckUtils]: 70: Hoare triple {32833#false} assume main_#t~switch343#1; {32833#false} is VALID [2022-02-20 21:54:01,737 INFO L290 TraceCheckUtils]: 71: Hoare triple {32833#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet351#1 && main_#t~nondet351#1 <= 2147483647;main_~tmp___16~0#1 := main_#t~nondet351#1;havoc main_#t~nondet351#1;main_#t~switch352#1 := 0 == main_~tmp___16~0#1; {32833#false} is VALID [2022-02-20 21:54:01,737 INFO L290 TraceCheckUtils]: 72: Hoare triple {32833#false} assume !main_#t~switch352#1;main_#t~switch352#1 := main_#t~switch352#1 || 1 == main_~tmp___16~0#1; {32833#false} is VALID [2022-02-20 21:54:01,737 INFO L290 TraceCheckUtils]: 73: Hoare triple {32833#false} assume main_#t~switch352#1; {32833#false} is VALID [2022-02-20 21:54:01,737 INFO L290 TraceCheckUtils]: 74: Hoare triple {32833#false} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_init_x25_asy } true;havoc init_x25_asy_#res#1;havoc init_x25_asy_#t~nondet315#1, init_x25_asy_#t~ret316#1.base, init_x25_asy_#t~ret316#1.offset, init_x25_asy_#t~ret317#1, init_x25_asy_~tmp~34#1.base, init_x25_asy_~tmp~34#1.offset, init_x25_asy_~tmp___0~18#1;havoc init_x25_asy_~tmp~34#1.base, init_x25_asy_~tmp~34#1.offset;havoc init_x25_asy_~tmp___0~18#1; {32833#false} is VALID [2022-02-20 21:54:01,737 INFO L290 TraceCheckUtils]: 75: Hoare triple {32833#false} assume !(~x25_asy_maxdev~0 <= 3); {32833#false} is VALID [2022-02-20 21:54:01,737 INFO L290 TraceCheckUtils]: 76: Hoare triple {32833#false} havoc init_x25_asy_#t~nondet315#1;assume { :begin_inline_kcalloc } true;kcalloc_#in~n#1, kcalloc_#in~size#1, kcalloc_#in~flags#1 := ~x25_asy_maxdev~0, 8, 208;havoc kcalloc_#res#1.base, kcalloc_#res#1.offset;havoc kcalloc_#t~ret20#1.base, kcalloc_#t~ret20#1.offset, kcalloc_~n#1, kcalloc_~size#1, kcalloc_~flags#1, kcalloc_~tmp~1#1.base, kcalloc_~tmp~1#1.offset;kcalloc_~n#1 := kcalloc_#in~n#1;kcalloc_~size#1 := kcalloc_#in~size#1;kcalloc_~flags#1 := kcalloc_#in~flags#1;havoc kcalloc_~tmp~1#1.base, kcalloc_~tmp~1#1.offset;assume { :begin_inline_kmalloc_array } true;kmalloc_array_#in~n#1, kmalloc_array_#in~size#1, kmalloc_array_#in~flags#1 := kcalloc_~n#1, kcalloc_~size#1, ~bitwiseOr(kcalloc_~flags#1, 32768);havoc kmalloc_array_#res#1.base, kmalloc_array_#res#1.offset;havoc kmalloc_array_#t~ret19#1.base, kmalloc_array_#t~ret19#1.offset, kmalloc_array_~n#1, kmalloc_array_~size#1, kmalloc_array_~flags#1, kmalloc_array_~tmp~0#1.base, kmalloc_array_~tmp~0#1.offset;kmalloc_array_~n#1 := kmalloc_array_#in~n#1;kmalloc_array_~size#1 := kmalloc_array_#in~size#1;kmalloc_array_~flags#1 := kmalloc_array_#in~flags#1;havoc kmalloc_array_~tmp~0#1.base, kmalloc_array_~tmp~0#1.offset; {32833#false} is VALID [2022-02-20 21:54:01,737 INFO L290 TraceCheckUtils]: 77: Hoare triple {32833#false} assume 0 != kmalloc_array_~size#1 % 18446744073709551616 && 18446744073709551615 / (kmalloc_array_~size#1 % 18446744073709551616) % 18446744073709551616 < kmalloc_array_~n#1 % 18446744073709551616;kmalloc_array_#res#1.base, kmalloc_array_#res#1.offset := 0, 0; {32833#false} is VALID [2022-02-20 21:54:01,737 INFO L290 TraceCheckUtils]: 78: Hoare triple {32833#false} kcalloc_#t~ret20#1.base, kcalloc_#t~ret20#1.offset := kmalloc_array_#res#1.base, kmalloc_array_#res#1.offset;assume { :end_inline_kmalloc_array } true;kcalloc_~tmp~1#1.base, kcalloc_~tmp~1#1.offset := kcalloc_#t~ret20#1.base, kcalloc_#t~ret20#1.offset;havoc kcalloc_#t~ret20#1.base, kcalloc_#t~ret20#1.offset;kcalloc_#res#1.base, kcalloc_#res#1.offset := kcalloc_~tmp~1#1.base, kcalloc_~tmp~1#1.offset; {32833#false} is VALID [2022-02-20 21:54:01,738 INFO L290 TraceCheckUtils]: 79: Hoare triple {32833#false} init_x25_asy_#t~ret316#1.base, init_x25_asy_#t~ret316#1.offset := kcalloc_#res#1.base, kcalloc_#res#1.offset;assume { :end_inline_kcalloc } true;init_x25_asy_~tmp~34#1.base, init_x25_asy_~tmp~34#1.offset := init_x25_asy_#t~ret316#1.base, init_x25_asy_#t~ret316#1.offset;havoc init_x25_asy_#t~ret316#1.base, init_x25_asy_#t~ret316#1.offset;~x25_asy_devs~0.base, ~x25_asy_devs~0.offset := init_x25_asy_~tmp~34#1.base, init_x25_asy_~tmp~34#1.offset; {32833#false} is VALID [2022-02-20 21:54:01,738 INFO L290 TraceCheckUtils]: 80: Hoare triple {32833#false} assume 0 == (~x25_asy_devs~0.base + ~x25_asy_devs~0.offset) % 18446744073709551616;init_x25_asy_#res#1 := -12; {32833#false} is VALID [2022-02-20 21:54:01,738 INFO L290 TraceCheckUtils]: 81: Hoare triple {32833#false} main_#t~ret353#1 := init_x25_asy_#res#1;assume { :end_inline_init_x25_asy } true;assume -2147483648 <= main_#t~ret353#1 && main_#t~ret353#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret353#1;havoc main_#t~ret353#1; {32833#false} is VALID [2022-02-20 21:54:01,738 INFO L290 TraceCheckUtils]: 82: Hoare triple {32833#false} assume !(0 == ~ldv_retval_1~0); {32833#false} is VALID [2022-02-20 21:54:01,738 INFO L290 TraceCheckUtils]: 83: Hoare triple {32833#false} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {32833#false} is VALID [2022-02-20 21:54:01,739 INFO L290 TraceCheckUtils]: 84: Hoare triple {32833#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret383#1, ldv_check_final_state_~tmp___7~7#1;havoc ldv_check_final_state_~tmp___7~7#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); {32833#false} is VALID [2022-02-20 21:54:01,739 INFO L290 TraceCheckUtils]: 85: Hoare triple {32833#false} ldv_check_final_state_#t~ret383#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret383#1 && ldv_check_final_state_#t~ret383#1 <= 2147483647;ldv_check_final_state_~tmp___7~7#1 := ldv_check_final_state_#t~ret383#1;havoc ldv_check_final_state_#t~ret383#1; {32833#false} is VALID [2022-02-20 21:54:01,739 INFO L290 TraceCheckUtils]: 86: Hoare triple {32833#false} assume !(0 != ldv_check_final_state_~tmp___7~7#1); {32833#false} is VALID [2022-02-20 21:54:01,739 INFO L272 TraceCheckUtils]: 87: Hoare triple {32833#false} call ldv_error(); {32833#false} is VALID [2022-02-20 21:54:01,739 INFO L290 TraceCheckUtils]: 88: Hoare triple {32833#false} assume !false; {32833#false} is VALID [2022-02-20 21:54:01,740 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 21:54:01,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:54:01,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422613988] [2022-02-20 21:54:01,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422613988] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:54:01,742 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:54:01,742 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:54:01,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386238406] [2022-02-20 21:54:01,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:54:01,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 89 [2022-02-20 21:54:01,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:54:01,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 21:54:01,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:01,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:54:01,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:54:01,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:54:01,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:54:01,797 INFO L87 Difference]: Start difference. First operand 2687 states and 3824 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 21:54:11,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:11,464 INFO L93 Difference]: Finished difference Result 8119 states and 11688 transitions. [2022-02-20 21:54:11,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 21:54:11,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 89 [2022-02-20 21:54:11,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:54:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 21:54:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3066 transitions. [2022-02-20 21:54:11,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 21:54:11,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3066 transitions. [2022-02-20 21:54:11,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 3066 transitions. [2022-02-20 21:54:13,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3066 edges. 3066 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:15,063 INFO L225 Difference]: With dead ends: 8119 [2022-02-20 21:54:15,063 INFO L226 Difference]: Without dead ends: 5446 [2022-02-20 21:54:15,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 21:54:15,069 INFO L933 BasicCegarLoop]: 1059 mSDtfsCounter, 1563 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 756 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1649 SdHoareTripleChecker+Valid, 2508 SdHoareTripleChecker+Invalid, 2028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 756 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-20 21:54:15,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1649 Valid, 2508 Invalid, 2028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [756 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-20 21:54:15,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5446 states. [2022-02-20 21:54:16,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5446 to 4985. [2022-02-20 21:54:16,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:54:16,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5446 states. Second operand has 4985 states, 3692 states have (on average 1.3518418201516793) internal successors, (4991), 3761 states have internal predecessors, (4991), 948 states have call successors, (948), 313 states have call predecessors, (948), 344 states have return successors, (1110), 958 states have call predecessors, (1110), 947 states have call successors, (1110) [2022-02-20 21:54:16,125 INFO L74 IsIncluded]: Start isIncluded. First operand 5446 states. Second operand has 4985 states, 3692 states have (on average 1.3518418201516793) internal successors, (4991), 3761 states have internal predecessors, (4991), 948 states have call successors, (948), 313 states have call predecessors, (948), 344 states have return successors, (1110), 958 states have call predecessors, (1110), 947 states have call successors, (1110) [2022-02-20 21:54:16,133 INFO L87 Difference]: Start difference. First operand 5446 states. Second operand has 4985 states, 3692 states have (on average 1.3518418201516793) internal successors, (4991), 3761 states have internal predecessors, (4991), 948 states have call successors, (948), 313 states have call predecessors, (948), 344 states have return successors, (1110), 958 states have call predecessors, (1110), 947 states have call successors, (1110) [2022-02-20 21:54:16,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:16,924 INFO L93 Difference]: Finished difference Result 5446 states and 7879 transitions. [2022-02-20 21:54:16,924 INFO L276 IsEmpty]: Start isEmpty. Operand 5446 states and 7879 transitions. [2022-02-20 21:54:16,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:16,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:16,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 4985 states, 3692 states have (on average 1.3518418201516793) internal successors, (4991), 3761 states have internal predecessors, (4991), 948 states have call successors, (948), 313 states have call predecessors, (948), 344 states have return successors, (1110), 958 states have call predecessors, (1110), 947 states have call successors, (1110) Second operand 5446 states. [2022-02-20 21:54:16,952 INFO L87 Difference]: Start difference. First operand has 4985 states, 3692 states have (on average 1.3518418201516793) internal successors, (4991), 3761 states have internal predecessors, (4991), 948 states have call successors, (948), 313 states have call predecessors, (948), 344 states have return successors, (1110), 958 states have call predecessors, (1110), 947 states have call successors, (1110) Second operand 5446 states. [2022-02-20 21:54:17,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:17,766 INFO L93 Difference]: Finished difference Result 5446 states and 7879 transitions. [2022-02-20 21:54:17,766 INFO L276 IsEmpty]: Start isEmpty. Operand 5446 states and 7879 transitions. [2022-02-20 21:54:17,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:17,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:17,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:54:17,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:54:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4985 states, 3692 states have (on average 1.3518418201516793) internal successors, (4991), 3761 states have internal predecessors, (4991), 948 states have call successors, (948), 313 states have call predecessors, (948), 344 states have return successors, (1110), 958 states have call predecessors, (1110), 947 states have call successors, (1110) [2022-02-20 21:54:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4985 states to 4985 states and 7049 transitions. [2022-02-20 21:54:18,847 INFO L78 Accepts]: Start accepts. Automaton has 4985 states and 7049 transitions. Word has length 89 [2022-02-20 21:54:18,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:54:18,847 INFO L470 AbstractCegarLoop]: Abstraction has 4985 states and 7049 transitions. [2022-02-20 21:54:18,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 21:54:18,847 INFO L276 IsEmpty]: Start isEmpty. Operand 4985 states and 7049 transitions. [2022-02-20 21:54:18,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-20 21:54:18,851 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:54:18,851 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:54:18,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 21:54:18,851 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:54:18,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:54:18,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1995914462, now seen corresponding path program 1 times [2022-02-20 21:54:18,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:54:18,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982695244] [2022-02-20 21:54:18,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:54:18,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:54:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:18,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:54:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:18,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {61993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {61946#true} is VALID [2022-02-20 21:54:18,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {61946#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {61946#true} is VALID [2022-02-20 21:54:18,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:18,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61946#true} {61946#true} #1799#return; {61946#true} is VALID [2022-02-20 21:54:18,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:54:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:18,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {61993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {61946#true} is VALID [2022-02-20 21:54:18,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {61946#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {61946#true} is VALID [2022-02-20 21:54:18,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:18,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61946#true} {61946#true} #1801#return; {61946#true} is VALID [2022-02-20 21:54:18,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:54:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:18,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {61993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {61946#true} is VALID [2022-02-20 21:54:18,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {61946#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {61946#true} is VALID [2022-02-20 21:54:18,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:18,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61946#true} {61946#true} #1803#return; {61946#true} is VALID [2022-02-20 21:54:18,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:54:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:18,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {61993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {61946#true} is VALID [2022-02-20 21:54:18,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {61946#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {61946#true} is VALID [2022-02-20 21:54:18,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:18,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61946#true} {61946#true} #1805#return; {61946#true} is VALID [2022-02-20 21:54:18,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 21:54:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:18,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {61993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {61946#true} is VALID [2022-02-20 21:54:18,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {61946#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {61946#true} is VALID [2022-02-20 21:54:18,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:18,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61946#true} {61946#true} #1807#return; {61946#true} is VALID [2022-02-20 21:54:18,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-02-20 21:54:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:18,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {61946#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {61946#true} is VALID [2022-02-20 21:54:18,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:18,970 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61946#true} {61947#false} #1951#return; {61947#false} is VALID [2022-02-20 21:54:18,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 21:54:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:18,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:19,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {61946#true} ~nr := #in~nr;~addr.base, ~addr.offset := #in~addr.base, #in~addr.offset;call #t~mem1 := read~int(~addr.base, ~addr.offset + 8 * (if ~nr / 64 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~nr / 64 % 18446744073709551616 % 18446744073709551616 else ~nr / 64 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 8);#res := (if (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 <= 2147483647 then (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 else (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 - 4294967296);havoc #t~mem1; {61946#true} is VALID [2022-02-20 21:54:19,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:19,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61946#true} {61946#true} #1711#return; {61946#true} is VALID [2022-02-20 21:54:19,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {61946#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;havoc ~tmp~14; {61946#true} is VALID [2022-02-20 21:54:19,010 INFO L272 TraceCheckUtils]: 1: Hoare triple {61946#true} call #t~ret71 := constant_test_bit(0, ~dev.base, 68 + ~dev.offset); {61946#true} is VALID [2022-02-20 21:54:19,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {61946#true} ~nr := #in~nr;~addr.base, ~addr.offset := #in~addr.base, #in~addr.offset;call #t~mem1 := read~int(~addr.base, ~addr.offset + 8 * (if ~nr / 64 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~nr / 64 % 18446744073709551616 % 18446744073709551616 else ~nr / 64 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 8);#res := (if (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 <= 2147483647 then (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 else (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 - 4294967296);havoc #t~mem1; {61946#true} is VALID [2022-02-20 21:54:19,011 INFO L290 TraceCheckUtils]: 3: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:19,014 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {61946#true} {61946#true} #1711#return; {61946#true} is VALID [2022-02-20 21:54:19,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {61946#true} assume -2147483648 <= #t~ret71 && #t~ret71 <= 2147483647;~tmp~14 := #t~ret71;havoc #t~ret71;#res := (if 0 == (if 0 != ~tmp~14 then 1 else 0) then 0 else 1); {61946#true} is VALID [2022-02-20 21:54:19,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:19,015 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {61946#true} {61947#false} #1953#return; {61947#false} is VALID [2022-02-20 21:54:19,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-02-20 21:54:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:19,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:19,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {61997#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~3;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~3 := 0; {61946#true} is VALID [2022-02-20 21:54:19,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {61946#true} assume !false; {61946#true} is VALID [2022-02-20 21:54:19,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {61946#true} assume !(~i~3 < ~last_index~0); {61946#true} is VALID [2022-02-20 21:54:19,041 INFO L290 TraceCheckUtils]: 3: Hoare triple {61946#true} assume -1 != ~deleted_index~0;~i~3 := 1 + ~deleted_index~0; {61946#true} is VALID [2022-02-20 21:54:19,041 INFO L290 TraceCheckUtils]: 4: Hoare triple {61946#true} assume !false; {61946#true} is VALID [2022-02-20 21:54:19,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {61946#true} assume !(~i~3 < ~last_index~0); {61946#true} is VALID [2022-02-20 21:54:19,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {61946#true} ~last_index~0 := ~last_index~0 - 1; {61946#true} is VALID [2022-02-20 21:54:19,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:19,042 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {61946#true} {61946#true} #1723#return; {61946#true} is VALID [2022-02-20 21:54:19,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {61997#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {61946#true} is VALID [2022-02-20 21:54:19,043 INFO L272 TraceCheckUtils]: 1: Hoare triple {61946#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {61997#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:19,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {61997#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~3;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~3 := 0; {61946#true} is VALID [2022-02-20 21:54:19,044 INFO L290 TraceCheckUtils]: 3: Hoare triple {61946#true} assume !false; {61946#true} is VALID [2022-02-20 21:54:19,044 INFO L290 TraceCheckUtils]: 4: Hoare triple {61946#true} assume !(~i~3 < ~last_index~0); {61946#true} is VALID [2022-02-20 21:54:19,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {61946#true} assume -1 != ~deleted_index~0;~i~3 := 1 + ~deleted_index~0; {61946#true} is VALID [2022-02-20 21:54:19,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {61946#true} assume !false; {61946#true} is VALID [2022-02-20 21:54:19,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {61946#true} assume !(~i~3 < ~last_index~0); {61946#true} is VALID [2022-02-20 21:54:19,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {61946#true} ~last_index~0 := ~last_index~0 - 1; {61946#true} is VALID [2022-02-20 21:54:19,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:19,044 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {61946#true} {61946#true} #1723#return; {61946#true} is VALID [2022-02-20 21:54:19,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:19,045 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {61946#true} {61947#false} #1955#return; {61947#false} is VALID [2022-02-20 21:54:19,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {61946#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(100, 2);call #Ultimate.allocInit(26, 3);call #Ultimate.allocInit(72, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(43, 6);call #Ultimate.allocInit(14, 7);call #Ultimate.allocInit(36, 8);call #Ultimate.allocInit(33, 9);call #Ultimate.allocInit(34, 10);call #Ultimate.allocInit(44, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(17, 13);call #Ultimate.allocInit(13, 14);call #Ultimate.allocInit(30, 15);call #Ultimate.allocInit(32, 16);call #Ultimate.allocInit(35, 17);call #Ultimate.allocInit(29, 18);call #Ultimate.allocInit(12, 19);call #Ultimate.allocInit(15, 20);call #Ultimate.allocInit(15, 21);call #Ultimate.allocInit(52, 22);call #Ultimate.allocInit(20, 23);call #Ultimate.allocInit(5, 24);call write~init~int(88, 24, 0, 1);call write~init~int(46, 24, 1, 1);call write~init~int(50, 24, 2, 1);call write~init~int(53, 24, 3, 1);call write~init~int(0, 24, 4, 1);call #Ultimate.allocInit(69, 25);~ldv_state_variable_3~0 := 0;~x25_ldisc_group1~0.base, ~x25_ldisc_group1~0.offset := 0, 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~x25_asy_netdev_ops_group1~0.base, ~x25_asy_netdev_ops_group1~0.offset := 0, 0;~x25_asy_callbacks_group0~0.base, ~x25_asy_callbacks_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~x25_asy_callbacks_group1~0.base, ~x25_asy_callbacks_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~x25_asy_devs~0.base, ~x25_asy_devs~0.offset := 0, 0;~x25_asy_maxdev~0 := 256;~#x25_asy_callbacks~0.base, ~#x25_asy_callbacks~0.offset := 26, 0;call #Ultimate.allocInit(48, 26);call write~init~$Pointer$(#funAddr~x25_asy_connected.base, #funAddr~x25_asy_connected.offset, ~#x25_asy_callbacks~0.base, ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_connected.base, #funAddr~x25_asy_connected.offset, ~#x25_asy_callbacks~0.base, 8 + ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_disconnected.base, #funAddr~x25_asy_disconnected.offset, ~#x25_asy_callbacks~0.base, 16 + ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_disconnected.base, #funAddr~x25_asy_disconnected.offset, ~#x25_asy_callbacks~0.base, 24 + ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_data_indication.base, #funAddr~x25_asy_data_indication.offset, ~#x25_asy_callbacks~0.base, 32 + ~#x25_asy_callbacks~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_data_transmit.base, #funAddr~x25_asy_data_transmit.offset, ~#x25_asy_callbacks~0.base, 40 + ~#x25_asy_callbacks~0.offset, 8);~#x25_asy_netdev_ops~0.base, ~#x25_asy_netdev_ops~0.offset := 27, 0;call #Ultimate.allocInit(480, 27);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 8 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_open_dev.base, #funAddr~x25_asy_open_dev.offset, ~#x25_asy_netdev_ops~0.base, 16 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_close.base, #funAddr~x25_asy_close.offset, ~#x25_asy_netdev_ops~0.base, 24 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_xmit.base, #funAddr~x25_asy_xmit.offset, ~#x25_asy_netdev_ops~0.base, 32 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 40 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 48 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 56 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 64 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 72 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 80 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 88 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_change_mtu.base, #funAddr~x25_asy_change_mtu.offset, ~#x25_asy_netdev_ops~0.base, 96 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 104 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_timeout.base, #funAddr~x25_asy_timeout.offset, ~#x25_asy_netdev_ops~0.base, 112 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 120 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 128 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 136 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 144 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 152 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 160 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 168 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 176 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 184 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 192 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 200 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 208 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 216 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 224 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 232 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 240 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 248 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 256 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 264 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 272 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 280 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 288 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 296 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 304 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 312 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 320 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 328 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 336 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 344 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 352 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 360 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 368 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 376 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 384 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 392 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 400 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 408 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 416 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 424 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 432 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 440 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 448 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 456 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 464 + ~#x25_asy_netdev_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_asy_netdev_ops~0.base, 472 + ~#x25_asy_netdev_ops~0.offset, 8);~#x25_ldisc~0.base, ~#x25_ldisc~0.offset := 28, 0;call #Ultimate.allocInit(160, 28);call write~init~int(21507, ~#x25_ldisc~0.base, ~#x25_ldisc~0.offset, 4);call write~init~$Pointer$(24, 0, ~#x25_ldisc~0.base, 4 + ~#x25_ldisc~0.offset, 8);call write~init~int(0, ~#x25_ldisc~0.base, 12 + ~#x25_ldisc~0.offset, 4);call write~init~int(0, ~#x25_ldisc~0.base, 16 + ~#x25_ldisc~0.offset, 4);call write~init~$Pointer$(#funAddr~x25_asy_open_tty.base, #funAddr~x25_asy_open_tty.offset, ~#x25_ldisc~0.base, 20 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_close_tty.base, #funAddr~x25_asy_close_tty.offset, ~#x25_ldisc~0.base, 28 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 36 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 44 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 52 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 60 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_ioctl.base, #funAddr~x25_asy_ioctl.offset, ~#x25_ldisc~0.base, 68 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_compat_ioctl.base, #funAddr~x25_asy_compat_ioctl.offset, ~#x25_ldisc~0.base, 76 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 84 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 92 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 100 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_receive_buf.base, #funAddr~x25_asy_receive_buf.offset, ~#x25_ldisc~0.base, 108 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~x25_asy_write_wakeup.base, #funAddr~x25_asy_write_wakeup.offset, ~#x25_ldisc~0.base, 116 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 124 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 132 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#x25_ldisc~0.base, 140 + ~#x25_ldisc~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#x25_ldisc~0.base, 148 + ~#x25_ldisc~0.offset, 8);call write~init~int(0, ~#x25_ldisc~0.base, 156 + ~#x25_ldisc~0.offset, 4);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 29, 0;call #Ultimate.allocInit(120, 29);#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; {61946#true} is VALID [2022-02-20 21:54:19,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {61946#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset, main_#t~nondet328#1, main_#t~nondet329#1, main_#t~ret330#1.base, main_#t~ret330#1.offset, main_#t~nondet331#1, main_#t~ret332#1.base, main_#t~ret332#1.offset, main_#t~nondet333#1, main_#t~nondet334#1, main_#t~ret335#1.base, main_#t~ret335#1.offset, main_#t~nondet336#1, main_#t~nondet337#1, main_#t~nondet338#1, main_#t~nondet339#1, main_#t~nondet340#1, main_#t~ret341#1.base, main_#t~ret341#1.offset, main_#t~nondet342#1, main_#t~switch343#1, main_#t~nondet344#1, main_#t~switch345#1, main_#t~ret346#1, main_#t~ret347#1, main_#t~ret348#1, main_#t~ret349#1, main_#t~ret350#1, main_#t~nondet351#1, main_#t~switch352#1, main_#t~ret353#1, main_#t~nondet354#1, main_#t~switch355#1, main_#t~ret356#1, main_#t~ret357#1, main_#t~ret358#1, main_#t~nondet359#1, main_#t~switch360#1, main_#t~ret361#1, main_#t~ret362#1, main_#t~ret363#1, main_#t~ret364#1, main_#t~ret365#1, main_#t~ret366#1, main_#t~ret367#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp~39#1.base, main_~tmp~39#1.offset, main_~ldvarg3~0#1, main_~tmp___0~20#1, main_~ldvarg0~0#1, main_~tmp___1~10#1, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset, main_~ldvarg6~0#1, main_~tmp___3~2#1, main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset, main_~tmp___4~2#1.base, main_~tmp___4~2#1.offset, main_~ldvarg1~0#1, main_~tmp___5~1#1, main_~ldvarg4~0#1, main_~tmp___6~1#1, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___7~1#1.base, main_~tmp___7~1#1.offset, main_~ldvarg11~0#1, main_~tmp___8~0#1, main_~ldvarg10~0#1, main_~tmp___9~0#1, main_~ldvarg12~0#1, main_~tmp___10~0#1, main_~ldvarg9~0#1, main_~tmp___11~0#1, main_~ldvarg14~0#1, main_~tmp___12~0#1, main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset, main_~tmp___13~0#1.base, main_~tmp___13~0#1.offset, main_~tmp___14~0#1, main_~tmp___15~0#1, main_~tmp___16~0#1, main_~tmp___17~0#1, main_~tmp___18~0#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp~39#1.base, main_~tmp~39#1.offset;havoc main_~ldvarg3~0#1;havoc main_~tmp___0~20#1;havoc main_~ldvarg0~0#1;havoc main_~tmp___1~10#1;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset;havoc main_~ldvarg6~0#1;havoc main_~tmp___3~2#1;havoc main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset;havoc main_~tmp___4~2#1.base, main_~tmp___4~2#1.offset;havoc main_~ldvarg1~0#1;havoc main_~tmp___5~1#1;havoc main_~ldvarg4~0#1;havoc main_~tmp___6~1#1;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___7~1#1.base, main_~tmp___7~1#1.offset;havoc main_~ldvarg11~0#1;havoc main_~tmp___8~0#1;havoc main_~ldvarg10~0#1;havoc main_~tmp___9~0#1;havoc main_~ldvarg12~0#1;havoc main_~tmp___10~0#1;havoc main_~ldvarg9~0#1;havoc main_~tmp___11~0#1;havoc main_~ldvarg14~0#1;havoc main_~tmp___12~0#1;havoc main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset;havoc main_~tmp___13~0#1.base, main_~tmp___13~0#1.offset;havoc main_~tmp___14~0#1;havoc main_~tmp___15~0#1;havoc main_~tmp___16~0#1;havoc main_~tmp___17~0#1;havoc main_~tmp___18~0#1; {61946#true} is VALID [2022-02-20 21:54:19,046 INFO L272 TraceCheckUtils]: 2: Hoare triple {61946#true} call main_#t~ret327#1.base, main_#t~ret327#1.offset := ldv_zalloc(1); {61993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:19,046 INFO L290 TraceCheckUtils]: 3: Hoare triple {61993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {61946#true} is VALID [2022-02-20 21:54:19,046 INFO L290 TraceCheckUtils]: 4: Hoare triple {61946#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {61946#true} is VALID [2022-02-20 21:54:19,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:19,046 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {61946#true} {61946#true} #1799#return; {61946#true} is VALID [2022-02-20 21:54:19,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {61946#true} main_~tmp~39#1.base, main_~tmp~39#1.offset := main_#t~ret327#1.base, main_#t~ret327#1.offset;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp~39#1.base, main_~tmp~39#1.offset;main_~tmp___0~20#1 := main_#t~nondet328#1;havoc main_#t~nondet328#1;main_~ldvarg3~0#1 := main_~tmp___0~20#1;main_~tmp___1~10#1 := main_#t~nondet329#1;havoc main_#t~nondet329#1;main_~ldvarg0~0#1 := main_~tmp___1~10#1; {61946#true} is VALID [2022-02-20 21:54:19,047 INFO L272 TraceCheckUtils]: 8: Hoare triple {61946#true} call main_#t~ret330#1.base, main_#t~ret330#1.offset := ldv_zalloc(512); {61993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:19,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {61993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {61946#true} is VALID [2022-02-20 21:54:19,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {61946#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {61946#true} is VALID [2022-02-20 21:54:19,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:19,047 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {61946#true} {61946#true} #1801#return; {61946#true} is VALID [2022-02-20 21:54:19,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {61946#true} main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset := main_#t~ret330#1.base, main_#t~ret330#1.offset;havoc main_#t~ret330#1.base, main_#t~ret330#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___2~5#1.base, main_~tmp___2~5#1.offset;assume -2147483648 <= main_#t~nondet331#1 && main_#t~nondet331#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet331#1;havoc main_#t~nondet331#1;main_~ldvarg6~0#1 := main_~tmp___3~2#1; {61946#true} is VALID [2022-02-20 21:54:19,048 INFO L272 TraceCheckUtils]: 14: Hoare triple {61946#true} call main_#t~ret332#1.base, main_#t~ret332#1.offset := ldv_zalloc(1); {61993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:19,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {61993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {61946#true} is VALID [2022-02-20 21:54:19,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {61946#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {61946#true} is VALID [2022-02-20 21:54:19,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:19,048 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {61946#true} {61946#true} #1803#return; {61946#true} is VALID [2022-02-20 21:54:19,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {61946#true} main_~tmp___4~2#1.base, main_~tmp___4~2#1.offset := main_#t~ret332#1.base, main_#t~ret332#1.offset;havoc main_#t~ret332#1.base, main_#t~ret332#1.offset;main_~ldvarg8~0#1.base, main_~ldvarg8~0#1.offset := main_~tmp___4~2#1.base, main_~tmp___4~2#1.offset;main_~tmp___5~1#1 := main_#t~nondet333#1;havoc main_#t~nondet333#1;main_~ldvarg1~0#1 := main_~tmp___5~1#1;main_~tmp___6~1#1 := main_#t~nondet334#1;havoc main_#t~nondet334#1;main_~ldvarg4~0#1 := main_~tmp___6~1#1; {61946#true} is VALID [2022-02-20 21:54:19,049 INFO L272 TraceCheckUtils]: 20: Hoare triple {61946#true} call main_#t~ret335#1.base, main_#t~ret335#1.offset := ldv_zalloc(512); {61993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:19,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {61993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {61946#true} is VALID [2022-02-20 21:54:19,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {61946#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {61946#true} is VALID [2022-02-20 21:54:19,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:19,049 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {61946#true} {61946#true} #1805#return; {61946#true} is VALID [2022-02-20 21:54:19,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {61946#true} main_~tmp___7~1#1.base, main_~tmp___7~1#1.offset := main_#t~ret335#1.base, main_#t~ret335#1.offset;havoc main_#t~ret335#1.base, main_#t~ret335#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___7~1#1.base, main_~tmp___7~1#1.offset;assume -2147483648 <= main_#t~nondet336#1 && main_#t~nondet336#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet336#1;havoc main_#t~nondet336#1;main_~ldvarg11~0#1 := main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet337#1 && main_#t~nondet337#1 <= 2147483647;main_~tmp___9~0#1 := main_#t~nondet337#1;havoc main_#t~nondet337#1;main_~ldvarg10~0#1 := main_~tmp___9~0#1;assume -2147483648 <= main_#t~nondet338#1 && main_#t~nondet338#1 <= 2147483647;main_~tmp___10~0#1 := main_#t~nondet338#1;havoc main_#t~nondet338#1;main_~ldvarg12~0#1 := main_~tmp___10~0#1;assume -2147483648 <= main_#t~nondet339#1 && main_#t~nondet339#1 <= 2147483647;main_~tmp___11~0#1 := main_#t~nondet339#1;havoc main_#t~nondet339#1;main_~ldvarg9~0#1 := main_~tmp___11~0#1;assume -2147483648 <= main_#t~nondet340#1 && main_#t~nondet340#1 <= 2147483647;main_~tmp___12~0#1 := main_#t~nondet340#1;havoc main_#t~nondet340#1;main_~ldvarg14~0#1 := main_~tmp___12~0#1; {61946#true} is VALID [2022-02-20 21:54:19,050 INFO L272 TraceCheckUtils]: 26: Hoare triple {61946#true} call main_#t~ret341#1.base, main_#t~ret341#1.offset := ldv_zalloc(232); {61993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:19,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {61993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~4#1.base, ~tmp~4#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647;~tmp___0~2#1 := #t~nondet41#1;havoc #t~nondet41#1; {61946#true} is VALID [2022-02-20 21:54:19,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {61946#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {61946#true} is VALID [2022-02-20 21:54:19,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:19,050 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {61946#true} {61946#true} #1807#return; {61946#true} is VALID [2022-02-20 21:54:19,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {61946#true} main_~tmp___13~0#1.base, main_~tmp___13~0#1.offset := main_#t~ret341#1.base, main_#t~ret341#1.offset;havoc main_#t~ret341#1.base, main_#t~ret341#1.offset;main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset := main_~tmp___13~0#1.base, main_~tmp___13~0#1.offset;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; {61946#true} is VALID [2022-02-20 21:54:19,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {61946#true} assume { :end_inline_ldv_set_init } true; {61946#true} is VALID [2022-02-20 21:54:19,050 INFO L290 TraceCheckUtils]: 33: Hoare triple {61946#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {61968#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:54:19,051 INFO L290 TraceCheckUtils]: 34: Hoare triple {61968#(= ~ldv_state_variable_2~0 0)} assume -2147483648 <= main_#t~nondet342#1 && main_#t~nondet342#1 <= 2147483647;main_~tmp___14~0#1 := main_#t~nondet342#1;havoc main_#t~nondet342#1;main_#t~switch343#1 := 0 == main_~tmp___14~0#1; {61968#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:54:19,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {61968#(= ~ldv_state_variable_2~0 0)} assume !main_#t~switch343#1;main_#t~switch343#1 := main_#t~switch343#1 || 1 == main_~tmp___14~0#1; {61968#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:54:19,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {61968#(= ~ldv_state_variable_2~0 0)} assume !main_#t~switch343#1;main_#t~switch343#1 := main_#t~switch343#1 || 2 == main_~tmp___14~0#1; {61968#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:54:19,052 INFO L290 TraceCheckUtils]: 37: Hoare triple {61968#(= ~ldv_state_variable_2~0 0)} assume !main_#t~switch343#1;main_#t~switch343#1 := main_#t~switch343#1 || 3 == main_~tmp___14~0#1; {61968#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:54:19,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {61968#(= ~ldv_state_variable_2~0 0)} assume main_#t~switch343#1; {61968#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:54:19,052 INFO L290 TraceCheckUtils]: 39: Hoare triple {61968#(= ~ldv_state_variable_2~0 0)} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet359#1 && main_#t~nondet359#1 <= 2147483647;main_~tmp___18~0#1 := main_#t~nondet359#1;havoc main_#t~nondet359#1;main_#t~switch360#1 := 0 == main_~tmp___18~0#1; {61947#false} is VALID [2022-02-20 21:54:19,052 INFO L290 TraceCheckUtils]: 40: Hoare triple {61947#false} assume !main_#t~switch360#1;main_#t~switch360#1 := main_#t~switch360#1 || 1 == main_~tmp___18~0#1; {61947#false} is VALID [2022-02-20 21:54:19,052 INFO L290 TraceCheckUtils]: 41: Hoare triple {61947#false} assume !main_#t~switch360#1;main_#t~switch360#1 := main_#t~switch360#1 || 2 == main_~tmp___18~0#1; {61947#false} is VALID [2022-02-20 21:54:19,052 INFO L290 TraceCheckUtils]: 42: Hoare triple {61947#false} assume !main_#t~switch360#1;main_#t~switch360#1 := main_#t~switch360#1 || 3 == main_~tmp___18~0#1; {61947#false} is VALID [2022-02-20 21:54:19,052 INFO L290 TraceCheckUtils]: 43: Hoare triple {61947#false} assume main_#t~switch360#1; {61947#false} is VALID [2022-02-20 21:54:19,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {61947#false} assume 3 == ~ldv_state_variable_2~0;assume { :begin_inline_x25_asy_xmit } true;x25_asy_xmit_#in~skb#1.base, x25_asy_xmit_#in~skb#1.offset, x25_asy_xmit_#in~dev#1.base, x25_asy_xmit_#in~dev#1.offset := main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset, ~x25_asy_netdev_ops_group1~0.base, ~x25_asy_netdev_ops_group1~0.offset;havoc x25_asy_xmit_#res#1;havoc x25_asy_xmit_#t~ret200#1.base, x25_asy_xmit_#t~ret200#1.offset, x25_asy_xmit_#t~mem201#1.base, x25_asy_xmit_#t~mem201#1.offset, x25_asy_xmit_#t~ret202#1, x25_asy_xmit_#t~nondet203#1, x25_asy_xmit_#t~mem204#1.base, x25_asy_xmit_#t~mem204#1.offset, x25_asy_xmit_#t~mem205#1, x25_asy_xmit_#t~switch206#1, x25_asy_xmit_#t~ret207#1, x25_asy_xmit_#t~nondet208#1, x25_asy_xmit_#t~ret209#1, x25_asy_xmit_#t~nondet210#1, x25_asy_xmit_#t~ret211#1.base, x25_asy_xmit_#t~ret211#1.offset, x25_asy_xmit_#t~ret212#1, x25_asy_xmit_#t~nondet213#1, x25_asy_xmit_~skb#1.base, x25_asy_xmit_~skb#1.offset, x25_asy_xmit_~dev#1.base, x25_asy_xmit_~dev#1.offset, x25_asy_xmit_~sl~4#1.base, x25_asy_xmit_~sl~4#1.offset, x25_asy_xmit_~tmp~20#1.base, x25_asy_xmit_~tmp~20#1.offset, x25_asy_xmit_~err~1#1, x25_asy_xmit_~tmp___0~10#1, x25_asy_xmit_~tmp___1~4#1;x25_asy_xmit_~skb#1.base, x25_asy_xmit_~skb#1.offset := x25_asy_xmit_#in~skb#1.base, x25_asy_xmit_#in~skb#1.offset;x25_asy_xmit_~dev#1.base, x25_asy_xmit_~dev#1.offset := x25_asy_xmit_#in~dev#1.base, x25_asy_xmit_#in~dev#1.offset;havoc x25_asy_xmit_~sl~4#1.base, x25_asy_xmit_~sl~4#1.offset;havoc x25_asy_xmit_~tmp~20#1.base, x25_asy_xmit_~tmp~20#1.offset;havoc x25_asy_xmit_~err~1#1;havoc x25_asy_xmit_~tmp___0~10#1;havoc x25_asy_xmit_~tmp___1~4#1; {61947#false} is VALID [2022-02-20 21:54:19,053 INFO L272 TraceCheckUtils]: 45: Hoare triple {61947#false} call x25_asy_xmit_#t~ret200#1.base, x25_asy_xmit_#t~ret200#1.offset := netdev_priv(x25_asy_xmit_~dev#1.base, x25_asy_xmit_~dev#1.offset); {61946#true} is VALID [2022-02-20 21:54:19,053 INFO L290 TraceCheckUtils]: 46: Hoare triple {61946#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;#res.base, #res.offset := ~dev.base, 3264 + ~dev.offset; {61946#true} is VALID [2022-02-20 21:54:19,053 INFO L290 TraceCheckUtils]: 47: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:19,053 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {61946#true} {61947#false} #1951#return; {61947#false} is VALID [2022-02-20 21:54:19,053 INFO L290 TraceCheckUtils]: 49: Hoare triple {61947#false} x25_asy_xmit_~tmp~20#1.base, x25_asy_xmit_~tmp~20#1.offset := x25_asy_xmit_#t~ret200#1.base, x25_asy_xmit_#t~ret200#1.offset;havoc x25_asy_xmit_#t~ret200#1.base, x25_asy_xmit_#t~ret200#1.offset;x25_asy_xmit_~sl~4#1.base, x25_asy_xmit_~sl~4#1.offset := x25_asy_xmit_~tmp~20#1.base, x25_asy_xmit_~tmp~20#1.offset;call x25_asy_xmit_#t~mem201#1.base, x25_asy_xmit_#t~mem201#1.offset := read~$Pointer$(x25_asy_xmit_~sl~4#1.base, 80 + x25_asy_xmit_~sl~4#1.offset, 8); {61947#false} is VALID [2022-02-20 21:54:19,053 INFO L272 TraceCheckUtils]: 50: Hoare triple {61947#false} call x25_asy_xmit_#t~ret202#1 := netif_running(x25_asy_xmit_#t~mem201#1.base, x25_asy_xmit_#t~mem201#1.offset); {61946#true} is VALID [2022-02-20 21:54:19,054 INFO L290 TraceCheckUtils]: 51: Hoare triple {61946#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;havoc ~tmp~14; {61946#true} is VALID [2022-02-20 21:54:19,054 INFO L272 TraceCheckUtils]: 52: Hoare triple {61946#true} call #t~ret71 := constant_test_bit(0, ~dev.base, 68 + ~dev.offset); {61946#true} is VALID [2022-02-20 21:54:19,054 INFO L290 TraceCheckUtils]: 53: Hoare triple {61946#true} ~nr := #in~nr;~addr.base, ~addr.offset := #in~addr.base, #in~addr.offset;call #t~mem1 := read~int(~addr.base, ~addr.offset + 8 * (if ~nr / 64 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~nr / 64 % 18446744073709551616 % 18446744073709551616 else ~nr / 64 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 8);#res := (if (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 <= 2147483647 then (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 else (if #t~mem1 < 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 1 else (if #t~mem1 >= 0 && (31 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63))) || 63 == (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))) then 0 else ~shiftRight(#t~mem1, (if 0 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 0 else (if 1 == (if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296) then 1 else ~bitwiseAnd((if ~nr % 4294967296 <= 2147483647 then ~nr % 4294967296 else ~nr % 4294967296 - 4294967296), 63)))))) % 18446744073709551616 % 4294967296 - 4294967296);havoc #t~mem1; {61946#true} is VALID [2022-02-20 21:54:19,054 INFO L290 TraceCheckUtils]: 54: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:19,054 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {61946#true} {61946#true} #1711#return; {61946#true} is VALID [2022-02-20 21:54:19,054 INFO L290 TraceCheckUtils]: 56: Hoare triple {61946#true} assume -2147483648 <= #t~ret71 && #t~ret71 <= 2147483647;~tmp~14 := #t~ret71;havoc #t~ret71;#res := (if 0 == (if 0 != ~tmp~14 then 1 else 0) then 0 else 1); {61946#true} is VALID [2022-02-20 21:54:19,054 INFO L290 TraceCheckUtils]: 57: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:19,054 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {61946#true} {61947#false} #1953#return; {61947#false} is VALID [2022-02-20 21:54:19,055 INFO L290 TraceCheckUtils]: 59: Hoare triple {61947#false} x25_asy_xmit_~tmp___0~10#1 := x25_asy_xmit_#t~ret202#1;havoc x25_asy_xmit_#t~mem201#1.base, x25_asy_xmit_#t~mem201#1.offset;havoc x25_asy_xmit_#t~ret202#1; {61947#false} is VALID [2022-02-20 21:54:19,055 INFO L290 TraceCheckUtils]: 60: Hoare triple {61947#false} assume !(0 != x25_asy_xmit_~tmp___0~10#1 % 256);x25_asy_xmit_~tmp___1~4#1 := 1; {61947#false} is VALID [2022-02-20 21:54:19,055 INFO L290 TraceCheckUtils]: 61: Hoare triple {61947#false} assume 0 != x25_asy_xmit_~tmp___1~4#1;havoc x25_asy_xmit_#t~nondet203#1;assume { :begin_inline_ldv_kfree_skb_17 } true;ldv_kfree_skb_17_#in~ldv_func_arg1#1.base, ldv_kfree_skb_17_#in~ldv_func_arg1#1.offset := x25_asy_xmit_~skb#1.base, x25_asy_xmit_~skb#1.offset;havoc ldv_kfree_skb_17_~ldv_func_arg1#1.base, ldv_kfree_skb_17_~ldv_func_arg1#1.offset;ldv_kfree_skb_17_~ldv_func_arg1#1.base, ldv_kfree_skb_17_~ldv_func_arg1#1.offset := ldv_kfree_skb_17_#in~ldv_func_arg1#1.base, ldv_kfree_skb_17_#in~ldv_func_arg1#1.offset; {61947#false} is VALID [2022-02-20 21:54:19,055 INFO L272 TraceCheckUtils]: 62: Hoare triple {61947#false} call ldv_skb_free(ldv_kfree_skb_17_~ldv_func_arg1#1.base, ldv_kfree_skb_17_~ldv_func_arg1#1.offset); {61997#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:19,055 INFO L290 TraceCheckUtils]: 63: Hoare triple {61997#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {61946#true} is VALID [2022-02-20 21:54:19,056 INFO L272 TraceCheckUtils]: 64: Hoare triple {61946#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {61997#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:19,056 INFO L290 TraceCheckUtils]: 65: Hoare triple {61997#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~3;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~3 := 0; {61946#true} is VALID [2022-02-20 21:54:19,056 INFO L290 TraceCheckUtils]: 66: Hoare triple {61946#true} assume !false; {61946#true} is VALID [2022-02-20 21:54:19,056 INFO L290 TraceCheckUtils]: 67: Hoare triple {61946#true} assume !(~i~3 < ~last_index~0); {61946#true} is VALID [2022-02-20 21:54:19,056 INFO L290 TraceCheckUtils]: 68: Hoare triple {61946#true} assume -1 != ~deleted_index~0;~i~3 := 1 + ~deleted_index~0; {61946#true} is VALID [2022-02-20 21:54:19,056 INFO L290 TraceCheckUtils]: 69: Hoare triple {61946#true} assume !false; {61946#true} is VALID [2022-02-20 21:54:19,056 INFO L290 TraceCheckUtils]: 70: Hoare triple {61946#true} assume !(~i~3 < ~last_index~0); {61946#true} is VALID [2022-02-20 21:54:19,057 INFO L290 TraceCheckUtils]: 71: Hoare triple {61946#true} ~last_index~0 := ~last_index~0 - 1; {61946#true} is VALID [2022-02-20 21:54:19,057 INFO L290 TraceCheckUtils]: 72: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:19,057 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {61946#true} {61946#true} #1723#return; {61946#true} is VALID [2022-02-20 21:54:19,057 INFO L290 TraceCheckUtils]: 74: Hoare triple {61946#true} assume true; {61946#true} is VALID [2022-02-20 21:54:19,057 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {61946#true} {61947#false} #1955#return; {61947#false} is VALID [2022-02-20 21:54:19,057 INFO L290 TraceCheckUtils]: 76: Hoare triple {61947#false} assume { :end_inline_ldv_kfree_skb_17 } true;x25_asy_xmit_#res#1 := 0; {61947#false} is VALID [2022-02-20 21:54:19,057 INFO L290 TraceCheckUtils]: 77: Hoare triple {61947#false} main_#t~ret365#1 := x25_asy_xmit_#res#1;assume { :end_inline_x25_asy_xmit } true;assume -2147483648 <= main_#t~ret365#1 && main_#t~ret365#1 <= 2147483647;havoc main_#t~ret365#1;~ldv_state_variable_2~0 := 3; {61947#false} is VALID [2022-02-20 21:54:19,058 INFO L290 TraceCheckUtils]: 78: Hoare triple {61947#false} assume -2147483648 <= main_#t~nondet342#1 && main_#t~nondet342#1 <= 2147483647;main_~tmp___14~0#1 := main_#t~nondet342#1;havoc main_#t~nondet342#1;main_#t~switch343#1 := 0 == main_~tmp___14~0#1; {61947#false} is VALID [2022-02-20 21:54:19,058 INFO L290 TraceCheckUtils]: 79: Hoare triple {61947#false} assume !main_#t~switch343#1;main_#t~switch343#1 := main_#t~switch343#1 || 1 == main_~tmp___14~0#1; {61947#false} is VALID [2022-02-20 21:54:19,058 INFO L290 TraceCheckUtils]: 80: Hoare triple {61947#false} assume main_#t~switch343#1; {61947#false} is VALID [2022-02-20 21:54:19,058 INFO L290 TraceCheckUtils]: 81: Hoare triple {61947#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet351#1 && main_#t~nondet351#1 <= 2147483647;main_~tmp___16~0#1 := main_#t~nondet351#1;havoc main_#t~nondet351#1;main_#t~switch352#1 := 0 == main_~tmp___16~0#1; {61947#false} is VALID [2022-02-20 21:54:19,058 INFO L290 TraceCheckUtils]: 82: Hoare triple {61947#false} assume !main_#t~switch352#1;main_#t~switch352#1 := main_#t~switch352#1 || 1 == main_~tmp___16~0#1; {61947#false} is VALID [2022-02-20 21:54:19,058 INFO L290 TraceCheckUtils]: 83: Hoare triple {61947#false} assume main_#t~switch352#1; {61947#false} is VALID [2022-02-20 21:54:19,058 INFO L290 TraceCheckUtils]: 84: Hoare triple {61947#false} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_init_x25_asy } true;havoc init_x25_asy_#res#1;havoc init_x25_asy_#t~nondet315#1, init_x25_asy_#t~ret316#1.base, init_x25_asy_#t~ret316#1.offset, init_x25_asy_#t~ret317#1, init_x25_asy_~tmp~34#1.base, init_x25_asy_~tmp~34#1.offset, init_x25_asy_~tmp___0~18#1;havoc init_x25_asy_~tmp~34#1.base, init_x25_asy_~tmp~34#1.offset;havoc init_x25_asy_~tmp___0~18#1; {61947#false} is VALID [2022-02-20 21:54:19,058 INFO L290 TraceCheckUtils]: 85: Hoare triple {61947#false} assume !(~x25_asy_maxdev~0 <= 3); {61947#false} is VALID [2022-02-20 21:54:19,058 INFO L290 TraceCheckUtils]: 86: Hoare triple {61947#false} havoc init_x25_asy_#t~nondet315#1;assume { :begin_inline_kcalloc } true;kcalloc_#in~n#1, kcalloc_#in~size#1, kcalloc_#in~flags#1 := ~x25_asy_maxdev~0, 8, 208;havoc kcalloc_#res#1.base, kcalloc_#res#1.offset;havoc kcalloc_#t~ret20#1.base, kcalloc_#t~ret20#1.offset, kcalloc_~n#1, kcalloc_~size#1, kcalloc_~flags#1, kcalloc_~tmp~1#1.base, kcalloc_~tmp~1#1.offset;kcalloc_~n#1 := kcalloc_#in~n#1;kcalloc_~size#1 := kcalloc_#in~size#1;kcalloc_~flags#1 := kcalloc_#in~flags#1;havoc kcalloc_~tmp~1#1.base, kcalloc_~tmp~1#1.offset;assume { :begin_inline_kmalloc_array } true;kmalloc_array_#in~n#1, kmalloc_array_#in~size#1, kmalloc_array_#in~flags#1 := kcalloc_~n#1, kcalloc_~size#1, ~bitwiseOr(kcalloc_~flags#1, 32768);havoc kmalloc_array_#res#1.base, kmalloc_array_#res#1.offset;havoc kmalloc_array_#t~ret19#1.base, kmalloc_array_#t~ret19#1.offset, kmalloc_array_~n#1, kmalloc_array_~size#1, kmalloc_array_~flags#1, kmalloc_array_~tmp~0#1.base, kmalloc_array_~tmp~0#1.offset;kmalloc_array_~n#1 := kmalloc_array_#in~n#1;kmalloc_array_~size#1 := kmalloc_array_#in~size#1;kmalloc_array_~flags#1 := kmalloc_array_#in~flags#1;havoc kmalloc_array_~tmp~0#1.base, kmalloc_array_~tmp~0#1.offset; {61947#false} is VALID [2022-02-20 21:54:19,059 INFO L290 TraceCheckUtils]: 87: Hoare triple {61947#false} assume 0 != kmalloc_array_~size#1 % 18446744073709551616 && 18446744073709551615 / (kmalloc_array_~size#1 % 18446744073709551616) % 18446744073709551616 < kmalloc_array_~n#1 % 18446744073709551616;kmalloc_array_#res#1.base, kmalloc_array_#res#1.offset := 0, 0; {61947#false} is VALID [2022-02-20 21:54:19,059 INFO L290 TraceCheckUtils]: 88: Hoare triple {61947#false} kcalloc_#t~ret20#1.base, kcalloc_#t~ret20#1.offset := kmalloc_array_#res#1.base, kmalloc_array_#res#1.offset;assume { :end_inline_kmalloc_array } true;kcalloc_~tmp~1#1.base, kcalloc_~tmp~1#1.offset := kcalloc_#t~ret20#1.base, kcalloc_#t~ret20#1.offset;havoc kcalloc_#t~ret20#1.base, kcalloc_#t~ret20#1.offset;kcalloc_#res#1.base, kcalloc_#res#1.offset := kcalloc_~tmp~1#1.base, kcalloc_~tmp~1#1.offset; {61947#false} is VALID [2022-02-20 21:54:19,059 INFO L290 TraceCheckUtils]: 89: Hoare triple {61947#false} init_x25_asy_#t~ret316#1.base, init_x25_asy_#t~ret316#1.offset := kcalloc_#res#1.base, kcalloc_#res#1.offset;assume { :end_inline_kcalloc } true;init_x25_asy_~tmp~34#1.base, init_x25_asy_~tmp~34#1.offset := init_x25_asy_#t~ret316#1.base, init_x25_asy_#t~ret316#1.offset;havoc init_x25_asy_#t~ret316#1.base, init_x25_asy_#t~ret316#1.offset;~x25_asy_devs~0.base, ~x25_asy_devs~0.offset := init_x25_asy_~tmp~34#1.base, init_x25_asy_~tmp~34#1.offset; {61947#false} is VALID [2022-02-20 21:54:19,059 INFO L290 TraceCheckUtils]: 90: Hoare triple {61947#false} assume 0 == (~x25_asy_devs~0.base + ~x25_asy_devs~0.offset) % 18446744073709551616;init_x25_asy_#res#1 := -12; {61947#false} is VALID [2022-02-20 21:54:19,059 INFO L290 TraceCheckUtils]: 91: Hoare triple {61947#false} main_#t~ret353#1 := init_x25_asy_#res#1;assume { :end_inline_init_x25_asy } true;assume -2147483648 <= main_#t~ret353#1 && main_#t~ret353#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret353#1;havoc main_#t~ret353#1; {61947#false} is VALID [2022-02-20 21:54:19,059 INFO L290 TraceCheckUtils]: 92: Hoare triple {61947#false} assume !(0 == ~ldv_retval_1~0); {61947#false} is VALID [2022-02-20 21:54:19,059 INFO L290 TraceCheckUtils]: 93: Hoare triple {61947#false} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {61947#false} is VALID [2022-02-20 21:54:19,059 INFO L290 TraceCheckUtils]: 94: Hoare triple {61947#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret383#1, ldv_check_final_state_~tmp___7~7#1;havoc ldv_check_final_state_~tmp___7~7#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); {61947#false} is VALID [2022-02-20 21:54:19,059 INFO L290 TraceCheckUtils]: 95: Hoare triple {61947#false} ldv_check_final_state_#t~ret383#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret383#1 && ldv_check_final_state_#t~ret383#1 <= 2147483647;ldv_check_final_state_~tmp___7~7#1 := ldv_check_final_state_#t~ret383#1;havoc ldv_check_final_state_#t~ret383#1; {61947#false} is VALID [2022-02-20 21:54:19,060 INFO L290 TraceCheckUtils]: 96: Hoare triple {61947#false} assume !(0 != ldv_check_final_state_~tmp___7~7#1); {61947#false} is VALID [2022-02-20 21:54:19,060 INFO L272 TraceCheckUtils]: 97: Hoare triple {61947#false} call ldv_error(); {61947#false} is VALID [2022-02-20 21:54:19,060 INFO L290 TraceCheckUtils]: 98: Hoare triple {61947#false} assume !false; {61947#false} is VALID [2022-02-20 21:54:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 21:54:19,060 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:54:19,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982695244] [2022-02-20 21:54:19,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982695244] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:54:19,061 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:54:19,061 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:54:19,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779280019] [2022-02-20 21:54:19,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:54:19,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2022-02-20 21:54:19,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:54:19,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 21:54:19,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:19,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:54:19,123 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:54:19,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:54:19,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:54:19,123 INFO L87 Difference]: Start difference. First operand 4985 states and 7049 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)