./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.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_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.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 f78e25bf76e2d1d395e5e41868c5ddb628a36f1efdf095bb509ea6a3a366617b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:54:50,998 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:54:51,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:54:51,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:54:51,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:54:51,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:54:51,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:54:51,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:54:51,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:54:51,036 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:54:51,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:54:51,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:54:51,038 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:54:51,039 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:54:51,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:54:51,041 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:54:51,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:54:51,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:54:51,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:54:51,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:54:51,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:54:51,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:54:51,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:54:51,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:54:51,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:54:51,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:54:51,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:54:51,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:54:51,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:54:51,055 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:54:51,055 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:54:51,056 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:54:51,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:54:51,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:54:51,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:54:51,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:54:51,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:54:51,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:54:51,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:54:51,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:54:51,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:54:51,066 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:54:51,094 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:54:51,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:54:51,097 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:54:51,098 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:54:51,098 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:54:51,099 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:54:51,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:54:51,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:54:51,100 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:54:51,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:54:51,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:54:51,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:54:51,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:54:51,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:54:51,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:54:51,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:54:51,102 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:54:51,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:54:51,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:54:51,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:54:51,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:54:51,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:54:51,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:54:51,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:54:51,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:54:51,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:54:51,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:54:51,104 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:54:51,104 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:54:51,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:54:51,105 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 -> f78e25bf76e2d1d395e5e41868c5ddb628a36f1efdf095bb509ea6a3a366617b [2022-02-20 21:54:51,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:54:51,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:54:51,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:54:51,349 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:54:51,349 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:54:51,351 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_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2022-02-20 21:54:51,407 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63ff10033/738cdefdf992469f8dec7e3a5946c8da/FLAG8729d575a [2022-02-20 21:54:52,024 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:54:52,025 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2022-02-20 21:54:52,056 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63ff10033/738cdefdf992469f8dec7e3a5946c8da/FLAG8729d575a [2022-02-20 21:54:52,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63ff10033/738cdefdf992469f8dec7e3a5946c8da [2022-02-20 21:54:52,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:54:52,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:54:52,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:54:52,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:54:52,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:54:52,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:54:52" (1/1) ... [2022-02-20 21:54:52,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eb0e368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:52, skipping insertion in model container [2022-02-20 21:54:52,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:54:52" (1/1) ... [2022-02-20 21:54:52,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:54:52,464 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:54:53,102 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_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i[162928,162941] [2022-02-20 21:54:53,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:54:53,483 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:54:53,612 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_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i[162928,162941] [2022-02-20 21:54:53,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:54:53,795 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:54:53,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:53 WrapperNode [2022-02-20 21:54:53,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:54:53,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:54:53,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:54:53,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:54:53,804 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:54:53" (1/1) ... [2022-02-20 21:54:53,850 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:54:53" (1/1) ... [2022-02-20 21:54:53,968 INFO L137 Inliner]: procedures = 180, calls = 578, calls flagged for inlining = 99, calls inlined = 93, statements flattened = 2426 [2022-02-20 21:54:53,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:54:53,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:54:53,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:54:53,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:54:53,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:53" (1/1) ... [2022-02-20 21:54:53,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:53" (1/1) ... [2022-02-20 21:54:53,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:53" (1/1) ... [2022-02-20 21:54:54,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:53" (1/1) ... [2022-02-20 21:54:54,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:53" (1/1) ... [2022-02-20 21:54:54,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:53" (1/1) ... [2022-02-20 21:54:54,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:53" (1/1) ... [2022-02-20 21:54:54,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:54:54,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:54:54,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:54:54,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:54:54,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:53" (1/1) ... [2022-02-20 21:54:54,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:54:54,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:54:54,212 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:54:54,229 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:54:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-02-20 21:54:54,256 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-02-20 21:54:54,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 21:54:54,256 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_push [2022-02-20 21:54:54,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_push [2022-02-20 21:54:54,256 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-02-20 21:54:54,256 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-02-20 21:54:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 21:54:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 21:54:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:54:54,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:54:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:54:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure crc_ccitt_byte [2022-02-20 21:54:54,257 INFO L138 BoogieDeclarations]: Found implementation of procedure crc_ccitt_byte [2022-02-20 21:54:54,258 INFO L130 BoogieDeclarations]: Found specification of procedure ap_put [2022-02-20 21:54:54,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_put [2022-02-20 21:54:54,258 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_output_wakeup [2022-02-20 21:54:54,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_output_wakeup [2022-02-20 21:54:54,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 21:54:54,258 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 21:54:54,259 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-02-20 21:54:54,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-02-20 21:54:54,259 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:54:54,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:54:54,259 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_hangup [2022-02-20 21:54:54,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_hangup [2022-02-20 21:54:54,259 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-02-20 21:54:54,260 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-02-20 21:54:54,260 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2022-02-20 21:54:54,260 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2022-02-20 21:54:54,260 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be16 [2022-02-20 21:54:54,260 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be16 [2022-02-20 21:54:54,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-02-20 21:54:54,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-02-20 21:54:54,261 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 21:54:54,261 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 21:54:54,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:54:54,261 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:54:54,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:54:54,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 21:54:54,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 21:54:54,262 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-02-20 21:54:54,262 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-02-20 21:54:54,262 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:54:54,262 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:54:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_close [2022-02-20 21:54:54,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_close [2022-02-20 21:54:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:54:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_poll [2022-02-20 21:54:54,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_poll [2022-02-20 21:54:54,264 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-02-20 21:54:54,264 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-02-20 21:54:54,264 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-02-20 21:54:54,264 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-02-20 21:54:54,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:54:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:54:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:54:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-02-20 21:54:54,266 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-02-20 21:54:54,266 INFO L130 BoogieDeclarations]: Found specification of procedure ap_get [2022-02-20 21:54:54,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_get [2022-02-20 21:54:54,267 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2022-02-20 21:54:54,267 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2022-02-20 21:54:54,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:54:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-02-20 21:54:54,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-02-20 21:54:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2022-02-20 21:54:54,268 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2022-02-20 21:54:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:54:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:54:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-02-20 21:54:54,269 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-02-20 21:54:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-02-20 21:54:54,269 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-02-20 21:54:54,270 INFO L130 BoogieDeclarations]: Found specification of procedure async_lcp_peek [2022-02-20 21:54:54,270 INFO L138 BoogieDeclarations]: Found implementation of procedure async_lcp_peek [2022-02-20 21:54:54,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:54:54,270 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-02-20 21:54:54,270 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-02-20 21:54:54,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 21:54:54,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 21:54:54,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 21:54:54,271 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-02-20 21:54:54,271 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-02-20 21:54:54,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:54:54,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:54:54,271 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_ioctl [2022-02-20 21:54:54,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_ioctl [2022-02-20 21:54:54,272 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-02-20 21:54:54,272 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-02-20 21:54:54,729 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:54:54,731 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:54:55,291 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:54:58,841 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:54:58,868 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:54:58,868 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 21:54:58,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:54:58 BoogieIcfgContainer [2022-02-20 21:54:58,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:54:58,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:54:58,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:54:58,880 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:54:58,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:54:52" (1/3) ... [2022-02-20 21:54:58,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422f212d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:54:58, skipping insertion in model container [2022-02-20 21:54:58,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:53" (2/3) ... [2022-02-20 21:54:58,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422f212d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:54:58, skipping insertion in model container [2022-02-20 21:54:58,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:54:58" (3/3) ... [2022-02-20 21:54:58,883 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2022-02-20 21:54:58,887 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:54:58,887 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:54:58,938 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:54:58,949 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:54:58,949 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:54:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 745 states, 591 states have (on average 1.4568527918781726) internal successors, (861), 605 states have internal predecessors, (861), 116 states have call successors, (116), 37 states have call predecessors, (116), 36 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-02-20 21:54:59,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 21:54:59,008 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:54:59,008 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,009 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:54:59,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:54:59,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1070293405, now seen corresponding path program 1 times [2022-02-20 21:54:59,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:54:59,027 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982632617] [2022-02-20 21:54:59,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:54:59,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:54:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:59,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:54:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:59,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {791#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {748#true} is VALID [2022-02-20 21:54:59,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {748#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {748#true} is VALID [2022-02-20 21:54:59,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {748#true} assume true; {748#true} is VALID [2022-02-20 21:54:59,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {748#true} {748#true} #2102#return; {748#true} is VALID [2022-02-20 21:54:59,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:54:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:59,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {791#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {748#true} is VALID [2022-02-20 21:54:59,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {748#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {748#true} is VALID [2022-02-20 21:54:59,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {748#true} assume true; {748#true} is VALID [2022-02-20 21:54:59,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {748#true} {748#true} #2104#return; {748#true} is VALID [2022-02-20 21:54:59,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:54:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:59,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {791#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {748#true} is VALID [2022-02-20 21:54:59,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {748#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {748#true} is VALID [2022-02-20 21:54:59,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {748#true} assume true; {748#true} is VALID [2022-02-20 21:54:59,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {748#true} {748#true} #2106#return; {748#true} is VALID [2022-02-20 21:54:59,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:54:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:59,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {791#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {748#true} is VALID [2022-02-20 21:54:59,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {748#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {748#true} is VALID [2022-02-20 21:54:59,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {748#true} assume true; {748#true} is VALID [2022-02-20 21:54:59,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {748#true} {748#true} #2108#return; {748#true} is VALID [2022-02-20 21:54:59,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 21:54:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:59,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {791#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {748#true} is VALID [2022-02-20 21:54:59,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {748#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {748#true} is VALID [2022-02-20 21:54:59,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {748#true} assume true; {748#true} is VALID [2022-02-20 21:54:59,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {748#true} {748#true} #2110#return; {748#true} is VALID [2022-02-20 21:54:59,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-20 21:54:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:59,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {791#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {748#true} is VALID [2022-02-20 21:54:59,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {748#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {748#true} is VALID [2022-02-20 21:54:59,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {748#true} assume true; {748#true} is VALID [2022-02-20 21:54:59,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {748#true} {748#true} #2112#return; {748#true} is VALID [2022-02-20 21:54:59,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 21:54:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:59,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {791#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {748#true} is VALID [2022-02-20 21:54:59,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {748#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {748#true} is VALID [2022-02-20 21:54:59,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {748#true} assume true; {748#true} is VALID [2022-02-20 21:54:59,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {748#true} {748#true} #2114#return; {748#true} is VALID [2022-02-20 21:54:59,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-02-20 21:54:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:59,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {791#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {748#true} is VALID [2022-02-20 21:54:59,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {748#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {748#true} is VALID [2022-02-20 21:54:59,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {748#true} assume true; {748#true} is VALID [2022-02-20 21:54:59,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {748#true} {748#true} #2116#return; {748#true} is VALID [2022-02-20 21:54:59,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 21:54:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:59,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {791#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {748#true} is VALID [2022-02-20 21:54:59,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {748#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {748#true} is VALID [2022-02-20 21:54:59,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {748#true} assume true; {748#true} is VALID [2022-02-20 21:54:59,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {748#true} {748#true} #2118#return; {748#true} is VALID [2022-02-20 21:54:59,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-02-20 21:54:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:59,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {791#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {748#true} is VALID [2022-02-20 21:54:59,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {748#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {748#true} is VALID [2022-02-20 21:54:59,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {748#true} assume true; {748#true} is VALID [2022-02-20 21:54:59,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {748#true} {748#true} #2120#return; {748#true} is VALID [2022-02-20 21:54:59,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {748#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(104, 2);call #Ultimate.allocInit(22, 3);call #Ultimate.allocInit(12, 4);call #Ultimate.allocInit(16, 5);call #Ultimate.allocInit(15, 6);call #Ultimate.allocInit(25, 7);call #Ultimate.allocInit(25, 8);call #Ultimate.allocInit(4, 9);call write~init~int(112, 9, 0, 1);call write~init~int(112, 9, 1, 1);call write~init~int(112, 9, 2, 1);call write~init~int(0, 9, 3, 1);call #Ultimate.allocInit(45, 10);call #Ultimate.allocInit(34, 11);call #Ultimate.allocInit(43, 12);~LDV_IN_INTERRUPT~0 := 1;~async_ops_group0~0.base, ~async_ops_group0~0.offset := 0, 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~ppp_ldisc_group1~0.base, ~ppp_ldisc_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~flag_time~0 := 250;~#async_ops~0.base, ~#async_ops~0.offset := 13, 0;call #Ultimate.allocInit(16, 13);call write~init~$Pointer$(#funAddr~ppp_async_send.base, #funAddr~ppp_async_send.offset, ~#async_ops~0.base, ~#async_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_async_ioctl.base, #funAddr~ppp_async_ioctl.offset, ~#async_ops~0.base, 8 + ~#async_ops~0.offset, 8);~#disc_data_lock~0.base, ~#disc_data_lock~0.offset := 14, 0;call #Ultimate.allocInit(68, 14);call write~init~int(0, ~#disc_data_lock~0.base, ~#disc_data_lock~0.offset, 4);call write~init~int(0, ~#disc_data_lock~0.base, 4 + ~#disc_data_lock~0.offset, 4);call write~init~int(3736018669, ~#disc_data_lock~0.base, 8 + ~#disc_data_lock~0.offset, 4);call write~init~int(4294967295, ~#disc_data_lock~0.base, 12 + ~#disc_data_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#disc_data_lock~0.base, 16 + ~#disc_data_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#disc_data_lock~0.base, 24 + ~#disc_data_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#disc_data_lock~0.base, 32 + ~#disc_data_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#disc_data_lock~0.base, 40 + ~#disc_data_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#disc_data_lock~0.base, 48 + ~#disc_data_lock~0.offset, 8);call write~init~int(0, ~#disc_data_lock~0.base, 56 + ~#disc_data_lock~0.offset, 4);call write~init~int(0, ~#disc_data_lock~0.base, 60 + ~#disc_data_lock~0.offset, 8);~#ppp_ldisc~0.base, ~#ppp_ldisc~0.offset := 15, 0;call #Ultimate.allocInit(160, 15);call write~init~int(21507, ~#ppp_ldisc~0.base, ~#ppp_ldisc~0.offset, 4);call write~init~$Pointer$(9, 0, ~#ppp_ldisc~0.base, 4 + ~#ppp_ldisc~0.offset, 8);call write~init~int(0, ~#ppp_ldisc~0.base, 12 + ~#ppp_ldisc~0.offset, 4);call write~init~int(0, ~#ppp_ldisc~0.base, 16 + ~#ppp_ldisc~0.offset, 4);call write~init~$Pointer$(#funAddr~ppp_asynctty_open.base, #funAddr~ppp_asynctty_open.offset, ~#ppp_ldisc~0.base, 20 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_close.base, #funAddr~ppp_asynctty_close.offset, ~#ppp_ldisc~0.base, 28 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_ldisc~0.base, 36 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_ldisc~0.base, 44 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_read.base, #funAddr~ppp_asynctty_read.offset, ~#ppp_ldisc~0.base, 52 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_write.base, #funAddr~ppp_asynctty_write.offset, ~#ppp_ldisc~0.base, 60 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_ioctl.base, #funAddr~ppp_asynctty_ioctl.offset, ~#ppp_ldisc~0.base, 68 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_ldisc~0.base, 76 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_ldisc~0.base, 84 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_poll.base, #funAddr~ppp_asynctty_poll.offset, ~#ppp_ldisc~0.base, 92 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_hangup.base, #funAddr~ppp_asynctty_hangup.offset, ~#ppp_ldisc~0.base, 100 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_receive.base, #funAddr~ppp_asynctty_receive.offset, ~#ppp_ldisc~0.base, 108 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_wakeup.base, #funAddr~ppp_asynctty_wakeup.offset, ~#ppp_ldisc~0.base, 116 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_ldisc~0.base, 124 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_ldisc~0.base, 132 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_ldisc~0.base, 140 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#ppp_ldisc~0.base, 148 + ~#ppp_ldisc~0.offset, 8);call write~init~int(0, ~#ppp_ldisc~0.base, 156 + ~#ppp_ldisc~0.offset, 4);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 16, 0;call #Ultimate.allocInit(120, 16);#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; {748#true} is VALID [2022-02-20 21:54:59,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {748#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet349#1, main_#t~ret350#1.base, main_#t~ret350#1.offset, main_#t~nondet351#1, main_#t~nondet352#1, main_#t~ret353#1.base, main_#t~ret353#1.offset, main_#t~ret354#1.base, main_#t~ret354#1.offset, main_#t~ret355#1.base, main_#t~ret355#1.offset, main_#t~nondet356#1, main_#t~nondet357#1, main_#t~ret358#1.base, main_#t~ret358#1.offset, main_#t~ret359#1.base, main_#t~ret359#1.offset, main_#t~ret360#1.base, main_#t~ret360#1.offset, main_#t~ret361#1.base, main_#t~ret361#1.offset, main_#t~ret362#1.base, main_#t~ret362#1.offset, main_#t~nondet363#1, main_#t~ret364#1.base, main_#t~ret364#1.offset, main_#t~nondet365#1, main_#t~nondet366#1, main_#t~switch367#1, main_#t~nondet368#1, main_#t~switch369#1, main_#t~ret370#1, main_#t~ret371#1, main_#t~ret372#1, main_#t~ret373#1, main_#t~ret374#1, main_#t~ret375#1, main_#t~ret376#1, main_#t~ret377#1, main_#t~ret378#1, main_#t~nondet379#1, main_#t~switch380#1, main_#t~ret381#1, main_#t~nondet382#1, main_#t~switch383#1, main_#t~ret384#1, main_#t~ret385#1, main_~ldvarg11~0#1, main_~tmp~35#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp___0~12#1.base, main_~tmp___0~12#1.offset, main_~ldvarg3~0#1, main_~tmp___1~7#1, main_~ldvarg0~0#1, main_~tmp___2~4#1, main_~ldvarg12~0#1.base, main_~ldvarg12~0#1.offset, main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___4~1#1.base, main_~tmp___4~1#1.offset, main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset, main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset, main_~ldvarg8~0#1, main_~tmp___6~1#1, main_~ldvarg1~0#1, main_~tmp___7~1#1, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___8~1#1.base, main_~tmp___8~1#1.offset, main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset, main_~tmp___9~1#1.base, main_~tmp___9~1#1.offset, main_~ldvarg10~0#1.base, main_~ldvarg10~0#1.offset, main_~tmp___10~1#1.base, main_~tmp___10~1#1.offset, main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset, main_~tmp___11~1#1.base, main_~tmp___11~1#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___12~1#1.base, main_~tmp___12~1#1.offset, main_~ldvarg14~0#1, main_~tmp___13~1#1, main_~ldvarg16~0#1.base, main_~ldvarg16~0#1.offset, main_~tmp___14~1#1.base, main_~tmp___14~1#1.offset, main_~ldvarg15~0#1, main_~tmp___15~1#1, main_~tmp___16~1#1, main_~tmp___17~1#1, main_~tmp___18~1#1, main_~tmp___19~1#1;havoc main_~ldvarg11~0#1;havoc main_~tmp~35#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp___0~12#1.base, main_~tmp___0~12#1.offset;havoc main_~ldvarg3~0#1;havoc main_~tmp___1~7#1;havoc main_~ldvarg0~0#1;havoc main_~tmp___2~4#1;havoc main_~ldvarg12~0#1.base, main_~ldvarg12~0#1.offset;havoc main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___4~1#1.base, main_~tmp___4~1#1.offset;havoc main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset;havoc main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;havoc main_~ldvarg8~0#1;havoc main_~tmp___6~1#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___7~1#1;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___8~1#1.base, main_~tmp___8~1#1.offset;havoc main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset;havoc main_~tmp___9~1#1.base, main_~tmp___9~1#1.offset;havoc main_~ldvarg10~0#1.base, main_~ldvarg10~0#1.offset;havoc main_~tmp___10~1#1.base, main_~tmp___10~1#1.offset;havoc main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset;havoc main_~tmp___11~1#1.base, main_~tmp___11~1#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___12~1#1.base, main_~tmp___12~1#1.offset;havoc main_~ldvarg14~0#1;havoc main_~tmp___13~1#1;havoc main_~ldvarg16~0#1.base, main_~ldvarg16~0#1.offset;havoc main_~tmp___14~1#1.base, main_~tmp___14~1#1.offset;havoc main_~ldvarg15~0#1;havoc main_~tmp___15~1#1;havoc main_~tmp___16~1#1;havoc main_~tmp___17~1#1;havoc main_~tmp___18~1#1;havoc main_~tmp___19~1#1;assume -2147483648 <= main_#t~nondet349#1 && main_#t~nondet349#1 <= 2147483647;main_~tmp~35#1 := main_#t~nondet349#1;havoc main_#t~nondet349#1;main_~ldvarg11~0#1 := main_~tmp~35#1; {748#true} is VALID [2022-02-20 21:54:59,590 INFO L272 TraceCheckUtils]: 2: Hoare triple {748#true} call main_#t~ret350#1.base, main_#t~ret350#1.offset := ldv_zalloc(512); {791#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:59,592 INFO L290 TraceCheckUtils]: 3: Hoare triple {791#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {748#true} is VALID [2022-02-20 21:54:59,593 INFO L290 TraceCheckUtils]: 4: Hoare triple {748#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {748#true} is VALID [2022-02-20 21:54:59,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {748#true} assume true; {748#true} is VALID [2022-02-20 21:54:59,593 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {748#true} {748#true} #2102#return; {748#true} is VALID [2022-02-20 21:54:59,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {748#true} main_~tmp___0~12#1.base, main_~tmp___0~12#1.offset := main_#t~ret350#1.base, main_#t~ret350#1.offset;havoc main_#t~ret350#1.base, main_#t~ret350#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp___0~12#1.base, main_~tmp___0~12#1.offset;assume -2147483648 <= main_#t~nondet351#1 && main_#t~nondet351#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet351#1;havoc main_#t~nondet351#1;main_~ldvarg3~0#1 := main_~tmp___1~7#1;main_~tmp___2~4#1 := main_#t~nondet352#1;havoc main_#t~nondet352#1;main_~ldvarg0~0#1 := main_~tmp___2~4#1; {748#true} is VALID [2022-02-20 21:54:59,597 INFO L272 TraceCheckUtils]: 8: Hoare triple {748#true} call main_#t~ret353#1.base, main_#t~ret353#1.offset := ldv_zalloc(1); {791#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:59,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {791#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {748#true} is VALID [2022-02-20 21:54:59,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {748#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {748#true} is VALID [2022-02-20 21:54:59,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {748#true} assume true; {748#true} is VALID [2022-02-20 21:54:59,600 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {748#true} {748#true} #2104#return; {748#true} is VALID [2022-02-20 21:54:59,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {748#true} main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset := main_#t~ret353#1.base, main_#t~ret353#1.offset;havoc main_#t~ret353#1.base, main_#t~ret353#1.offset;main_~ldvarg12~0#1.base, main_~ldvarg12~0#1.offset := main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset; {748#true} is VALID [2022-02-20 21:54:59,601 INFO L272 TraceCheckUtils]: 14: Hoare triple {748#true} call main_#t~ret354#1.base, main_#t~ret354#1.offset := ldv_zalloc(1); {791#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:59,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {791#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {748#true} is VALID [2022-02-20 21:54:59,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {748#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {748#true} is VALID [2022-02-20 21:54:59,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {748#true} assume true; {748#true} is VALID [2022-02-20 21:54:59,602 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {748#true} {748#true} #2106#return; {748#true} is VALID [2022-02-20 21:54:59,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {748#true} main_~tmp___4~1#1.base, main_~tmp___4~1#1.offset := main_#t~ret354#1.base, main_#t~ret354#1.offset;havoc main_#t~ret354#1.base, main_#t~ret354#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___4~1#1.base, main_~tmp___4~1#1.offset; {748#true} is VALID [2022-02-20 21:54:59,603 INFO L272 TraceCheckUtils]: 20: Hoare triple {748#true} call main_#t~ret355#1.base, main_#t~ret355#1.offset := ldv_zalloc(16); {791#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:59,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {791#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {748#true} is VALID [2022-02-20 21:54:59,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {748#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {748#true} is VALID [2022-02-20 21:54:59,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {748#true} assume true; {748#true} is VALID [2022-02-20 21:54:59,604 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {748#true} {748#true} #2108#return; {748#true} is VALID [2022-02-20 21:54:59,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {748#true} main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset := main_#t~ret355#1.base, main_#t~ret355#1.offset;havoc main_#t~ret355#1.base, main_#t~ret355#1.offset;main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset := main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;assume -2147483648 <= main_#t~nondet356#1 && main_#t~nondet356#1 <= 2147483647;main_~tmp___6~1#1 := main_#t~nondet356#1;havoc main_#t~nondet356#1;main_~ldvarg8~0#1 := main_~tmp___6~1#1;main_~tmp___7~1#1 := main_#t~nondet357#1;havoc main_#t~nondet357#1;main_~ldvarg1~0#1 := main_~tmp___7~1#1; {748#true} is VALID [2022-02-20 21:54:59,605 INFO L272 TraceCheckUtils]: 26: Hoare triple {748#true} call main_#t~ret358#1.base, main_#t~ret358#1.offset := ldv_zalloc(1); {791#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:59,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {791#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {748#true} is VALID [2022-02-20 21:54:59,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {748#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {748#true} is VALID [2022-02-20 21:54:59,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {748#true} assume true; {748#true} is VALID [2022-02-20 21:54:59,606 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {748#true} {748#true} #2110#return; {748#true} is VALID [2022-02-20 21:54:59,606 INFO L290 TraceCheckUtils]: 31: Hoare triple {748#true} main_~tmp___8~1#1.base, main_~tmp___8~1#1.offset := main_#t~ret358#1.base, main_#t~ret358#1.offset;havoc main_#t~ret358#1.base, main_#t~ret358#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___8~1#1.base, main_~tmp___8~1#1.offset; {748#true} is VALID [2022-02-20 21:54:59,607 INFO L272 TraceCheckUtils]: 32: Hoare triple {748#true} call main_#t~ret359#1.base, main_#t~ret359#1.offset := ldv_zalloc(512); {791#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:59,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {791#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {748#true} is VALID [2022-02-20 21:54:59,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {748#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {748#true} is VALID [2022-02-20 21:54:59,608 INFO L290 TraceCheckUtils]: 35: Hoare triple {748#true} assume true; {748#true} is VALID [2022-02-20 21:54:59,608 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {748#true} {748#true} #2112#return; {748#true} is VALID [2022-02-20 21:54:59,608 INFO L290 TraceCheckUtils]: 37: Hoare triple {748#true} main_~tmp___9~1#1.base, main_~tmp___9~1#1.offset := main_#t~ret359#1.base, main_#t~ret359#1.offset;havoc main_#t~ret359#1.base, main_#t~ret359#1.offset;main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset := main_~tmp___9~1#1.base, main_~tmp___9~1#1.offset; {748#true} is VALID [2022-02-20 21:54:59,609 INFO L272 TraceCheckUtils]: 38: Hoare triple {748#true} call main_#t~ret360#1.base, main_#t~ret360#1.offset := ldv_zalloc(512); {791#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:59,610 INFO L290 TraceCheckUtils]: 39: Hoare triple {791#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {748#true} is VALID [2022-02-20 21:54:59,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {748#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {748#true} is VALID [2022-02-20 21:54:59,610 INFO L290 TraceCheckUtils]: 41: Hoare triple {748#true} assume true; {748#true} is VALID [2022-02-20 21:54:59,611 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {748#true} {748#true} #2114#return; {748#true} is VALID [2022-02-20 21:54:59,611 INFO L290 TraceCheckUtils]: 43: Hoare triple {748#true} main_~tmp___10~1#1.base, main_~tmp___10~1#1.offset := main_#t~ret360#1.base, main_#t~ret360#1.offset;havoc main_#t~ret360#1.base, main_#t~ret360#1.offset;main_~ldvarg10~0#1.base, main_~ldvarg10~0#1.offset := main_~tmp___10~1#1.base, main_~tmp___10~1#1.offset; {748#true} is VALID [2022-02-20 21:54:59,612 INFO L272 TraceCheckUtils]: 44: Hoare triple {748#true} call main_#t~ret361#1.base, main_#t~ret361#1.offset := ldv_zalloc(1); {791#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:59,612 INFO L290 TraceCheckUtils]: 45: Hoare triple {791#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {748#true} is VALID [2022-02-20 21:54:59,612 INFO L290 TraceCheckUtils]: 46: Hoare triple {748#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {748#true} is VALID [2022-02-20 21:54:59,613 INFO L290 TraceCheckUtils]: 47: Hoare triple {748#true} assume true; {748#true} is VALID [2022-02-20 21:54:59,613 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {748#true} {748#true} #2116#return; {748#true} is VALID [2022-02-20 21:54:59,613 INFO L290 TraceCheckUtils]: 49: Hoare triple {748#true} main_~tmp___11~1#1.base, main_~tmp___11~1#1.offset := main_#t~ret361#1.base, main_#t~ret361#1.offset;havoc main_#t~ret361#1.base, main_#t~ret361#1.offset;main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset := main_~tmp___11~1#1.base, main_~tmp___11~1#1.offset; {748#true} is VALID [2022-02-20 21:54:59,614 INFO L272 TraceCheckUtils]: 50: Hoare triple {748#true} call main_#t~ret362#1.base, main_#t~ret362#1.offset := ldv_zalloc(512); {791#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:59,614 INFO L290 TraceCheckUtils]: 51: Hoare triple {791#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {748#true} is VALID [2022-02-20 21:54:59,614 INFO L290 TraceCheckUtils]: 52: Hoare triple {748#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {748#true} is VALID [2022-02-20 21:54:59,614 INFO L290 TraceCheckUtils]: 53: Hoare triple {748#true} assume true; {748#true} is VALID [2022-02-20 21:54:59,615 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {748#true} {748#true} #2118#return; {748#true} is VALID [2022-02-20 21:54:59,615 INFO L290 TraceCheckUtils]: 55: Hoare triple {748#true} main_~tmp___12~1#1.base, main_~tmp___12~1#1.offset := main_#t~ret362#1.base, main_#t~ret362#1.offset;havoc main_#t~ret362#1.base, main_#t~ret362#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___12~1#1.base, main_~tmp___12~1#1.offset;main_~tmp___13~1#1 := main_#t~nondet363#1;havoc main_#t~nondet363#1;main_~ldvarg14~0#1 := main_~tmp___13~1#1; {748#true} is VALID [2022-02-20 21:54:59,616 INFO L272 TraceCheckUtils]: 56: Hoare triple {748#true} call main_#t~ret364#1.base, main_#t~ret364#1.offset := ldv_zalloc(232); {791#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:59,616 INFO L290 TraceCheckUtils]: 57: Hoare triple {791#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {748#true} is VALID [2022-02-20 21:54:59,616 INFO L290 TraceCheckUtils]: 58: Hoare triple {748#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {748#true} is VALID [2022-02-20 21:54:59,617 INFO L290 TraceCheckUtils]: 59: Hoare triple {748#true} assume true; {748#true} is VALID [2022-02-20 21:54:59,619 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {748#true} {748#true} #2120#return; {748#true} is VALID [2022-02-20 21:54:59,619 INFO L290 TraceCheckUtils]: 61: Hoare triple {748#true} main_~tmp___14~1#1.base, main_~tmp___14~1#1.offset := main_#t~ret364#1.base, main_#t~ret364#1.offset;havoc main_#t~ret364#1.base, main_#t~ret364#1.offset;main_~ldvarg16~0#1.base, main_~ldvarg16~0#1.offset := main_~tmp___14~1#1.base, main_~tmp___14~1#1.offset;main_~tmp___15~1#1 := main_#t~nondet365#1;havoc main_#t~nondet365#1;main_~ldvarg15~0#1 := main_~tmp___15~1#1;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {748#true} is VALID [2022-02-20 21:54:59,620 INFO L290 TraceCheckUtils]: 62: Hoare triple {748#true} assume { :end_inline_ldv_set_init } true; {748#true} is VALID [2022-02-20 21:54:59,623 INFO L290 TraceCheckUtils]: 63: Hoare triple {748#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_2~0 := 0; {790#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:54:59,623 INFO L290 TraceCheckUtils]: 64: Hoare triple {790#(= ~ldv_state_variable_0~0 1)} assume -2147483648 <= main_#t~nondet366#1 && main_#t~nondet366#1 <= 2147483647;main_~tmp___16~1#1 := main_#t~nondet366#1;havoc main_#t~nondet366#1;main_#t~switch367#1 := 0 == main_~tmp___16~1#1; {790#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:54:59,624 INFO L290 TraceCheckUtils]: 65: Hoare triple {790#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch367#1;main_#t~switch367#1 := main_#t~switch367#1 || 1 == main_~tmp___16~1#1; {790#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:54:59,624 INFO L290 TraceCheckUtils]: 66: Hoare triple {790#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch367#1; {790#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:54:59,625 INFO L290 TraceCheckUtils]: 67: Hoare triple {790#(= ~ldv_state_variable_0~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet379#1 && main_#t~nondet379#1 <= 2147483647;main_~tmp___18~1#1 := main_#t~nondet379#1;havoc main_#t~nondet379#1;main_#t~switch380#1 := 0 == main_~tmp___18~1#1; {790#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:54:59,626 INFO L290 TraceCheckUtils]: 68: Hoare triple {790#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch380#1; {790#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:54:59,626 INFO L290 TraceCheckUtils]: 69: Hoare triple {790#(= ~ldv_state_variable_0~0 1)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_ppp_async_cleanup } true;havoc ppp_async_cleanup_#t~ret345#1, ppp_async_cleanup_#t~nondet346#1, ppp_async_cleanup_~tmp~32#1;havoc ppp_async_cleanup_~tmp~32#1;assume { :begin_inline_tty_unregister_ldisc } true;tty_unregister_ldisc_#in~arg0#1 := 3;havoc tty_unregister_ldisc_#res#1;havoc tty_unregister_ldisc_#t~nondet414#1, tty_unregister_ldisc_~arg0#1;tty_unregister_ldisc_~arg0#1 := tty_unregister_ldisc_#in~arg0#1;assume -2147483648 <= tty_unregister_ldisc_#t~nondet414#1 && tty_unregister_ldisc_#t~nondet414#1 <= 2147483647;tty_unregister_ldisc_#res#1 := tty_unregister_ldisc_#t~nondet414#1;havoc tty_unregister_ldisc_#t~nondet414#1; {749#false} is VALID [2022-02-20 21:54:59,627 INFO L290 TraceCheckUtils]: 70: Hoare triple {749#false} ppp_async_cleanup_#t~ret345#1 := tty_unregister_ldisc_#res#1;assume { :end_inline_tty_unregister_ldisc } true;assume -2147483648 <= ppp_async_cleanup_#t~ret345#1 && ppp_async_cleanup_#t~ret345#1 <= 2147483647;ppp_async_cleanup_~tmp~32#1 := ppp_async_cleanup_#t~ret345#1;havoc ppp_async_cleanup_#t~ret345#1; {749#false} is VALID [2022-02-20 21:54:59,628 INFO L290 TraceCheckUtils]: 71: Hoare triple {749#false} assume !(0 != ppp_async_cleanup_~tmp~32#1); {749#false} is VALID [2022-02-20 21:54:59,628 INFO L290 TraceCheckUtils]: 72: Hoare triple {749#false} assume { :end_inline_ppp_async_cleanup } true;~ldv_state_variable_0~0 := 2; {749#false} is VALID [2022-02-20 21:54:59,633 INFO L290 TraceCheckUtils]: 73: Hoare triple {749#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret397#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); {749#false} is VALID [2022-02-20 21:54:59,634 INFO L290 TraceCheckUtils]: 74: Hoare triple {749#false} ldv_check_final_state_#t~ret397#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret397#1 && ldv_check_final_state_#t~ret397#1 <= 2147483647;ldv_check_final_state_~tmp___7~7#1 := ldv_check_final_state_#t~ret397#1;havoc ldv_check_final_state_#t~ret397#1; {749#false} is VALID [2022-02-20 21:54:59,635 INFO L290 TraceCheckUtils]: 75: Hoare triple {749#false} assume !(0 != ldv_check_final_state_~tmp___7~7#1); {749#false} is VALID [2022-02-20 21:54:59,643 INFO L272 TraceCheckUtils]: 76: Hoare triple {749#false} call ldv_error(); {749#false} is VALID [2022-02-20 21:54:59,644 INFO L290 TraceCheckUtils]: 77: Hoare triple {749#false} assume !false; {749#false} is VALID [2022-02-20 21:54:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-02-20 21:54:59,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:54:59,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982632617] [2022-02-20 21:54:59,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982632617] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:54:59,646 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:54:59,646 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:54:59,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622326371] [2022-02-20 21:54:59,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:54:59,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 78 [2022-02-20 21:54:59,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:54:59,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 21:54:59,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:59,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:54:59,758 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:54:59,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:54:59,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:54:59,792 INFO L87 Difference]: Start difference. First operand has 745 states, 591 states have (on average 1.4568527918781726) internal successors, (861), 605 states have internal predecessors, (861), 116 states have call successors, (116), 37 states have call predecessors, (116), 36 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 21:55:07,863 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 21:55:12,765 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 21:55:13,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:13,358 INFO L93 Difference]: Finished difference Result 2318 states and 3473 transitions. [2022-02-20 21:55:13,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:55:13,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 78 [2022-02-20 21:55:13,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:55:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 21:55:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3473 transitions. [2022-02-20 21:55:13,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 21:55:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3473 transitions. [2022-02-20 21:55:13,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 3473 transitions. [2022-02-20 21:55:16,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3473 edges. 3473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:16,442 INFO L225 Difference]: With dead ends: 2318 [2022-02-20 21:55:16,442 INFO L226 Difference]: Without dead ends: 1560 [2022-02-20 21:55:16,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:55:16,458 INFO L933 BasicCegarLoop]: 1114 mSDtfsCounter, 1446 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 305 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 2221 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-02-20 21:55:16,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1541 Valid, 2221 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 885 Invalid, 2 Unknown, 0 Unchecked, 5.6s Time] [2022-02-20 21:55:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2022-02-20 21:55:16,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1388. [2022-02-20 21:55:16,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:55:16,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1560 states. Second operand has 1388 states, 1108 states have (on average 1.4296028880866427) internal successors, (1584), 1124 states have internal predecessors, (1584), 209 states have call successors, (209), 71 states have call predecessors, (209), 70 states have return successors, (208), 208 states have call predecessors, (208), 208 states have call successors, (208) [2022-02-20 21:55:16,624 INFO L74 IsIncluded]: Start isIncluded. First operand 1560 states. Second operand has 1388 states, 1108 states have (on average 1.4296028880866427) internal successors, (1584), 1124 states have internal predecessors, (1584), 209 states have call successors, (209), 71 states have call predecessors, (209), 70 states have return successors, (208), 208 states have call predecessors, (208), 208 states have call successors, (208) [2022-02-20 21:55:16,629 INFO L87 Difference]: Start difference. First operand 1560 states. Second operand has 1388 states, 1108 states have (on average 1.4296028880866427) internal successors, (1584), 1124 states have internal predecessors, (1584), 209 states have call successors, (209), 71 states have call predecessors, (209), 70 states have return successors, (208), 208 states have call predecessors, (208), 208 states have call successors, (208) [2022-02-20 21:55:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:16,762 INFO L93 Difference]: Finished difference Result 1560 states and 2275 transitions. [2022-02-20 21:55:16,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2275 transitions. [2022-02-20 21:55:16,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:16,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:16,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 1388 states, 1108 states have (on average 1.4296028880866427) internal successors, (1584), 1124 states have internal predecessors, (1584), 209 states have call successors, (209), 71 states have call predecessors, (209), 70 states have return successors, (208), 208 states have call predecessors, (208), 208 states have call successors, (208) Second operand 1560 states. [2022-02-20 21:55:16,779 INFO L87 Difference]: Start difference. First operand has 1388 states, 1108 states have (on average 1.4296028880866427) internal successors, (1584), 1124 states have internal predecessors, (1584), 209 states have call successors, (209), 71 states have call predecessors, (209), 70 states have return successors, (208), 208 states have call predecessors, (208), 208 states have call successors, (208) Second operand 1560 states. [2022-02-20 21:55:16,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:16,916 INFO L93 Difference]: Finished difference Result 1560 states and 2275 transitions. [2022-02-20 21:55:16,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2275 transitions. [2022-02-20 21:55:16,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:16,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:16,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:55:16,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:55:16,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1108 states have (on average 1.4296028880866427) internal successors, (1584), 1124 states have internal predecessors, (1584), 209 states have call successors, (209), 71 states have call predecessors, (209), 70 states have return successors, (208), 208 states have call predecessors, (208), 208 states have call successors, (208) [2022-02-20 21:55:17,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 2001 transitions. [2022-02-20 21:55:17,063 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 2001 transitions. Word has length 78 [2022-02-20 21:55:17,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:55:17,064 INFO L470 AbstractCegarLoop]: Abstraction has 1388 states and 2001 transitions. [2022-02-20 21:55:17,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 21:55:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 2001 transitions. [2022-02-20 21:55:17,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-20 21:55:17,069 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:55:17,069 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:17,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:55:17,069 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:55:17,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:55:17,070 INFO L85 PathProgramCache]: Analyzing trace with hash 192122725, now seen corresponding path program 1 times [2022-02-20 21:55:17,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:55:17,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075849087] [2022-02-20 21:55:17,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:55:17,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:55:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:17,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:17,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {9057#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {9012#true} is VALID [2022-02-20 21:55:17,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {9012#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {9012#true} is VALID [2022-02-20 21:55:17,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-02-20 21:55:17,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9012#true} {9012#true} #2102#return; {9012#true} is VALID [2022-02-20 21:55:17,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:55:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:17,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {9057#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {9012#true} is VALID [2022-02-20 21:55:17,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {9012#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {9012#true} is VALID [2022-02-20 21:55:17,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-02-20 21:55:17,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9012#true} {9012#true} #2104#return; {9012#true} is VALID [2022-02-20 21:55:17,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:55:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:17,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {9057#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {9012#true} is VALID [2022-02-20 21:55:17,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {9012#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {9012#true} is VALID [2022-02-20 21:55:17,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-02-20 21:55:17,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9012#true} {9012#true} #2106#return; {9012#true} is VALID [2022-02-20 21:55:17,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:55:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:17,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {9057#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {9012#true} is VALID [2022-02-20 21:55:17,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {9012#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {9012#true} is VALID [2022-02-20 21:55:17,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-02-20 21:55:17,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9012#true} {9012#true} #2108#return; {9012#true} is VALID [2022-02-20 21:55:17,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 21:55:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:17,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {9057#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {9012#true} is VALID [2022-02-20 21:55:17,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {9012#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {9012#true} is VALID [2022-02-20 21:55:17,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-02-20 21:55:17,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9012#true} {9012#true} #2110#return; {9012#true} is VALID [2022-02-20 21:55:17,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-20 21:55:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:17,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {9057#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {9012#true} is VALID [2022-02-20 21:55:17,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {9012#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {9012#true} is VALID [2022-02-20 21:55:17,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-02-20 21:55:17,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9012#true} {9012#true} #2112#return; {9012#true} is VALID [2022-02-20 21:55:17,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 21:55:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:17,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {9057#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {9012#true} is VALID [2022-02-20 21:55:17,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {9012#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {9012#true} is VALID [2022-02-20 21:55:17,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-02-20 21:55:17,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9012#true} {9012#true} #2114#return; {9012#true} is VALID [2022-02-20 21:55:17,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-02-20 21:55:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:17,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {9057#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {9012#true} is VALID [2022-02-20 21:55:17,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {9012#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {9012#true} is VALID [2022-02-20 21:55:17,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-02-20 21:55:17,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9012#true} {9012#true} #2116#return; {9012#true} is VALID [2022-02-20 21:55:17,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 21:55:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:17,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {9057#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {9012#true} is VALID [2022-02-20 21:55:17,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {9012#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {9012#true} is VALID [2022-02-20 21:55:17,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-02-20 21:55:17,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9012#true} {9012#true} #2118#return; {9012#true} is VALID [2022-02-20 21:55:17,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-02-20 21:55:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:17,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {9057#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {9012#true} is VALID [2022-02-20 21:55:17,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {9012#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {9012#true} is VALID [2022-02-20 21:55:17,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-02-20 21:55:17,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9012#true} {9012#true} #2120#return; {9012#true} is VALID [2022-02-20 21:55:17,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {9012#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(104, 2);call #Ultimate.allocInit(22, 3);call #Ultimate.allocInit(12, 4);call #Ultimate.allocInit(16, 5);call #Ultimate.allocInit(15, 6);call #Ultimate.allocInit(25, 7);call #Ultimate.allocInit(25, 8);call #Ultimate.allocInit(4, 9);call write~init~int(112, 9, 0, 1);call write~init~int(112, 9, 1, 1);call write~init~int(112, 9, 2, 1);call write~init~int(0, 9, 3, 1);call #Ultimate.allocInit(45, 10);call #Ultimate.allocInit(34, 11);call #Ultimate.allocInit(43, 12);~LDV_IN_INTERRUPT~0 := 1;~async_ops_group0~0.base, ~async_ops_group0~0.offset := 0, 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~ppp_ldisc_group1~0.base, ~ppp_ldisc_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~flag_time~0 := 250;~#async_ops~0.base, ~#async_ops~0.offset := 13, 0;call #Ultimate.allocInit(16, 13);call write~init~$Pointer$(#funAddr~ppp_async_send.base, #funAddr~ppp_async_send.offset, ~#async_ops~0.base, ~#async_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_async_ioctl.base, #funAddr~ppp_async_ioctl.offset, ~#async_ops~0.base, 8 + ~#async_ops~0.offset, 8);~#disc_data_lock~0.base, ~#disc_data_lock~0.offset := 14, 0;call #Ultimate.allocInit(68, 14);call write~init~int(0, ~#disc_data_lock~0.base, ~#disc_data_lock~0.offset, 4);call write~init~int(0, ~#disc_data_lock~0.base, 4 + ~#disc_data_lock~0.offset, 4);call write~init~int(3736018669, ~#disc_data_lock~0.base, 8 + ~#disc_data_lock~0.offset, 4);call write~init~int(4294967295, ~#disc_data_lock~0.base, 12 + ~#disc_data_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#disc_data_lock~0.base, 16 + ~#disc_data_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#disc_data_lock~0.base, 24 + ~#disc_data_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#disc_data_lock~0.base, 32 + ~#disc_data_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#disc_data_lock~0.base, 40 + ~#disc_data_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#disc_data_lock~0.base, 48 + ~#disc_data_lock~0.offset, 8);call write~init~int(0, ~#disc_data_lock~0.base, 56 + ~#disc_data_lock~0.offset, 4);call write~init~int(0, ~#disc_data_lock~0.base, 60 + ~#disc_data_lock~0.offset, 8);~#ppp_ldisc~0.base, ~#ppp_ldisc~0.offset := 15, 0;call #Ultimate.allocInit(160, 15);call write~init~int(21507, ~#ppp_ldisc~0.base, ~#ppp_ldisc~0.offset, 4);call write~init~$Pointer$(9, 0, ~#ppp_ldisc~0.base, 4 + ~#ppp_ldisc~0.offset, 8);call write~init~int(0, ~#ppp_ldisc~0.base, 12 + ~#ppp_ldisc~0.offset, 4);call write~init~int(0, ~#ppp_ldisc~0.base, 16 + ~#ppp_ldisc~0.offset, 4);call write~init~$Pointer$(#funAddr~ppp_asynctty_open.base, #funAddr~ppp_asynctty_open.offset, ~#ppp_ldisc~0.base, 20 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_close.base, #funAddr~ppp_asynctty_close.offset, ~#ppp_ldisc~0.base, 28 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_ldisc~0.base, 36 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_ldisc~0.base, 44 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_read.base, #funAddr~ppp_asynctty_read.offset, ~#ppp_ldisc~0.base, 52 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_write.base, #funAddr~ppp_asynctty_write.offset, ~#ppp_ldisc~0.base, 60 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_ioctl.base, #funAddr~ppp_asynctty_ioctl.offset, ~#ppp_ldisc~0.base, 68 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_ldisc~0.base, 76 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_ldisc~0.base, 84 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_poll.base, #funAddr~ppp_asynctty_poll.offset, ~#ppp_ldisc~0.base, 92 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_hangup.base, #funAddr~ppp_asynctty_hangup.offset, ~#ppp_ldisc~0.base, 100 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_receive.base, #funAddr~ppp_asynctty_receive.offset, ~#ppp_ldisc~0.base, 108 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_wakeup.base, #funAddr~ppp_asynctty_wakeup.offset, ~#ppp_ldisc~0.base, 116 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_ldisc~0.base, 124 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_ldisc~0.base, 132 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_ldisc~0.base, 140 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#ppp_ldisc~0.base, 148 + ~#ppp_ldisc~0.offset, 8);call write~init~int(0, ~#ppp_ldisc~0.base, 156 + ~#ppp_ldisc~0.offset, 4);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 16, 0;call #Ultimate.allocInit(120, 16);#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; {9012#true} is VALID [2022-02-20 21:55:17,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {9012#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet349#1, main_#t~ret350#1.base, main_#t~ret350#1.offset, main_#t~nondet351#1, main_#t~nondet352#1, main_#t~ret353#1.base, main_#t~ret353#1.offset, main_#t~ret354#1.base, main_#t~ret354#1.offset, main_#t~ret355#1.base, main_#t~ret355#1.offset, main_#t~nondet356#1, main_#t~nondet357#1, main_#t~ret358#1.base, main_#t~ret358#1.offset, main_#t~ret359#1.base, main_#t~ret359#1.offset, main_#t~ret360#1.base, main_#t~ret360#1.offset, main_#t~ret361#1.base, main_#t~ret361#1.offset, main_#t~ret362#1.base, main_#t~ret362#1.offset, main_#t~nondet363#1, main_#t~ret364#1.base, main_#t~ret364#1.offset, main_#t~nondet365#1, main_#t~nondet366#1, main_#t~switch367#1, main_#t~nondet368#1, main_#t~switch369#1, main_#t~ret370#1, main_#t~ret371#1, main_#t~ret372#1, main_#t~ret373#1, main_#t~ret374#1, main_#t~ret375#1, main_#t~ret376#1, main_#t~ret377#1, main_#t~ret378#1, main_#t~nondet379#1, main_#t~switch380#1, main_#t~ret381#1, main_#t~nondet382#1, main_#t~switch383#1, main_#t~ret384#1, main_#t~ret385#1, main_~ldvarg11~0#1, main_~tmp~35#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp___0~12#1.base, main_~tmp___0~12#1.offset, main_~ldvarg3~0#1, main_~tmp___1~7#1, main_~ldvarg0~0#1, main_~tmp___2~4#1, main_~ldvarg12~0#1.base, main_~ldvarg12~0#1.offset, main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___4~1#1.base, main_~tmp___4~1#1.offset, main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset, main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset, main_~ldvarg8~0#1, main_~tmp___6~1#1, main_~ldvarg1~0#1, main_~tmp___7~1#1, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___8~1#1.base, main_~tmp___8~1#1.offset, main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset, main_~tmp___9~1#1.base, main_~tmp___9~1#1.offset, main_~ldvarg10~0#1.base, main_~ldvarg10~0#1.offset, main_~tmp___10~1#1.base, main_~tmp___10~1#1.offset, main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset, main_~tmp___11~1#1.base, main_~tmp___11~1#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___12~1#1.base, main_~tmp___12~1#1.offset, main_~ldvarg14~0#1, main_~tmp___13~1#1, main_~ldvarg16~0#1.base, main_~ldvarg16~0#1.offset, main_~tmp___14~1#1.base, main_~tmp___14~1#1.offset, main_~ldvarg15~0#1, main_~tmp___15~1#1, main_~tmp___16~1#1, main_~tmp___17~1#1, main_~tmp___18~1#1, main_~tmp___19~1#1;havoc main_~ldvarg11~0#1;havoc main_~tmp~35#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp___0~12#1.base, main_~tmp___0~12#1.offset;havoc main_~ldvarg3~0#1;havoc main_~tmp___1~7#1;havoc main_~ldvarg0~0#1;havoc main_~tmp___2~4#1;havoc main_~ldvarg12~0#1.base, main_~ldvarg12~0#1.offset;havoc main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___4~1#1.base, main_~tmp___4~1#1.offset;havoc main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset;havoc main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;havoc main_~ldvarg8~0#1;havoc main_~tmp___6~1#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___7~1#1;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___8~1#1.base, main_~tmp___8~1#1.offset;havoc main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset;havoc main_~tmp___9~1#1.base, main_~tmp___9~1#1.offset;havoc main_~ldvarg10~0#1.base, main_~ldvarg10~0#1.offset;havoc main_~tmp___10~1#1.base, main_~tmp___10~1#1.offset;havoc main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset;havoc main_~tmp___11~1#1.base, main_~tmp___11~1#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___12~1#1.base, main_~tmp___12~1#1.offset;havoc main_~ldvarg14~0#1;havoc main_~tmp___13~1#1;havoc main_~ldvarg16~0#1.base, main_~ldvarg16~0#1.offset;havoc main_~tmp___14~1#1.base, main_~tmp___14~1#1.offset;havoc main_~ldvarg15~0#1;havoc main_~tmp___15~1#1;havoc main_~tmp___16~1#1;havoc main_~tmp___17~1#1;havoc main_~tmp___18~1#1;havoc main_~tmp___19~1#1;assume -2147483648 <= main_#t~nondet349#1 && main_#t~nondet349#1 <= 2147483647;main_~tmp~35#1 := main_#t~nondet349#1;havoc main_#t~nondet349#1;main_~ldvarg11~0#1 := main_~tmp~35#1; {9012#true} is VALID [2022-02-20 21:55:17,328 INFO L272 TraceCheckUtils]: 2: Hoare triple {9012#true} call main_#t~ret350#1.base, main_#t~ret350#1.offset := ldv_zalloc(512); {9057#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:17,329 INFO L290 TraceCheckUtils]: 3: Hoare triple {9057#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {9012#true} is VALID [2022-02-20 21:55:17,329 INFO L290 TraceCheckUtils]: 4: Hoare triple {9012#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {9012#true} is VALID [2022-02-20 21:55:17,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-02-20 21:55:17,329 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9012#true} {9012#true} #2102#return; {9012#true} is VALID [2022-02-20 21:55:17,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {9012#true} main_~tmp___0~12#1.base, main_~tmp___0~12#1.offset := main_#t~ret350#1.base, main_#t~ret350#1.offset;havoc main_#t~ret350#1.base, main_#t~ret350#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp___0~12#1.base, main_~tmp___0~12#1.offset;assume -2147483648 <= main_#t~nondet351#1 && main_#t~nondet351#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet351#1;havoc main_#t~nondet351#1;main_~ldvarg3~0#1 := main_~tmp___1~7#1;main_~tmp___2~4#1 := main_#t~nondet352#1;havoc main_#t~nondet352#1;main_~ldvarg0~0#1 := main_~tmp___2~4#1; {9012#true} is VALID [2022-02-20 21:55:17,330 INFO L272 TraceCheckUtils]: 8: Hoare triple {9012#true} call main_#t~ret353#1.base, main_#t~ret353#1.offset := ldv_zalloc(1); {9057#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:17,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {9057#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {9012#true} is VALID [2022-02-20 21:55:17,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {9012#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {9012#true} is VALID [2022-02-20 21:55:17,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-02-20 21:55:17,331 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9012#true} {9012#true} #2104#return; {9012#true} is VALID [2022-02-20 21:55:17,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {9012#true} main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset := main_#t~ret353#1.base, main_#t~ret353#1.offset;havoc main_#t~ret353#1.base, main_#t~ret353#1.offset;main_~ldvarg12~0#1.base, main_~ldvarg12~0#1.offset := main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset; {9012#true} is VALID [2022-02-20 21:55:17,332 INFO L272 TraceCheckUtils]: 14: Hoare triple {9012#true} call main_#t~ret354#1.base, main_#t~ret354#1.offset := ldv_zalloc(1); {9057#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:17,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {9057#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {9012#true} is VALID [2022-02-20 21:55:17,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {9012#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {9012#true} is VALID [2022-02-20 21:55:17,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-02-20 21:55:17,333 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9012#true} {9012#true} #2106#return; {9012#true} is VALID [2022-02-20 21:55:17,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {9012#true} main_~tmp___4~1#1.base, main_~tmp___4~1#1.offset := main_#t~ret354#1.base, main_#t~ret354#1.offset;havoc main_#t~ret354#1.base, main_#t~ret354#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___4~1#1.base, main_~tmp___4~1#1.offset; {9012#true} is VALID [2022-02-20 21:55:17,333 INFO L272 TraceCheckUtils]: 20: Hoare triple {9012#true} call main_#t~ret355#1.base, main_#t~ret355#1.offset := ldv_zalloc(16); {9057#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:17,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {9057#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {9012#true} is VALID [2022-02-20 21:55:17,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {9012#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {9012#true} is VALID [2022-02-20 21:55:17,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-02-20 21:55:17,334 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9012#true} {9012#true} #2108#return; {9012#true} is VALID [2022-02-20 21:55:17,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {9012#true} main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset := main_#t~ret355#1.base, main_#t~ret355#1.offset;havoc main_#t~ret355#1.base, main_#t~ret355#1.offset;main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset := main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;assume -2147483648 <= main_#t~nondet356#1 && main_#t~nondet356#1 <= 2147483647;main_~tmp___6~1#1 := main_#t~nondet356#1;havoc main_#t~nondet356#1;main_~ldvarg8~0#1 := main_~tmp___6~1#1;main_~tmp___7~1#1 := main_#t~nondet357#1;havoc main_#t~nondet357#1;main_~ldvarg1~0#1 := main_~tmp___7~1#1; {9012#true} is VALID [2022-02-20 21:55:17,335 INFO L272 TraceCheckUtils]: 26: Hoare triple {9012#true} call main_#t~ret358#1.base, main_#t~ret358#1.offset := ldv_zalloc(1); {9057#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:17,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {9057#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {9012#true} is VALID [2022-02-20 21:55:17,335 INFO L290 TraceCheckUtils]: 28: Hoare triple {9012#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {9012#true} is VALID [2022-02-20 21:55:17,336 INFO L290 TraceCheckUtils]: 29: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-02-20 21:55:17,336 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9012#true} {9012#true} #2110#return; {9012#true} is VALID [2022-02-20 21:55:17,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {9012#true} main_~tmp___8~1#1.base, main_~tmp___8~1#1.offset := main_#t~ret358#1.base, main_#t~ret358#1.offset;havoc main_#t~ret358#1.base, main_#t~ret358#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___8~1#1.base, main_~tmp___8~1#1.offset; {9012#true} is VALID [2022-02-20 21:55:17,337 INFO L272 TraceCheckUtils]: 32: Hoare triple {9012#true} call main_#t~ret359#1.base, main_#t~ret359#1.offset := ldv_zalloc(512); {9057#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:17,337 INFO L290 TraceCheckUtils]: 33: Hoare triple {9057#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {9012#true} is VALID [2022-02-20 21:55:17,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {9012#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {9012#true} is VALID [2022-02-20 21:55:17,337 INFO L290 TraceCheckUtils]: 35: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-02-20 21:55:17,337 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9012#true} {9012#true} #2112#return; {9012#true} is VALID [2022-02-20 21:55:17,338 INFO L290 TraceCheckUtils]: 37: Hoare triple {9012#true} main_~tmp___9~1#1.base, main_~tmp___9~1#1.offset := main_#t~ret359#1.base, main_#t~ret359#1.offset;havoc main_#t~ret359#1.base, main_#t~ret359#1.offset;main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset := main_~tmp___9~1#1.base, main_~tmp___9~1#1.offset; {9012#true} is VALID [2022-02-20 21:55:17,338 INFO L272 TraceCheckUtils]: 38: Hoare triple {9012#true} call main_#t~ret360#1.base, main_#t~ret360#1.offset := ldv_zalloc(512); {9057#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:17,338 INFO L290 TraceCheckUtils]: 39: Hoare triple {9057#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {9012#true} is VALID [2022-02-20 21:55:17,339 INFO L290 TraceCheckUtils]: 40: Hoare triple {9012#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {9012#true} is VALID [2022-02-20 21:55:17,339 INFO L290 TraceCheckUtils]: 41: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-02-20 21:55:17,339 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9012#true} {9012#true} #2114#return; {9012#true} is VALID [2022-02-20 21:55:17,339 INFO L290 TraceCheckUtils]: 43: Hoare triple {9012#true} main_~tmp___10~1#1.base, main_~tmp___10~1#1.offset := main_#t~ret360#1.base, main_#t~ret360#1.offset;havoc main_#t~ret360#1.base, main_#t~ret360#1.offset;main_~ldvarg10~0#1.base, main_~ldvarg10~0#1.offset := main_~tmp___10~1#1.base, main_~tmp___10~1#1.offset; {9012#true} is VALID [2022-02-20 21:55:17,340 INFO L272 TraceCheckUtils]: 44: Hoare triple {9012#true} call main_#t~ret361#1.base, main_#t~ret361#1.offset := ldv_zalloc(1); {9057#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:17,340 INFO L290 TraceCheckUtils]: 45: Hoare triple {9057#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {9012#true} is VALID [2022-02-20 21:55:17,340 INFO L290 TraceCheckUtils]: 46: Hoare triple {9012#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {9012#true} is VALID [2022-02-20 21:55:17,341 INFO L290 TraceCheckUtils]: 47: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-02-20 21:55:17,341 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9012#true} {9012#true} #2116#return; {9012#true} is VALID [2022-02-20 21:55:17,341 INFO L290 TraceCheckUtils]: 49: Hoare triple {9012#true} main_~tmp___11~1#1.base, main_~tmp___11~1#1.offset := main_#t~ret361#1.base, main_#t~ret361#1.offset;havoc main_#t~ret361#1.base, main_#t~ret361#1.offset;main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset := main_~tmp___11~1#1.base, main_~tmp___11~1#1.offset; {9012#true} is VALID [2022-02-20 21:55:17,342 INFO L272 TraceCheckUtils]: 50: Hoare triple {9012#true} call main_#t~ret362#1.base, main_#t~ret362#1.offset := ldv_zalloc(512); {9057#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:17,342 INFO L290 TraceCheckUtils]: 51: Hoare triple {9057#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {9012#true} is VALID [2022-02-20 21:55:17,342 INFO L290 TraceCheckUtils]: 52: Hoare triple {9012#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {9012#true} is VALID [2022-02-20 21:55:17,342 INFO L290 TraceCheckUtils]: 53: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-02-20 21:55:17,342 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9012#true} {9012#true} #2118#return; {9012#true} is VALID [2022-02-20 21:55:17,343 INFO L290 TraceCheckUtils]: 55: Hoare triple {9012#true} main_~tmp___12~1#1.base, main_~tmp___12~1#1.offset := main_#t~ret362#1.base, main_#t~ret362#1.offset;havoc main_#t~ret362#1.base, main_#t~ret362#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___12~1#1.base, main_~tmp___12~1#1.offset;main_~tmp___13~1#1 := main_#t~nondet363#1;havoc main_#t~nondet363#1;main_~ldvarg14~0#1 := main_~tmp___13~1#1; {9012#true} is VALID [2022-02-20 21:55:17,347 INFO L272 TraceCheckUtils]: 56: Hoare triple {9012#true} call main_#t~ret364#1.base, main_#t~ret364#1.offset := ldv_zalloc(232); {9057#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:17,348 INFO L290 TraceCheckUtils]: 57: Hoare triple {9057#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {9012#true} is VALID [2022-02-20 21:55:17,348 INFO L290 TraceCheckUtils]: 58: Hoare triple {9012#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {9012#true} is VALID [2022-02-20 21:55:17,348 INFO L290 TraceCheckUtils]: 59: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-02-20 21:55:17,348 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9012#true} {9012#true} #2120#return; {9012#true} is VALID [2022-02-20 21:55:17,349 INFO L290 TraceCheckUtils]: 61: Hoare triple {9012#true} main_~tmp___14~1#1.base, main_~tmp___14~1#1.offset := main_#t~ret364#1.base, main_#t~ret364#1.offset;havoc main_#t~ret364#1.base, main_#t~ret364#1.offset;main_~ldvarg16~0#1.base, main_~ldvarg16~0#1.offset := main_~tmp___14~1#1.base, main_~tmp___14~1#1.offset;main_~tmp___15~1#1 := main_#t~nondet365#1;havoc main_#t~nondet365#1;main_~ldvarg15~0#1 := main_~tmp___15~1#1;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {9054#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:17,349 INFO L290 TraceCheckUtils]: 62: Hoare triple {9054#(= ~last_index~0 0)} assume { :end_inline_ldv_set_init } true; {9054#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:17,350 INFO L290 TraceCheckUtils]: 63: Hoare triple {9054#(= ~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_2~0 := 0; {9054#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:17,350 INFO L290 TraceCheckUtils]: 64: Hoare triple {9054#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet366#1 && main_#t~nondet366#1 <= 2147483647;main_~tmp___16~1#1 := main_#t~nondet366#1;havoc main_#t~nondet366#1;main_#t~switch367#1 := 0 == main_~tmp___16~1#1; {9054#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:17,350 INFO L290 TraceCheckUtils]: 65: Hoare triple {9054#(= ~last_index~0 0)} assume !main_#t~switch367#1;main_#t~switch367#1 := main_#t~switch367#1 || 1 == main_~tmp___16~1#1; {9054#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:17,351 INFO L290 TraceCheckUtils]: 66: Hoare triple {9054#(= ~last_index~0 0)} assume main_#t~switch367#1; {9054#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:17,351 INFO L290 TraceCheckUtils]: 67: Hoare triple {9054#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet379#1 && main_#t~nondet379#1 <= 2147483647;main_~tmp___18~1#1 := main_#t~nondet379#1;havoc main_#t~nondet379#1;main_#t~switch380#1 := 0 == main_~tmp___18~1#1; {9054#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:17,352 INFO L290 TraceCheckUtils]: 68: Hoare triple {9054#(= ~last_index~0 0)} assume !main_#t~switch380#1;main_#t~switch380#1 := main_#t~switch380#1 || 1 == main_~tmp___18~1#1; {9054#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:17,352 INFO L290 TraceCheckUtils]: 69: Hoare triple {9054#(= ~last_index~0 0)} assume main_#t~switch380#1; {9054#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:17,353 INFO L290 TraceCheckUtils]: 70: Hoare triple {9054#(= ~last_index~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_ppp_async_init } true;havoc ppp_async_init_#res#1;havoc ppp_async_init_#t~ret160#1, ppp_async_init_#t~nondet161#1, ppp_async_init_~err~2#1;havoc ppp_async_init_~err~2#1;assume { :begin_inline_tty_register_ldisc } true;tty_register_ldisc_#in~arg0#1, tty_register_ldisc_#in~arg1#1.base, tty_register_ldisc_#in~arg1#1.offset := 3, ~#ppp_ldisc~0.base, ~#ppp_ldisc~0.offset;havoc tty_register_ldisc_#res#1;havoc tty_register_ldisc_#t~nondet412#1, tty_register_ldisc_~arg0#1, tty_register_ldisc_~arg1#1.base, tty_register_ldisc_~arg1#1.offset;tty_register_ldisc_~arg0#1 := tty_register_ldisc_#in~arg0#1;tty_register_ldisc_~arg1#1.base, tty_register_ldisc_~arg1#1.offset := tty_register_ldisc_#in~arg1#1.base, tty_register_ldisc_#in~arg1#1.offset;assume -2147483648 <= tty_register_ldisc_#t~nondet412#1 && tty_register_ldisc_#t~nondet412#1 <= 2147483647;tty_register_ldisc_#res#1 := tty_register_ldisc_#t~nondet412#1;havoc tty_register_ldisc_#t~nondet412#1; {9054#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:17,353 INFO L290 TraceCheckUtils]: 71: Hoare triple {9054#(= ~last_index~0 0)} ppp_async_init_#t~ret160#1 := tty_register_ldisc_#res#1;assume { :end_inline_tty_register_ldisc } true;assume -2147483648 <= ppp_async_init_#t~ret160#1 && ppp_async_init_#t~ret160#1 <= 2147483647;ppp_async_init_~err~2#1 := ppp_async_init_#t~ret160#1;havoc ppp_async_init_#t~ret160#1; {9054#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:17,354 INFO L290 TraceCheckUtils]: 72: Hoare triple {9054#(= ~last_index~0 0)} assume 0 != ppp_async_init_~err~2#1;havoc ppp_async_init_#t~nondet161#1; {9054#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:17,354 INFO L290 TraceCheckUtils]: 73: Hoare triple {9054#(= ~last_index~0 0)} ppp_async_init_#res#1 := ppp_async_init_~err~2#1; {9054#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:17,355 INFO L290 TraceCheckUtils]: 74: Hoare triple {9054#(= ~last_index~0 0)} main_#t~ret381#1 := ppp_async_init_#res#1;assume { :end_inline_ppp_async_init } true;assume -2147483648 <= main_#t~ret381#1 && main_#t~ret381#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret381#1;havoc main_#t~ret381#1; {9054#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:17,355 INFO L290 TraceCheckUtils]: 75: Hoare triple {9054#(= ~last_index~0 0)} assume !(0 == ~ldv_retval_1~0); {9054#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:17,355 INFO L290 TraceCheckUtils]: 76: Hoare triple {9054#(= ~last_index~0 0)} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {9054#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:17,356 INFO L290 TraceCheckUtils]: 77: Hoare triple {9054#(= ~last_index~0 0)} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret397#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); {9055#(<= 1 |ULTIMATE.start_ldv_set_is_empty_#res#1|)} is VALID [2022-02-20 21:55:17,356 INFO L290 TraceCheckUtils]: 78: Hoare triple {9055#(<= 1 |ULTIMATE.start_ldv_set_is_empty_#res#1|)} ldv_check_final_state_#t~ret397#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret397#1 && ldv_check_final_state_#t~ret397#1 <= 2147483647;ldv_check_final_state_~tmp___7~7#1 := ldv_check_final_state_#t~ret397#1;havoc ldv_check_final_state_#t~ret397#1; {9056#(<= 1 |ULTIMATE.start_ldv_check_final_state_~tmp___7~7#1|)} is VALID [2022-02-20 21:55:17,357 INFO L290 TraceCheckUtils]: 79: Hoare triple {9056#(<= 1 |ULTIMATE.start_ldv_check_final_state_~tmp___7~7#1|)} assume !(0 != ldv_check_final_state_~tmp___7~7#1); {9013#false} is VALID [2022-02-20 21:55:17,357 INFO L272 TraceCheckUtils]: 80: Hoare triple {9013#false} call ldv_error(); {9013#false} is VALID [2022-02-20 21:55:17,362 INFO L290 TraceCheckUtils]: 81: Hoare triple {9013#false} assume !false; {9013#false} is VALID [2022-02-20 21:55:17,363 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-02-20 21:55:17,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:55:17,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075849087] [2022-02-20 21:55:17,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075849087] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:55:17,364 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:55:17,364 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:55:17,364 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632835075] [2022-02-20 21:55:17,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:55:17,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 82 [2022-02-20 21:55:17,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:55:17,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 21:55:17,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:17,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:55:17,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:55:17,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:55:17,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:55:17,425 INFO L87 Difference]: Start difference. First operand 1388 states and 2001 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 21:55:27,745 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 21:55:36,623 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 21:55:37,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:37,939 INFO L93 Difference]: Finished difference Result 4449 states and 6499 transitions. [2022-02-20 21:55:37,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:55:37,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 82 [2022-02-20 21:55:37,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:55:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 21:55:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3313 transitions. [2022-02-20 21:55:37,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 21:55:38,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3313 transitions. [2022-02-20 21:55:38,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 3313 transitions. [2022-02-20 21:55:40,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3313 edges. 3313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:41,238 INFO L225 Difference]: With dead ends: 4449 [2022-02-20 21:55:41,238 INFO L226 Difference]: Without dead ends: 3079 [2022-02-20 21:55:41,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 21:55:41,242 INFO L933 BasicCegarLoop]: 1087 mSDtfsCounter, 1475 mSDsluCounter, 2462 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 315 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 3549 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-02-20 21:55:41,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1574 Valid, 3549 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 1856 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2022-02-20 21:55:41,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3079 states. [2022-02-20 21:55:41,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3079 to 2815. [2022-02-20 21:55:41,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:55:41,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3079 states. Second operand has 2815 states, 2249 states have (on average 1.4313028012449978) internal successors, (3219), 2287 states have internal predecessors, (3219), 417 states have call successors, (417), 141 states have call predecessors, (417), 148 states have return successors, (458), 418 states have call predecessors, (458), 416 states have call successors, (458) [2022-02-20 21:55:41,339 INFO L74 IsIncluded]: Start isIncluded. First operand 3079 states. Second operand has 2815 states, 2249 states have (on average 1.4313028012449978) internal successors, (3219), 2287 states have internal predecessors, (3219), 417 states have call successors, (417), 141 states have call predecessors, (417), 148 states have return successors, (458), 418 states have call predecessors, (458), 416 states have call successors, (458) [2022-02-20 21:55:41,345 INFO L87 Difference]: Start difference. First operand 3079 states. Second operand has 2815 states, 2249 states have (on average 1.4313028012449978) internal successors, (3219), 2287 states have internal predecessors, (3219), 417 states have call successors, (417), 141 states have call predecessors, (417), 148 states have return successors, (458), 418 states have call predecessors, (458), 416 states have call successors, (458) [2022-02-20 21:55:41,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:41,791 INFO L93 Difference]: Finished difference Result 3079 states and 4516 transitions. [2022-02-20 21:55:41,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3079 states and 4516 transitions. [2022-02-20 21:55:41,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:41,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:41,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 2815 states, 2249 states have (on average 1.4313028012449978) internal successors, (3219), 2287 states have internal predecessors, (3219), 417 states have call successors, (417), 141 states have call predecessors, (417), 148 states have return successors, (458), 418 states have call predecessors, (458), 416 states have call successors, (458) Second operand 3079 states. [2022-02-20 21:55:41,834 INFO L87 Difference]: Start difference. First operand has 2815 states, 2249 states have (on average 1.4313028012449978) internal successors, (3219), 2287 states have internal predecessors, (3219), 417 states have call successors, (417), 141 states have call predecessors, (417), 148 states have return successors, (458), 418 states have call predecessors, (458), 416 states have call successors, (458) Second operand 3079 states. [2022-02-20 21:55:42,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:42,186 INFO L93 Difference]: Finished difference Result 3079 states and 4516 transitions. [2022-02-20 21:55:42,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3079 states and 4516 transitions. [2022-02-20 21:55:42,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:42,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:42,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:55:42,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:55:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2815 states, 2249 states have (on average 1.4313028012449978) internal successors, (3219), 2287 states have internal predecessors, (3219), 417 states have call successors, (417), 141 states have call predecessors, (417), 148 states have return successors, (458), 418 states have call predecessors, (458), 416 states have call successors, (458) [2022-02-20 21:55:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 4094 transitions. [2022-02-20 21:55:42,671 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 4094 transitions. Word has length 82 [2022-02-20 21:55:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:55:42,671 INFO L470 AbstractCegarLoop]: Abstraction has 2815 states and 4094 transitions. [2022-02-20 21:55:42,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 21:55:42,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 4094 transitions. [2022-02-20 21:55:42,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-02-20 21:55:42,678 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:55:42,679 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:42,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:55:42,679 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:55:42,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:55:42,680 INFO L85 PathProgramCache]: Analyzing trace with hash 793541372, now seen corresponding path program 1 times [2022-02-20 21:55:42,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:55:42,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250397081] [2022-02-20 21:55:42,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:55:42,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:55:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:42,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:42,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {25267#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {25177#true} is VALID [2022-02-20 21:55:42,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {25177#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {25177#true} is VALID [2022-02-20 21:55:42,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:42,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25177#true} {25177#true} #2102#return; {25177#true} is VALID [2022-02-20 21:55:42,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:55:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:42,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {25267#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {25177#true} is VALID [2022-02-20 21:55:42,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {25177#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {25177#true} is VALID [2022-02-20 21:55:42,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:42,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25177#true} {25177#true} #2104#return; {25177#true} is VALID [2022-02-20 21:55:42,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:55:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:42,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {25267#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {25177#true} is VALID [2022-02-20 21:55:42,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {25177#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {25177#true} is VALID [2022-02-20 21:55:42,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:42,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25177#true} {25177#true} #2106#return; {25177#true} is VALID [2022-02-20 21:55:42,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 21:55:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:42,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {25267#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {25177#true} is VALID [2022-02-20 21:55:42,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {25177#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {25177#true} is VALID [2022-02-20 21:55:42,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:42,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25177#true} {25177#true} #2108#return; {25177#true} is VALID [2022-02-20 21:55:42,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 21:55:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:42,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {25267#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {25177#true} is VALID [2022-02-20 21:55:42,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {25177#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {25177#true} is VALID [2022-02-20 21:55:42,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:42,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25177#true} {25177#true} #2110#return; {25177#true} is VALID [2022-02-20 21:55:42,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-20 21:55:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:42,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {25267#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {25177#true} is VALID [2022-02-20 21:55:42,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {25177#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {25177#true} is VALID [2022-02-20 21:55:42,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:42,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25177#true} {25177#true} #2112#return; {25177#true} is VALID [2022-02-20 21:55:42,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 21:55:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:42,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {25267#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {25177#true} is VALID [2022-02-20 21:55:42,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {25177#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {25177#true} is VALID [2022-02-20 21:55:42,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:42,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25177#true} {25177#true} #2114#return; {25177#true} is VALID [2022-02-20 21:55:42,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-02-20 21:55:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:42,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {25267#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {25177#true} is VALID [2022-02-20 21:55:42,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {25177#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {25177#true} is VALID [2022-02-20 21:55:42,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:42,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25177#true} {25177#true} #2116#return; {25177#true} is VALID [2022-02-20 21:55:42,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 21:55:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:42,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {25267#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {25177#true} is VALID [2022-02-20 21:55:42,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {25177#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {25177#true} is VALID [2022-02-20 21:55:42,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:42,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25177#true} {25177#true} #2118#return; {25177#true} is VALID [2022-02-20 21:55:42,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-02-20 21:55:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:42,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {25267#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {25177#true} is VALID [2022-02-20 21:55:42,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {25177#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {25177#true} is VALID [2022-02-20 21:55:42,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:42,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25177#true} {25177#true} #2120#return; {25177#true} is VALID [2022-02-20 21:55:42,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-02-20 21:55:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:42,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 21:55:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:42,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {25177#true} ~v.base, ~v.offset := #in~v.base, #in~v.offset;havoc ~c~2;#res := (if 0 != ~c~2 then 1 else 0); {25177#true} is VALID [2022-02-20 21:55:42,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:42,940 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25177#true} {25177#true} #2092#return; {25177#true} is VALID [2022-02-20 21:55:42,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 21:55:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:42,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:42,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {25298#(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~5;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~5 := 0; {25177#true} is VALID [2022-02-20 21:55:42,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {25177#true} assume !false; {25177#true} is VALID [2022-02-20 21:55:42,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {25177#true} assume !(~i~5 < ~last_index~0); {25177#true} is VALID [2022-02-20 21:55:42,965 INFO L290 TraceCheckUtils]: 3: Hoare triple {25177#true} assume !(-1 != ~deleted_index~0); {25177#true} is VALID [2022-02-20 21:55:42,965 INFO L290 TraceCheckUtils]: 4: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:42,965 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {25177#true} {25177#true} #2078#return; {25177#true} is VALID [2022-02-20 21:55:42,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {25298#(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; {25177#true} is VALID [2022-02-20 21:55:42,967 INFO L272 TraceCheckUtils]: 1: Hoare triple {25177#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {25298#(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:55:42,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {25298#(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~5;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~5 := 0; {25177#true} is VALID [2022-02-20 21:55:42,967 INFO L290 TraceCheckUtils]: 3: Hoare triple {25177#true} assume !false; {25177#true} is VALID [2022-02-20 21:55:42,967 INFO L290 TraceCheckUtils]: 4: Hoare triple {25177#true} assume !(~i~5 < ~last_index~0); {25177#true} is VALID [2022-02-20 21:55:42,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {25177#true} assume !(-1 != ~deleted_index~0); {25177#true} is VALID [2022-02-20 21:55:42,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:42,968 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25177#true} {25177#true} #2078#return; {25177#true} is VALID [2022-02-20 21:55:42,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:42,968 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {25177#true} {25177#true} #2094#return; {25177#true} is VALID [2022-02-20 21:55:42,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 21:55:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:42,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:42,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {25298#(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~5;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~5 := 0; {25177#true} is VALID [2022-02-20 21:55:42,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {25177#true} assume !false; {25177#true} is VALID [2022-02-20 21:55:42,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {25177#true} assume !(~i~5 < ~last_index~0); {25177#true} is VALID [2022-02-20 21:55:42,983 INFO L290 TraceCheckUtils]: 3: Hoare triple {25177#true} assume -1 != ~deleted_index~0;~i~5 := 1 + ~deleted_index~0; {25177#true} is VALID [2022-02-20 21:55:42,984 INFO L290 TraceCheckUtils]: 4: Hoare triple {25177#true} assume !false; {25177#true} is VALID [2022-02-20 21:55:42,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {25177#true} assume !(~i~5 < ~last_index~0); {25177#true} is VALID [2022-02-20 21:55:42,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {25177#true} ~last_index~0 := ~last_index~0 - 1; {25177#true} is VALID [2022-02-20 21:55:42,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:42,985 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {25177#true} {25177#true} #2078#return; {25177#true} is VALID [2022-02-20 21:55:42,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {25298#(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; {25177#true} is VALID [2022-02-20 21:55:42,986 INFO L272 TraceCheckUtils]: 1: Hoare triple {25177#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {25298#(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:55:42,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {25298#(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~5;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~5 := 0; {25177#true} is VALID [2022-02-20 21:55:42,987 INFO L290 TraceCheckUtils]: 3: Hoare triple {25177#true} assume !false; {25177#true} is VALID [2022-02-20 21:55:42,987 INFO L290 TraceCheckUtils]: 4: Hoare triple {25177#true} assume !(~i~5 < ~last_index~0); {25177#true} is VALID [2022-02-20 21:55:42,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {25177#true} assume -1 != ~deleted_index~0;~i~5 := 1 + ~deleted_index~0; {25177#true} is VALID [2022-02-20 21:55:42,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {25177#true} assume !false; {25177#true} is VALID [2022-02-20 21:55:42,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {25177#true} assume !(~i~5 < ~last_index~0); {25177#true} is VALID [2022-02-20 21:55:42,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {25177#true} ~last_index~0 := ~last_index~0 - 1; {25177#true} is VALID [2022-02-20 21:55:42,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:42,988 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25177#true} {25177#true} #2078#return; {25177#true} is VALID [2022-02-20 21:55:42,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:42,988 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {25177#true} {25177#true} #2096#return; {25177#true} is VALID [2022-02-20 21:55:42,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 21:55:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:42,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {25314#(= |old(#valid)| |#valid|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call ULTIMATE.dealloc(~p.base, ~p.offset); {25177#true} is VALID [2022-02-20 21:55:43,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25177#true} {25177#true} #2098#return; {25177#true} is VALID [2022-02-20 21:55:43,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {25268#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~tty#1.base, ~tty#1.offset := #in~tty#1.base, #in~tty#1.offset;havoc ~ap~2#1.base, ~ap~2#1.offset;havoc ~tmp~20#1;assume { :begin_inline__raw_write_lock_irq } true;_raw_write_lock_irq_#in~arg0#1.base, _raw_write_lock_irq_#in~arg0#1.offset := ~#disc_data_lock~0.base, ~#disc_data_lock~0.offset;havoc _raw_write_lock_irq_~arg0#1.base, _raw_write_lock_irq_~arg0#1.offset;_raw_write_lock_irq_~arg0#1.base, _raw_write_lock_irq_~arg0#1.offset := _raw_write_lock_irq_#in~arg0#1.base, _raw_write_lock_irq_#in~arg0#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {25177#true} assume { :end_inline__raw_write_lock_irq } true;call #t~mem142#1.base, #t~mem142#1.offset := read~$Pointer$(~tty#1.base, 1509 + ~tty#1.offset, 8);~ap~2#1.base, ~ap~2#1.offset := #t~mem142#1.base, #t~mem142#1.offset;havoc #t~mem142#1.base, #t~mem142#1.offset;call write~$Pointer$(0, 0, ~tty#1.base, 1509 + ~tty#1.offset, 8);assume { :begin_inline__raw_write_unlock_irq } true;_raw_write_unlock_irq_#in~arg0#1.base, _raw_write_unlock_irq_#in~arg0#1.offset := ~#disc_data_lock~0.base, ~#disc_data_lock~0.offset;havoc _raw_write_unlock_irq_~arg0#1.base, _raw_write_unlock_irq_~arg0#1.offset;_raw_write_unlock_irq_~arg0#1.base, _raw_write_unlock_irq_~arg0#1.offset := _raw_write_unlock_irq_#in~arg0#1.base, _raw_write_unlock_irq_#in~arg0#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {25177#true} assume { :end_inline__raw_write_unlock_irq } true; {25177#true} is VALID [2022-02-20 21:55:43,006 INFO L290 TraceCheckUtils]: 3: Hoare triple {25177#true} assume !(0 == (~ap~2#1.base + ~ap~2#1.offset) % 18446744073709551616); {25177#true} is VALID [2022-02-20 21:55:43,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {25177#true} call #t~ret143#1 := atomic_dec_and_test(~ap~2#1.base, 386 + ~ap~2#1.offset); {25177#true} is VALID [2022-02-20 21:55:43,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {25177#true} ~v.base, ~v.offset := #in~v.base, #in~v.offset;havoc ~c~2;#res := (if 0 != ~c~2 then 1 else 0); {25177#true} is VALID [2022-02-20 21:55:43,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,006 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25177#true} {25177#true} #2092#return; {25177#true} is VALID [2022-02-20 21:55:43,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {25177#true} assume -2147483648 <= #t~ret143#1 && #t~ret143#1 <= 2147483647;~tmp~20#1 := #t~ret143#1;havoc #t~ret143#1; {25177#true} is VALID [2022-02-20 21:55:43,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {25177#true} assume !(0 == ~tmp~20#1); {25177#true} is VALID [2022-02-20 21:55:43,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {25177#true} assume { :begin_inline_tasklet_kill } true;tasklet_kill_#in~arg0#1.base, tasklet_kill_#in~arg0#1.offset := ~ap~2#1.base, 350 + ~ap~2#1.offset;havoc tasklet_kill_~arg0#1.base, tasklet_kill_~arg0#1.offset;tasklet_kill_~arg0#1.base, tasklet_kill_~arg0#1.offset := tasklet_kill_#in~arg0#1.base, tasklet_kill_#in~arg0#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {25177#true} assume { :end_inline_tasklet_kill } true;assume { :begin_inline_ppp_unregister_channel } true;ppp_unregister_channel_#in~arg0#1.base, ppp_unregister_channel_#in~arg0#1.offset := ~ap~2#1.base, 474 + ~ap~2#1.offset;havoc ppp_unregister_channel_~arg0#1.base, ppp_unregister_channel_~arg0#1.offset;ppp_unregister_channel_~arg0#1.base, ppp_unregister_channel_~arg0#1.offset := ppp_unregister_channel_#in~arg0#1.base, ppp_unregister_channel_#in~arg0#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {25177#true} assume { :end_inline_ppp_unregister_channel } true;call #t~mem144#1.base, #t~mem144#1.offset := read~$Pointer$(~ap~2#1.base, 250 + ~ap~2#1.offset, 8);assume { :begin_inline_ldv_kfree_skb_12 } true;ldv_kfree_skb_12_#in~ldv_func_arg1#1.base, ldv_kfree_skb_12_#in~ldv_func_arg1#1.offset := #t~mem144#1.base, #t~mem144#1.offset;havoc ldv_kfree_skb_12_~ldv_func_arg1#1.base, ldv_kfree_skb_12_~ldv_func_arg1#1.offset;ldv_kfree_skb_12_~ldv_func_arg1#1.base, ldv_kfree_skb_12_~ldv_func_arg1#1.offset := ldv_kfree_skb_12_#in~ldv_func_arg1#1.base, ldv_kfree_skb_12_#in~ldv_func_arg1#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,008 INFO L272 TraceCheckUtils]: 13: Hoare triple {25177#true} call ldv_skb_free(ldv_kfree_skb_12_~ldv_func_arg1#1.base, ldv_kfree_skb_12_~ldv_func_arg1#1.offset); {25298#(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:55:43,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {25298#(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; {25177#true} is VALID [2022-02-20 21:55:43,010 INFO L272 TraceCheckUtils]: 15: Hoare triple {25177#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {25298#(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:55:43,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {25298#(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~5;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~5 := 0; {25177#true} is VALID [2022-02-20 21:55:43,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {25177#true} assume !false; {25177#true} is VALID [2022-02-20 21:55:43,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {25177#true} assume !(~i~5 < ~last_index~0); {25177#true} is VALID [2022-02-20 21:55:43,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {25177#true} assume !(-1 != ~deleted_index~0); {25177#true} is VALID [2022-02-20 21:55:43,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,011 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {25177#true} {25177#true} #2078#return; {25177#true} is VALID [2022-02-20 21:55:43,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,011 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {25177#true} {25177#true} #2094#return; {25177#true} is VALID [2022-02-20 21:55:43,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {25177#true} assume { :end_inline_ldv_kfree_skb_12 } true;havoc #t~mem144#1.base, #t~mem144#1.offset;assume { :begin_inline_skb_queue_purge } true;skb_queue_purge_#in~arg0#1.base, skb_queue_purge_#in~arg0#1.offset := ~ap~2#1.base, 262 + ~ap~2#1.offset;havoc skb_queue_purge_~arg0#1.base, skb_queue_purge_~arg0#1.offset;skb_queue_purge_~arg0#1.base, skb_queue_purge_~arg0#1.offset := skb_queue_purge_#in~arg0#1.base, skb_queue_purge_#in~arg0#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {25177#true} assume { :end_inline_skb_queue_purge } true;call #t~mem145#1.base, #t~mem145#1.offset := read~$Pointer$(~ap~2#1.base, 212 + ~ap~2#1.offset, 8);assume { :begin_inline_ldv_kfree_skb_13 } true;ldv_kfree_skb_13_#in~ldv_func_arg1#1.base, ldv_kfree_skb_13_#in~ldv_func_arg1#1.offset := #t~mem145#1.base, #t~mem145#1.offset;havoc ldv_kfree_skb_13_~ldv_func_arg1#1.base, ldv_kfree_skb_13_~ldv_func_arg1#1.offset;ldv_kfree_skb_13_~ldv_func_arg1#1.base, ldv_kfree_skb_13_~ldv_func_arg1#1.offset := ldv_kfree_skb_13_#in~ldv_func_arg1#1.base, ldv_kfree_skb_13_#in~ldv_func_arg1#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,012 INFO L272 TraceCheckUtils]: 26: Hoare triple {25177#true} call ldv_skb_free(ldv_kfree_skb_13_~ldv_func_arg1#1.base, ldv_kfree_skb_13_~ldv_func_arg1#1.offset); {25298#(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:55:43,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {25298#(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; {25177#true} is VALID [2022-02-20 21:55:43,013 INFO L272 TraceCheckUtils]: 28: Hoare triple {25177#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {25298#(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:55:43,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {25298#(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~5;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~5 := 0; {25177#true} is VALID [2022-02-20 21:55:43,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {25177#true} assume !false; {25177#true} is VALID [2022-02-20 21:55:43,014 INFO L290 TraceCheckUtils]: 31: Hoare triple {25177#true} assume !(~i~5 < ~last_index~0); {25177#true} is VALID [2022-02-20 21:55:43,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {25177#true} assume -1 != ~deleted_index~0;~i~5 := 1 + ~deleted_index~0; {25177#true} is VALID [2022-02-20 21:55:43,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {25177#true} assume !false; {25177#true} is VALID [2022-02-20 21:55:43,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {25177#true} assume !(~i~5 < ~last_index~0); {25177#true} is VALID [2022-02-20 21:55:43,015 INFO L290 TraceCheckUtils]: 35: Hoare triple {25177#true} ~last_index~0 := ~last_index~0 - 1; {25177#true} is VALID [2022-02-20 21:55:43,015 INFO L290 TraceCheckUtils]: 36: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,015 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {25177#true} {25177#true} #2078#return; {25177#true} is VALID [2022-02-20 21:55:43,015 INFO L290 TraceCheckUtils]: 38: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,015 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {25177#true} {25177#true} #2096#return; {25177#true} is VALID [2022-02-20 21:55:43,015 INFO L290 TraceCheckUtils]: 40: Hoare triple {25177#true} assume { :end_inline_ldv_kfree_skb_13 } true;havoc #t~mem145#1.base, #t~mem145#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,016 INFO L272 TraceCheckUtils]: 41: Hoare triple {25177#true} call kfree(~ap~2#1.base, ~ap~2#1.offset); {25314#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 21:55:43,017 INFO L290 TraceCheckUtils]: 42: Hoare triple {25314#(= |old(#valid)| |#valid|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call ULTIMATE.dealloc(~p.base, ~p.offset); {25177#true} is VALID [2022-02-20 21:55:43,017 INFO L290 TraceCheckUtils]: 43: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,017 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {25177#true} {25177#true} #2098#return; {25177#true} is VALID [2022-02-20 21:55:43,018 INFO L290 TraceCheckUtils]: 45: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,018 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {25177#true} {25178#false} #2130#return; {25178#false} is VALID [2022-02-20 21:55:43,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {25177#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(104, 2);call #Ultimate.allocInit(22, 3);call #Ultimate.allocInit(12, 4);call #Ultimate.allocInit(16, 5);call #Ultimate.allocInit(15, 6);call #Ultimate.allocInit(25, 7);call #Ultimate.allocInit(25, 8);call #Ultimate.allocInit(4, 9);call write~init~int(112, 9, 0, 1);call write~init~int(112, 9, 1, 1);call write~init~int(112, 9, 2, 1);call write~init~int(0, 9, 3, 1);call #Ultimate.allocInit(45, 10);call #Ultimate.allocInit(34, 11);call #Ultimate.allocInit(43, 12);~LDV_IN_INTERRUPT~0 := 1;~async_ops_group0~0.base, ~async_ops_group0~0.offset := 0, 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~ppp_ldisc_group1~0.base, ~ppp_ldisc_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~flag_time~0 := 250;~#async_ops~0.base, ~#async_ops~0.offset := 13, 0;call #Ultimate.allocInit(16, 13);call write~init~$Pointer$(#funAddr~ppp_async_send.base, #funAddr~ppp_async_send.offset, ~#async_ops~0.base, ~#async_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_async_ioctl.base, #funAddr~ppp_async_ioctl.offset, ~#async_ops~0.base, 8 + ~#async_ops~0.offset, 8);~#disc_data_lock~0.base, ~#disc_data_lock~0.offset := 14, 0;call #Ultimate.allocInit(68, 14);call write~init~int(0, ~#disc_data_lock~0.base, ~#disc_data_lock~0.offset, 4);call write~init~int(0, ~#disc_data_lock~0.base, 4 + ~#disc_data_lock~0.offset, 4);call write~init~int(3736018669, ~#disc_data_lock~0.base, 8 + ~#disc_data_lock~0.offset, 4);call write~init~int(4294967295, ~#disc_data_lock~0.base, 12 + ~#disc_data_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#disc_data_lock~0.base, 16 + ~#disc_data_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#disc_data_lock~0.base, 24 + ~#disc_data_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#disc_data_lock~0.base, 32 + ~#disc_data_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#disc_data_lock~0.base, 40 + ~#disc_data_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#disc_data_lock~0.base, 48 + ~#disc_data_lock~0.offset, 8);call write~init~int(0, ~#disc_data_lock~0.base, 56 + ~#disc_data_lock~0.offset, 4);call write~init~int(0, ~#disc_data_lock~0.base, 60 + ~#disc_data_lock~0.offset, 8);~#ppp_ldisc~0.base, ~#ppp_ldisc~0.offset := 15, 0;call #Ultimate.allocInit(160, 15);call write~init~int(21507, ~#ppp_ldisc~0.base, ~#ppp_ldisc~0.offset, 4);call write~init~$Pointer$(9, 0, ~#ppp_ldisc~0.base, 4 + ~#ppp_ldisc~0.offset, 8);call write~init~int(0, ~#ppp_ldisc~0.base, 12 + ~#ppp_ldisc~0.offset, 4);call write~init~int(0, ~#ppp_ldisc~0.base, 16 + ~#ppp_ldisc~0.offset, 4);call write~init~$Pointer$(#funAddr~ppp_asynctty_open.base, #funAddr~ppp_asynctty_open.offset, ~#ppp_ldisc~0.base, 20 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_close.base, #funAddr~ppp_asynctty_close.offset, ~#ppp_ldisc~0.base, 28 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_ldisc~0.base, 36 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_ldisc~0.base, 44 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_read.base, #funAddr~ppp_asynctty_read.offset, ~#ppp_ldisc~0.base, 52 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_write.base, #funAddr~ppp_asynctty_write.offset, ~#ppp_ldisc~0.base, 60 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_ioctl.base, #funAddr~ppp_asynctty_ioctl.offset, ~#ppp_ldisc~0.base, 68 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_ldisc~0.base, 76 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_ldisc~0.base, 84 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_poll.base, #funAddr~ppp_asynctty_poll.offset, ~#ppp_ldisc~0.base, 92 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_hangup.base, #funAddr~ppp_asynctty_hangup.offset, ~#ppp_ldisc~0.base, 100 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_receive.base, #funAddr~ppp_asynctty_receive.offset, ~#ppp_ldisc~0.base, 108 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(#funAddr~ppp_asynctty_wakeup.base, #funAddr~ppp_asynctty_wakeup.offset, ~#ppp_ldisc~0.base, 116 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_ldisc~0.base, 124 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_ldisc~0.base, 132 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ppp_ldisc~0.base, 140 + ~#ppp_ldisc~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#ppp_ldisc~0.base, 148 + ~#ppp_ldisc~0.offset, 8);call write~init~int(0, ~#ppp_ldisc~0.base, 156 + ~#ppp_ldisc~0.offset, 4);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 16, 0;call #Ultimate.allocInit(120, 16);#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; {25177#true} is VALID [2022-02-20 21:55:43,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {25177#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet349#1, main_#t~ret350#1.base, main_#t~ret350#1.offset, main_#t~nondet351#1, main_#t~nondet352#1, main_#t~ret353#1.base, main_#t~ret353#1.offset, main_#t~ret354#1.base, main_#t~ret354#1.offset, main_#t~ret355#1.base, main_#t~ret355#1.offset, main_#t~nondet356#1, main_#t~nondet357#1, main_#t~ret358#1.base, main_#t~ret358#1.offset, main_#t~ret359#1.base, main_#t~ret359#1.offset, main_#t~ret360#1.base, main_#t~ret360#1.offset, main_#t~ret361#1.base, main_#t~ret361#1.offset, main_#t~ret362#1.base, main_#t~ret362#1.offset, main_#t~nondet363#1, main_#t~ret364#1.base, main_#t~ret364#1.offset, main_#t~nondet365#1, main_#t~nondet366#1, main_#t~switch367#1, main_#t~nondet368#1, main_#t~switch369#1, main_#t~ret370#1, main_#t~ret371#1, main_#t~ret372#1, main_#t~ret373#1, main_#t~ret374#1, main_#t~ret375#1, main_#t~ret376#1, main_#t~ret377#1, main_#t~ret378#1, main_#t~nondet379#1, main_#t~switch380#1, main_#t~ret381#1, main_#t~nondet382#1, main_#t~switch383#1, main_#t~ret384#1, main_#t~ret385#1, main_~ldvarg11~0#1, main_~tmp~35#1, main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset, main_~tmp___0~12#1.base, main_~tmp___0~12#1.offset, main_~ldvarg3~0#1, main_~tmp___1~7#1, main_~ldvarg0~0#1, main_~tmp___2~4#1, main_~ldvarg12~0#1.base, main_~ldvarg12~0#1.offset, main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___4~1#1.base, main_~tmp___4~1#1.offset, main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset, main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset, main_~ldvarg8~0#1, main_~tmp___6~1#1, main_~ldvarg1~0#1, main_~tmp___7~1#1, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___8~1#1.base, main_~tmp___8~1#1.offset, main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset, main_~tmp___9~1#1.base, main_~tmp___9~1#1.offset, main_~ldvarg10~0#1.base, main_~ldvarg10~0#1.offset, main_~tmp___10~1#1.base, main_~tmp___10~1#1.offset, main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset, main_~tmp___11~1#1.base, main_~tmp___11~1#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___12~1#1.base, main_~tmp___12~1#1.offset, main_~ldvarg14~0#1, main_~tmp___13~1#1, main_~ldvarg16~0#1.base, main_~ldvarg16~0#1.offset, main_~tmp___14~1#1.base, main_~tmp___14~1#1.offset, main_~ldvarg15~0#1, main_~tmp___15~1#1, main_~tmp___16~1#1, main_~tmp___17~1#1, main_~tmp___18~1#1, main_~tmp___19~1#1;havoc main_~ldvarg11~0#1;havoc main_~tmp~35#1;havoc main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset;havoc main_~tmp___0~12#1.base, main_~tmp___0~12#1.offset;havoc main_~ldvarg3~0#1;havoc main_~tmp___1~7#1;havoc main_~ldvarg0~0#1;havoc main_~tmp___2~4#1;havoc main_~ldvarg12~0#1.base, main_~ldvarg12~0#1.offset;havoc main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___4~1#1.base, main_~tmp___4~1#1.offset;havoc main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset;havoc main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;havoc main_~ldvarg8~0#1;havoc main_~tmp___6~1#1;havoc main_~ldvarg1~0#1;havoc main_~tmp___7~1#1;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___8~1#1.base, main_~tmp___8~1#1.offset;havoc main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset;havoc main_~tmp___9~1#1.base, main_~tmp___9~1#1.offset;havoc main_~ldvarg10~0#1.base, main_~ldvarg10~0#1.offset;havoc main_~tmp___10~1#1.base, main_~tmp___10~1#1.offset;havoc main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset;havoc main_~tmp___11~1#1.base, main_~tmp___11~1#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___12~1#1.base, main_~tmp___12~1#1.offset;havoc main_~ldvarg14~0#1;havoc main_~tmp___13~1#1;havoc main_~ldvarg16~0#1.base, main_~ldvarg16~0#1.offset;havoc main_~tmp___14~1#1.base, main_~tmp___14~1#1.offset;havoc main_~ldvarg15~0#1;havoc main_~tmp___15~1#1;havoc main_~tmp___16~1#1;havoc main_~tmp___17~1#1;havoc main_~tmp___18~1#1;havoc main_~tmp___19~1#1;assume -2147483648 <= main_#t~nondet349#1 && main_#t~nondet349#1 <= 2147483647;main_~tmp~35#1 := main_#t~nondet349#1;havoc main_#t~nondet349#1;main_~ldvarg11~0#1 := main_~tmp~35#1; {25177#true} is VALID [2022-02-20 21:55:43,020 INFO L272 TraceCheckUtils]: 2: Hoare triple {25177#true} call main_#t~ret350#1.base, main_#t~ret350#1.offset := ldv_zalloc(512); {25267#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:43,021 INFO L290 TraceCheckUtils]: 3: Hoare triple {25267#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {25177#true} is VALID [2022-02-20 21:55:43,021 INFO L290 TraceCheckUtils]: 4: Hoare triple {25177#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {25177#true} is VALID [2022-02-20 21:55:43,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,021 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {25177#true} {25177#true} #2102#return; {25177#true} is VALID [2022-02-20 21:55:43,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {25177#true} main_~tmp___0~12#1.base, main_~tmp___0~12#1.offset := main_#t~ret350#1.base, main_#t~ret350#1.offset;havoc main_#t~ret350#1.base, main_#t~ret350#1.offset;main_~ldvarg7~0#1.base, main_~ldvarg7~0#1.offset := main_~tmp___0~12#1.base, main_~tmp___0~12#1.offset;assume -2147483648 <= main_#t~nondet351#1 && main_#t~nondet351#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet351#1;havoc main_#t~nondet351#1;main_~ldvarg3~0#1 := main_~tmp___1~7#1;main_~tmp___2~4#1 := main_#t~nondet352#1;havoc main_#t~nondet352#1;main_~ldvarg0~0#1 := main_~tmp___2~4#1; {25177#true} is VALID [2022-02-20 21:55:43,022 INFO L272 TraceCheckUtils]: 8: Hoare triple {25177#true} call main_#t~ret353#1.base, main_#t~ret353#1.offset := ldv_zalloc(1); {25267#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:43,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {25267#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {25177#true} is VALID [2022-02-20 21:55:43,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {25177#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {25177#true} is VALID [2022-02-20 21:55:43,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,022 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {25177#true} {25177#true} #2104#return; {25177#true} is VALID [2022-02-20 21:55:43,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {25177#true} main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset := main_#t~ret353#1.base, main_#t~ret353#1.offset;havoc main_#t~ret353#1.base, main_#t~ret353#1.offset;main_~ldvarg12~0#1.base, main_~ldvarg12~0#1.offset := main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,023 INFO L272 TraceCheckUtils]: 14: Hoare triple {25177#true} call main_#t~ret354#1.base, main_#t~ret354#1.offset := ldv_zalloc(1); {25267#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:43,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {25267#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {25177#true} is VALID [2022-02-20 21:55:43,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {25177#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {25177#true} is VALID [2022-02-20 21:55:43,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,024 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {25177#true} {25177#true} #2106#return; {25177#true} is VALID [2022-02-20 21:55:43,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {25177#true} main_~tmp___4~1#1.base, main_~tmp___4~1#1.offset := main_#t~ret354#1.base, main_#t~ret354#1.offset;havoc main_#t~ret354#1.base, main_#t~ret354#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___4~1#1.base, main_~tmp___4~1#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,025 INFO L272 TraceCheckUtils]: 20: Hoare triple {25177#true} call main_#t~ret355#1.base, main_#t~ret355#1.offset := ldv_zalloc(16); {25267#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:43,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {25267#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {25177#true} is VALID [2022-02-20 21:55:43,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {25177#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {25177#true} is VALID [2022-02-20 21:55:43,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,025 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {25177#true} {25177#true} #2108#return; {25177#true} is VALID [2022-02-20 21:55:43,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {25177#true} main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset := main_#t~ret355#1.base, main_#t~ret355#1.offset;havoc main_#t~ret355#1.base, main_#t~ret355#1.offset;main_~ldvarg6~0#1.base, main_~ldvarg6~0#1.offset := main_~tmp___5~1#1.base, main_~tmp___5~1#1.offset;assume -2147483648 <= main_#t~nondet356#1 && main_#t~nondet356#1 <= 2147483647;main_~tmp___6~1#1 := main_#t~nondet356#1;havoc main_#t~nondet356#1;main_~ldvarg8~0#1 := main_~tmp___6~1#1;main_~tmp___7~1#1 := main_#t~nondet357#1;havoc main_#t~nondet357#1;main_~ldvarg1~0#1 := main_~tmp___7~1#1; {25177#true} is VALID [2022-02-20 21:55:43,026 INFO L272 TraceCheckUtils]: 26: Hoare triple {25177#true} call main_#t~ret358#1.base, main_#t~ret358#1.offset := ldv_zalloc(1); {25267#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:43,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {25267#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {25177#true} is VALID [2022-02-20 21:55:43,026 INFO L290 TraceCheckUtils]: 28: Hoare triple {25177#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {25177#true} is VALID [2022-02-20 21:55:43,026 INFO L290 TraceCheckUtils]: 29: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,027 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {25177#true} {25177#true} #2110#return; {25177#true} is VALID [2022-02-20 21:55:43,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {25177#true} main_~tmp___8~1#1.base, main_~tmp___8~1#1.offset := main_#t~ret358#1.base, main_#t~ret358#1.offset;havoc main_#t~ret358#1.base, main_#t~ret358#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___8~1#1.base, main_~tmp___8~1#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,027 INFO L272 TraceCheckUtils]: 32: Hoare triple {25177#true} call main_#t~ret359#1.base, main_#t~ret359#1.offset := ldv_zalloc(512); {25267#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:43,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {25267#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {25177#true} is VALID [2022-02-20 21:55:43,028 INFO L290 TraceCheckUtils]: 34: Hoare triple {25177#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {25177#true} is VALID [2022-02-20 21:55:43,028 INFO L290 TraceCheckUtils]: 35: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,028 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {25177#true} {25177#true} #2112#return; {25177#true} is VALID [2022-02-20 21:55:43,028 INFO L290 TraceCheckUtils]: 37: Hoare triple {25177#true} main_~tmp___9~1#1.base, main_~tmp___9~1#1.offset := main_#t~ret359#1.base, main_#t~ret359#1.offset;havoc main_#t~ret359#1.base, main_#t~ret359#1.offset;main_~ldvarg13~0#1.base, main_~ldvarg13~0#1.offset := main_~tmp___9~1#1.base, main_~tmp___9~1#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,029 INFO L272 TraceCheckUtils]: 38: Hoare triple {25177#true} call main_#t~ret360#1.base, main_#t~ret360#1.offset := ldv_zalloc(512); {25267#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:43,029 INFO L290 TraceCheckUtils]: 39: Hoare triple {25267#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {25177#true} is VALID [2022-02-20 21:55:43,029 INFO L290 TraceCheckUtils]: 40: Hoare triple {25177#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {25177#true} is VALID [2022-02-20 21:55:43,029 INFO L290 TraceCheckUtils]: 41: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,029 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {25177#true} {25177#true} #2114#return; {25177#true} is VALID [2022-02-20 21:55:43,029 INFO L290 TraceCheckUtils]: 43: Hoare triple {25177#true} main_~tmp___10~1#1.base, main_~tmp___10~1#1.offset := main_#t~ret360#1.base, main_#t~ret360#1.offset;havoc main_#t~ret360#1.base, main_#t~ret360#1.offset;main_~ldvarg10~0#1.base, main_~ldvarg10~0#1.offset := main_~tmp___10~1#1.base, main_~tmp___10~1#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,030 INFO L272 TraceCheckUtils]: 44: Hoare triple {25177#true} call main_#t~ret361#1.base, main_#t~ret361#1.offset := ldv_zalloc(1); {25267#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:43,030 INFO L290 TraceCheckUtils]: 45: Hoare triple {25267#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {25177#true} is VALID [2022-02-20 21:55:43,030 INFO L290 TraceCheckUtils]: 46: Hoare triple {25177#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {25177#true} is VALID [2022-02-20 21:55:43,031 INFO L290 TraceCheckUtils]: 47: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,031 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {25177#true} {25177#true} #2116#return; {25177#true} is VALID [2022-02-20 21:55:43,031 INFO L290 TraceCheckUtils]: 49: Hoare triple {25177#true} main_~tmp___11~1#1.base, main_~tmp___11~1#1.offset := main_#t~ret361#1.base, main_#t~ret361#1.offset;havoc main_#t~ret361#1.base, main_#t~ret361#1.offset;main_~ldvarg9~0#1.base, main_~ldvarg9~0#1.offset := main_~tmp___11~1#1.base, main_~tmp___11~1#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,031 INFO L272 TraceCheckUtils]: 50: Hoare triple {25177#true} call main_#t~ret362#1.base, main_#t~ret362#1.offset := ldv_zalloc(512); {25267#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:43,032 INFO L290 TraceCheckUtils]: 51: Hoare triple {25267#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {25177#true} is VALID [2022-02-20 21:55:43,032 INFO L290 TraceCheckUtils]: 52: Hoare triple {25177#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {25177#true} is VALID [2022-02-20 21:55:43,032 INFO L290 TraceCheckUtils]: 53: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,032 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {25177#true} {25177#true} #2118#return; {25177#true} is VALID [2022-02-20 21:55:43,032 INFO L290 TraceCheckUtils]: 55: Hoare triple {25177#true} main_~tmp___12~1#1.base, main_~tmp___12~1#1.offset := main_#t~ret362#1.base, main_#t~ret362#1.offset;havoc main_#t~ret362#1.base, main_#t~ret362#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___12~1#1.base, main_~tmp___12~1#1.offset;main_~tmp___13~1#1 := main_#t~nondet363#1;havoc main_#t~nondet363#1;main_~ldvarg14~0#1 := main_~tmp___13~1#1; {25177#true} is VALID [2022-02-20 21:55:43,033 INFO L272 TraceCheckUtils]: 56: Hoare triple {25177#true} call main_#t~ret364#1.base, main_#t~ret364#1.offset := ldv_zalloc(232); {25267#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:43,033 INFO L290 TraceCheckUtils]: 57: Hoare triple {25267#(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~11#1.base, ~tmp~11#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet77#1 && #t~nondet77#1 <= 2147483647;~tmp___0~3#1 := #t~nondet77#1;havoc #t~nondet77#1; {25177#true} is VALID [2022-02-20 21:55:43,033 INFO L290 TraceCheckUtils]: 58: Hoare triple {25177#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {25177#true} is VALID [2022-02-20 21:55:43,033 INFO L290 TraceCheckUtils]: 59: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,034 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {25177#true} {25177#true} #2120#return; {25177#true} is VALID [2022-02-20 21:55:43,034 INFO L290 TraceCheckUtils]: 61: Hoare triple {25177#true} main_~tmp___14~1#1.base, main_~tmp___14~1#1.offset := main_#t~ret364#1.base, main_#t~ret364#1.offset;havoc main_#t~ret364#1.base, main_#t~ret364#1.offset;main_~ldvarg16~0#1.base, main_~ldvarg16~0#1.offset := main_~tmp___14~1#1.base, main_~tmp___14~1#1.offset;main_~tmp___15~1#1 := main_#t~nondet365#1;havoc main_#t~nondet365#1;main_~ldvarg15~0#1 := main_~tmp___15~1#1;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {25177#true} is VALID [2022-02-20 21:55:43,034 INFO L290 TraceCheckUtils]: 62: Hoare triple {25177#true} assume { :end_inline_ldv_set_init } true; {25177#true} is VALID [2022-02-20 21:55:43,034 INFO L290 TraceCheckUtils]: 63: Hoare triple {25177#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_2~0 := 0; {25219#(= ~ldv_state_variable_1~0 0)} is VALID [2022-02-20 21:55:43,035 INFO L290 TraceCheckUtils]: 64: Hoare triple {25219#(= ~ldv_state_variable_1~0 0)} assume -2147483648 <= main_#t~nondet366#1 && main_#t~nondet366#1 <= 2147483647;main_~tmp___16~1#1 := main_#t~nondet366#1;havoc main_#t~nondet366#1;main_#t~switch367#1 := 0 == main_~tmp___16~1#1; {25219#(= ~ldv_state_variable_1~0 0)} is VALID [2022-02-20 21:55:43,035 INFO L290 TraceCheckUtils]: 65: Hoare triple {25219#(= ~ldv_state_variable_1~0 0)} assume main_#t~switch367#1; {25219#(= ~ldv_state_variable_1~0 0)} is VALID [2022-02-20 21:55:43,035 INFO L290 TraceCheckUtils]: 66: Hoare triple {25219#(= ~ldv_state_variable_1~0 0)} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet368#1 && main_#t~nondet368#1 <= 2147483647;main_~tmp___17~1#1 := main_#t~nondet368#1;havoc main_#t~nondet368#1;main_#t~switch369#1 := 0 == main_~tmp___17~1#1; {25178#false} is VALID [2022-02-20 21:55:43,036 INFO L290 TraceCheckUtils]: 67: Hoare triple {25178#false} assume !main_#t~switch369#1;main_#t~switch369#1 := main_#t~switch369#1 || 1 == main_~tmp___17~1#1; {25178#false} is VALID [2022-02-20 21:55:43,036 INFO L290 TraceCheckUtils]: 68: Hoare triple {25178#false} assume !main_#t~switch369#1;main_#t~switch369#1 := main_#t~switch369#1 || 2 == main_~tmp___17~1#1; {25178#false} is VALID [2022-02-20 21:55:43,036 INFO L290 TraceCheckUtils]: 69: Hoare triple {25178#false} assume !main_#t~switch369#1;main_#t~switch369#1 := main_#t~switch369#1 || 3 == main_~tmp___17~1#1; {25178#false} is VALID [2022-02-20 21:55:43,036 INFO L290 TraceCheckUtils]: 70: Hoare triple {25178#false} assume !main_#t~switch369#1;main_#t~switch369#1 := main_#t~switch369#1 || 4 == main_~tmp___17~1#1; {25178#false} is VALID [2022-02-20 21:55:43,036 INFO L290 TraceCheckUtils]: 71: Hoare triple {25178#false} assume main_#t~switch369#1; {25178#false} is VALID [2022-02-20 21:55:43,036 INFO L290 TraceCheckUtils]: 72: Hoare triple {25178#false} assume 2 == ~ldv_state_variable_1~0; {25178#false} is VALID [2022-02-20 21:55:43,036 INFO L272 TraceCheckUtils]: 73: Hoare triple {25178#false} call ppp_asynctty_close(~ppp_ldisc_group1~0.base, ~ppp_ldisc_group1~0.offset); {25268#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:43,037 INFO L290 TraceCheckUtils]: 74: Hoare triple {25268#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~tty#1.base, ~tty#1.offset := #in~tty#1.base, #in~tty#1.offset;havoc ~ap~2#1.base, ~ap~2#1.offset;havoc ~tmp~20#1;assume { :begin_inline__raw_write_lock_irq } true;_raw_write_lock_irq_#in~arg0#1.base, _raw_write_lock_irq_#in~arg0#1.offset := ~#disc_data_lock~0.base, ~#disc_data_lock~0.offset;havoc _raw_write_lock_irq_~arg0#1.base, _raw_write_lock_irq_~arg0#1.offset;_raw_write_lock_irq_~arg0#1.base, _raw_write_lock_irq_~arg0#1.offset := _raw_write_lock_irq_#in~arg0#1.base, _raw_write_lock_irq_#in~arg0#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,037 INFO L290 TraceCheckUtils]: 75: Hoare triple {25177#true} assume { :end_inline__raw_write_lock_irq } true;call #t~mem142#1.base, #t~mem142#1.offset := read~$Pointer$(~tty#1.base, 1509 + ~tty#1.offset, 8);~ap~2#1.base, ~ap~2#1.offset := #t~mem142#1.base, #t~mem142#1.offset;havoc #t~mem142#1.base, #t~mem142#1.offset;call write~$Pointer$(0, 0, ~tty#1.base, 1509 + ~tty#1.offset, 8);assume { :begin_inline__raw_write_unlock_irq } true;_raw_write_unlock_irq_#in~arg0#1.base, _raw_write_unlock_irq_#in~arg0#1.offset := ~#disc_data_lock~0.base, ~#disc_data_lock~0.offset;havoc _raw_write_unlock_irq_~arg0#1.base, _raw_write_unlock_irq_~arg0#1.offset;_raw_write_unlock_irq_~arg0#1.base, _raw_write_unlock_irq_~arg0#1.offset := _raw_write_unlock_irq_#in~arg0#1.base, _raw_write_unlock_irq_#in~arg0#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,037 INFO L290 TraceCheckUtils]: 76: Hoare triple {25177#true} assume { :end_inline__raw_write_unlock_irq } true; {25177#true} is VALID [2022-02-20 21:55:43,037 INFO L290 TraceCheckUtils]: 77: Hoare triple {25177#true} assume !(0 == (~ap~2#1.base + ~ap~2#1.offset) % 18446744073709551616); {25177#true} is VALID [2022-02-20 21:55:43,037 INFO L272 TraceCheckUtils]: 78: Hoare triple {25177#true} call #t~ret143#1 := atomic_dec_and_test(~ap~2#1.base, 386 + ~ap~2#1.offset); {25177#true} is VALID [2022-02-20 21:55:43,037 INFO L290 TraceCheckUtils]: 79: Hoare triple {25177#true} ~v.base, ~v.offset := #in~v.base, #in~v.offset;havoc ~c~2;#res := (if 0 != ~c~2 then 1 else 0); {25177#true} is VALID [2022-02-20 21:55:43,038 INFO L290 TraceCheckUtils]: 80: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,038 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {25177#true} {25177#true} #2092#return; {25177#true} is VALID [2022-02-20 21:55:43,038 INFO L290 TraceCheckUtils]: 82: Hoare triple {25177#true} assume -2147483648 <= #t~ret143#1 && #t~ret143#1 <= 2147483647;~tmp~20#1 := #t~ret143#1;havoc #t~ret143#1; {25177#true} is VALID [2022-02-20 21:55:43,038 INFO L290 TraceCheckUtils]: 83: Hoare triple {25177#true} assume !(0 == ~tmp~20#1); {25177#true} is VALID [2022-02-20 21:55:43,038 INFO L290 TraceCheckUtils]: 84: Hoare triple {25177#true} assume { :begin_inline_tasklet_kill } true;tasklet_kill_#in~arg0#1.base, tasklet_kill_#in~arg0#1.offset := ~ap~2#1.base, 350 + ~ap~2#1.offset;havoc tasklet_kill_~arg0#1.base, tasklet_kill_~arg0#1.offset;tasklet_kill_~arg0#1.base, tasklet_kill_~arg0#1.offset := tasklet_kill_#in~arg0#1.base, tasklet_kill_#in~arg0#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,038 INFO L290 TraceCheckUtils]: 85: Hoare triple {25177#true} assume { :end_inline_tasklet_kill } true;assume { :begin_inline_ppp_unregister_channel } true;ppp_unregister_channel_#in~arg0#1.base, ppp_unregister_channel_#in~arg0#1.offset := ~ap~2#1.base, 474 + ~ap~2#1.offset;havoc ppp_unregister_channel_~arg0#1.base, ppp_unregister_channel_~arg0#1.offset;ppp_unregister_channel_~arg0#1.base, ppp_unregister_channel_~arg0#1.offset := ppp_unregister_channel_#in~arg0#1.base, ppp_unregister_channel_#in~arg0#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,038 INFO L290 TraceCheckUtils]: 86: Hoare triple {25177#true} assume { :end_inline_ppp_unregister_channel } true;call #t~mem144#1.base, #t~mem144#1.offset := read~$Pointer$(~ap~2#1.base, 250 + ~ap~2#1.offset, 8);assume { :begin_inline_ldv_kfree_skb_12 } true;ldv_kfree_skb_12_#in~ldv_func_arg1#1.base, ldv_kfree_skb_12_#in~ldv_func_arg1#1.offset := #t~mem144#1.base, #t~mem144#1.offset;havoc ldv_kfree_skb_12_~ldv_func_arg1#1.base, ldv_kfree_skb_12_~ldv_func_arg1#1.offset;ldv_kfree_skb_12_~ldv_func_arg1#1.base, ldv_kfree_skb_12_~ldv_func_arg1#1.offset := ldv_kfree_skb_12_#in~ldv_func_arg1#1.base, ldv_kfree_skb_12_#in~ldv_func_arg1#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,039 INFO L272 TraceCheckUtils]: 87: Hoare triple {25177#true} call ldv_skb_free(ldv_kfree_skb_12_~ldv_func_arg1#1.base, ldv_kfree_skb_12_~ldv_func_arg1#1.offset); {25298#(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:55:43,039 INFO L290 TraceCheckUtils]: 88: Hoare triple {25298#(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; {25177#true} is VALID [2022-02-20 21:55:43,040 INFO L272 TraceCheckUtils]: 89: Hoare triple {25177#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {25298#(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:55:43,041 INFO L290 TraceCheckUtils]: 90: Hoare triple {25298#(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~5;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~5 := 0; {25177#true} is VALID [2022-02-20 21:55:43,041 INFO L290 TraceCheckUtils]: 91: Hoare triple {25177#true} assume !false; {25177#true} is VALID [2022-02-20 21:55:43,041 INFO L290 TraceCheckUtils]: 92: Hoare triple {25177#true} assume !(~i~5 < ~last_index~0); {25177#true} is VALID [2022-02-20 21:55:43,041 INFO L290 TraceCheckUtils]: 93: Hoare triple {25177#true} assume !(-1 != ~deleted_index~0); {25177#true} is VALID [2022-02-20 21:55:43,041 INFO L290 TraceCheckUtils]: 94: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,041 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {25177#true} {25177#true} #2078#return; {25177#true} is VALID [2022-02-20 21:55:43,042 INFO L290 TraceCheckUtils]: 96: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,042 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {25177#true} {25177#true} #2094#return; {25177#true} is VALID [2022-02-20 21:55:43,042 INFO L290 TraceCheckUtils]: 98: Hoare triple {25177#true} assume { :end_inline_ldv_kfree_skb_12 } true;havoc #t~mem144#1.base, #t~mem144#1.offset;assume { :begin_inline_skb_queue_purge } true;skb_queue_purge_#in~arg0#1.base, skb_queue_purge_#in~arg0#1.offset := ~ap~2#1.base, 262 + ~ap~2#1.offset;havoc skb_queue_purge_~arg0#1.base, skb_queue_purge_~arg0#1.offset;skb_queue_purge_~arg0#1.base, skb_queue_purge_~arg0#1.offset := skb_queue_purge_#in~arg0#1.base, skb_queue_purge_#in~arg0#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,042 INFO L290 TraceCheckUtils]: 99: Hoare triple {25177#true} assume { :end_inline_skb_queue_purge } true;call #t~mem145#1.base, #t~mem145#1.offset := read~$Pointer$(~ap~2#1.base, 212 + ~ap~2#1.offset, 8);assume { :begin_inline_ldv_kfree_skb_13 } true;ldv_kfree_skb_13_#in~ldv_func_arg1#1.base, ldv_kfree_skb_13_#in~ldv_func_arg1#1.offset := #t~mem145#1.base, #t~mem145#1.offset;havoc ldv_kfree_skb_13_~ldv_func_arg1#1.base, ldv_kfree_skb_13_~ldv_func_arg1#1.offset;ldv_kfree_skb_13_~ldv_func_arg1#1.base, ldv_kfree_skb_13_~ldv_func_arg1#1.offset := ldv_kfree_skb_13_#in~ldv_func_arg1#1.base, ldv_kfree_skb_13_#in~ldv_func_arg1#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,043 INFO L272 TraceCheckUtils]: 100: Hoare triple {25177#true} call ldv_skb_free(ldv_kfree_skb_13_~ldv_func_arg1#1.base, ldv_kfree_skb_13_~ldv_func_arg1#1.offset); {25298#(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:55:43,043 INFO L290 TraceCheckUtils]: 101: Hoare triple {25298#(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; {25177#true} is VALID [2022-02-20 21:55:43,044 INFO L272 TraceCheckUtils]: 102: Hoare triple {25177#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {25298#(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:55:43,044 INFO L290 TraceCheckUtils]: 103: Hoare triple {25298#(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~5;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~5 := 0; {25177#true} is VALID [2022-02-20 21:55:43,044 INFO L290 TraceCheckUtils]: 104: Hoare triple {25177#true} assume !false; {25177#true} is VALID [2022-02-20 21:55:43,044 INFO L290 TraceCheckUtils]: 105: Hoare triple {25177#true} assume !(~i~5 < ~last_index~0); {25177#true} is VALID [2022-02-20 21:55:43,045 INFO L290 TraceCheckUtils]: 106: Hoare triple {25177#true} assume -1 != ~deleted_index~0;~i~5 := 1 + ~deleted_index~0; {25177#true} is VALID [2022-02-20 21:55:43,045 INFO L290 TraceCheckUtils]: 107: Hoare triple {25177#true} assume !false; {25177#true} is VALID [2022-02-20 21:55:43,045 INFO L290 TraceCheckUtils]: 108: Hoare triple {25177#true} assume !(~i~5 < ~last_index~0); {25177#true} is VALID [2022-02-20 21:55:43,045 INFO L290 TraceCheckUtils]: 109: Hoare triple {25177#true} ~last_index~0 := ~last_index~0 - 1; {25177#true} is VALID [2022-02-20 21:55:43,045 INFO L290 TraceCheckUtils]: 110: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,045 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {25177#true} {25177#true} #2078#return; {25177#true} is VALID [2022-02-20 21:55:43,045 INFO L290 TraceCheckUtils]: 112: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,046 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {25177#true} {25177#true} #2096#return; {25177#true} is VALID [2022-02-20 21:55:43,046 INFO L290 TraceCheckUtils]: 114: Hoare triple {25177#true} assume { :end_inline_ldv_kfree_skb_13 } true;havoc #t~mem145#1.base, #t~mem145#1.offset; {25177#true} is VALID [2022-02-20 21:55:43,046 INFO L272 TraceCheckUtils]: 115: Hoare triple {25177#true} call kfree(~ap~2#1.base, ~ap~2#1.offset); {25314#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 21:55:43,047 INFO L290 TraceCheckUtils]: 116: Hoare triple {25314#(= |old(#valid)| |#valid|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call ULTIMATE.dealloc(~p.base, ~p.offset); {25177#true} is VALID [2022-02-20 21:55:43,047 INFO L290 TraceCheckUtils]: 117: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,047 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {25177#true} {25177#true} #2098#return; {25177#true} is VALID [2022-02-20 21:55:43,047 INFO L290 TraceCheckUtils]: 119: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-02-20 21:55:43,047 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {25177#true} {25178#false} #2130#return; {25178#false} is VALID [2022-02-20 21:55:43,047 INFO L290 TraceCheckUtils]: 121: Hoare triple {25178#false} ~ldv_state_variable_1~0 := 1;~ref_cnt~0 := ~ref_cnt~0 - 1; {25178#false} is VALID [2022-02-20 21:55:43,047 INFO L290 TraceCheckUtils]: 122: Hoare triple {25178#false} assume -2147483648 <= main_#t~nondet366#1 && main_#t~nondet366#1 <= 2147483647;main_~tmp___16~1#1 := main_#t~nondet366#1;havoc main_#t~nondet366#1;main_#t~switch367#1 := 0 == main_~tmp___16~1#1; {25178#false} is VALID [2022-02-20 21:55:43,048 INFO L290 TraceCheckUtils]: 123: Hoare triple {25178#false} assume !main_#t~switch367#1;main_#t~switch367#1 := main_#t~switch367#1 || 1 == main_~tmp___16~1#1; {25178#false} is VALID [2022-02-20 21:55:43,048 INFO L290 TraceCheckUtils]: 124: Hoare triple {25178#false} assume main_#t~switch367#1; {25178#false} is VALID [2022-02-20 21:55:43,048 INFO L290 TraceCheckUtils]: 125: Hoare triple {25178#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet379#1 && main_#t~nondet379#1 <= 2147483647;main_~tmp___18~1#1 := main_#t~nondet379#1;havoc main_#t~nondet379#1;main_#t~switch380#1 := 0 == main_~tmp___18~1#1; {25178#false} is VALID [2022-02-20 21:55:43,048 INFO L290 TraceCheckUtils]: 126: Hoare triple {25178#false} assume !main_#t~switch380#1;main_#t~switch380#1 := main_#t~switch380#1 || 1 == main_~tmp___18~1#1; {25178#false} is VALID [2022-02-20 21:55:43,048 INFO L290 TraceCheckUtils]: 127: Hoare triple {25178#false} assume main_#t~switch380#1; {25178#false} is VALID [2022-02-20 21:55:43,048 INFO L290 TraceCheckUtils]: 128: Hoare triple {25178#false} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_ppp_async_init } true;havoc ppp_async_init_#res#1;havoc ppp_async_init_#t~ret160#1, ppp_async_init_#t~nondet161#1, ppp_async_init_~err~2#1;havoc ppp_async_init_~err~2#1;assume { :begin_inline_tty_register_ldisc } true;tty_register_ldisc_#in~arg0#1, tty_register_ldisc_#in~arg1#1.base, tty_register_ldisc_#in~arg1#1.offset := 3, ~#ppp_ldisc~0.base, ~#ppp_ldisc~0.offset;havoc tty_register_ldisc_#res#1;havoc tty_register_ldisc_#t~nondet412#1, tty_register_ldisc_~arg0#1, tty_register_ldisc_~arg1#1.base, tty_register_ldisc_~arg1#1.offset;tty_register_ldisc_~arg0#1 := tty_register_ldisc_#in~arg0#1;tty_register_ldisc_~arg1#1.base, tty_register_ldisc_~arg1#1.offset := tty_register_ldisc_#in~arg1#1.base, tty_register_ldisc_#in~arg1#1.offset;assume -2147483648 <= tty_register_ldisc_#t~nondet412#1 && tty_register_ldisc_#t~nondet412#1 <= 2147483647;tty_register_ldisc_#res#1 := tty_register_ldisc_#t~nondet412#1;havoc tty_register_ldisc_#t~nondet412#1; {25178#false} is VALID [2022-02-20 21:55:43,049 INFO L290 TraceCheckUtils]: 129: Hoare triple {25178#false} ppp_async_init_#t~ret160#1 := tty_register_ldisc_#res#1;assume { :end_inline_tty_register_ldisc } true;assume -2147483648 <= ppp_async_init_#t~ret160#1 && ppp_async_init_#t~ret160#1 <= 2147483647;ppp_async_init_~err~2#1 := ppp_async_init_#t~ret160#1;havoc ppp_async_init_#t~ret160#1; {25178#false} is VALID [2022-02-20 21:55:43,049 INFO L290 TraceCheckUtils]: 130: Hoare triple {25178#false} assume 0 != ppp_async_init_~err~2#1;havoc ppp_async_init_#t~nondet161#1; {25178#false} is VALID [2022-02-20 21:55:43,049 INFO L290 TraceCheckUtils]: 131: Hoare triple {25178#false} ppp_async_init_#res#1 := ppp_async_init_~err~2#1; {25178#false} is VALID [2022-02-20 21:55:43,049 INFO L290 TraceCheckUtils]: 132: Hoare triple {25178#false} main_#t~ret381#1 := ppp_async_init_#res#1;assume { :end_inline_ppp_async_init } true;assume -2147483648 <= main_#t~ret381#1 && main_#t~ret381#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret381#1;havoc main_#t~ret381#1; {25178#false} is VALID [2022-02-20 21:55:43,049 INFO L290 TraceCheckUtils]: 133: Hoare triple {25178#false} assume !(0 == ~ldv_retval_1~0); {25178#false} is VALID [2022-02-20 21:55:43,049 INFO L290 TraceCheckUtils]: 134: Hoare triple {25178#false} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {25178#false} is VALID [2022-02-20 21:55:43,049 INFO L290 TraceCheckUtils]: 135: Hoare triple {25178#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret397#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); {25178#false} is VALID [2022-02-20 21:55:43,050 INFO L290 TraceCheckUtils]: 136: Hoare triple {25178#false} ldv_check_final_state_#t~ret397#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret397#1 && ldv_check_final_state_#t~ret397#1 <= 2147483647;ldv_check_final_state_~tmp___7~7#1 := ldv_check_final_state_#t~ret397#1;havoc ldv_check_final_state_#t~ret397#1; {25178#false} is VALID [2022-02-20 21:55:43,050 INFO L290 TraceCheckUtils]: 137: Hoare triple {25178#false} assume !(0 != ldv_check_final_state_~tmp___7~7#1); {25178#false} is VALID [2022-02-20 21:55:43,050 INFO L272 TraceCheckUtils]: 138: Hoare triple {25178#false} call ldv_error(); {25178#false} is VALID [2022-02-20 21:55:43,050 INFO L290 TraceCheckUtils]: 139: Hoare triple {25178#false} assume !false; {25178#false} is VALID [2022-02-20 21:55:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-20 21:55:43,051 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:55:43,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250397081] [2022-02-20 21:55:43,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250397081] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:55:43,051 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:55:43,052 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 21:55:43,052 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849223112] [2022-02-20 21:55:43,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:55:43,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2022-02-20 21:55:43,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:55:43,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-02-20 21:55:43,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:43,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 21:55:43,139 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:55:43,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 21:55:43,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:55:43,140 INFO L87 Difference]: Start difference. First operand 2815 states and 4094 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16)