./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--touchscreen--tsc2005.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-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--touchscreen--tsc2005.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 9e6cb9575d01b247a38f631016ebb8c3cacd422c61aaebbf8be9e6e4657d498f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 22:16:22,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 22:16:22,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 22:16:22,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 22:16:22,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 22:16:22,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 22:16:22,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 22:16:22,531 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 22:16:22,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 22:16:22,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 22:16:22,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 22:16:22,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 22:16:22,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 22:16:22,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 22:16:22,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 22:16:22,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 22:16:22,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 22:16:22,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 22:16:22,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 22:16:22,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 22:16:22,556 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 22:16:22,557 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 22:16:22,558 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 22:16:22,558 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 22:16:22,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 22:16:22,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 22:16:22,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 22:16:22,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 22:16:22,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 22:16:22,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 22:16:22,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 22:16:22,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 22:16:22,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 22:16:22,564 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 22:16:22,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 22:16:22,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 22:16:22,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 22:16:22,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 22:16:22,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 22:16:22,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 22:16:22,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 22:16:22,567 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 22:16:22,581 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 22:16:22,581 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 22:16:22,581 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 22:16:22,581 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 22:16:22,582 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 22:16:22,582 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 22:16:22,583 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 22:16:22,583 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 22:16:22,583 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 22:16:22,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 22:16:22,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 22:16:22,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 22:16:22,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 22:16:22,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 22:16:22,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 22:16:22,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 22:16:22,584 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 22:16:22,585 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 22:16:22,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 22:16:22,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 22:16:22,585 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 22:16:22,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:16:22,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 22:16:22,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 22:16:22,586 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 22:16:22,586 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 22:16:22,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 22:16:22,586 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 22:16:22,586 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 22:16:22,587 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 22:16:22,587 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 -> 9e6cb9575d01b247a38f631016ebb8c3cacd422c61aaebbf8be9e6e4657d498f [2022-02-20 22:16:22,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 22:16:22,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 22:16:22,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 22:16:22,775 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 22:16:22,775 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 22:16:22,776 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--touchscreen--tsc2005.ko-entry_point.cil.out.i [2022-02-20 22:16:22,829 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e9e40ee/70d149bc21d94d62816d7bcf3a1041b1/FLAGfcc45f87b [2022-02-20 22:16:23,363 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 22:16:23,364 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--touchscreen--tsc2005.ko-entry_point.cil.out.i [2022-02-20 22:16:23,408 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e9e40ee/70d149bc21d94d62816d7bcf3a1041b1/FLAGfcc45f87b [2022-02-20 22:16:23,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e9e40ee/70d149bc21d94d62816d7bcf3a1041b1 [2022-02-20 22:16:23,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 22:16:23,562 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 22:16:23,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 22:16:23,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 22:16:23,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 22:16:23,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:16:23" (1/1) ... [2022-02-20 22:16:23,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67d06594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:16:23, skipping insertion in model container [2022-02-20 22:16:23,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:16:23" (1/1) ... [2022-02-20 22:16:23,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 22:16:23,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:16:24,373 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-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--touchscreen--tsc2005.ko-entry_point.cil.out.i[172920,172933] [2022-02-20 22:16:24,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:16:24,462 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 22:16:24,644 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-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--touchscreen--tsc2005.ko-entry_point.cil.out.i[172920,172933] [2022-02-20 22:16:24,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:16:24,722 INFO L208 MainTranslator]: Completed translation [2022-02-20 22:16:24,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:16:24 WrapperNode [2022-02-20 22:16:24,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 22:16:24,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 22:16:24,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 22:16:24,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 22:16:24,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:16:24" (1/1) ... [2022-02-20 22:16:24,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:16:24" (1/1) ... [2022-02-20 22:16:24,891 INFO L137 Inliner]: procedures = 262, calls = 892, calls flagged for inlining = 100, calls inlined = 92, statements flattened = 2323 [2022-02-20 22:16:24,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 22:16:24,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 22:16:24,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 22:16:24,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 22:16:24,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:16:24" (1/1) ... [2022-02-20 22:16:24,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:16:24" (1/1) ... [2022-02-20 22:16:24,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:16:24" (1/1) ... [2022-02-20 22:16:24,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:16:24" (1/1) ... [2022-02-20 22:16:24,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:16:24" (1/1) ... [2022-02-20 22:16:24,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:16:24" (1/1) ... [2022-02-20 22:16:24,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:16:24" (1/1) ... [2022-02-20 22:16:25,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 22:16:25,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 22:16:25,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 22:16:25,015 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 22:16:25,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:16:24" (1/1) ... [2022-02-20 22:16:25,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:16:25,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 22:16:25,053 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 22:16:25,060 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 22:16:25,091 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_read [2022-02-20 22:16:25,092 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_read [2022-02-20 22:16:25,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 22:16:25,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 22:16:25,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 22:16:25,092 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 22:16:25,092 INFO L130 BoogieDeclarations]: Found specification of procedure spi_sync [2022-02-20 22:16:25,092 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_sync [2022-02-20 22:16:25,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 22:16:25,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 22:16:25,093 INFO L130 BoogieDeclarations]: Found specification of procedure disable_irq [2022-02-20 22:16:25,093 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_irq [2022-02-20 22:16:25,093 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2022-02-20 22:16:25,093 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2022-02-20 22:16:25,093 INFO L130 BoogieDeclarations]: Found specification of procedure usleep_range [2022-02-20 22:16:25,093 INFO L138 BoogieDeclarations]: Found implementation of procedure usleep_range [2022-02-20 22:16:25,094 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-02-20 22:16:25,094 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-02-20 22:16:25,094 INFO L130 BoogieDeclarations]: Found specification of procedure of_property_read_u32 [2022-02-20 22:16:25,094 INFO L138 BoogieDeclarations]: Found implementation of procedure of_property_read_u32 [2022-02-20 22:16:25,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_tsc2005 [2022-02-20 22:16:25,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_tsc2005 [2022-02-20 22:16:25,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 22:16:25,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 22:16:25,095 INFO L130 BoogieDeclarations]: Found specification of procedure queue_delayed_work_on [2022-02-20 22:16:25,095 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_delayed_work_on [2022-02-20 22:16:25,095 INFO L130 BoogieDeclarations]: Found specification of procedure activate_work_3 [2022-02-20 22:16:25,095 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_work_3 [2022-02-20 22:16:25,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 22:16:25,095 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 22:16:25,111 INFO L130 BoogieDeclarations]: Found specification of procedure activate_suitable_irq_2 [2022-02-20 22:16:25,112 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_suitable_irq_2 [2022-02-20 22:16:25,112 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 22:16:25,112 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 22:16:25,112 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-02-20 22:16:25,112 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-02-20 22:16:25,112 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-02-20 22:16:25,112 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-02-20 22:16:25,113 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_4 [2022-02-20 22:16:25,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_4 [2022-02-20 22:16:25,113 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_tsc2005 [2022-02-20 22:16:25,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_tsc2005 [2022-02-20 22:16:25,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 22:16:25,114 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2022-02-20 22:16:25,114 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2022-02-20 22:16:25,114 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-02-20 22:16:25,114 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-02-20 22:16:25,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 22:16:25,114 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_stop_scan [2022-02-20 22:16:25,114 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_stop_scan [2022-02-20 22:16:25,115 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_write [2022-02-20 22:16:25,115 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_write [2022-02-20 22:16:25,115 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-02-20 22:16:25,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-02-20 22:16:25,115 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-02-20 22:16:25,115 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-02-20 22:16:25,116 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_cmd [2022-02-20 22:16:25,116 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_cmd [2022-02-20 22:16:25,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 22:16:25,117 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-02-20 22:16:25,117 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-02-20 22:16:25,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 22:16:25,118 INFO L130 BoogieDeclarations]: Found specification of procedure spi_message_add_tail [2022-02-20 22:16:25,118 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_message_add_tail [2022-02-20 22:16:25,118 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_esd_work [2022-02-20 22:16:25,118 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_esd_work [2022-02-20 22:16:25,118 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-02-20 22:16:25,118 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-02-20 22:16:25,118 INFO L130 BoogieDeclarations]: Found specification of procedure to_spi_device [2022-02-20 22:16:25,118 INFO L138 BoogieDeclarations]: Found implementation of procedure to_spi_device [2022-02-20 22:16:25,119 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_suspend [2022-02-20 22:16:25,119 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_suspend [2022-02-20 22:16:25,119 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2022-02-20 22:16:25,119 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2022-02-20 22:16:25,119 INFO L130 BoogieDeclarations]: Found specification of procedure round_jiffies_relative [2022-02-20 22:16:25,119 INFO L138 BoogieDeclarations]: Found implementation of procedure round_jiffies_relative [2022-02-20 22:16:25,119 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2022-02-20 22:16:25,120 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2022-02-20 22:16:25,120 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-02-20 22:16:25,120 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-02-20 22:16:25,120 INFO L130 BoogieDeclarations]: Found specification of procedure devm_request_threaded_irq [2022-02-20 22:16:25,120 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_request_threaded_irq [2022-02-20 22:16:25,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 22:16:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-02-20 22:16:25,121 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-02-20 22:16:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure sysfs_remove_group [2022-02-20 22:16:25,121 INFO L138 BoogieDeclarations]: Found implementation of procedure sysfs_remove_group [2022-02-20 22:16:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_disable [2022-02-20 22:16:25,121 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_disable [2022-02-20 22:16:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure reg_check_2 [2022-02-20 22:16:25,121 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_check_2 [2022-02-20 22:16:25,122 INFO L130 BoogieDeclarations]: Found specification of procedure activate_suitable_timer_4 [2022-02-20 22:16:25,122 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_suitable_timer_4 [2022-02-20 22:16:25,122 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_start_scan [2022-02-20 22:16:25,122 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_start_scan [2022-02-20 22:16:25,122 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_resume [2022-02-20 22:16:25,122 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_resume [2022-02-20 22:16:25,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 22:16:25,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 22:16:25,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 22:16:25,124 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-02-20 22:16:25,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-02-20 22:16:25,124 INFO L130 BoogieDeclarations]: Found specification of procedure enable_irq [2022-02-20 22:16:25,124 INFO L138 BoogieDeclarations]: Found implementation of procedure enable_irq [2022-02-20 22:16:25,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 22:16:25,124 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_4 [2022-02-20 22:16:25,124 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_4 [2022-02-20 22:16:25,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 22:16:25,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-02-20 22:16:25,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-02-20 22:16:25,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 22:16:25,125 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-02-20 22:16:25,125 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-02-20 22:16:25,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2022-02-20 22:16:25,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2022-02-20 22:16:25,126 INFO L130 BoogieDeclarations]: Found specification of procedure spi_message_init [2022-02-20 22:16:25,126 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_message_init [2022-02-20 22:16:25,126 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_2 [2022-02-20 22:16:25,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_2 [2022-02-20 22:16:25,127 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_setup_read [2022-02-20 22:16:25,129 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_setup_read [2022-02-20 22:16:25,129 INFO L130 BoogieDeclarations]: Found specification of procedure __tsc2005_enable [2022-02-20 22:16:25,129 INFO L138 BoogieDeclarations]: Found implementation of procedure __tsc2005_enable [2022-02-20 22:16:25,129 INFO L130 BoogieDeclarations]: Found specification of procedure spi_get_drvdata [2022-02-20 22:16:25,129 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_get_drvdata [2022-02-20 22:16:25,131 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_tsc2005 [2022-02-20 22:16:25,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_tsc2005 [2022-02-20 22:16:25,131 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_irq_thread [2022-02-20 22:16:25,131 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_irq_thread [2022-02-20 22:16:25,136 INFO L130 BoogieDeclarations]: Found specification of procedure __tsc2005_disable [2022-02-20 22:16:25,136 INFO L138 BoogieDeclarations]: Found implementation of procedure __tsc2005_disable [2022-02-20 22:16:25,136 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_update_pen_state [2022-02-20 22:16:25,136 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_update_pen_state [2022-02-20 22:16:25,136 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-02-20 22:16:25,136 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-02-20 22:16:25,136 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_delayed_work [2022-02-20 22:16:25,136 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_delayed_work [2022-02-20 22:16:25,136 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_set_reset [2022-02-20 22:16:25,137 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_set_reset [2022-02-20 22:16:25,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 22:16:25,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 22:16:25,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 22:16:25,137 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-02-20 22:16:25,137 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-02-20 22:16:25,620 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 22:16:25,622 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 22:16:25,823 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 22:16:31,718 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 22:16:31,738 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 22:16:31,739 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 22:16:31,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:16:31 BoogieIcfgContainer [2022-02-20 22:16:31,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 22:16:31,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 22:16:31,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 22:16:31,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 22:16:31,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 10:16:23" (1/3) ... [2022-02-20 22:16:31,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ce0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:16:31, skipping insertion in model container [2022-02-20 22:16:31,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:16:24" (2/3) ... [2022-02-20 22:16:31,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ce0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:16:31, skipping insertion in model container [2022-02-20 22:16:31,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:16:31" (3/3) ... [2022-02-20 22:16:31,748 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--input--touchscreen--tsc2005.ko-entry_point.cil.out.i [2022-02-20 22:16:31,752 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 22:16:31,753 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 22:16:31,793 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 22:16:31,798 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 22:16:31,798 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 22:16:31,831 INFO L276 IsEmpty]: Start isEmpty. Operand has 896 states, 635 states have (on average 1.395275590551181) internal successors, (886), 666 states have internal predecessors, (886), 194 states have call successors, (194), 66 states have call predecessors, (194), 65 states have return successors, (182), 179 states have call predecessors, (182), 182 states have call successors, (182) [2022-02-20 22:16:31,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-02-20 22:16:31,841 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:16:31,842 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:16:31,842 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:16:31,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:16:31,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1240876610, now seen corresponding path program 1 times [2022-02-20 22:16:31,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:16:31,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365537939] [2022-02-20 22:16:31,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:16:31,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:16:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:32,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:16:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:32,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:16:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:32,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {986#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {899#true} is VALID [2022-02-20 22:16:32,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {899#true} assume true; {899#true} is VALID [2022-02-20 22:16:32,264 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {899#true} {899#true} #2227#return; {899#true} is VALID [2022-02-20 22:16:32,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:16:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:32,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {899#true} ~cond := #in~cond; {899#true} is VALID [2022-02-20 22:16:32,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {899#true} assume 0 == ~cond;assume false; {900#false} is VALID [2022-02-20 22:16:32,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {900#false} {899#true} #2229#return; {900#false} is VALID [2022-02-20 22:16:32,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {978#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {899#true} is VALID [2022-02-20 22:16:32,283 INFO L272 TraceCheckUtils]: 1: Hoare triple {899#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {986#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:16:32,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {986#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {899#true} is VALID [2022-02-20 22:16:32,284 INFO L290 TraceCheckUtils]: 3: Hoare triple {899#true} assume true; {899#true} is VALID [2022-02-20 22:16:32,284 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {899#true} {899#true} #2227#return; {899#true} is VALID [2022-02-20 22:16:32,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {899#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {899#true} is VALID [2022-02-20 22:16:32,285 INFO L272 TraceCheckUtils]: 6: Hoare triple {899#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {899#true} is VALID [2022-02-20 22:16:32,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {899#true} ~cond := #in~cond; {899#true} is VALID [2022-02-20 22:16:32,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {899#true} assume 0 == ~cond;assume false; {900#false} is VALID [2022-02-20 22:16:32,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,286 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#false} {899#true} #2229#return; {900#false} is VALID [2022-02-20 22:16:32,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {900#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {900#false} is VALID [2022-02-20 22:16:32,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,287 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {900#false} {899#true} #2247#return; {900#false} is VALID [2022-02-20 22:16:32,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:16:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:32,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:16:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:32,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {986#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {899#true} is VALID [2022-02-20 22:16:32,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {899#true} assume true; {899#true} is VALID [2022-02-20 22:16:32,322 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {899#true} {899#true} #2227#return; {899#true} is VALID [2022-02-20 22:16:32,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:16:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:32,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {899#true} ~cond := #in~cond; {899#true} is VALID [2022-02-20 22:16:32,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {899#true} assume 0 == ~cond;assume false; {900#false} is VALID [2022-02-20 22:16:32,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {900#false} {899#true} #2229#return; {900#false} is VALID [2022-02-20 22:16:32,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {978#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {899#true} is VALID [2022-02-20 22:16:32,334 INFO L272 TraceCheckUtils]: 1: Hoare triple {899#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {986#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:16:32,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {986#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {899#true} is VALID [2022-02-20 22:16:32,334 INFO L290 TraceCheckUtils]: 3: Hoare triple {899#true} assume true; {899#true} is VALID [2022-02-20 22:16:32,334 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {899#true} {899#true} #2227#return; {899#true} is VALID [2022-02-20 22:16:32,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {899#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {899#true} is VALID [2022-02-20 22:16:32,335 INFO L272 TraceCheckUtils]: 6: Hoare triple {899#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {899#true} is VALID [2022-02-20 22:16:32,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {899#true} ~cond := #in~cond; {899#true} is VALID [2022-02-20 22:16:32,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {899#true} assume 0 == ~cond;assume false; {900#false} is VALID [2022-02-20 22:16:32,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,336 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#false} {899#true} #2229#return; {900#false} is VALID [2022-02-20 22:16:32,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {900#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {900#false} is VALID [2022-02-20 22:16:32,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,336 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {900#false} {900#false} #2249#return; {900#false} is VALID [2022-02-20 22:16:32,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:16:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:32,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:16:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:32,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {986#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {899#true} is VALID [2022-02-20 22:16:32,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {899#true} assume true; {899#true} is VALID [2022-02-20 22:16:32,382 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {899#true} {899#true} #2227#return; {899#true} is VALID [2022-02-20 22:16:32,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:16:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:32,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {899#true} ~cond := #in~cond; {899#true} is VALID [2022-02-20 22:16:32,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {899#true} assume 0 == ~cond;assume false; {900#false} is VALID [2022-02-20 22:16:32,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {900#false} {899#true} #2229#return; {900#false} is VALID [2022-02-20 22:16:32,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {978#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {899#true} is VALID [2022-02-20 22:16:32,390 INFO L272 TraceCheckUtils]: 1: Hoare triple {899#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {986#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:16:32,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {986#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {899#true} is VALID [2022-02-20 22:16:32,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {899#true} assume true; {899#true} is VALID [2022-02-20 22:16:32,391 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {899#true} {899#true} #2227#return; {899#true} is VALID [2022-02-20 22:16:32,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {899#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {899#true} is VALID [2022-02-20 22:16:32,391 INFO L272 TraceCheckUtils]: 6: Hoare triple {899#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {899#true} is VALID [2022-02-20 22:16:32,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {899#true} ~cond := #in~cond; {899#true} is VALID [2022-02-20 22:16:32,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {899#true} assume 0 == ~cond;assume false; {900#false} is VALID [2022-02-20 22:16:32,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,393 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#false} {899#true} #2229#return; {900#false} is VALID [2022-02-20 22:16:32,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {900#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {900#false} is VALID [2022-02-20 22:16:32,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,393 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {900#false} {900#false} #2251#return; {900#false} is VALID [2022-02-20 22:16:32,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 22:16:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:32,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:16:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:32,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {986#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {899#true} is VALID [2022-02-20 22:16:32,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {899#true} assume true; {899#true} is VALID [2022-02-20 22:16:32,430 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {899#true} {899#true} #2227#return; {899#true} is VALID [2022-02-20 22:16:32,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:16:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:32,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {899#true} ~cond := #in~cond; {899#true} is VALID [2022-02-20 22:16:32,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {899#true} assume 0 == ~cond;assume false; {900#false} is VALID [2022-02-20 22:16:32,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {900#false} {899#true} #2229#return; {900#false} is VALID [2022-02-20 22:16:32,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {978#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {899#true} is VALID [2022-02-20 22:16:32,438 INFO L272 TraceCheckUtils]: 1: Hoare triple {899#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {986#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:16:32,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {986#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {899#true} is VALID [2022-02-20 22:16:32,441 INFO L290 TraceCheckUtils]: 3: Hoare triple {899#true} assume true; {899#true} is VALID [2022-02-20 22:16:32,441 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {899#true} {899#true} #2227#return; {899#true} is VALID [2022-02-20 22:16:32,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {899#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {899#true} is VALID [2022-02-20 22:16:32,441 INFO L272 TraceCheckUtils]: 6: Hoare triple {899#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {899#true} is VALID [2022-02-20 22:16:32,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {899#true} ~cond := #in~cond; {899#true} is VALID [2022-02-20 22:16:32,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {899#true} assume 0 == ~cond;assume false; {900#false} is VALID [2022-02-20 22:16:32,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,442 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#false} {899#true} #2229#return; {900#false} is VALID [2022-02-20 22:16:32,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {900#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {900#false} is VALID [2022-02-20 22:16:32,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,443 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {900#false} {900#false} #2253#return; {900#false} is VALID [2022-02-20 22:16:32,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 22:16:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:32,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:16:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:32,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {986#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {899#true} is VALID [2022-02-20 22:16:32,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {899#true} assume true; {899#true} is VALID [2022-02-20 22:16:32,469 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {899#true} {899#true} #2227#return; {899#true} is VALID [2022-02-20 22:16:32,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:16:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:32,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {899#true} ~cond := #in~cond; {899#true} is VALID [2022-02-20 22:16:32,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {899#true} assume 0 == ~cond;assume false; {900#false} is VALID [2022-02-20 22:16:32,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {900#false} {899#true} #2229#return; {900#false} is VALID [2022-02-20 22:16:32,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {978#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {899#true} is VALID [2022-02-20 22:16:32,477 INFO L272 TraceCheckUtils]: 1: Hoare triple {899#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {986#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:16:32,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {986#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {899#true} is VALID [2022-02-20 22:16:32,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {899#true} assume true; {899#true} is VALID [2022-02-20 22:16:32,477 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {899#true} {899#true} #2227#return; {899#true} is VALID [2022-02-20 22:16:32,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {899#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {899#true} is VALID [2022-02-20 22:16:32,478 INFO L272 TraceCheckUtils]: 6: Hoare triple {899#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {899#true} is VALID [2022-02-20 22:16:32,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {899#true} ~cond := #in~cond; {899#true} is VALID [2022-02-20 22:16:32,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {899#true} assume 0 == ~cond;assume false; {900#false} is VALID [2022-02-20 22:16:32,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,480 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#false} {899#true} #2229#return; {900#false} is VALID [2022-02-20 22:16:32,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {900#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {900#false} is VALID [2022-02-20 22:16:32,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,481 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {900#false} {900#false} #2255#return; {900#false} is VALID [2022-02-20 22:16:32,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-02-20 22:16:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:32,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {1015#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr488 := 0; {899#true} is VALID [2022-02-20 22:16:32,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {899#true} assume !(#t~loopctr488 % 18446744073709551616 < #amount % 18446744073709551616); {899#true} is VALID [2022-02-20 22:16:32,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {899#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {899#true} is VALID [2022-02-20 22:16:32,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {899#true} {900#false} #2257#return; {900#false} is VALID [2022-02-20 22:16:32,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-02-20 22:16:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:32,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {899#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;assume -2147483648 <= #t~nondet474 && #t~nondet474 <= 2147483647;#res := #t~nondet474;havoc #t~nondet474; {899#true} is VALID [2022-02-20 22:16:32,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {899#true} assume true; {899#true} is VALID [2022-02-20 22:16:32,505 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {899#true} {900#false} #2187#return; {900#false} is VALID [2022-02-20 22:16:32,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {899#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(89, 2);call #Ultimate.allocInit(36, 3);call #Ultimate.allocInit(12, 4);call #Ultimate.allocInit(48, 5);call #Ultimate.allocInit(14, 6);call #Ultimate.allocInit(8, 7);call #Ultimate.allocInit(25, 8);call #Ultimate.allocInit(214, 9);call #Ultimate.allocInit(32, 10);call #Ultimate.allocInit(32, 11);call #Ultimate.allocInit(32, 12);call #Ultimate.allocInit(33, 13);call #Ultimate.allocInit(44, 14);call #Ultimate.allocInit(27, 15);call #Ultimate.allocInit(44, 16);call #Ultimate.allocInit(39, 17);call #Ultimate.allocInit(4, 18);call write~init~int(37, 18, 0, 1);call write~init~int(100, 18, 1, 1);call write~init~int(10, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(9, 19);call #Ultimate.allocInit(36, 20);call #Ultimate.allocInit(18, 21);call #Ultimate.allocInit(8, 22);call #Ultimate.allocInit(16, 23);call #Ultimate.allocInit(27, 24);call #Ultimate.allocInit(12, 25);call #Ultimate.allocInit(32, 26);call #Ultimate.allocInit(12, 27);call #Ultimate.allocInit(33, 28);call #Ultimate.allocInit(4, 29);call write~init~int(118, 29, 0, 1);call write~init~int(105, 29, 1, 1);call write~init~int(111, 29, 2, 1);call write~init~int(0, 29, 3, 1);call #Ultimate.allocInit(27, 30);call #Ultimate.allocInit(11, 31);call #Ultimate.allocInit(20, 32);call #Ultimate.allocInit(25, 33);call #Ultimate.allocInit(26, 34);call #Ultimate.allocInit(12, 35);call #Ultimate.allocInit(20, 36);call #Ultimate.allocInit(8, 37);call #Ultimate.allocInit(32, 38);call #Ultimate.allocInit(44, 39);call #Ultimate.allocInit(42, 40);call #Ultimate.allocInit(8, 41);~ldv_state_variable_8~0 := 0;~ldv_work_struct_3_1~0.base, ~ldv_work_struct_3_1~0.offset := 0, 0;~ldv_timer_4_0~0 := 0;~ldv_state_variable_0~0 := 0;~ldv_state_variable_5~0 := 0;~ldv_irq_2_0~0 := 0;~ldv_work_3_2~0 := 0;~ldv_irq_dev_2_0~0.base, ~ldv_irq_dev_2_0~0.offset := 0, 0;~ldv_work_3_0~0 := 0;~ldv_timer_4_3~0 := 0;~ldv_irq_data_2_3~0.base, ~ldv_irq_data_2_3~0.offset := 0, 0;~ldv_irq_2_2~0 := 0;~ldv_irq_dev_1_2~0.base, ~ldv_irq_dev_1_2~0.offset := 0, 0;~ldv_irq_line_2_0~0 := 0;~ldv_irq_dev_2_1~0.base, ~ldv_irq_dev_2_1~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_data_2_2~0.base, ~ldv_irq_data_2_2~0.offset := 0, 0;~ldv_irq_line_1_1~0 := 0;~ldv_work_3_3~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_state_variable_7~0 := 0;~ldv_irq_line_1_2~0 := 0;~ldv_work_struct_3_3~0.base, ~ldv_work_struct_3_3~0.offset := 0, 0;~ldv_irq_dev_2_2~0.base, ~ldv_irq_dev_2_2~0.offset := 0, 0;~ldv_irq_line_2_3~0 := 0;~ldv_irq_2_1~0 := 0;~ldv_irq_data_2_1~0.base, ~ldv_irq_data_2_1~0.offset := 0, 0;~ldv_irq_1_3~0 := 0;~ldv_irq_dev_1_1~0.base, ~ldv_irq_dev_1_1~0.offset := 0, 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_line_2_2~0 := 0;~ldv_timer_4_2~0 := 0;~ldv_irq_1_0~0 := 0;~ldv_timer_list_4_0~0.base, ~ldv_timer_list_4_0~0.offset := 0, 0;~ldv_work_struct_3_2~0.base, ~ldv_work_struct_3_2~0.offset := 0, 0;~ldv_state_variable_6~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~tsc2005_driver_group0~0.base, ~tsc2005_driver_group0~0.offset := 0, 0;~ldv_work_3_1~0 := 0;~ldv_irq_line_2_1~0 := 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~ldv_irq_dev_1_3~0.base, ~ldv_irq_dev_1_3~0.offset := 0, 0;~ldv_state_variable_2~0 := 0;~ldv_irq_dev_1_0~0.base, ~ldv_irq_dev_1_0~0.offset := 0, 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_irq_dev_2_3~0.base, ~ldv_irq_dev_2_3~0.offset := 0, 0;~ldv_irq_data_2_0~0.base, ~ldv_irq_data_2_0~0.offset := 0, 0;~ldv_work_struct_3_0~0.base, ~ldv_work_struct_3_0~0.offset := 0, 0;~ldv_timer_list_4_3~0.base, ~ldv_timer_list_4_3~0.offset := 0, 0;~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_timer_list_4_2~0.base, ~ldv_timer_list_4_2~0.offset := 0, 0;~ldv_irq_1_1~0 := 0;~ldv_irq_2_3~0 := 0;~ldv_irq_line_1_3~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_irq_line_1_0~0 := 0;~tsc2005_pm_ops_group1~0.base, ~tsc2005_pm_ops_group1~0.offset := 0, 0;~ldv_timer_4_1~0 := 0;~ldv_timer_list_4_1~0.base, ~ldv_timer_list_4_1~0.offset := 0, 0;~ldv_state_variable_4~0 := 0;~#dev_attr_selftest~0.base, ~#dev_attr_selftest~0.offset := 42, 0;call #Ultimate.allocInit(43, 42);call write~init~$Pointer$(19, 0, ~#dev_attr_selftest~0.base, ~#dev_attr_selftest~0.offset, 8);call write~init~int(292, ~#dev_attr_selftest~0.base, 8 + ~#dev_attr_selftest~0.offset, 2);call write~init~int(0, ~#dev_attr_selftest~0.base, 10 + ~#dev_attr_selftest~0.offset, 1);call write~init~$Pointer$(0, 0, ~#dev_attr_selftest~0.base, 11 + ~#dev_attr_selftest~0.offset, 8);call write~init~int(0, ~#dev_attr_selftest~0.base, 19 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 20 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 21 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 22 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 23 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 24 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 25 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 26 + ~#dev_attr_selftest~0.offset, 1);call write~init~$Pointer$(#funAddr~tsc2005_selftest_show.base, #funAddr~tsc2005_selftest_show.offset, ~#dev_attr_selftest~0.base, 27 + ~#dev_attr_selftest~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dev_attr_selftest~0.base, 35 + ~#dev_attr_selftest~0.offset, 8);~#tsc2005_attrs~0.base, ~#tsc2005_attrs~0.offset := 43, 0;call #Ultimate.allocInit(16, 43);call write~init~$Pointer$(~#dev_attr_selftest~0.base, ~#dev_attr_selftest~0.offset, ~#tsc2005_attrs~0.base, ~#tsc2005_attrs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_attrs~0.base, 8 + ~#tsc2005_attrs~0.offset, 8);~#tsc2005_attr_group~0.base, ~#tsc2005_attr_group~0.offset := 44, 0;call #Ultimate.allocInit(32, 44);call write~init~$Pointer$(0, 0, ~#tsc2005_attr_group~0.base, ~#tsc2005_attr_group~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_attr_is_visible.base, #funAddr~tsc2005_attr_is_visible.offset, ~#tsc2005_attr_group~0.base, 8 + ~#tsc2005_attr_group~0.offset, 8);call write~init~$Pointer$(~#tsc2005_attrs~0.base, ~#tsc2005_attrs~0.offset, ~#tsc2005_attr_group~0.base, 16 + ~#tsc2005_attr_group~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_attr_group~0.base, 24 + ~#tsc2005_attr_group~0.offset, 8);~#tsc2005_pm_ops~0.base, ~#tsc2005_pm_ops~0.offset := 45, 0;call #Ultimate.allocInit(184, 45);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 8 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_suspend.base, #funAddr~tsc2005_suspend.offset, ~#tsc2005_pm_ops~0.base, 16 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_resume.base, #funAddr~tsc2005_resume.offset, ~#tsc2005_pm_ops~0.base, 24 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_suspend.base, #funAddr~tsc2005_suspend.offset, ~#tsc2005_pm_ops~0.base, 32 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_resume.base, #funAddr~tsc2005_resume.offset, ~#tsc2005_pm_ops~0.base, 40 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_suspend.base, #funAddr~tsc2005_suspend.offset, ~#tsc2005_pm_ops~0.base, 48 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_resume.base, #funAddr~tsc2005_resume.offset, ~#tsc2005_pm_ops~0.base, 56 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 64 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 72 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 80 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 88 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 96 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 104 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 112 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 120 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 128 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 136 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 144 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 152 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 160 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 168 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 176 + ~#tsc2005_pm_ops~0.offset, 8);~#tsc2005_driver~0.base, ~#tsc2005_driver~0.offset := 46, 0;call #Ultimate.allocInit(149, 46);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_probe.base, #funAddr~tsc2005_probe.offset, ~#tsc2005_driver~0.base, 8 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_remove.base, #funAddr~tsc2005_remove.offset, ~#tsc2005_driver~0.base, 16 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 24 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(41, 0, ~#tsc2005_driver~0.base, 32 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 40 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#tsc2005_driver~0.base, 48 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 56 + ~#tsc2005_driver~0.offset, 8);call write~init~int(0, ~#tsc2005_driver~0.base, 64 + ~#tsc2005_driver~0.offset, 1);call write~init~int(0, ~#tsc2005_driver~0.base, 65 + ~#tsc2005_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 69 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 77 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 85 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 93 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 101 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 109 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 117 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 125 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(~#tsc2005_pm_ops~0.base, ~#tsc2005_pm_ops~0.offset, ~#tsc2005_driver~0.base, 133 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 141 + ~#tsc2005_driver~0.offset, 8);~ldv_retval_20~0 := 0;~ldv_retval_18~0 := 0;~ldv_retval_2~0 := 0;~ldv_retval_5~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_11~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_15~0 := 0;~ldv_retval_16~0 := 0;~ldv_retval_8~0 := 0;~ldv_retval_7~0 := 0;~ldv_retval_19~0 := 0;~ldv_retval_14~0 := 0;~ldv_retval_17~0 := 0;~ldv_retval_12~0 := 0;~ldv_retval_6~0 := 0;~ldv_retval_13~0 := 0;~ldv_retval_9~0 := 0;~ldv_retval_10~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_3~0 := 0;~ldv_mutex_i_mutex_of_inode~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_mutex_of_tsc2005~0 := 1; {899#true} is VALID [2022-02-20 22:16:32,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {899#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret352#1.base, main_#t~ret352#1.offset, 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~ret356#1.base, main_#t~ret356#1.offset, main_#t~ret357#1.base, main_#t~ret357#1.offset, main_#t~nondet358#1, main_#t~switch359#1, main_#t~nondet360#1, main_#t~switch361#1, main_#t~ret362#1, main_#t~ret363#1, main_#t~ret364#1, main_#t~ret365#1, main_#t~ret366#1, main_#t~ret367#1, main_#t~ret368#1, main_#t~ret369#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~ret379#1, main_#t~ret380#1, main_#t~ret381#1, main_#t~nondet382#1, main_#t~switch383#1, main_#t~mem384#1, main_#t~ret385#1, main_#t~nondet386#1, main_#t~switch387#1, main_#t~ret388#1, main_#t~nondet389#1, main_#t~switch390#1, main_#t~ret391#1, main_#t~nondet392#1, main_#t~switch393#1, main_#t~ret394#1, main_#t~ret395#1, main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~37#1.base, main_~tmp~37#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___2~3#1.base, main_~tmp___2~3#1.offset, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset, main_~tmp___4~1#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1;call main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~37#1.base, main_~tmp~37#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___2~3#1.base, main_~tmp___2~3#1.offset;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset;havoc main_~tmp___4~1#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1; {899#true} is VALID [2022-02-20 22:16:32,512 INFO L272 TraceCheckUtils]: 2: Hoare triple {899#true} call main_#t~ret352#1.base, main_#t~ret352#1.offset := ldv_init_zalloc(296); {978#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:16:32,512 INFO L290 TraceCheckUtils]: 3: Hoare triple {978#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {899#true} is VALID [2022-02-20 22:16:32,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {899#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {986#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:16:32,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {986#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {899#true} is VALID [2022-02-20 22:16:32,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {899#true} assume true; {899#true} is VALID [2022-02-20 22:16:32,514 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {899#true} {899#true} #2227#return; {899#true} is VALID [2022-02-20 22:16:32,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {899#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {899#true} is VALID [2022-02-20 22:16:32,515 INFO L272 TraceCheckUtils]: 9: Hoare triple {899#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {899#true} is VALID [2022-02-20 22:16:32,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {899#true} ~cond := #in~cond; {899#true} is VALID [2022-02-20 22:16:32,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {899#true} assume 0 == ~cond;assume false; {900#false} is VALID [2022-02-20 22:16:32,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,525 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {900#false} {899#true} #2229#return; {900#false} is VALID [2022-02-20 22:16:32,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {900#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {900#false} is VALID [2022-02-20 22:16:32,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,526 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {900#false} {899#true} #2247#return; {900#false} is VALID [2022-02-20 22:16:32,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {900#false} main_~tmp~37#1.base, main_~tmp~37#1.offset := main_#t~ret352#1.base, main_#t~ret352#1.offset;havoc main_#t~ret352#1.base, main_#t~ret352#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~37#1.base, main_~tmp~37#1.offset; {900#false} is VALID [2022-02-20 22:16:32,526 INFO L272 TraceCheckUtils]: 18: Hoare triple {900#false} call main_#t~ret353#1.base, main_#t~ret353#1.offset := ldv_init_zalloc(32); {978#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:16:32,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {978#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {899#true} is VALID [2022-02-20 22:16:32,527 INFO L272 TraceCheckUtils]: 20: Hoare triple {899#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {986#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:16:32,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {986#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {899#true} is VALID [2022-02-20 22:16:32,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {899#true} assume true; {899#true} is VALID [2022-02-20 22:16:32,528 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {899#true} {899#true} #2227#return; {899#true} is VALID [2022-02-20 22:16:32,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {899#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {899#true} is VALID [2022-02-20 22:16:32,528 INFO L272 TraceCheckUtils]: 25: Hoare triple {899#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {899#true} is VALID [2022-02-20 22:16:32,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {899#true} ~cond := #in~cond; {899#true} is VALID [2022-02-20 22:16:32,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {899#true} assume 0 == ~cond;assume false; {900#false} is VALID [2022-02-20 22:16:32,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,529 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {900#false} {899#true} #2229#return; {900#false} is VALID [2022-02-20 22:16:32,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {900#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {900#false} is VALID [2022-02-20 22:16:32,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,529 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {900#false} {900#false} #2249#return; {900#false} is VALID [2022-02-20 22:16:32,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {900#false} main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset := main_#t~ret353#1.base, main_#t~ret353#1.offset;havoc main_#t~ret353#1.base, main_#t~ret353#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset; {900#false} is VALID [2022-02-20 22:16:32,530 INFO L272 TraceCheckUtils]: 34: Hoare triple {900#false} call main_#t~ret354#1.base, main_#t~ret354#1.offset := ldv_init_zalloc(1); {978#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:16:32,530 INFO L290 TraceCheckUtils]: 35: Hoare triple {978#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {899#true} is VALID [2022-02-20 22:16:32,531 INFO L272 TraceCheckUtils]: 36: Hoare triple {899#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {986#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:16:32,531 INFO L290 TraceCheckUtils]: 37: Hoare triple {986#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {899#true} is VALID [2022-02-20 22:16:32,531 INFO L290 TraceCheckUtils]: 38: Hoare triple {899#true} assume true; {899#true} is VALID [2022-02-20 22:16:32,531 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {899#true} {899#true} #2227#return; {899#true} is VALID [2022-02-20 22:16:32,531 INFO L290 TraceCheckUtils]: 40: Hoare triple {899#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {899#true} is VALID [2022-02-20 22:16:32,531 INFO L272 TraceCheckUtils]: 41: Hoare triple {899#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {899#true} is VALID [2022-02-20 22:16:32,532 INFO L290 TraceCheckUtils]: 42: Hoare triple {899#true} ~cond := #in~cond; {899#true} is VALID [2022-02-20 22:16:32,532 INFO L290 TraceCheckUtils]: 43: Hoare triple {899#true} assume 0 == ~cond;assume false; {900#false} is VALID [2022-02-20 22:16:32,532 INFO L290 TraceCheckUtils]: 44: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,532 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {900#false} {899#true} #2229#return; {900#false} is VALID [2022-02-20 22:16:32,532 INFO L290 TraceCheckUtils]: 46: Hoare triple {900#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {900#false} is VALID [2022-02-20 22:16:32,532 INFO L290 TraceCheckUtils]: 47: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,533 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {900#false} {900#false} #2251#return; {900#false} is VALID [2022-02-20 22:16:32,533 INFO L290 TraceCheckUtils]: 49: Hoare triple {900#false} main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset := main_#t~ret354#1.base, main_#t~ret354#1.offset;havoc main_#t~ret354#1.base, main_#t~ret354#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset; {900#false} is VALID [2022-02-20 22:16:32,534 INFO L272 TraceCheckUtils]: 50: Hoare triple {900#false} call main_#t~ret355#1.base, main_#t~ret355#1.offset := ldv_init_zalloc(1416); {978#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:16:32,536 INFO L290 TraceCheckUtils]: 51: Hoare triple {978#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {899#true} is VALID [2022-02-20 22:16:32,537 INFO L272 TraceCheckUtils]: 52: Hoare triple {899#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {986#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:16:32,537 INFO L290 TraceCheckUtils]: 53: Hoare triple {986#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {899#true} is VALID [2022-02-20 22:16:32,537 INFO L290 TraceCheckUtils]: 54: Hoare triple {899#true} assume true; {899#true} is VALID [2022-02-20 22:16:32,537 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {899#true} {899#true} #2227#return; {899#true} is VALID [2022-02-20 22:16:32,539 INFO L290 TraceCheckUtils]: 56: Hoare triple {899#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {899#true} is VALID [2022-02-20 22:16:32,540 INFO L272 TraceCheckUtils]: 57: Hoare triple {899#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {899#true} is VALID [2022-02-20 22:16:32,540 INFO L290 TraceCheckUtils]: 58: Hoare triple {899#true} ~cond := #in~cond; {899#true} is VALID [2022-02-20 22:16:32,540 INFO L290 TraceCheckUtils]: 59: Hoare triple {899#true} assume 0 == ~cond;assume false; {900#false} is VALID [2022-02-20 22:16:32,541 INFO L290 TraceCheckUtils]: 60: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,541 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {900#false} {899#true} #2229#return; {900#false} is VALID [2022-02-20 22:16:32,542 INFO L290 TraceCheckUtils]: 62: Hoare triple {900#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {900#false} is VALID [2022-02-20 22:16:32,542 INFO L290 TraceCheckUtils]: 63: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,542 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {900#false} {900#false} #2253#return; {900#false} is VALID [2022-02-20 22:16:32,542 INFO L290 TraceCheckUtils]: 65: Hoare triple {900#false} main_~tmp___2~3#1.base, main_~tmp___2~3#1.offset := main_#t~ret355#1.base, main_#t~ret355#1.offset;havoc main_#t~ret355#1.base, main_#t~ret355#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___2~3#1.base, main_~tmp___2~3#1.offset; {900#false} is VALID [2022-02-20 22:16:32,542 INFO L272 TraceCheckUtils]: 66: Hoare triple {900#false} call main_#t~ret356#1.base, main_#t~ret356#1.offset := ldv_init_zalloc(48); {978#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:16:32,542 INFO L290 TraceCheckUtils]: 67: Hoare triple {978#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {899#true} is VALID [2022-02-20 22:16:32,543 INFO L272 TraceCheckUtils]: 68: Hoare triple {899#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {986#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:16:32,543 INFO L290 TraceCheckUtils]: 69: Hoare triple {986#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {899#true} is VALID [2022-02-20 22:16:32,544 INFO L290 TraceCheckUtils]: 70: Hoare triple {899#true} assume true; {899#true} is VALID [2022-02-20 22:16:32,544 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {899#true} {899#true} #2227#return; {899#true} is VALID [2022-02-20 22:16:32,544 INFO L290 TraceCheckUtils]: 72: Hoare triple {899#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {899#true} is VALID [2022-02-20 22:16:32,544 INFO L272 TraceCheckUtils]: 73: Hoare triple {899#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {899#true} is VALID [2022-02-20 22:16:32,544 INFO L290 TraceCheckUtils]: 74: Hoare triple {899#true} ~cond := #in~cond; {899#true} is VALID [2022-02-20 22:16:32,544 INFO L290 TraceCheckUtils]: 75: Hoare triple {899#true} assume 0 == ~cond;assume false; {900#false} is VALID [2022-02-20 22:16:32,545 INFO L290 TraceCheckUtils]: 76: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,545 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {900#false} {899#true} #2229#return; {900#false} is VALID [2022-02-20 22:16:32,545 INFO L290 TraceCheckUtils]: 78: Hoare triple {900#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {900#false} is VALID [2022-02-20 22:16:32,545 INFO L290 TraceCheckUtils]: 79: Hoare triple {900#false} assume true; {900#false} is VALID [2022-02-20 22:16:32,545 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {900#false} {900#false} #2255#return; {900#false} is VALID [2022-02-20 22:16:32,545 INFO L290 TraceCheckUtils]: 81: Hoare triple {900#false} main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset := main_#t~ret356#1.base, main_#t~ret356#1.offset;havoc main_#t~ret356#1.base, main_#t~ret356#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset;assume { :begin_inline_ldv_initialize } true; {900#false} is VALID [2022-02-20 22:16:32,546 INFO L290 TraceCheckUtils]: 82: Hoare triple {900#false} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_ldv_memset } true;ldv_memset_#in~s#1.base, ldv_memset_#in~s#1.offset, ldv_memset_#in~c#1, ldv_memset_#in~n#1 := main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset, 0, 4;havoc ldv_memset_#res#1.base, ldv_memset_#res#1.offset;havoc ldv_memset_#t~memset~res35#1.base, ldv_memset_#t~memset~res35#1.offset, ldv_memset_~s#1.base, ldv_memset_~s#1.offset, ldv_memset_~c#1, ldv_memset_~n#1, ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset;ldv_memset_~s#1.base, ldv_memset_~s#1.offset := ldv_memset_#in~s#1.base, ldv_memset_#in~s#1.offset;ldv_memset_~c#1 := ldv_memset_#in~c#1;ldv_memset_~n#1 := ldv_memset_#in~n#1;havoc ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset; {900#false} is VALID [2022-02-20 22:16:32,546 INFO L272 TraceCheckUtils]: 83: Hoare triple {900#false} call ldv_memset_#t~memset~res35#1.base, ldv_memset_#t~memset~res35#1.offset := #Ultimate.C_memset(ldv_memset_~s#1.base, ldv_memset_~s#1.offset, ldv_memset_~c#1, ldv_memset_~n#1); {1015#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:16:32,546 INFO L290 TraceCheckUtils]: 84: Hoare triple {1015#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr488 := 0; {899#true} is VALID [2022-02-20 22:16:32,546 INFO L290 TraceCheckUtils]: 85: Hoare triple {899#true} assume !(#t~loopctr488 % 18446744073709551616 < #amount % 18446744073709551616); {899#true} is VALID [2022-02-20 22:16:32,546 INFO L290 TraceCheckUtils]: 86: Hoare triple {899#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {899#true} is VALID [2022-02-20 22:16:32,547 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {899#true} {900#false} #2257#return; {900#false} is VALID [2022-02-20 22:16:32,548 INFO L290 TraceCheckUtils]: 88: Hoare triple {900#false} ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset := ldv_memset_~s#1.base, ldv_memset_~s#1.offset;havoc ldv_memset_#t~memset~res35#1.base, ldv_memset_#t~memset~res35#1.offset;ldv_memset_#res#1.base, ldv_memset_#res#1.offset := ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset; {900#false} is VALID [2022-02-20 22:16:32,548 INFO L290 TraceCheckUtils]: 89: Hoare triple {900#false} main_#t~ret357#1.base, main_#t~ret357#1.offset := ldv_memset_#res#1.base, ldv_memset_#res#1.offset;assume { :end_inline_ldv_memset } true;havoc main_#t~ret357#1.base, main_#t~ret357#1.offset;~ldv_state_variable_6~0 := 0;assume { :begin_inline_work_init_3 } true;~ldv_work_3_0~0 := 0;~ldv_work_3_1~0 := 0;~ldv_work_3_2~0 := 0;~ldv_work_3_3~0 := 0; {900#false} is VALID [2022-02-20 22:16:32,548 INFO L290 TraceCheckUtils]: 90: Hoare triple {900#false} assume { :end_inline_work_init_3 } true;~ldv_state_variable_3~0 := 1;~ldv_state_variable_7~0 := 0;~ldv_state_variable_2~0 := 1;~ldv_state_variable_8~0 := 0;~ldv_state_variable_1~0 := 1;assume { :begin_inline_timer_init_4 } true;~ldv_timer_4_0~0 := 0;~ldv_timer_4_1~0 := 0;~ldv_timer_4_2~0 := 0;~ldv_timer_4_3~0 := 0; {900#false} is VALID [2022-02-20 22:16:32,548 INFO L290 TraceCheckUtils]: 91: Hoare triple {900#false} assume { :end_inline_timer_init_4 } true;~ldv_state_variable_4~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_5~0 := 0; {900#false} is VALID [2022-02-20 22:16:32,548 INFO L290 TraceCheckUtils]: 92: Hoare triple {900#false} assume -2147483648 <= main_#t~nondet358#1 && main_#t~nondet358#1 <= 2147483647;main_~tmp___4~1#1 := main_#t~nondet358#1;havoc main_#t~nondet358#1;main_#t~switch359#1 := 0 == main_~tmp___4~1#1; {900#false} is VALID [2022-02-20 22:16:32,549 INFO L290 TraceCheckUtils]: 93: Hoare triple {900#false} assume !main_#t~switch359#1;main_#t~switch359#1 := main_#t~switch359#1 || 1 == main_~tmp___4~1#1; {900#false} is VALID [2022-02-20 22:16:32,549 INFO L290 TraceCheckUtils]: 94: Hoare triple {900#false} assume main_#t~switch359#1; {900#false} is VALID [2022-02-20 22:16:32,549 INFO L290 TraceCheckUtils]: 95: Hoare triple {900#false} assume 0 != ~ldv_state_variable_3~0;assume { :begin_inline_invoke_work_3 } true;havoc invoke_work_3_#t~nondet341#1, invoke_work_3_#t~switch342#1, invoke_work_3_~tmp~34#1;havoc invoke_work_3_~tmp~34#1;assume -2147483648 <= invoke_work_3_#t~nondet341#1 && invoke_work_3_#t~nondet341#1 <= 2147483647;invoke_work_3_~tmp~34#1 := invoke_work_3_#t~nondet341#1;havoc invoke_work_3_#t~nondet341#1;invoke_work_3_#t~switch342#1 := 0 == invoke_work_3_~tmp~34#1; {900#false} is VALID [2022-02-20 22:16:32,550 INFO L290 TraceCheckUtils]: 96: Hoare triple {900#false} assume !invoke_work_3_#t~switch342#1;invoke_work_3_#t~switch342#1 := invoke_work_3_#t~switch342#1 || 1 == invoke_work_3_~tmp~34#1; {900#false} is VALID [2022-02-20 22:16:32,550 INFO L290 TraceCheckUtils]: 97: Hoare triple {900#false} assume !invoke_work_3_#t~switch342#1;invoke_work_3_#t~switch342#1 := invoke_work_3_#t~switch342#1 || 2 == invoke_work_3_~tmp~34#1; {900#false} is VALID [2022-02-20 22:16:32,550 INFO L290 TraceCheckUtils]: 98: Hoare triple {900#false} assume invoke_work_3_#t~switch342#1; {900#false} is VALID [2022-02-20 22:16:32,550 INFO L290 TraceCheckUtils]: 99: Hoare triple {900#false} assume 2 == ~ldv_work_3_2~0 || 3 == ~ldv_work_3_2~0;~ldv_work_3_2~0 := 4; {900#false} is VALID [2022-02-20 22:16:32,550 INFO L272 TraceCheckUtils]: 100: Hoare triple {900#false} call tsc2005_esd_work(~ldv_work_struct_3_0~0.base, ~ldv_work_struct_3_0~0.offset); {900#false} is VALID [2022-02-20 22:16:32,550 INFO L290 TraceCheckUtils]: 101: Hoare triple {900#false} ~work#1.base, ~work#1.offset := #in~work#1.base, #in~work#1.offset;havoc ~ts~4#1.base, ~ts~4#1.offset;havoc ~__mptr~2#1.base, ~__mptr~2#1.offset;havoc ~error~5#1;call ~#r~0#1.base, ~#r~0#1.offset := #Ultimate.allocOnStack(2);havoc ~tmp~21#1;havoc ~tmp___0~7#1;havoc ~tmp___1~2#1;havoc ~tmp___2~1#1;~__mptr~2#1.base, ~__mptr~2#1.offset := ~work#1.base, ~work#1.offset;~ts~4#1.base, ~ts~4#1.offset := ~__mptr~2#1.base, -1059552 + ~__mptr~2#1.offset;assume { :begin_inline_ldv_mutex_trylock_23 } true;ldv_mutex_trylock_23_#in~ldv_func_arg1#1.base, ldv_mutex_trylock_23_#in~ldv_func_arg1#1.offset := ~ts~4#1.base, 533 + ~ts~4#1.offset;havoc ldv_mutex_trylock_23_#res#1;havoc ldv_mutex_trylock_23_#t~ret409#1, ldv_mutex_trylock_23_#t~ret410#1, ldv_mutex_trylock_23_~ldv_func_arg1#1.base, ldv_mutex_trylock_23_~ldv_func_arg1#1.offset, ldv_mutex_trylock_23_~ldv_func_res~9#1, ldv_mutex_trylock_23_~tmp~49#1, ldv_mutex_trylock_23_~tmp___0~16#1;ldv_mutex_trylock_23_~ldv_func_arg1#1.base, ldv_mutex_trylock_23_~ldv_func_arg1#1.offset := ldv_mutex_trylock_23_#in~ldv_func_arg1#1.base, ldv_mutex_trylock_23_#in~ldv_func_arg1#1.offset;havoc ldv_mutex_trylock_23_~ldv_func_res~9#1;havoc ldv_mutex_trylock_23_~tmp~49#1;havoc ldv_mutex_trylock_23_~tmp___0~16#1; {900#false} is VALID [2022-02-20 22:16:32,551 INFO L272 TraceCheckUtils]: 102: Hoare triple {900#false} call ldv_mutex_trylock_23_#t~ret409#1 := mutex_trylock(ldv_mutex_trylock_23_~ldv_func_arg1#1.base, ldv_mutex_trylock_23_~ldv_func_arg1#1.offset); {899#true} is VALID [2022-02-20 22:16:32,551 INFO L290 TraceCheckUtils]: 103: Hoare triple {899#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;assume -2147483648 <= #t~nondet474 && #t~nondet474 <= 2147483647;#res := #t~nondet474;havoc #t~nondet474; {899#true} is VALID [2022-02-20 22:16:32,551 INFO L290 TraceCheckUtils]: 104: Hoare triple {899#true} assume true; {899#true} is VALID [2022-02-20 22:16:32,551 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {899#true} {900#false} #2187#return; {900#false} is VALID [2022-02-20 22:16:32,551 INFO L290 TraceCheckUtils]: 106: Hoare triple {900#false} assume -2147483648 <= ldv_mutex_trylock_23_#t~ret409#1 && ldv_mutex_trylock_23_#t~ret409#1 <= 2147483647;ldv_mutex_trylock_23_~tmp~49#1 := ldv_mutex_trylock_23_#t~ret409#1;havoc ldv_mutex_trylock_23_#t~ret409#1;ldv_mutex_trylock_23_~ldv_func_res~9#1 := ldv_mutex_trylock_23_~tmp~49#1; {900#false} is VALID [2022-02-20 22:16:32,551 INFO L272 TraceCheckUtils]: 107: Hoare triple {900#false} call ldv_mutex_trylock_23_#t~ret410#1 := ldv_mutex_trylock_mutex_of_tsc2005(ldv_mutex_trylock_23_~ldv_func_arg1#1.base, ldv_mutex_trylock_23_~ldv_func_arg1#1.offset); {900#false} is VALID [2022-02-20 22:16:32,552 INFO L290 TraceCheckUtils]: 108: Hoare triple {900#false} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;havoc ~is_mutex_held_by_another_thread~3; {900#false} is VALID [2022-02-20 22:16:32,552 INFO L290 TraceCheckUtils]: 109: Hoare triple {900#false} assume 1 != ~ldv_mutex_mutex_of_tsc2005~0; {900#false} is VALID [2022-02-20 22:16:32,552 INFO L272 TraceCheckUtils]: 110: Hoare triple {900#false} call ldv_error(); {900#false} is VALID [2022-02-20 22:16:32,552 INFO L290 TraceCheckUtils]: 111: Hoare triple {900#false} assume !false; {900#false} is VALID [2022-02-20 22:16:32,552 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-02-20 22:16:32,553 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:16:32,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365537939] [2022-02-20 22:16:32,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365537939] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:16:32,555 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:16:32,555 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 22:16:32,556 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724889810] [2022-02-20 22:16:32,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:16:32,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 112 [2022-02-20 22:16:32,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:16:32,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.8) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:16:32,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:16:32,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 22:16:32,619 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:16:32,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 22:16:32,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 22:16:32,655 INFO L87 Difference]: Start difference. First operand has 896 states, 635 states have (on average 1.395275590551181) internal successors, (886), 666 states have internal predecessors, (886), 194 states have call successors, (194), 66 states have call predecessors, (194), 65 states have return successors, (182), 179 states have call predecessors, (182), 182 states have call successors, (182) Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:16:36,486 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 22:16:40,497 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 22:16:42,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:16:42,139 INFO L93 Difference]: Finished difference Result 1824 states and 2611 transitions. [2022-02-20 22:16:42,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 22:16:42,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 112 [2022-02-20 22:16:42,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:16:42,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:16:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2611 transitions. [2022-02-20 22:16:42,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:16:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2611 transitions. [2022-02-20 22:16:42,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 2611 transitions. [2022-02-20 22:16:44,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2611 edges. 2611 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:16:44,270 INFO L225 Difference]: With dead ends: 1824 [2022-02-20 22:16:44,270 INFO L226 Difference]: Without dead ends: 914 [2022-02-20 22:16:44,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:16:44,278 INFO L933 BasicCegarLoop]: 1164 mSDtfsCounter, 524 mSDsluCounter, 1755 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 456 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 2919 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-02-20 22:16:44,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [542 Valid, 2919 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 664 Invalid, 2 Unknown, 0 Unchecked, 5.8s Time] [2022-02-20 22:16:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2022-02-20 22:16:44,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 877. [2022-02-20 22:16:44,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:16:44,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 914 states. Second operand has 877 states, 630 states have (on average 1.3698412698412699) internal successors, (863), 647 states have internal predecessors, (863), 182 states have call successors, (182), 65 states have call predecessors, (182), 64 states have return successors, (175), 172 states have call predecessors, (175), 175 states have call successors, (175) [2022-02-20 22:16:44,374 INFO L74 IsIncluded]: Start isIncluded. First operand 914 states. Second operand has 877 states, 630 states have (on average 1.3698412698412699) internal successors, (863), 647 states have internal predecessors, (863), 182 states have call successors, (182), 65 states have call predecessors, (182), 64 states have return successors, (175), 172 states have call predecessors, (175), 175 states have call successors, (175) [2022-02-20 22:16:44,376 INFO L87 Difference]: Start difference. First operand 914 states. Second operand has 877 states, 630 states have (on average 1.3698412698412699) internal successors, (863), 647 states have internal predecessors, (863), 182 states have call successors, (182), 65 states have call predecessors, (182), 64 states have return successors, (175), 172 states have call predecessors, (175), 175 states have call successors, (175) [2022-02-20 22:16:44,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:16:44,448 INFO L93 Difference]: Finished difference Result 914 states and 1280 transitions. [2022-02-20 22:16:44,448 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1280 transitions. [2022-02-20 22:16:44,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:16:44,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:16:44,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 877 states, 630 states have (on average 1.3698412698412699) internal successors, (863), 647 states have internal predecessors, (863), 182 states have call successors, (182), 65 states have call predecessors, (182), 64 states have return successors, (175), 172 states have call predecessors, (175), 175 states have call successors, (175) Second operand 914 states. [2022-02-20 22:16:44,466 INFO L87 Difference]: Start difference. First operand has 877 states, 630 states have (on average 1.3698412698412699) internal successors, (863), 647 states have internal predecessors, (863), 182 states have call successors, (182), 65 states have call predecessors, (182), 64 states have return successors, (175), 172 states have call predecessors, (175), 175 states have call successors, (175) Second operand 914 states. [2022-02-20 22:16:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:16:44,502 INFO L93 Difference]: Finished difference Result 914 states and 1280 transitions. [2022-02-20 22:16:44,503 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1280 transitions. [2022-02-20 22:16:44,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:16:44,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:16:44,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:16:44,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:16:44,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 630 states have (on average 1.3698412698412699) internal successors, (863), 647 states have internal predecessors, (863), 182 states have call successors, (182), 65 states have call predecessors, (182), 64 states have return successors, (175), 172 states have call predecessors, (175), 175 states have call successors, (175) [2022-02-20 22:16:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1220 transitions. [2022-02-20 22:16:44,550 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1220 transitions. Word has length 112 [2022-02-20 22:16:44,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:16:44,550 INFO L470 AbstractCegarLoop]: Abstraction has 877 states and 1220 transitions. [2022-02-20 22:16:44,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:16:44,551 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1220 transitions. [2022-02-20 22:16:44,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-02-20 22:16:44,552 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:16:44,553 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:16:44,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 22:16:44,553 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:16:44,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:16:44,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2136306119, now seen corresponding path program 1 times [2022-02-20 22:16:44,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:16:44,554 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150958937] [2022-02-20 22:16:44,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:16:44,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:16:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:44,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:16:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:44,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:16:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:44,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {6712#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6624#true} is VALID [2022-02-20 22:16:44,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,746 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6624#true} {6624#true} #2227#return; {6624#true} is VALID [2022-02-20 22:16:44,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:16:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:44,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {6624#true} ~cond := #in~cond; {6624#true} is VALID [2022-02-20 22:16:44,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {6624#true} assume !(0 == ~cond); {6624#true} is VALID [2022-02-20 22:16:44,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6624#true} {6624#true} #2229#return; {6624#true} is VALID [2022-02-20 22:16:44,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {6704#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {6624#true} is VALID [2022-02-20 22:16:44,759 INFO L272 TraceCheckUtils]: 1: Hoare triple {6624#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {6712#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:16:44,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {6712#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6624#true} is VALID [2022-02-20 22:16:44,759 INFO L290 TraceCheckUtils]: 3: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,759 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6624#true} {6624#true} #2227#return; {6624#true} is VALID [2022-02-20 22:16:44,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {6624#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {6624#true} is VALID [2022-02-20 22:16:44,760 INFO L272 TraceCheckUtils]: 6: Hoare triple {6624#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {6624#true} is VALID [2022-02-20 22:16:44,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {6624#true} ~cond := #in~cond; {6624#true} is VALID [2022-02-20 22:16:44,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {6624#true} assume !(0 == ~cond); {6624#true} is VALID [2022-02-20 22:16:44,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,760 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6624#true} {6624#true} #2229#return; {6624#true} is VALID [2022-02-20 22:16:44,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {6624#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {6624#true} is VALID [2022-02-20 22:16:44,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,761 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6624#true} {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} #2247#return; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:16:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:44,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:16:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:44,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {6712#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6624#true} is VALID [2022-02-20 22:16:44,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6624#true} {6624#true} #2227#return; {6624#true} is VALID [2022-02-20 22:16:44,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:16:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:44,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {6624#true} ~cond := #in~cond; {6624#true} is VALID [2022-02-20 22:16:44,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {6624#true} assume !(0 == ~cond); {6624#true} is VALID [2022-02-20 22:16:44,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6624#true} {6624#true} #2229#return; {6624#true} is VALID [2022-02-20 22:16:44,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {6704#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {6624#true} is VALID [2022-02-20 22:16:44,797 INFO L272 TraceCheckUtils]: 1: Hoare triple {6624#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {6712#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:16:44,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {6712#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6624#true} is VALID [2022-02-20 22:16:44,800 INFO L290 TraceCheckUtils]: 3: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,800 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6624#true} {6624#true} #2227#return; {6624#true} is VALID [2022-02-20 22:16:44,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {6624#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {6624#true} is VALID [2022-02-20 22:16:44,801 INFO L272 TraceCheckUtils]: 6: Hoare triple {6624#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {6624#true} is VALID [2022-02-20 22:16:44,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {6624#true} ~cond := #in~cond; {6624#true} is VALID [2022-02-20 22:16:44,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {6624#true} assume !(0 == ~cond); {6624#true} is VALID [2022-02-20 22:16:44,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,801 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6624#true} {6624#true} #2229#return; {6624#true} is VALID [2022-02-20 22:16:44,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {6624#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {6624#true} is VALID [2022-02-20 22:16:44,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,802 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6624#true} {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} #2249#return; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:16:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:44,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:16:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:44,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {6712#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6624#true} is VALID [2022-02-20 22:16:44,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,827 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6624#true} {6624#true} #2227#return; {6624#true} is VALID [2022-02-20 22:16:44,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:16:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:44,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {6624#true} ~cond := #in~cond; {6624#true} is VALID [2022-02-20 22:16:44,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {6624#true} assume !(0 == ~cond); {6624#true} is VALID [2022-02-20 22:16:44,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6624#true} {6624#true} #2229#return; {6624#true} is VALID [2022-02-20 22:16:44,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {6704#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {6624#true} is VALID [2022-02-20 22:16:44,836 INFO L272 TraceCheckUtils]: 1: Hoare triple {6624#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {6712#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:16:44,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {6712#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6624#true} is VALID [2022-02-20 22:16:44,836 INFO L290 TraceCheckUtils]: 3: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,836 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6624#true} {6624#true} #2227#return; {6624#true} is VALID [2022-02-20 22:16:44,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {6624#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {6624#true} is VALID [2022-02-20 22:16:44,836 INFO L272 TraceCheckUtils]: 6: Hoare triple {6624#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {6624#true} is VALID [2022-02-20 22:16:44,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {6624#true} ~cond := #in~cond; {6624#true} is VALID [2022-02-20 22:16:44,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {6624#true} assume !(0 == ~cond); {6624#true} is VALID [2022-02-20 22:16:44,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,838 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6624#true} {6624#true} #2229#return; {6624#true} is VALID [2022-02-20 22:16:44,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {6624#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {6624#true} is VALID [2022-02-20 22:16:44,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,838 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6624#true} {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} #2251#return; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 22:16:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:44,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:16:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:44,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {6712#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6624#true} is VALID [2022-02-20 22:16:44,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,865 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6624#true} {6624#true} #2227#return; {6624#true} is VALID [2022-02-20 22:16:44,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:16:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:44,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {6624#true} ~cond := #in~cond; {6624#true} is VALID [2022-02-20 22:16:44,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {6624#true} assume !(0 == ~cond); {6624#true} is VALID [2022-02-20 22:16:44,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6624#true} {6624#true} #2229#return; {6624#true} is VALID [2022-02-20 22:16:44,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {6704#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {6624#true} is VALID [2022-02-20 22:16:44,871 INFO L272 TraceCheckUtils]: 1: Hoare triple {6624#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {6712#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:16:44,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {6712#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6624#true} is VALID [2022-02-20 22:16:44,871 INFO L290 TraceCheckUtils]: 3: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,871 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6624#true} {6624#true} #2227#return; {6624#true} is VALID [2022-02-20 22:16:44,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {6624#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {6624#true} is VALID [2022-02-20 22:16:44,872 INFO L272 TraceCheckUtils]: 6: Hoare triple {6624#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {6624#true} is VALID [2022-02-20 22:16:44,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {6624#true} ~cond := #in~cond; {6624#true} is VALID [2022-02-20 22:16:44,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {6624#true} assume !(0 == ~cond); {6624#true} is VALID [2022-02-20 22:16:44,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,872 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6624#true} {6624#true} #2229#return; {6624#true} is VALID [2022-02-20 22:16:44,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {6624#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {6624#true} is VALID [2022-02-20 22:16:44,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,873 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6624#true} {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} #2253#return; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 22:16:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:44,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:16:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:44,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {6712#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6624#true} is VALID [2022-02-20 22:16:44,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,893 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6624#true} {6624#true} #2227#return; {6624#true} is VALID [2022-02-20 22:16:44,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:16:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:44,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {6624#true} ~cond := #in~cond; {6624#true} is VALID [2022-02-20 22:16:44,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {6624#true} assume !(0 == ~cond); {6624#true} is VALID [2022-02-20 22:16:44,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6624#true} {6624#true} #2229#return; {6624#true} is VALID [2022-02-20 22:16:44,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {6704#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {6624#true} is VALID [2022-02-20 22:16:44,899 INFO L272 TraceCheckUtils]: 1: Hoare triple {6624#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {6712#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:16:44,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {6712#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6624#true} is VALID [2022-02-20 22:16:44,899 INFO L290 TraceCheckUtils]: 3: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,899 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6624#true} {6624#true} #2227#return; {6624#true} is VALID [2022-02-20 22:16:44,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {6624#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {6624#true} is VALID [2022-02-20 22:16:44,900 INFO L272 TraceCheckUtils]: 6: Hoare triple {6624#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {6624#true} is VALID [2022-02-20 22:16:44,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {6624#true} ~cond := #in~cond; {6624#true} is VALID [2022-02-20 22:16:44,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {6624#true} assume !(0 == ~cond); {6624#true} is VALID [2022-02-20 22:16:44,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,900 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6624#true} {6624#true} #2229#return; {6624#true} is VALID [2022-02-20 22:16:44,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {6624#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {6624#true} is VALID [2022-02-20 22:16:44,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,902 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6624#true} {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} #2255#return; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-02-20 22:16:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:44,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {6741#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr488 := 0; {6624#true} is VALID [2022-02-20 22:16:44,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {6624#true} assume !(#t~loopctr488 % 18446744073709551616 < #amount % 18446744073709551616); {6624#true} is VALID [2022-02-20 22:16:44,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {6624#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {6624#true} is VALID [2022-02-20 22:16:44,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6624#true} {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} #2257#return; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-02-20 22:16:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:16:44,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {6624#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;assume -2147483648 <= #t~nondet474 && #t~nondet474 <= 2147483647;#res := #t~nondet474;havoc #t~nondet474; {6624#true} is VALID [2022-02-20 22:16:44,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,949 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6624#true} {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} #2187#return; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {6624#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(89, 2);call #Ultimate.allocInit(36, 3);call #Ultimate.allocInit(12, 4);call #Ultimate.allocInit(48, 5);call #Ultimate.allocInit(14, 6);call #Ultimate.allocInit(8, 7);call #Ultimate.allocInit(25, 8);call #Ultimate.allocInit(214, 9);call #Ultimate.allocInit(32, 10);call #Ultimate.allocInit(32, 11);call #Ultimate.allocInit(32, 12);call #Ultimate.allocInit(33, 13);call #Ultimate.allocInit(44, 14);call #Ultimate.allocInit(27, 15);call #Ultimate.allocInit(44, 16);call #Ultimate.allocInit(39, 17);call #Ultimate.allocInit(4, 18);call write~init~int(37, 18, 0, 1);call write~init~int(100, 18, 1, 1);call write~init~int(10, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(9, 19);call #Ultimate.allocInit(36, 20);call #Ultimate.allocInit(18, 21);call #Ultimate.allocInit(8, 22);call #Ultimate.allocInit(16, 23);call #Ultimate.allocInit(27, 24);call #Ultimate.allocInit(12, 25);call #Ultimate.allocInit(32, 26);call #Ultimate.allocInit(12, 27);call #Ultimate.allocInit(33, 28);call #Ultimate.allocInit(4, 29);call write~init~int(118, 29, 0, 1);call write~init~int(105, 29, 1, 1);call write~init~int(111, 29, 2, 1);call write~init~int(0, 29, 3, 1);call #Ultimate.allocInit(27, 30);call #Ultimate.allocInit(11, 31);call #Ultimate.allocInit(20, 32);call #Ultimate.allocInit(25, 33);call #Ultimate.allocInit(26, 34);call #Ultimate.allocInit(12, 35);call #Ultimate.allocInit(20, 36);call #Ultimate.allocInit(8, 37);call #Ultimate.allocInit(32, 38);call #Ultimate.allocInit(44, 39);call #Ultimate.allocInit(42, 40);call #Ultimate.allocInit(8, 41);~ldv_state_variable_8~0 := 0;~ldv_work_struct_3_1~0.base, ~ldv_work_struct_3_1~0.offset := 0, 0;~ldv_timer_4_0~0 := 0;~ldv_state_variable_0~0 := 0;~ldv_state_variable_5~0 := 0;~ldv_irq_2_0~0 := 0;~ldv_work_3_2~0 := 0;~ldv_irq_dev_2_0~0.base, ~ldv_irq_dev_2_0~0.offset := 0, 0;~ldv_work_3_0~0 := 0;~ldv_timer_4_3~0 := 0;~ldv_irq_data_2_3~0.base, ~ldv_irq_data_2_3~0.offset := 0, 0;~ldv_irq_2_2~0 := 0;~ldv_irq_dev_1_2~0.base, ~ldv_irq_dev_1_2~0.offset := 0, 0;~ldv_irq_line_2_0~0 := 0;~ldv_irq_dev_2_1~0.base, ~ldv_irq_dev_2_1~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_data_2_2~0.base, ~ldv_irq_data_2_2~0.offset := 0, 0;~ldv_irq_line_1_1~0 := 0;~ldv_work_3_3~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_state_variable_7~0 := 0;~ldv_irq_line_1_2~0 := 0;~ldv_work_struct_3_3~0.base, ~ldv_work_struct_3_3~0.offset := 0, 0;~ldv_irq_dev_2_2~0.base, ~ldv_irq_dev_2_2~0.offset := 0, 0;~ldv_irq_line_2_3~0 := 0;~ldv_irq_2_1~0 := 0;~ldv_irq_data_2_1~0.base, ~ldv_irq_data_2_1~0.offset := 0, 0;~ldv_irq_1_3~0 := 0;~ldv_irq_dev_1_1~0.base, ~ldv_irq_dev_1_1~0.offset := 0, 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_line_2_2~0 := 0;~ldv_timer_4_2~0 := 0;~ldv_irq_1_0~0 := 0;~ldv_timer_list_4_0~0.base, ~ldv_timer_list_4_0~0.offset := 0, 0;~ldv_work_struct_3_2~0.base, ~ldv_work_struct_3_2~0.offset := 0, 0;~ldv_state_variable_6~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~tsc2005_driver_group0~0.base, ~tsc2005_driver_group0~0.offset := 0, 0;~ldv_work_3_1~0 := 0;~ldv_irq_line_2_1~0 := 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~ldv_irq_dev_1_3~0.base, ~ldv_irq_dev_1_3~0.offset := 0, 0;~ldv_state_variable_2~0 := 0;~ldv_irq_dev_1_0~0.base, ~ldv_irq_dev_1_0~0.offset := 0, 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_irq_dev_2_3~0.base, ~ldv_irq_dev_2_3~0.offset := 0, 0;~ldv_irq_data_2_0~0.base, ~ldv_irq_data_2_0~0.offset := 0, 0;~ldv_work_struct_3_0~0.base, ~ldv_work_struct_3_0~0.offset := 0, 0;~ldv_timer_list_4_3~0.base, ~ldv_timer_list_4_3~0.offset := 0, 0;~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_timer_list_4_2~0.base, ~ldv_timer_list_4_2~0.offset := 0, 0;~ldv_irq_1_1~0 := 0;~ldv_irq_2_3~0 := 0;~ldv_irq_line_1_3~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_irq_line_1_0~0 := 0;~tsc2005_pm_ops_group1~0.base, ~tsc2005_pm_ops_group1~0.offset := 0, 0;~ldv_timer_4_1~0 := 0;~ldv_timer_list_4_1~0.base, ~ldv_timer_list_4_1~0.offset := 0, 0;~ldv_state_variable_4~0 := 0;~#dev_attr_selftest~0.base, ~#dev_attr_selftest~0.offset := 42, 0;call #Ultimate.allocInit(43, 42);call write~init~$Pointer$(19, 0, ~#dev_attr_selftest~0.base, ~#dev_attr_selftest~0.offset, 8);call write~init~int(292, ~#dev_attr_selftest~0.base, 8 + ~#dev_attr_selftest~0.offset, 2);call write~init~int(0, ~#dev_attr_selftest~0.base, 10 + ~#dev_attr_selftest~0.offset, 1);call write~init~$Pointer$(0, 0, ~#dev_attr_selftest~0.base, 11 + ~#dev_attr_selftest~0.offset, 8);call write~init~int(0, ~#dev_attr_selftest~0.base, 19 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 20 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 21 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 22 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 23 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 24 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 25 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 26 + ~#dev_attr_selftest~0.offset, 1);call write~init~$Pointer$(#funAddr~tsc2005_selftest_show.base, #funAddr~tsc2005_selftest_show.offset, ~#dev_attr_selftest~0.base, 27 + ~#dev_attr_selftest~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dev_attr_selftest~0.base, 35 + ~#dev_attr_selftest~0.offset, 8);~#tsc2005_attrs~0.base, ~#tsc2005_attrs~0.offset := 43, 0;call #Ultimate.allocInit(16, 43);call write~init~$Pointer$(~#dev_attr_selftest~0.base, ~#dev_attr_selftest~0.offset, ~#tsc2005_attrs~0.base, ~#tsc2005_attrs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_attrs~0.base, 8 + ~#tsc2005_attrs~0.offset, 8);~#tsc2005_attr_group~0.base, ~#tsc2005_attr_group~0.offset := 44, 0;call #Ultimate.allocInit(32, 44);call write~init~$Pointer$(0, 0, ~#tsc2005_attr_group~0.base, ~#tsc2005_attr_group~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_attr_is_visible.base, #funAddr~tsc2005_attr_is_visible.offset, ~#tsc2005_attr_group~0.base, 8 + ~#tsc2005_attr_group~0.offset, 8);call write~init~$Pointer$(~#tsc2005_attrs~0.base, ~#tsc2005_attrs~0.offset, ~#tsc2005_attr_group~0.base, 16 + ~#tsc2005_attr_group~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_attr_group~0.base, 24 + ~#tsc2005_attr_group~0.offset, 8);~#tsc2005_pm_ops~0.base, ~#tsc2005_pm_ops~0.offset := 45, 0;call #Ultimate.allocInit(184, 45);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 8 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_suspend.base, #funAddr~tsc2005_suspend.offset, ~#tsc2005_pm_ops~0.base, 16 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_resume.base, #funAddr~tsc2005_resume.offset, ~#tsc2005_pm_ops~0.base, 24 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_suspend.base, #funAddr~tsc2005_suspend.offset, ~#tsc2005_pm_ops~0.base, 32 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_resume.base, #funAddr~tsc2005_resume.offset, ~#tsc2005_pm_ops~0.base, 40 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_suspend.base, #funAddr~tsc2005_suspend.offset, ~#tsc2005_pm_ops~0.base, 48 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_resume.base, #funAddr~tsc2005_resume.offset, ~#tsc2005_pm_ops~0.base, 56 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 64 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 72 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 80 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 88 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 96 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 104 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 112 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 120 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 128 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 136 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 144 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 152 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 160 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 168 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 176 + ~#tsc2005_pm_ops~0.offset, 8);~#tsc2005_driver~0.base, ~#tsc2005_driver~0.offset := 46, 0;call #Ultimate.allocInit(149, 46);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_probe.base, #funAddr~tsc2005_probe.offset, ~#tsc2005_driver~0.base, 8 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_remove.base, #funAddr~tsc2005_remove.offset, ~#tsc2005_driver~0.base, 16 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 24 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(41, 0, ~#tsc2005_driver~0.base, 32 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 40 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#tsc2005_driver~0.base, 48 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 56 + ~#tsc2005_driver~0.offset, 8);call write~init~int(0, ~#tsc2005_driver~0.base, 64 + ~#tsc2005_driver~0.offset, 1);call write~init~int(0, ~#tsc2005_driver~0.base, 65 + ~#tsc2005_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 69 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 77 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 85 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 93 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 101 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 109 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 117 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 125 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(~#tsc2005_pm_ops~0.base, ~#tsc2005_pm_ops~0.offset, ~#tsc2005_driver~0.base, 133 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 141 + ~#tsc2005_driver~0.offset, 8);~ldv_retval_20~0 := 0;~ldv_retval_18~0 := 0;~ldv_retval_2~0 := 0;~ldv_retval_5~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_11~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_15~0 := 0;~ldv_retval_16~0 := 0;~ldv_retval_8~0 := 0;~ldv_retval_7~0 := 0;~ldv_retval_19~0 := 0;~ldv_retval_14~0 := 0;~ldv_retval_17~0 := 0;~ldv_retval_12~0 := 0;~ldv_retval_6~0 := 0;~ldv_retval_13~0 := 0;~ldv_retval_9~0 := 0;~ldv_retval_10~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_3~0 := 0;~ldv_mutex_i_mutex_of_inode~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_mutex_of_tsc2005~0 := 1; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret352#1.base, main_#t~ret352#1.offset, 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~ret356#1.base, main_#t~ret356#1.offset, main_#t~ret357#1.base, main_#t~ret357#1.offset, main_#t~nondet358#1, main_#t~switch359#1, main_#t~nondet360#1, main_#t~switch361#1, main_#t~ret362#1, main_#t~ret363#1, main_#t~ret364#1, main_#t~ret365#1, main_#t~ret366#1, main_#t~ret367#1, main_#t~ret368#1, main_#t~ret369#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~ret379#1, main_#t~ret380#1, main_#t~ret381#1, main_#t~nondet382#1, main_#t~switch383#1, main_#t~mem384#1, main_#t~ret385#1, main_#t~nondet386#1, main_#t~switch387#1, main_#t~ret388#1, main_#t~nondet389#1, main_#t~switch390#1, main_#t~ret391#1, main_#t~nondet392#1, main_#t~switch393#1, main_#t~ret394#1, main_#t~ret395#1, main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~37#1.base, main_~tmp~37#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___2~3#1.base, main_~tmp___2~3#1.offset, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset, main_~tmp___4~1#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1;call main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~37#1.base, main_~tmp~37#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___2~3#1.base, main_~tmp___2~3#1.offset;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset;havoc main_~tmp___4~1#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,951 INFO L272 TraceCheckUtils]: 2: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} call main_#t~ret352#1.base, main_#t~ret352#1.offset := ldv_init_zalloc(296); {6704#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:16:44,951 INFO L290 TraceCheckUtils]: 3: Hoare triple {6704#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {6624#true} is VALID [2022-02-20 22:16:44,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {6624#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {6712#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:16:44,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {6712#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6624#true} is VALID [2022-02-20 22:16:44,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,952 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6624#true} {6624#true} #2227#return; {6624#true} is VALID [2022-02-20 22:16:44,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {6624#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {6624#true} is VALID [2022-02-20 22:16:44,952 INFO L272 TraceCheckUtils]: 9: Hoare triple {6624#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {6624#true} is VALID [2022-02-20 22:16:44,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {6624#true} ~cond := #in~cond; {6624#true} is VALID [2022-02-20 22:16:44,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {6624#true} assume !(0 == ~cond); {6624#true} is VALID [2022-02-20 22:16:44,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,953 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6624#true} {6624#true} #2229#return; {6624#true} is VALID [2022-02-20 22:16:44,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {6624#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {6624#true} is VALID [2022-02-20 22:16:44,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,953 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6624#true} {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} #2247#return; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} main_~tmp~37#1.base, main_~tmp~37#1.offset := main_#t~ret352#1.base, main_#t~ret352#1.offset;havoc main_#t~ret352#1.base, main_#t~ret352#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~37#1.base, main_~tmp~37#1.offset; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,954 INFO L272 TraceCheckUtils]: 18: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} call main_#t~ret353#1.base, main_#t~ret353#1.offset := ldv_init_zalloc(32); {6704#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:16:44,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {6704#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {6624#true} is VALID [2022-02-20 22:16:44,955 INFO L272 TraceCheckUtils]: 20: Hoare triple {6624#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {6712#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:16:44,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {6712#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6624#true} is VALID [2022-02-20 22:16:44,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,955 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6624#true} {6624#true} #2227#return; {6624#true} is VALID [2022-02-20 22:16:44,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {6624#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {6624#true} is VALID [2022-02-20 22:16:44,955 INFO L272 TraceCheckUtils]: 25: Hoare triple {6624#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {6624#true} is VALID [2022-02-20 22:16:44,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {6624#true} ~cond := #in~cond; {6624#true} is VALID [2022-02-20 22:16:44,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {6624#true} assume !(0 == ~cond); {6624#true} is VALID [2022-02-20 22:16:44,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,956 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6624#true} {6624#true} #2229#return; {6624#true} is VALID [2022-02-20 22:16:44,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {6624#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {6624#true} is VALID [2022-02-20 22:16:44,956 INFO L290 TraceCheckUtils]: 31: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,957 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6624#true} {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} #2249#return; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset := main_#t~ret353#1.base, main_#t~ret353#1.offset;havoc main_#t~ret353#1.base, main_#t~ret353#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,957 INFO L272 TraceCheckUtils]: 34: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} call main_#t~ret354#1.base, main_#t~ret354#1.offset := ldv_init_zalloc(1); {6704#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:16:44,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {6704#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {6624#true} is VALID [2022-02-20 22:16:44,958 INFO L272 TraceCheckUtils]: 36: Hoare triple {6624#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {6712#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:16:44,958 INFO L290 TraceCheckUtils]: 37: Hoare triple {6712#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6624#true} is VALID [2022-02-20 22:16:44,958 INFO L290 TraceCheckUtils]: 38: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,958 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6624#true} {6624#true} #2227#return; {6624#true} is VALID [2022-02-20 22:16:44,960 INFO L290 TraceCheckUtils]: 40: Hoare triple {6624#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {6624#true} is VALID [2022-02-20 22:16:44,961 INFO L272 TraceCheckUtils]: 41: Hoare triple {6624#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {6624#true} is VALID [2022-02-20 22:16:44,962 INFO L290 TraceCheckUtils]: 42: Hoare triple {6624#true} ~cond := #in~cond; {6624#true} is VALID [2022-02-20 22:16:44,962 INFO L290 TraceCheckUtils]: 43: Hoare triple {6624#true} assume !(0 == ~cond); {6624#true} is VALID [2022-02-20 22:16:44,962 INFO L290 TraceCheckUtils]: 44: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,962 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6624#true} {6624#true} #2229#return; {6624#true} is VALID [2022-02-20 22:16:44,962 INFO L290 TraceCheckUtils]: 46: Hoare triple {6624#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {6624#true} is VALID [2022-02-20 22:16:44,963 INFO L290 TraceCheckUtils]: 47: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,964 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6624#true} {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} #2251#return; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,964 INFO L290 TraceCheckUtils]: 49: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset := main_#t~ret354#1.base, main_#t~ret354#1.offset;havoc main_#t~ret354#1.base, main_#t~ret354#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,964 INFO L272 TraceCheckUtils]: 50: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} call main_#t~ret355#1.base, main_#t~ret355#1.offset := ldv_init_zalloc(1416); {6704#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:16:44,964 INFO L290 TraceCheckUtils]: 51: Hoare triple {6704#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {6624#true} is VALID [2022-02-20 22:16:44,965 INFO L272 TraceCheckUtils]: 52: Hoare triple {6624#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {6712#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:16:44,965 INFO L290 TraceCheckUtils]: 53: Hoare triple {6712#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6624#true} is VALID [2022-02-20 22:16:44,965 INFO L290 TraceCheckUtils]: 54: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,965 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6624#true} {6624#true} #2227#return; {6624#true} is VALID [2022-02-20 22:16:44,965 INFO L290 TraceCheckUtils]: 56: Hoare triple {6624#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {6624#true} is VALID [2022-02-20 22:16:44,966 INFO L272 TraceCheckUtils]: 57: Hoare triple {6624#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {6624#true} is VALID [2022-02-20 22:16:44,966 INFO L290 TraceCheckUtils]: 58: Hoare triple {6624#true} ~cond := #in~cond; {6624#true} is VALID [2022-02-20 22:16:44,966 INFO L290 TraceCheckUtils]: 59: Hoare triple {6624#true} assume !(0 == ~cond); {6624#true} is VALID [2022-02-20 22:16:44,966 INFO L290 TraceCheckUtils]: 60: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,966 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {6624#true} {6624#true} #2229#return; {6624#true} is VALID [2022-02-20 22:16:44,966 INFO L290 TraceCheckUtils]: 62: Hoare triple {6624#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {6624#true} is VALID [2022-02-20 22:16:44,966 INFO L290 TraceCheckUtils]: 63: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,967 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6624#true} {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} #2253#return; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,967 INFO L290 TraceCheckUtils]: 65: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} main_~tmp___2~3#1.base, main_~tmp___2~3#1.offset := main_#t~ret355#1.base, main_#t~ret355#1.offset;havoc main_#t~ret355#1.base, main_#t~ret355#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___2~3#1.base, main_~tmp___2~3#1.offset; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,967 INFO L272 TraceCheckUtils]: 66: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} call main_#t~ret356#1.base, main_#t~ret356#1.offset := ldv_init_zalloc(48); {6704#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:16:44,967 INFO L290 TraceCheckUtils]: 67: Hoare triple {6704#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {6624#true} is VALID [2022-02-20 22:16:44,968 INFO L272 TraceCheckUtils]: 68: Hoare triple {6624#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {6712#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:16:44,968 INFO L290 TraceCheckUtils]: 69: Hoare triple {6712#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6624#true} is VALID [2022-02-20 22:16:44,968 INFO L290 TraceCheckUtils]: 70: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,968 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6624#true} {6624#true} #2227#return; {6624#true} is VALID [2022-02-20 22:16:44,968 INFO L290 TraceCheckUtils]: 72: Hoare triple {6624#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {6624#true} is VALID [2022-02-20 22:16:44,969 INFO L272 TraceCheckUtils]: 73: Hoare triple {6624#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {6624#true} is VALID [2022-02-20 22:16:44,969 INFO L290 TraceCheckUtils]: 74: Hoare triple {6624#true} ~cond := #in~cond; {6624#true} is VALID [2022-02-20 22:16:44,969 INFO L290 TraceCheckUtils]: 75: Hoare triple {6624#true} assume !(0 == ~cond); {6624#true} is VALID [2022-02-20 22:16:44,969 INFO L290 TraceCheckUtils]: 76: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,969 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {6624#true} {6624#true} #2229#return; {6624#true} is VALID [2022-02-20 22:16:44,969 INFO L290 TraceCheckUtils]: 78: Hoare triple {6624#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {6624#true} is VALID [2022-02-20 22:16:44,969 INFO L290 TraceCheckUtils]: 79: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,970 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6624#true} {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} #2255#return; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,970 INFO L290 TraceCheckUtils]: 81: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset := main_#t~ret356#1.base, main_#t~ret356#1.offset;havoc main_#t~ret356#1.base, main_#t~ret356#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset;assume { :begin_inline_ldv_initialize } true; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,970 INFO L290 TraceCheckUtils]: 82: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_ldv_memset } true;ldv_memset_#in~s#1.base, ldv_memset_#in~s#1.offset, ldv_memset_#in~c#1, ldv_memset_#in~n#1 := main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset, 0, 4;havoc ldv_memset_#res#1.base, ldv_memset_#res#1.offset;havoc ldv_memset_#t~memset~res35#1.base, ldv_memset_#t~memset~res35#1.offset, ldv_memset_~s#1.base, ldv_memset_~s#1.offset, ldv_memset_~c#1, ldv_memset_~n#1, ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset;ldv_memset_~s#1.base, ldv_memset_~s#1.offset := ldv_memset_#in~s#1.base, ldv_memset_#in~s#1.offset;ldv_memset_~c#1 := ldv_memset_#in~c#1;ldv_memset_~n#1 := ldv_memset_#in~n#1;havoc ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,971 INFO L272 TraceCheckUtils]: 83: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} call ldv_memset_#t~memset~res35#1.base, ldv_memset_#t~memset~res35#1.offset := #Ultimate.C_memset(ldv_memset_~s#1.base, ldv_memset_~s#1.offset, ldv_memset_~c#1, ldv_memset_~n#1); {6741#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:16:44,971 INFO L290 TraceCheckUtils]: 84: Hoare triple {6741#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr488 := 0; {6624#true} is VALID [2022-02-20 22:16:44,971 INFO L290 TraceCheckUtils]: 85: Hoare triple {6624#true} assume !(#t~loopctr488 % 18446744073709551616 < #amount % 18446744073709551616); {6624#true} is VALID [2022-02-20 22:16:44,971 INFO L290 TraceCheckUtils]: 86: Hoare triple {6624#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {6624#true} is VALID [2022-02-20 22:16:44,972 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {6624#true} {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} #2257#return; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,972 INFO L290 TraceCheckUtils]: 88: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset := ldv_memset_~s#1.base, ldv_memset_~s#1.offset;havoc ldv_memset_#t~memset~res35#1.base, ldv_memset_#t~memset~res35#1.offset;ldv_memset_#res#1.base, ldv_memset_#res#1.offset := ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,972 INFO L290 TraceCheckUtils]: 89: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} main_#t~ret357#1.base, main_#t~ret357#1.offset := ldv_memset_#res#1.base, ldv_memset_#res#1.offset;assume { :end_inline_ldv_memset } true;havoc main_#t~ret357#1.base, main_#t~ret357#1.offset;~ldv_state_variable_6~0 := 0;assume { :begin_inline_work_init_3 } true;~ldv_work_3_0~0 := 0;~ldv_work_3_1~0 := 0;~ldv_work_3_2~0 := 0;~ldv_work_3_3~0 := 0; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,973 INFO L290 TraceCheckUtils]: 90: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} assume { :end_inline_work_init_3 } true;~ldv_state_variable_3~0 := 1;~ldv_state_variable_7~0 := 0;~ldv_state_variable_2~0 := 1;~ldv_state_variable_8~0 := 0;~ldv_state_variable_1~0 := 1;assume { :begin_inline_timer_init_4 } true;~ldv_timer_4_0~0 := 0;~ldv_timer_4_1~0 := 0;~ldv_timer_4_2~0 := 0;~ldv_timer_4_3~0 := 0; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,973 INFO L290 TraceCheckUtils]: 91: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} assume { :end_inline_timer_init_4 } true;~ldv_state_variable_4~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_5~0 := 0; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,973 INFO L290 TraceCheckUtils]: 92: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} assume -2147483648 <= main_#t~nondet358#1 && main_#t~nondet358#1 <= 2147483647;main_~tmp___4~1#1 := main_#t~nondet358#1;havoc main_#t~nondet358#1;main_#t~switch359#1 := 0 == main_~tmp___4~1#1; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,973 INFO L290 TraceCheckUtils]: 93: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} assume !main_#t~switch359#1;main_#t~switch359#1 := main_#t~switch359#1 || 1 == main_~tmp___4~1#1; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,974 INFO L290 TraceCheckUtils]: 94: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} assume main_#t~switch359#1; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,974 INFO L290 TraceCheckUtils]: 95: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} assume 0 != ~ldv_state_variable_3~0;assume { :begin_inline_invoke_work_3 } true;havoc invoke_work_3_#t~nondet341#1, invoke_work_3_#t~switch342#1, invoke_work_3_~tmp~34#1;havoc invoke_work_3_~tmp~34#1;assume -2147483648 <= invoke_work_3_#t~nondet341#1 && invoke_work_3_#t~nondet341#1 <= 2147483647;invoke_work_3_~tmp~34#1 := invoke_work_3_#t~nondet341#1;havoc invoke_work_3_#t~nondet341#1;invoke_work_3_#t~switch342#1 := 0 == invoke_work_3_~tmp~34#1; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,974 INFO L290 TraceCheckUtils]: 96: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} assume !invoke_work_3_#t~switch342#1;invoke_work_3_#t~switch342#1 := invoke_work_3_#t~switch342#1 || 1 == invoke_work_3_~tmp~34#1; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,975 INFO L290 TraceCheckUtils]: 97: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} assume invoke_work_3_#t~switch342#1; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,975 INFO L290 TraceCheckUtils]: 98: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} assume 2 == ~ldv_work_3_1~0 || 3 == ~ldv_work_3_1~0;~ldv_work_3_1~0 := 4; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,975 INFO L272 TraceCheckUtils]: 99: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} call tsc2005_esd_work(~ldv_work_struct_3_0~0.base, ~ldv_work_struct_3_0~0.offset); {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,975 INFO L290 TraceCheckUtils]: 100: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} ~work#1.base, ~work#1.offset := #in~work#1.base, #in~work#1.offset;havoc ~ts~4#1.base, ~ts~4#1.offset;havoc ~__mptr~2#1.base, ~__mptr~2#1.offset;havoc ~error~5#1;call ~#r~0#1.base, ~#r~0#1.offset := #Ultimate.allocOnStack(2);havoc ~tmp~21#1;havoc ~tmp___0~7#1;havoc ~tmp___1~2#1;havoc ~tmp___2~1#1;~__mptr~2#1.base, ~__mptr~2#1.offset := ~work#1.base, ~work#1.offset;~ts~4#1.base, ~ts~4#1.offset := ~__mptr~2#1.base, -1059552 + ~__mptr~2#1.offset;assume { :begin_inline_ldv_mutex_trylock_23 } true;ldv_mutex_trylock_23_#in~ldv_func_arg1#1.base, ldv_mutex_trylock_23_#in~ldv_func_arg1#1.offset := ~ts~4#1.base, 533 + ~ts~4#1.offset;havoc ldv_mutex_trylock_23_#res#1;havoc ldv_mutex_trylock_23_#t~ret409#1, ldv_mutex_trylock_23_#t~ret410#1, ldv_mutex_trylock_23_~ldv_func_arg1#1.base, ldv_mutex_trylock_23_~ldv_func_arg1#1.offset, ldv_mutex_trylock_23_~ldv_func_res~9#1, ldv_mutex_trylock_23_~tmp~49#1, ldv_mutex_trylock_23_~tmp___0~16#1;ldv_mutex_trylock_23_~ldv_func_arg1#1.base, ldv_mutex_trylock_23_~ldv_func_arg1#1.offset := ldv_mutex_trylock_23_#in~ldv_func_arg1#1.base, ldv_mutex_trylock_23_#in~ldv_func_arg1#1.offset;havoc ldv_mutex_trylock_23_~ldv_func_res~9#1;havoc ldv_mutex_trylock_23_~tmp~49#1;havoc ldv_mutex_trylock_23_~tmp___0~16#1; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,976 INFO L272 TraceCheckUtils]: 101: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} call ldv_mutex_trylock_23_#t~ret409#1 := mutex_trylock(ldv_mutex_trylock_23_~ldv_func_arg1#1.base, ldv_mutex_trylock_23_~ldv_func_arg1#1.offset); {6624#true} is VALID [2022-02-20 22:16:44,976 INFO L290 TraceCheckUtils]: 102: Hoare triple {6624#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;assume -2147483648 <= #t~nondet474 && #t~nondet474 <= 2147483647;#res := #t~nondet474;havoc #t~nondet474; {6624#true} is VALID [2022-02-20 22:16:44,976 INFO L290 TraceCheckUtils]: 103: Hoare triple {6624#true} assume true; {6624#true} is VALID [2022-02-20 22:16:44,976 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {6624#true} {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} #2187#return; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,977 INFO L290 TraceCheckUtils]: 105: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} assume -2147483648 <= ldv_mutex_trylock_23_#t~ret409#1 && ldv_mutex_trylock_23_#t~ret409#1 <= 2147483647;ldv_mutex_trylock_23_~tmp~49#1 := ldv_mutex_trylock_23_#t~ret409#1;havoc ldv_mutex_trylock_23_#t~ret409#1;ldv_mutex_trylock_23_~ldv_func_res~9#1 := ldv_mutex_trylock_23_~tmp~49#1; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,977 INFO L272 TraceCheckUtils]: 106: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} call ldv_mutex_trylock_23_#t~ret410#1 := ldv_mutex_trylock_mutex_of_tsc2005(ldv_mutex_trylock_23_~ldv_func_arg1#1.base, ldv_mutex_trylock_23_~ldv_func_arg1#1.offset); {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,977 INFO L290 TraceCheckUtils]: 107: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;havoc ~is_mutex_held_by_another_thread~3; {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} is VALID [2022-02-20 22:16:44,977 INFO L290 TraceCheckUtils]: 108: Hoare triple {6626#(= ~ldv_mutex_mutex_of_tsc2005~0 1)} assume 1 != ~ldv_mutex_mutex_of_tsc2005~0; {6625#false} is VALID [2022-02-20 22:16:44,978 INFO L272 TraceCheckUtils]: 109: Hoare triple {6625#false} call ldv_error(); {6625#false} is VALID [2022-02-20 22:16:44,978 INFO L290 TraceCheckUtils]: 110: Hoare triple {6625#false} assume !false; {6625#false} is VALID [2022-02-20 22:16:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-02-20 22:16:44,979 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:16:44,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150958937] [2022-02-20 22:16:44,979 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150958937] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:16:44,979 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:16:44,979 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:16:44,982 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912472629] [2022-02-20 22:16:44,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:16:44,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 111 [2022-02-20 22:16:44,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:16:44,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:16:45,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:16:45,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:16:45,028 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:16:45,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:16:45,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:16:45,029 INFO L87 Difference]: Start difference. First operand 877 states and 1220 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:16:48,825 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 22:16:55,017 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 22:16:57,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:16:57,113 INFO L93 Difference]: Finished difference Result 2515 states and 3538 transitions. [2022-02-20 22:16:57,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 22:16:57,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 111 [2022-02-20 22:16:57,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:16:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:16:57,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3538 transitions. [2022-02-20 22:16:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:16:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3538 transitions. [2022-02-20 22:16:57,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 3538 transitions. [2022-02-20 22:17:00,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3538 edges. 3538 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:17:00,204 INFO L225 Difference]: With dead ends: 2515 [2022-02-20 22:17:00,204 INFO L226 Difference]: Without dead ends: 1655 [2022-02-20 22:17:00,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-20 22:17:00,208 INFO L933 BasicCegarLoop]: 1313 mSDtfsCounter, 1866 mSDsluCounter, 2097 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 897 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1949 SdHoareTripleChecker+Valid, 3410 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 897 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-02-20 22:17:00,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1949 Valid, 3410 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [897 Valid, 1025 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-02-20 22:17:00,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2022-02-20 22:17:00,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1586. [2022-02-20 22:17:00,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:17:00,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1655 states. Second operand has 1586 states, 1154 states have (on average 1.3760831889081455) internal successors, (1588), 1186 states have internal predecessors, (1588), 314 states have call successors, (314), 122 states have call predecessors, (314), 117 states have return successors, (316), 291 states have call predecessors, (316), 306 states have call successors, (316) [2022-02-20 22:17:00,265 INFO L74 IsIncluded]: Start isIncluded. First operand 1655 states. Second operand has 1586 states, 1154 states have (on average 1.3760831889081455) internal successors, (1588), 1186 states have internal predecessors, (1588), 314 states have call successors, (314), 122 states have call predecessors, (314), 117 states have return successors, (316), 291 states have call predecessors, (316), 306 states have call successors, (316) [2022-02-20 22:17:00,268 INFO L87 Difference]: Start difference. First operand 1655 states. Second operand has 1586 states, 1154 states have (on average 1.3760831889081455) internal successors, (1588), 1186 states have internal predecessors, (1588), 314 states have call successors, (314), 122 states have call predecessors, (314), 117 states have return successors, (316), 291 states have call predecessors, (316), 306 states have call successors, (316) [2022-02-20 22:17:00,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:17:00,355 INFO L93 Difference]: Finished difference Result 1655 states and 2327 transitions. [2022-02-20 22:17:00,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2327 transitions. [2022-02-20 22:17:00,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:17:00,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:17:00,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 1586 states, 1154 states have (on average 1.3760831889081455) internal successors, (1588), 1186 states have internal predecessors, (1588), 314 states have call successors, (314), 122 states have call predecessors, (314), 117 states have return successors, (316), 291 states have call predecessors, (316), 306 states have call successors, (316) Second operand 1655 states. [2022-02-20 22:17:00,369 INFO L87 Difference]: Start difference. First operand has 1586 states, 1154 states have (on average 1.3760831889081455) internal successors, (1588), 1186 states have internal predecessors, (1588), 314 states have call successors, (314), 122 states have call predecessors, (314), 117 states have return successors, (316), 291 states have call predecessors, (316), 306 states have call successors, (316) Second operand 1655 states. [2022-02-20 22:17:00,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:17:00,460 INFO L93 Difference]: Finished difference Result 1655 states and 2327 transitions. [2022-02-20 22:17:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2327 transitions. [2022-02-20 22:17:00,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:17:00,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:17:00,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:17:00,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:17:00,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1586 states, 1154 states have (on average 1.3760831889081455) internal successors, (1588), 1186 states have internal predecessors, (1588), 314 states have call successors, (314), 122 states have call predecessors, (314), 117 states have return successors, (316), 291 states have call predecessors, (316), 306 states have call successors, (316) [2022-02-20 22:17:00,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2218 transitions. [2022-02-20 22:17:00,592 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2218 transitions. Word has length 111 [2022-02-20 22:17:00,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:17:00,593 INFO L470 AbstractCegarLoop]: Abstraction has 1586 states and 2218 transitions. [2022-02-20 22:17:00,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:17:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2218 transitions. [2022-02-20 22:17:00,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-02-20 22:17:00,595 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:17:00,595 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:17:00,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 22:17:00,596 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:17:00,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:17:00,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1490593513, now seen corresponding path program 1 times [2022-02-20 22:17:00,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:17:00,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728783432] [2022-02-20 22:17:00,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:17:00,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:17:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:00,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:17:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:00,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:17:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:00,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {15838#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15753#true} is VALID [2022-02-20 22:17:00,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,746 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15753#true} {15753#true} #2227#return; {15753#true} is VALID [2022-02-20 22:17:00,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:17:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:00,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {15753#true} ~cond := #in~cond; {15753#true} is VALID [2022-02-20 22:17:00,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {15753#true} assume !(0 == ~cond); {15753#true} is VALID [2022-02-20 22:17:00,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15753#true} {15753#true} #2229#return; {15753#true} is VALID [2022-02-20 22:17:00,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {15830#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {15753#true} is VALID [2022-02-20 22:17:00,755 INFO L272 TraceCheckUtils]: 1: Hoare triple {15753#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {15838#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:17:00,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {15838#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15753#true} is VALID [2022-02-20 22:17:00,755 INFO L290 TraceCheckUtils]: 3: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,755 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15753#true} {15753#true} #2227#return; {15753#true} is VALID [2022-02-20 22:17:00,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {15753#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {15753#true} is VALID [2022-02-20 22:17:00,755 INFO L272 TraceCheckUtils]: 6: Hoare triple {15753#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {15753#true} is VALID [2022-02-20 22:17:00,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {15753#true} ~cond := #in~cond; {15753#true} is VALID [2022-02-20 22:17:00,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {15753#true} assume !(0 == ~cond); {15753#true} is VALID [2022-02-20 22:17:00,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,756 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15753#true} {15753#true} #2229#return; {15753#true} is VALID [2022-02-20 22:17:00,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {15753#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {15753#true} is VALID [2022-02-20 22:17:00,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,756 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {15753#true} {15753#true} #2247#return; {15753#true} is VALID [2022-02-20 22:17:00,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:17:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:00,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:17:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:00,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {15838#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15753#true} is VALID [2022-02-20 22:17:00,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,770 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15753#true} {15753#true} #2227#return; {15753#true} is VALID [2022-02-20 22:17:00,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:17:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:00,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {15753#true} ~cond := #in~cond; {15753#true} is VALID [2022-02-20 22:17:00,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {15753#true} assume !(0 == ~cond); {15753#true} is VALID [2022-02-20 22:17:00,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15753#true} {15753#true} #2229#return; {15753#true} is VALID [2022-02-20 22:17:00,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {15830#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {15753#true} is VALID [2022-02-20 22:17:00,776 INFO L272 TraceCheckUtils]: 1: Hoare triple {15753#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {15838#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:17:00,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {15838#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15753#true} is VALID [2022-02-20 22:17:00,776 INFO L290 TraceCheckUtils]: 3: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,776 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15753#true} {15753#true} #2227#return; {15753#true} is VALID [2022-02-20 22:17:00,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {15753#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {15753#true} is VALID [2022-02-20 22:17:00,777 INFO L272 TraceCheckUtils]: 6: Hoare triple {15753#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {15753#true} is VALID [2022-02-20 22:17:00,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {15753#true} ~cond := #in~cond; {15753#true} is VALID [2022-02-20 22:17:00,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {15753#true} assume !(0 == ~cond); {15753#true} is VALID [2022-02-20 22:17:00,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,777 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15753#true} {15753#true} #2229#return; {15753#true} is VALID [2022-02-20 22:17:00,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {15753#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {15753#true} is VALID [2022-02-20 22:17:00,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,777 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {15753#true} {15753#true} #2249#return; {15753#true} is VALID [2022-02-20 22:17:00,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:17:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:00,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:17:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:00,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {15838#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15753#true} is VALID [2022-02-20 22:17:00,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,794 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15753#true} {15753#true} #2227#return; {15753#true} is VALID [2022-02-20 22:17:00,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:17:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:00,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {15753#true} ~cond := #in~cond; {15753#true} is VALID [2022-02-20 22:17:00,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {15753#true} assume !(0 == ~cond); {15753#true} is VALID [2022-02-20 22:17:00,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15753#true} {15753#true} #2229#return; {15753#true} is VALID [2022-02-20 22:17:00,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {15830#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {15753#true} is VALID [2022-02-20 22:17:00,801 INFO L272 TraceCheckUtils]: 1: Hoare triple {15753#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {15838#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:17:00,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {15838#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15753#true} is VALID [2022-02-20 22:17:00,802 INFO L290 TraceCheckUtils]: 3: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,802 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15753#true} {15753#true} #2227#return; {15753#true} is VALID [2022-02-20 22:17:00,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {15753#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {15753#true} is VALID [2022-02-20 22:17:00,802 INFO L272 TraceCheckUtils]: 6: Hoare triple {15753#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {15753#true} is VALID [2022-02-20 22:17:00,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {15753#true} ~cond := #in~cond; {15753#true} is VALID [2022-02-20 22:17:00,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {15753#true} assume !(0 == ~cond); {15753#true} is VALID [2022-02-20 22:17:00,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,802 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15753#true} {15753#true} #2229#return; {15753#true} is VALID [2022-02-20 22:17:00,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {15753#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {15753#true} is VALID [2022-02-20 22:17:00,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,803 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {15753#true} {15753#true} #2251#return; {15753#true} is VALID [2022-02-20 22:17:00,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 22:17:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:00,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:17:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:00,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {15838#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15753#true} is VALID [2022-02-20 22:17:00,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,819 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15753#true} {15753#true} #2227#return; {15753#true} is VALID [2022-02-20 22:17:00,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:17:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:00,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {15753#true} ~cond := #in~cond; {15753#true} is VALID [2022-02-20 22:17:00,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {15753#true} assume !(0 == ~cond); {15753#true} is VALID [2022-02-20 22:17:00,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15753#true} {15753#true} #2229#return; {15753#true} is VALID [2022-02-20 22:17:00,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {15830#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {15753#true} is VALID [2022-02-20 22:17:00,826 INFO L272 TraceCheckUtils]: 1: Hoare triple {15753#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {15838#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:17:00,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {15838#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15753#true} is VALID [2022-02-20 22:17:00,826 INFO L290 TraceCheckUtils]: 3: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,826 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15753#true} {15753#true} #2227#return; {15753#true} is VALID [2022-02-20 22:17:00,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {15753#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {15753#true} is VALID [2022-02-20 22:17:00,827 INFO L272 TraceCheckUtils]: 6: Hoare triple {15753#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {15753#true} is VALID [2022-02-20 22:17:00,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {15753#true} ~cond := #in~cond; {15753#true} is VALID [2022-02-20 22:17:00,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {15753#true} assume !(0 == ~cond); {15753#true} is VALID [2022-02-20 22:17:00,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,827 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15753#true} {15753#true} #2229#return; {15753#true} is VALID [2022-02-20 22:17:00,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {15753#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {15753#true} is VALID [2022-02-20 22:17:00,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,827 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {15753#true} {15753#true} #2253#return; {15753#true} is VALID [2022-02-20 22:17:00,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 22:17:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:00,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:17:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:00,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {15838#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15753#true} is VALID [2022-02-20 22:17:00,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,842 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15753#true} {15753#true} #2227#return; {15753#true} is VALID [2022-02-20 22:17:00,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:17:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:00,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {15753#true} ~cond := #in~cond; {15753#true} is VALID [2022-02-20 22:17:00,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {15753#true} assume !(0 == ~cond); {15753#true} is VALID [2022-02-20 22:17:00,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15753#true} {15753#true} #2229#return; {15753#true} is VALID [2022-02-20 22:17:00,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {15830#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {15753#true} is VALID [2022-02-20 22:17:00,865 INFO L272 TraceCheckUtils]: 1: Hoare triple {15753#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {15838#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:17:00,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {15838#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15753#true} is VALID [2022-02-20 22:17:00,866 INFO L290 TraceCheckUtils]: 3: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,866 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15753#true} {15753#true} #2227#return; {15753#true} is VALID [2022-02-20 22:17:00,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {15753#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {15753#true} is VALID [2022-02-20 22:17:00,866 INFO L272 TraceCheckUtils]: 6: Hoare triple {15753#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {15753#true} is VALID [2022-02-20 22:17:00,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {15753#true} ~cond := #in~cond; {15753#true} is VALID [2022-02-20 22:17:00,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {15753#true} assume !(0 == ~cond); {15753#true} is VALID [2022-02-20 22:17:00,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,867 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15753#true} {15753#true} #2229#return; {15753#true} is VALID [2022-02-20 22:17:00,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {15753#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {15753#true} is VALID [2022-02-20 22:17:00,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,867 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {15753#true} {15753#true} #2255#return; {15753#true} is VALID [2022-02-20 22:17:00,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-02-20 22:17:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:00,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {15867#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr488 := 0; {15753#true} is VALID [2022-02-20 22:17:00,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {15753#true} assume !(#t~loopctr488 % 18446744073709551616 < #amount % 18446744073709551616); {15753#true} is VALID [2022-02-20 22:17:00,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {15753#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {15753#true} is VALID [2022-02-20 22:17:00,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15753#true} {15753#true} #2257#return; {15753#true} is VALID [2022-02-20 22:17:00,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {15753#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(89, 2);call #Ultimate.allocInit(36, 3);call #Ultimate.allocInit(12, 4);call #Ultimate.allocInit(48, 5);call #Ultimate.allocInit(14, 6);call #Ultimate.allocInit(8, 7);call #Ultimate.allocInit(25, 8);call #Ultimate.allocInit(214, 9);call #Ultimate.allocInit(32, 10);call #Ultimate.allocInit(32, 11);call #Ultimate.allocInit(32, 12);call #Ultimate.allocInit(33, 13);call #Ultimate.allocInit(44, 14);call #Ultimate.allocInit(27, 15);call #Ultimate.allocInit(44, 16);call #Ultimate.allocInit(39, 17);call #Ultimate.allocInit(4, 18);call write~init~int(37, 18, 0, 1);call write~init~int(100, 18, 1, 1);call write~init~int(10, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(9, 19);call #Ultimate.allocInit(36, 20);call #Ultimate.allocInit(18, 21);call #Ultimate.allocInit(8, 22);call #Ultimate.allocInit(16, 23);call #Ultimate.allocInit(27, 24);call #Ultimate.allocInit(12, 25);call #Ultimate.allocInit(32, 26);call #Ultimate.allocInit(12, 27);call #Ultimate.allocInit(33, 28);call #Ultimate.allocInit(4, 29);call write~init~int(118, 29, 0, 1);call write~init~int(105, 29, 1, 1);call write~init~int(111, 29, 2, 1);call write~init~int(0, 29, 3, 1);call #Ultimate.allocInit(27, 30);call #Ultimate.allocInit(11, 31);call #Ultimate.allocInit(20, 32);call #Ultimate.allocInit(25, 33);call #Ultimate.allocInit(26, 34);call #Ultimate.allocInit(12, 35);call #Ultimate.allocInit(20, 36);call #Ultimate.allocInit(8, 37);call #Ultimate.allocInit(32, 38);call #Ultimate.allocInit(44, 39);call #Ultimate.allocInit(42, 40);call #Ultimate.allocInit(8, 41);~ldv_state_variable_8~0 := 0;~ldv_work_struct_3_1~0.base, ~ldv_work_struct_3_1~0.offset := 0, 0;~ldv_timer_4_0~0 := 0;~ldv_state_variable_0~0 := 0;~ldv_state_variable_5~0 := 0;~ldv_irq_2_0~0 := 0;~ldv_work_3_2~0 := 0;~ldv_irq_dev_2_0~0.base, ~ldv_irq_dev_2_0~0.offset := 0, 0;~ldv_work_3_0~0 := 0;~ldv_timer_4_3~0 := 0;~ldv_irq_data_2_3~0.base, ~ldv_irq_data_2_3~0.offset := 0, 0;~ldv_irq_2_2~0 := 0;~ldv_irq_dev_1_2~0.base, ~ldv_irq_dev_1_2~0.offset := 0, 0;~ldv_irq_line_2_0~0 := 0;~ldv_irq_dev_2_1~0.base, ~ldv_irq_dev_2_1~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_data_2_2~0.base, ~ldv_irq_data_2_2~0.offset := 0, 0;~ldv_irq_line_1_1~0 := 0;~ldv_work_3_3~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_state_variable_7~0 := 0;~ldv_irq_line_1_2~0 := 0;~ldv_work_struct_3_3~0.base, ~ldv_work_struct_3_3~0.offset := 0, 0;~ldv_irq_dev_2_2~0.base, ~ldv_irq_dev_2_2~0.offset := 0, 0;~ldv_irq_line_2_3~0 := 0;~ldv_irq_2_1~0 := 0;~ldv_irq_data_2_1~0.base, ~ldv_irq_data_2_1~0.offset := 0, 0;~ldv_irq_1_3~0 := 0;~ldv_irq_dev_1_1~0.base, ~ldv_irq_dev_1_1~0.offset := 0, 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_line_2_2~0 := 0;~ldv_timer_4_2~0 := 0;~ldv_irq_1_0~0 := 0;~ldv_timer_list_4_0~0.base, ~ldv_timer_list_4_0~0.offset := 0, 0;~ldv_work_struct_3_2~0.base, ~ldv_work_struct_3_2~0.offset := 0, 0;~ldv_state_variable_6~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~tsc2005_driver_group0~0.base, ~tsc2005_driver_group0~0.offset := 0, 0;~ldv_work_3_1~0 := 0;~ldv_irq_line_2_1~0 := 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~ldv_irq_dev_1_3~0.base, ~ldv_irq_dev_1_3~0.offset := 0, 0;~ldv_state_variable_2~0 := 0;~ldv_irq_dev_1_0~0.base, ~ldv_irq_dev_1_0~0.offset := 0, 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_irq_dev_2_3~0.base, ~ldv_irq_dev_2_3~0.offset := 0, 0;~ldv_irq_data_2_0~0.base, ~ldv_irq_data_2_0~0.offset := 0, 0;~ldv_work_struct_3_0~0.base, ~ldv_work_struct_3_0~0.offset := 0, 0;~ldv_timer_list_4_3~0.base, ~ldv_timer_list_4_3~0.offset := 0, 0;~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_timer_list_4_2~0.base, ~ldv_timer_list_4_2~0.offset := 0, 0;~ldv_irq_1_1~0 := 0;~ldv_irq_2_3~0 := 0;~ldv_irq_line_1_3~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_irq_line_1_0~0 := 0;~tsc2005_pm_ops_group1~0.base, ~tsc2005_pm_ops_group1~0.offset := 0, 0;~ldv_timer_4_1~0 := 0;~ldv_timer_list_4_1~0.base, ~ldv_timer_list_4_1~0.offset := 0, 0;~ldv_state_variable_4~0 := 0;~#dev_attr_selftest~0.base, ~#dev_attr_selftest~0.offset := 42, 0;call #Ultimate.allocInit(43, 42);call write~init~$Pointer$(19, 0, ~#dev_attr_selftest~0.base, ~#dev_attr_selftest~0.offset, 8);call write~init~int(292, ~#dev_attr_selftest~0.base, 8 + ~#dev_attr_selftest~0.offset, 2);call write~init~int(0, ~#dev_attr_selftest~0.base, 10 + ~#dev_attr_selftest~0.offset, 1);call write~init~$Pointer$(0, 0, ~#dev_attr_selftest~0.base, 11 + ~#dev_attr_selftest~0.offset, 8);call write~init~int(0, ~#dev_attr_selftest~0.base, 19 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 20 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 21 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 22 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 23 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 24 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 25 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 26 + ~#dev_attr_selftest~0.offset, 1);call write~init~$Pointer$(#funAddr~tsc2005_selftest_show.base, #funAddr~tsc2005_selftest_show.offset, ~#dev_attr_selftest~0.base, 27 + ~#dev_attr_selftest~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dev_attr_selftest~0.base, 35 + ~#dev_attr_selftest~0.offset, 8);~#tsc2005_attrs~0.base, ~#tsc2005_attrs~0.offset := 43, 0;call #Ultimate.allocInit(16, 43);call write~init~$Pointer$(~#dev_attr_selftest~0.base, ~#dev_attr_selftest~0.offset, ~#tsc2005_attrs~0.base, ~#tsc2005_attrs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_attrs~0.base, 8 + ~#tsc2005_attrs~0.offset, 8);~#tsc2005_attr_group~0.base, ~#tsc2005_attr_group~0.offset := 44, 0;call #Ultimate.allocInit(32, 44);call write~init~$Pointer$(0, 0, ~#tsc2005_attr_group~0.base, ~#tsc2005_attr_group~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_attr_is_visible.base, #funAddr~tsc2005_attr_is_visible.offset, ~#tsc2005_attr_group~0.base, 8 + ~#tsc2005_attr_group~0.offset, 8);call write~init~$Pointer$(~#tsc2005_attrs~0.base, ~#tsc2005_attrs~0.offset, ~#tsc2005_attr_group~0.base, 16 + ~#tsc2005_attr_group~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_attr_group~0.base, 24 + ~#tsc2005_attr_group~0.offset, 8);~#tsc2005_pm_ops~0.base, ~#tsc2005_pm_ops~0.offset := 45, 0;call #Ultimate.allocInit(184, 45);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 8 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_suspend.base, #funAddr~tsc2005_suspend.offset, ~#tsc2005_pm_ops~0.base, 16 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_resume.base, #funAddr~tsc2005_resume.offset, ~#tsc2005_pm_ops~0.base, 24 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_suspend.base, #funAddr~tsc2005_suspend.offset, ~#tsc2005_pm_ops~0.base, 32 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_resume.base, #funAddr~tsc2005_resume.offset, ~#tsc2005_pm_ops~0.base, 40 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_suspend.base, #funAddr~tsc2005_suspend.offset, ~#tsc2005_pm_ops~0.base, 48 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_resume.base, #funAddr~tsc2005_resume.offset, ~#tsc2005_pm_ops~0.base, 56 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 64 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 72 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 80 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 88 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 96 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 104 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 112 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 120 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 128 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 136 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 144 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 152 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 160 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 168 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 176 + ~#tsc2005_pm_ops~0.offset, 8);~#tsc2005_driver~0.base, ~#tsc2005_driver~0.offset := 46, 0;call #Ultimate.allocInit(149, 46);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_probe.base, #funAddr~tsc2005_probe.offset, ~#tsc2005_driver~0.base, 8 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_remove.base, #funAddr~tsc2005_remove.offset, ~#tsc2005_driver~0.base, 16 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 24 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(41, 0, ~#tsc2005_driver~0.base, 32 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 40 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#tsc2005_driver~0.base, 48 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 56 + ~#tsc2005_driver~0.offset, 8);call write~init~int(0, ~#tsc2005_driver~0.base, 64 + ~#tsc2005_driver~0.offset, 1);call write~init~int(0, ~#tsc2005_driver~0.base, 65 + ~#tsc2005_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 69 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 77 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 85 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 93 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 101 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 109 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 117 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 125 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(~#tsc2005_pm_ops~0.base, ~#tsc2005_pm_ops~0.offset, ~#tsc2005_driver~0.base, 133 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 141 + ~#tsc2005_driver~0.offset, 8);~ldv_retval_20~0 := 0;~ldv_retval_18~0 := 0;~ldv_retval_2~0 := 0;~ldv_retval_5~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_11~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_15~0 := 0;~ldv_retval_16~0 := 0;~ldv_retval_8~0 := 0;~ldv_retval_7~0 := 0;~ldv_retval_19~0 := 0;~ldv_retval_14~0 := 0;~ldv_retval_17~0 := 0;~ldv_retval_12~0 := 0;~ldv_retval_6~0 := 0;~ldv_retval_13~0 := 0;~ldv_retval_9~0 := 0;~ldv_retval_10~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_3~0 := 0;~ldv_mutex_i_mutex_of_inode~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_mutex_of_tsc2005~0 := 1; {15753#true} is VALID [2022-02-20 22:17:00,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {15753#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret352#1.base, main_#t~ret352#1.offset, 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~ret356#1.base, main_#t~ret356#1.offset, main_#t~ret357#1.base, main_#t~ret357#1.offset, main_#t~nondet358#1, main_#t~switch359#1, main_#t~nondet360#1, main_#t~switch361#1, main_#t~ret362#1, main_#t~ret363#1, main_#t~ret364#1, main_#t~ret365#1, main_#t~ret366#1, main_#t~ret367#1, main_#t~ret368#1, main_#t~ret369#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~ret379#1, main_#t~ret380#1, main_#t~ret381#1, main_#t~nondet382#1, main_#t~switch383#1, main_#t~mem384#1, main_#t~ret385#1, main_#t~nondet386#1, main_#t~switch387#1, main_#t~ret388#1, main_#t~nondet389#1, main_#t~switch390#1, main_#t~ret391#1, main_#t~nondet392#1, main_#t~switch393#1, main_#t~ret394#1, main_#t~ret395#1, main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~37#1.base, main_~tmp~37#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___2~3#1.base, main_~tmp___2~3#1.offset, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset, main_~tmp___4~1#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1;call main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~37#1.base, main_~tmp~37#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___2~3#1.base, main_~tmp___2~3#1.offset;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset;havoc main_~tmp___4~1#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1; {15753#true} is VALID [2022-02-20 22:17:00,888 INFO L272 TraceCheckUtils]: 2: Hoare triple {15753#true} call main_#t~ret352#1.base, main_#t~ret352#1.offset := ldv_init_zalloc(296); {15830#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:17:00,888 INFO L290 TraceCheckUtils]: 3: Hoare triple {15830#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {15753#true} is VALID [2022-02-20 22:17:00,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {15753#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {15838#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:17:00,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {15838#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15753#true} is VALID [2022-02-20 22:17:00,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,889 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15753#true} {15753#true} #2227#return; {15753#true} is VALID [2022-02-20 22:17:00,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {15753#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {15753#true} is VALID [2022-02-20 22:17:00,889 INFO L272 TraceCheckUtils]: 9: Hoare triple {15753#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {15753#true} is VALID [2022-02-20 22:17:00,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {15753#true} ~cond := #in~cond; {15753#true} is VALID [2022-02-20 22:17:00,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {15753#true} assume !(0 == ~cond); {15753#true} is VALID [2022-02-20 22:17:00,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,890 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {15753#true} {15753#true} #2229#return; {15753#true} is VALID [2022-02-20 22:17:00,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {15753#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {15753#true} is VALID [2022-02-20 22:17:00,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,891 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15753#true} {15753#true} #2247#return; {15753#true} is VALID [2022-02-20 22:17:00,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {15753#true} main_~tmp~37#1.base, main_~tmp~37#1.offset := main_#t~ret352#1.base, main_#t~ret352#1.offset;havoc main_#t~ret352#1.base, main_#t~ret352#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~37#1.base, main_~tmp~37#1.offset; {15753#true} is VALID [2022-02-20 22:17:00,891 INFO L272 TraceCheckUtils]: 18: Hoare triple {15753#true} call main_#t~ret353#1.base, main_#t~ret353#1.offset := ldv_init_zalloc(32); {15830#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:17:00,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {15830#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {15753#true} is VALID [2022-02-20 22:17:00,892 INFO L272 TraceCheckUtils]: 20: Hoare triple {15753#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {15838#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:17:00,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {15838#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15753#true} is VALID [2022-02-20 22:17:00,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,892 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15753#true} {15753#true} #2227#return; {15753#true} is VALID [2022-02-20 22:17:00,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {15753#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {15753#true} is VALID [2022-02-20 22:17:00,893 INFO L272 TraceCheckUtils]: 25: Hoare triple {15753#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {15753#true} is VALID [2022-02-20 22:17:00,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {15753#true} ~cond := #in~cond; {15753#true} is VALID [2022-02-20 22:17:00,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {15753#true} assume !(0 == ~cond); {15753#true} is VALID [2022-02-20 22:17:00,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,893 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {15753#true} {15753#true} #2229#return; {15753#true} is VALID [2022-02-20 22:17:00,893 INFO L290 TraceCheckUtils]: 30: Hoare triple {15753#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {15753#true} is VALID [2022-02-20 22:17:00,893 INFO L290 TraceCheckUtils]: 31: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,893 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15753#true} {15753#true} #2249#return; {15753#true} is VALID [2022-02-20 22:17:00,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {15753#true} main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset := main_#t~ret353#1.base, main_#t~ret353#1.offset;havoc main_#t~ret353#1.base, main_#t~ret353#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset; {15753#true} is VALID [2022-02-20 22:17:00,894 INFO L272 TraceCheckUtils]: 34: Hoare triple {15753#true} call main_#t~ret354#1.base, main_#t~ret354#1.offset := ldv_init_zalloc(1); {15830#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:17:00,894 INFO L290 TraceCheckUtils]: 35: Hoare triple {15830#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {15753#true} is VALID [2022-02-20 22:17:00,895 INFO L272 TraceCheckUtils]: 36: Hoare triple {15753#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {15838#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:17:00,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {15838#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15753#true} is VALID [2022-02-20 22:17:00,895 INFO L290 TraceCheckUtils]: 38: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,895 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15753#true} {15753#true} #2227#return; {15753#true} is VALID [2022-02-20 22:17:00,895 INFO L290 TraceCheckUtils]: 40: Hoare triple {15753#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {15753#true} is VALID [2022-02-20 22:17:00,896 INFO L272 TraceCheckUtils]: 41: Hoare triple {15753#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {15753#true} is VALID [2022-02-20 22:17:00,896 INFO L290 TraceCheckUtils]: 42: Hoare triple {15753#true} ~cond := #in~cond; {15753#true} is VALID [2022-02-20 22:17:00,896 INFO L290 TraceCheckUtils]: 43: Hoare triple {15753#true} assume !(0 == ~cond); {15753#true} is VALID [2022-02-20 22:17:00,896 INFO L290 TraceCheckUtils]: 44: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,896 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {15753#true} {15753#true} #2229#return; {15753#true} is VALID [2022-02-20 22:17:00,896 INFO L290 TraceCheckUtils]: 46: Hoare triple {15753#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {15753#true} is VALID [2022-02-20 22:17:00,896 INFO L290 TraceCheckUtils]: 47: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,896 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {15753#true} {15753#true} #2251#return; {15753#true} is VALID [2022-02-20 22:17:00,897 INFO L290 TraceCheckUtils]: 49: Hoare triple {15753#true} main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset := main_#t~ret354#1.base, main_#t~ret354#1.offset;havoc main_#t~ret354#1.base, main_#t~ret354#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset; {15753#true} is VALID [2022-02-20 22:17:00,897 INFO L272 TraceCheckUtils]: 50: Hoare triple {15753#true} call main_#t~ret355#1.base, main_#t~ret355#1.offset := ldv_init_zalloc(1416); {15830#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:17:00,897 INFO L290 TraceCheckUtils]: 51: Hoare triple {15830#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {15753#true} is VALID [2022-02-20 22:17:00,898 INFO L272 TraceCheckUtils]: 52: Hoare triple {15753#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {15838#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:17:00,898 INFO L290 TraceCheckUtils]: 53: Hoare triple {15838#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15753#true} is VALID [2022-02-20 22:17:00,898 INFO L290 TraceCheckUtils]: 54: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,898 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15753#true} {15753#true} #2227#return; {15753#true} is VALID [2022-02-20 22:17:00,898 INFO L290 TraceCheckUtils]: 56: Hoare triple {15753#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {15753#true} is VALID [2022-02-20 22:17:00,898 INFO L272 TraceCheckUtils]: 57: Hoare triple {15753#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {15753#true} is VALID [2022-02-20 22:17:00,899 INFO L290 TraceCheckUtils]: 58: Hoare triple {15753#true} ~cond := #in~cond; {15753#true} is VALID [2022-02-20 22:17:00,899 INFO L290 TraceCheckUtils]: 59: Hoare triple {15753#true} assume !(0 == ~cond); {15753#true} is VALID [2022-02-20 22:17:00,899 INFO L290 TraceCheckUtils]: 60: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,899 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {15753#true} {15753#true} #2229#return; {15753#true} is VALID [2022-02-20 22:17:00,899 INFO L290 TraceCheckUtils]: 62: Hoare triple {15753#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {15753#true} is VALID [2022-02-20 22:17:00,899 INFO L290 TraceCheckUtils]: 63: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,899 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {15753#true} {15753#true} #2253#return; {15753#true} is VALID [2022-02-20 22:17:00,899 INFO L290 TraceCheckUtils]: 65: Hoare triple {15753#true} main_~tmp___2~3#1.base, main_~tmp___2~3#1.offset := main_#t~ret355#1.base, main_#t~ret355#1.offset;havoc main_#t~ret355#1.base, main_#t~ret355#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___2~3#1.base, main_~tmp___2~3#1.offset; {15753#true} is VALID [2022-02-20 22:17:00,900 INFO L272 TraceCheckUtils]: 66: Hoare triple {15753#true} call main_#t~ret356#1.base, main_#t~ret356#1.offset := ldv_init_zalloc(48); {15830#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:17:00,900 INFO L290 TraceCheckUtils]: 67: Hoare triple {15830#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {15753#true} is VALID [2022-02-20 22:17:00,901 INFO L272 TraceCheckUtils]: 68: Hoare triple {15753#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {15838#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:17:00,901 INFO L290 TraceCheckUtils]: 69: Hoare triple {15838#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15753#true} is VALID [2022-02-20 22:17:00,901 INFO L290 TraceCheckUtils]: 70: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,901 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {15753#true} {15753#true} #2227#return; {15753#true} is VALID [2022-02-20 22:17:00,901 INFO L290 TraceCheckUtils]: 72: Hoare triple {15753#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {15753#true} is VALID [2022-02-20 22:17:00,901 INFO L272 TraceCheckUtils]: 73: Hoare triple {15753#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {15753#true} is VALID [2022-02-20 22:17:00,901 INFO L290 TraceCheckUtils]: 74: Hoare triple {15753#true} ~cond := #in~cond; {15753#true} is VALID [2022-02-20 22:17:00,902 INFO L290 TraceCheckUtils]: 75: Hoare triple {15753#true} assume !(0 == ~cond); {15753#true} is VALID [2022-02-20 22:17:00,902 INFO L290 TraceCheckUtils]: 76: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,902 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {15753#true} {15753#true} #2229#return; {15753#true} is VALID [2022-02-20 22:17:00,902 INFO L290 TraceCheckUtils]: 78: Hoare triple {15753#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {15753#true} is VALID [2022-02-20 22:17:00,902 INFO L290 TraceCheckUtils]: 79: Hoare triple {15753#true} assume true; {15753#true} is VALID [2022-02-20 22:17:00,902 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15753#true} {15753#true} #2255#return; {15753#true} is VALID [2022-02-20 22:17:00,902 INFO L290 TraceCheckUtils]: 81: Hoare triple {15753#true} main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset := main_#t~ret356#1.base, main_#t~ret356#1.offset;havoc main_#t~ret356#1.base, main_#t~ret356#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset;assume { :begin_inline_ldv_initialize } true; {15753#true} is VALID [2022-02-20 22:17:00,902 INFO L290 TraceCheckUtils]: 82: Hoare triple {15753#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_ldv_memset } true;ldv_memset_#in~s#1.base, ldv_memset_#in~s#1.offset, ldv_memset_#in~c#1, ldv_memset_#in~n#1 := main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset, 0, 4;havoc ldv_memset_#res#1.base, ldv_memset_#res#1.offset;havoc ldv_memset_#t~memset~res35#1.base, ldv_memset_#t~memset~res35#1.offset, ldv_memset_~s#1.base, ldv_memset_~s#1.offset, ldv_memset_~c#1, ldv_memset_~n#1, ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset;ldv_memset_~s#1.base, ldv_memset_~s#1.offset := ldv_memset_#in~s#1.base, ldv_memset_#in~s#1.offset;ldv_memset_~c#1 := ldv_memset_#in~c#1;ldv_memset_~n#1 := ldv_memset_#in~n#1;havoc ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset; {15753#true} is VALID [2022-02-20 22:17:00,903 INFO L272 TraceCheckUtils]: 83: Hoare triple {15753#true} call ldv_memset_#t~memset~res35#1.base, ldv_memset_#t~memset~res35#1.offset := #Ultimate.C_memset(ldv_memset_~s#1.base, ldv_memset_~s#1.offset, ldv_memset_~c#1, ldv_memset_~n#1); {15867#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:17:00,903 INFO L290 TraceCheckUtils]: 84: Hoare triple {15867#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr488 := 0; {15753#true} is VALID [2022-02-20 22:17:00,904 INFO L290 TraceCheckUtils]: 85: Hoare triple {15753#true} assume !(#t~loopctr488 % 18446744073709551616 < #amount % 18446744073709551616); {15753#true} is VALID [2022-02-20 22:17:00,904 INFO L290 TraceCheckUtils]: 86: Hoare triple {15753#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {15753#true} is VALID [2022-02-20 22:17:00,904 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {15753#true} {15753#true} #2257#return; {15753#true} is VALID [2022-02-20 22:17:00,905 INFO L290 TraceCheckUtils]: 88: Hoare triple {15753#true} ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset := ldv_memset_~s#1.base, ldv_memset_~s#1.offset;havoc ldv_memset_#t~memset~res35#1.base, ldv_memset_#t~memset~res35#1.offset;ldv_memset_#res#1.base, ldv_memset_#res#1.offset := ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset; {15753#true} is VALID [2022-02-20 22:17:00,905 INFO L290 TraceCheckUtils]: 89: Hoare triple {15753#true} main_#t~ret357#1.base, main_#t~ret357#1.offset := ldv_memset_#res#1.base, ldv_memset_#res#1.offset;assume { :end_inline_ldv_memset } true;havoc main_#t~ret357#1.base, main_#t~ret357#1.offset;~ldv_state_variable_6~0 := 0;assume { :begin_inline_work_init_3 } true;~ldv_work_3_0~0 := 0;~ldv_work_3_1~0 := 0;~ldv_work_3_2~0 := 0;~ldv_work_3_3~0 := 0; {15753#true} is VALID [2022-02-20 22:17:00,905 INFO L290 TraceCheckUtils]: 90: Hoare triple {15753#true} assume { :end_inline_work_init_3 } true;~ldv_state_variable_3~0 := 1;~ldv_state_variable_7~0 := 0;~ldv_state_variable_2~0 := 1;~ldv_state_variable_8~0 := 0;~ldv_state_variable_1~0 := 1;assume { :begin_inline_timer_init_4 } true;~ldv_timer_4_0~0 := 0;~ldv_timer_4_1~0 := 0;~ldv_timer_4_2~0 := 0;~ldv_timer_4_3~0 := 0; {15753#true} is VALID [2022-02-20 22:17:00,911 INFO L290 TraceCheckUtils]: 91: Hoare triple {15753#true} assume { :end_inline_timer_init_4 } true;~ldv_state_variable_4~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_5~0 := 0; {15829#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:17:00,911 INFO L290 TraceCheckUtils]: 92: Hoare triple {15829#(= ~ldv_state_variable_0~0 1)} assume -2147483648 <= main_#t~nondet358#1 && main_#t~nondet358#1 <= 2147483647;main_~tmp___4~1#1 := main_#t~nondet358#1;havoc main_#t~nondet358#1;main_#t~switch359#1 := 0 == main_~tmp___4~1#1; {15829#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:17:00,912 INFO L290 TraceCheckUtils]: 93: Hoare triple {15829#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch359#1;main_#t~switch359#1 := main_#t~switch359#1 || 1 == main_~tmp___4~1#1; {15829#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:17:00,912 INFO L290 TraceCheckUtils]: 94: Hoare triple {15829#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch359#1;main_#t~switch359#1 := main_#t~switch359#1 || 2 == main_~tmp___4~1#1; {15829#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:17:00,912 INFO L290 TraceCheckUtils]: 95: Hoare triple {15829#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch359#1;main_#t~switch359#1 := main_#t~switch359#1 || 3 == main_~tmp___4~1#1; {15829#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:17:00,917 INFO L290 TraceCheckUtils]: 96: Hoare triple {15829#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch359#1;main_#t~switch359#1 := main_#t~switch359#1 || 4 == main_~tmp___4~1#1; {15829#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:17:00,917 INFO L290 TraceCheckUtils]: 97: Hoare triple {15829#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch359#1;main_#t~switch359#1 := main_#t~switch359#1 || 5 == main_~tmp___4~1#1; {15829#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:17:00,918 INFO L290 TraceCheckUtils]: 98: Hoare triple {15829#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch359#1;main_#t~switch359#1 := main_#t~switch359#1 || 6 == main_~tmp___4~1#1; {15829#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:17:00,918 INFO L290 TraceCheckUtils]: 99: Hoare triple {15829#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch359#1;main_#t~switch359#1 := main_#t~switch359#1 || 7 == main_~tmp___4~1#1; {15829#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:17:00,918 INFO L290 TraceCheckUtils]: 100: Hoare triple {15829#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch359#1; {15829#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:17:00,919 INFO L290 TraceCheckUtils]: 101: Hoare triple {15829#(= ~ldv_state_variable_0~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet389#1 && main_#t~nondet389#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet389#1;havoc main_#t~nondet389#1;main_#t~switch390#1 := 0 == main_~tmp___8~0#1; {15829#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:17:00,919 INFO L290 TraceCheckUtils]: 102: Hoare triple {15829#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch390#1; {15829#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:17:00,919 INFO L290 TraceCheckUtils]: 103: Hoare triple {15829#(= ~ldv_state_variable_0~0 1)} assume 2 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_tsc2005_driver_exit } true;assume { :begin_inline_spi_unregister_driver } true;spi_unregister_driver_#in~sdrv#1.base, spi_unregister_driver_#in~sdrv#1.offset := ~#tsc2005_driver~0.base, ~#tsc2005_driver~0.offset;havoc spi_unregister_driver_~sdrv#1.base, spi_unregister_driver_~sdrv#1.offset;spi_unregister_driver_~sdrv#1.base, spi_unregister_driver_~sdrv#1.offset := spi_unregister_driver_#in~sdrv#1.base, spi_unregister_driver_#in~sdrv#1.offset; {15754#false} is VALID [2022-02-20 22:17:00,919 INFO L290 TraceCheckUtils]: 104: Hoare triple {15754#false} assume !(0 != (spi_unregister_driver_~sdrv#1.base + spi_unregister_driver_~sdrv#1.offset) % 18446744073709551616); {15754#false} is VALID [2022-02-20 22:17:00,919 INFO L290 TraceCheckUtils]: 105: Hoare triple {15754#false} assume { :end_inline_spi_unregister_driver } true; {15754#false} is VALID [2022-02-20 22:17:00,920 INFO L290 TraceCheckUtils]: 106: Hoare triple {15754#false} assume { :end_inline_tsc2005_driver_exit } true;~ldv_state_variable_0~0 := 3; {15754#false} is VALID [2022-02-20 22:17:00,920 INFO L290 TraceCheckUtils]: 107: Hoare triple {15754#false} assume { :begin_inline_ldv_check_final_state } true; {15754#false} is VALID [2022-02-20 22:17:00,920 INFO L290 TraceCheckUtils]: 108: Hoare triple {15754#false} assume 1 != ~ldv_mutex_i_mutex_of_inode~0; {15754#false} is VALID [2022-02-20 22:17:00,920 INFO L272 TraceCheckUtils]: 109: Hoare triple {15754#false} call ldv_error(); {15754#false} is VALID [2022-02-20 22:17:00,920 INFO L290 TraceCheckUtils]: 110: Hoare triple {15754#false} assume !false; {15754#false} is VALID [2022-02-20 22:17:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-02-20 22:17:00,921 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:17:00,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728783432] [2022-02-20 22:17:00,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728783432] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:17:00,924 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:17:00,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:17:00,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275123525] [2022-02-20 22:17:00,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:17:00,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 111 [2022-02-20 22:17:00,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:17:00,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-20 22:17:00,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:17:00,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:17:00,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:17:00,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:17:00,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:17:00,975 INFO L87 Difference]: Start difference. First operand 1586 states and 2218 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-20 22:17:04,891 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 22:17:11,160 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 22:17:15,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:17:15,092 INFO L93 Difference]: Finished difference Result 4767 states and 6711 transitions. [2022-02-20 22:17:15,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 22:17:15,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 111 [2022-02-20 22:17:15,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:17:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-20 22:17:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3668 transitions. [2022-02-20 22:17:15,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-20 22:17:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3668 transitions. [2022-02-20 22:17:15,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 3668 transitions. [2022-02-20 22:17:17,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3668 edges. 3668 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:17:18,439 INFO L225 Difference]: With dead ends: 4767 [2022-02-20 22:17:18,439 INFO L226 Difference]: Without dead ends: 3199 [2022-02-20 22:17:18,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-20 22:17:18,445 INFO L933 BasicCegarLoop]: 1304 mSDtfsCounter, 1983 mSDsluCounter, 2779 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 933 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2086 SdHoareTripleChecker+Valid, 4083 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 933 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-02-20 22:17:18,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2086 Valid, 4083 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [933 Valid, 1396 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-02-20 22:17:18,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3199 states. [2022-02-20 22:17:18,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3199 to 3034. [2022-02-20 22:17:18,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:17:18,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3199 states. Second operand has 3034 states, 2218 states have (on average 1.3818755635707844) internal successors, (3065), 2276 states have internal predecessors, (3065), 591 states have call successors, (591), 232 states have call predecessors, (591), 224 states have return successors, (603), 552 states have call predecessors, (603), 583 states have call successors, (603) [2022-02-20 22:17:18,536 INFO L74 IsIncluded]: Start isIncluded. First operand 3199 states. Second operand has 3034 states, 2218 states have (on average 1.3818755635707844) internal successors, (3065), 2276 states have internal predecessors, (3065), 591 states have call successors, (591), 232 states have call predecessors, (591), 224 states have return successors, (603), 552 states have call predecessors, (603), 583 states have call successors, (603) [2022-02-20 22:17:18,548 INFO L87 Difference]: Start difference. First operand 3199 states. Second operand has 3034 states, 2218 states have (on average 1.3818755635707844) internal successors, (3065), 2276 states have internal predecessors, (3065), 591 states have call successors, (591), 232 states have call predecessors, (591), 224 states have return successors, (603), 552 states have call predecessors, (603), 583 states have call successors, (603) [2022-02-20 22:17:18,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:17:18,911 INFO L93 Difference]: Finished difference Result 3199 states and 4511 transitions. [2022-02-20 22:17:18,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3199 states and 4511 transitions. [2022-02-20 22:17:18,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:17:18,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:17:18,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 3034 states, 2218 states have (on average 1.3818755635707844) internal successors, (3065), 2276 states have internal predecessors, (3065), 591 states have call successors, (591), 232 states have call predecessors, (591), 224 states have return successors, (603), 552 states have call predecessors, (603), 583 states have call successors, (603) Second operand 3199 states. [2022-02-20 22:17:18,932 INFO L87 Difference]: Start difference. First operand has 3034 states, 2218 states have (on average 1.3818755635707844) internal successors, (3065), 2276 states have internal predecessors, (3065), 591 states have call successors, (591), 232 states have call predecessors, (591), 224 states have return successors, (603), 552 states have call predecessors, (603), 583 states have call successors, (603) Second operand 3199 states. [2022-02-20 22:17:19,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:17:19,273 INFO L93 Difference]: Finished difference Result 3199 states and 4511 transitions. [2022-02-20 22:17:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 3199 states and 4511 transitions. [2022-02-20 22:17:19,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:17:19,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:17:19,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:17:19,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:17:19,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3034 states, 2218 states have (on average 1.3818755635707844) internal successors, (3065), 2276 states have internal predecessors, (3065), 591 states have call successors, (591), 232 states have call predecessors, (591), 224 states have return successors, (603), 552 states have call predecessors, (603), 583 states have call successors, (603) [2022-02-20 22:17:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 4259 transitions. [2022-02-20 22:17:19,714 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 4259 transitions. Word has length 111 [2022-02-20 22:17:19,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:17:19,715 INFO L470 AbstractCegarLoop]: Abstraction has 3034 states and 4259 transitions. [2022-02-20 22:17:19,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-20 22:17:19,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 4259 transitions. [2022-02-20 22:17:19,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-02-20 22:17:19,716 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:17:19,717 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:17:19,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 22:17:19,717 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:17:19,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:17:19,717 INFO L85 PathProgramCache]: Analyzing trace with hash -455292992, now seen corresponding path program 1 times [2022-02-20 22:17:19,718 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:17:19,718 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673424217] [2022-02-20 22:17:19,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:17:19,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:17:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:19,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:17:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:19,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:17:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:19,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {33142#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {33057#true} is VALID [2022-02-20 22:17:19,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,817 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33057#true} {33057#true} #2227#return; {33057#true} is VALID [2022-02-20 22:17:19,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:17:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:19,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {33057#true} ~cond := #in~cond; {33057#true} is VALID [2022-02-20 22:17:19,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {33057#true} assume !(0 == ~cond); {33057#true} is VALID [2022-02-20 22:17:19,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33057#true} {33057#true} #2229#return; {33057#true} is VALID [2022-02-20 22:17:19,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {33134#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {33057#true} is VALID [2022-02-20 22:17:19,824 INFO L272 TraceCheckUtils]: 1: Hoare triple {33057#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {33142#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:17:19,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {33142#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {33057#true} is VALID [2022-02-20 22:17:19,824 INFO L290 TraceCheckUtils]: 3: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,824 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {33057#true} {33057#true} #2227#return; {33057#true} is VALID [2022-02-20 22:17:19,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {33057#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {33057#true} is VALID [2022-02-20 22:17:19,825 INFO L272 TraceCheckUtils]: 6: Hoare triple {33057#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {33057#true} is VALID [2022-02-20 22:17:19,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {33057#true} ~cond := #in~cond; {33057#true} is VALID [2022-02-20 22:17:19,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {33057#true} assume !(0 == ~cond); {33057#true} is VALID [2022-02-20 22:17:19,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,825 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33057#true} {33057#true} #2229#return; {33057#true} is VALID [2022-02-20 22:17:19,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {33057#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {33057#true} is VALID [2022-02-20 22:17:19,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,826 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {33057#true} {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #2247#return; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:17:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:19,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:17:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:19,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {33142#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {33057#true} is VALID [2022-02-20 22:17:19,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,841 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33057#true} {33057#true} #2227#return; {33057#true} is VALID [2022-02-20 22:17:19,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:17:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:19,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {33057#true} ~cond := #in~cond; {33057#true} is VALID [2022-02-20 22:17:19,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {33057#true} assume !(0 == ~cond); {33057#true} is VALID [2022-02-20 22:17:19,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33057#true} {33057#true} #2229#return; {33057#true} is VALID [2022-02-20 22:17:19,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {33134#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {33057#true} is VALID [2022-02-20 22:17:19,848 INFO L272 TraceCheckUtils]: 1: Hoare triple {33057#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {33142#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:17:19,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {33142#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {33057#true} is VALID [2022-02-20 22:17:19,848 INFO L290 TraceCheckUtils]: 3: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,849 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {33057#true} {33057#true} #2227#return; {33057#true} is VALID [2022-02-20 22:17:19,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {33057#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {33057#true} is VALID [2022-02-20 22:17:19,849 INFO L272 TraceCheckUtils]: 6: Hoare triple {33057#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {33057#true} is VALID [2022-02-20 22:17:19,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {33057#true} ~cond := #in~cond; {33057#true} is VALID [2022-02-20 22:17:19,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {33057#true} assume !(0 == ~cond); {33057#true} is VALID [2022-02-20 22:17:19,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,849 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33057#true} {33057#true} #2229#return; {33057#true} is VALID [2022-02-20 22:17:19,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {33057#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {33057#true} is VALID [2022-02-20 22:17:19,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,863 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {33057#true} {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #2249#return; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:17:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:19,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:17:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:19,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {33142#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {33057#true} is VALID [2022-02-20 22:17:19,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,886 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33057#true} {33057#true} #2227#return; {33057#true} is VALID [2022-02-20 22:17:19,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:17:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:19,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {33057#true} ~cond := #in~cond; {33057#true} is VALID [2022-02-20 22:17:19,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {33057#true} assume !(0 == ~cond); {33057#true} is VALID [2022-02-20 22:17:19,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33057#true} {33057#true} #2229#return; {33057#true} is VALID [2022-02-20 22:17:19,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {33134#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {33057#true} is VALID [2022-02-20 22:17:19,891 INFO L272 TraceCheckUtils]: 1: Hoare triple {33057#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {33142#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:17:19,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {33142#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {33057#true} is VALID [2022-02-20 22:17:19,891 INFO L290 TraceCheckUtils]: 3: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,891 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {33057#true} {33057#true} #2227#return; {33057#true} is VALID [2022-02-20 22:17:19,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {33057#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {33057#true} is VALID [2022-02-20 22:17:19,891 INFO L272 TraceCheckUtils]: 6: Hoare triple {33057#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {33057#true} is VALID [2022-02-20 22:17:19,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {33057#true} ~cond := #in~cond; {33057#true} is VALID [2022-02-20 22:17:19,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {33057#true} assume !(0 == ~cond); {33057#true} is VALID [2022-02-20 22:17:19,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,892 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33057#true} {33057#true} #2229#return; {33057#true} is VALID [2022-02-20 22:17:19,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {33057#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {33057#true} is VALID [2022-02-20 22:17:19,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,892 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {33057#true} {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #2251#return; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 22:17:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:19,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:17:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:19,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {33142#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {33057#true} is VALID [2022-02-20 22:17:19,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,910 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33057#true} {33057#true} #2227#return; {33057#true} is VALID [2022-02-20 22:17:19,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:17:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:19,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {33057#true} ~cond := #in~cond; {33057#true} is VALID [2022-02-20 22:17:19,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {33057#true} assume !(0 == ~cond); {33057#true} is VALID [2022-02-20 22:17:19,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33057#true} {33057#true} #2229#return; {33057#true} is VALID [2022-02-20 22:17:19,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {33134#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {33057#true} is VALID [2022-02-20 22:17:19,916 INFO L272 TraceCheckUtils]: 1: Hoare triple {33057#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {33142#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:17:19,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {33142#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {33057#true} is VALID [2022-02-20 22:17:19,916 INFO L290 TraceCheckUtils]: 3: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,916 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {33057#true} {33057#true} #2227#return; {33057#true} is VALID [2022-02-20 22:17:19,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {33057#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {33057#true} is VALID [2022-02-20 22:17:19,916 INFO L272 TraceCheckUtils]: 6: Hoare triple {33057#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {33057#true} is VALID [2022-02-20 22:17:19,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {33057#true} ~cond := #in~cond; {33057#true} is VALID [2022-02-20 22:17:19,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {33057#true} assume !(0 == ~cond); {33057#true} is VALID [2022-02-20 22:17:19,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,917 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33057#true} {33057#true} #2229#return; {33057#true} is VALID [2022-02-20 22:17:19,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {33057#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {33057#true} is VALID [2022-02-20 22:17:19,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,917 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {33057#true} {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #2253#return; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 22:17:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:19,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:17:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:19,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {33142#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {33057#true} is VALID [2022-02-20 22:17:19,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,934 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33057#true} {33057#true} #2227#return; {33057#true} is VALID [2022-02-20 22:17:19,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:17:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:19,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {33057#true} ~cond := #in~cond; {33057#true} is VALID [2022-02-20 22:17:19,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {33057#true} assume !(0 == ~cond); {33057#true} is VALID [2022-02-20 22:17:19,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33057#true} {33057#true} #2229#return; {33057#true} is VALID [2022-02-20 22:17:19,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {33134#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {33057#true} is VALID [2022-02-20 22:17:19,941 INFO L272 TraceCheckUtils]: 1: Hoare triple {33057#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {33142#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:17:19,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {33142#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {33057#true} is VALID [2022-02-20 22:17:19,941 INFO L290 TraceCheckUtils]: 3: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,941 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {33057#true} {33057#true} #2227#return; {33057#true} is VALID [2022-02-20 22:17:19,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {33057#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {33057#true} is VALID [2022-02-20 22:17:19,942 INFO L272 TraceCheckUtils]: 6: Hoare triple {33057#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {33057#true} is VALID [2022-02-20 22:17:19,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {33057#true} ~cond := #in~cond; {33057#true} is VALID [2022-02-20 22:17:19,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {33057#true} assume !(0 == ~cond); {33057#true} is VALID [2022-02-20 22:17:19,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,942 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33057#true} {33057#true} #2229#return; {33057#true} is VALID [2022-02-20 22:17:19,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {33057#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {33057#true} is VALID [2022-02-20 22:17:19,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,943 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {33057#true} {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #2255#return; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-02-20 22:17:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:17:19,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {33171#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr488 := 0; {33057#true} is VALID [2022-02-20 22:17:19,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {33057#true} assume !(#t~loopctr488 % 18446744073709551616 < #amount % 18446744073709551616); {33057#true} is VALID [2022-02-20 22:17:19,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {33057#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {33057#true} is VALID [2022-02-20 22:17:19,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33057#true} {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #2257#return; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {33057#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(89, 2);call #Ultimate.allocInit(36, 3);call #Ultimate.allocInit(12, 4);call #Ultimate.allocInit(48, 5);call #Ultimate.allocInit(14, 6);call #Ultimate.allocInit(8, 7);call #Ultimate.allocInit(25, 8);call #Ultimate.allocInit(214, 9);call #Ultimate.allocInit(32, 10);call #Ultimate.allocInit(32, 11);call #Ultimate.allocInit(32, 12);call #Ultimate.allocInit(33, 13);call #Ultimate.allocInit(44, 14);call #Ultimate.allocInit(27, 15);call #Ultimate.allocInit(44, 16);call #Ultimate.allocInit(39, 17);call #Ultimate.allocInit(4, 18);call write~init~int(37, 18, 0, 1);call write~init~int(100, 18, 1, 1);call write~init~int(10, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(9, 19);call #Ultimate.allocInit(36, 20);call #Ultimate.allocInit(18, 21);call #Ultimate.allocInit(8, 22);call #Ultimate.allocInit(16, 23);call #Ultimate.allocInit(27, 24);call #Ultimate.allocInit(12, 25);call #Ultimate.allocInit(32, 26);call #Ultimate.allocInit(12, 27);call #Ultimate.allocInit(33, 28);call #Ultimate.allocInit(4, 29);call write~init~int(118, 29, 0, 1);call write~init~int(105, 29, 1, 1);call write~init~int(111, 29, 2, 1);call write~init~int(0, 29, 3, 1);call #Ultimate.allocInit(27, 30);call #Ultimate.allocInit(11, 31);call #Ultimate.allocInit(20, 32);call #Ultimate.allocInit(25, 33);call #Ultimate.allocInit(26, 34);call #Ultimate.allocInit(12, 35);call #Ultimate.allocInit(20, 36);call #Ultimate.allocInit(8, 37);call #Ultimate.allocInit(32, 38);call #Ultimate.allocInit(44, 39);call #Ultimate.allocInit(42, 40);call #Ultimate.allocInit(8, 41);~ldv_state_variable_8~0 := 0;~ldv_work_struct_3_1~0.base, ~ldv_work_struct_3_1~0.offset := 0, 0;~ldv_timer_4_0~0 := 0;~ldv_state_variable_0~0 := 0;~ldv_state_variable_5~0 := 0;~ldv_irq_2_0~0 := 0;~ldv_work_3_2~0 := 0;~ldv_irq_dev_2_0~0.base, ~ldv_irq_dev_2_0~0.offset := 0, 0;~ldv_work_3_0~0 := 0;~ldv_timer_4_3~0 := 0;~ldv_irq_data_2_3~0.base, ~ldv_irq_data_2_3~0.offset := 0, 0;~ldv_irq_2_2~0 := 0;~ldv_irq_dev_1_2~0.base, ~ldv_irq_dev_1_2~0.offset := 0, 0;~ldv_irq_line_2_0~0 := 0;~ldv_irq_dev_2_1~0.base, ~ldv_irq_dev_2_1~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_data_2_2~0.base, ~ldv_irq_data_2_2~0.offset := 0, 0;~ldv_irq_line_1_1~0 := 0;~ldv_work_3_3~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_state_variable_7~0 := 0;~ldv_irq_line_1_2~0 := 0;~ldv_work_struct_3_3~0.base, ~ldv_work_struct_3_3~0.offset := 0, 0;~ldv_irq_dev_2_2~0.base, ~ldv_irq_dev_2_2~0.offset := 0, 0;~ldv_irq_line_2_3~0 := 0;~ldv_irq_2_1~0 := 0;~ldv_irq_data_2_1~0.base, ~ldv_irq_data_2_1~0.offset := 0, 0;~ldv_irq_1_3~0 := 0;~ldv_irq_dev_1_1~0.base, ~ldv_irq_dev_1_1~0.offset := 0, 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_line_2_2~0 := 0;~ldv_timer_4_2~0 := 0;~ldv_irq_1_0~0 := 0;~ldv_timer_list_4_0~0.base, ~ldv_timer_list_4_0~0.offset := 0, 0;~ldv_work_struct_3_2~0.base, ~ldv_work_struct_3_2~0.offset := 0, 0;~ldv_state_variable_6~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~tsc2005_driver_group0~0.base, ~tsc2005_driver_group0~0.offset := 0, 0;~ldv_work_3_1~0 := 0;~ldv_irq_line_2_1~0 := 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~ldv_irq_dev_1_3~0.base, ~ldv_irq_dev_1_3~0.offset := 0, 0;~ldv_state_variable_2~0 := 0;~ldv_irq_dev_1_0~0.base, ~ldv_irq_dev_1_0~0.offset := 0, 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_irq_dev_2_3~0.base, ~ldv_irq_dev_2_3~0.offset := 0, 0;~ldv_irq_data_2_0~0.base, ~ldv_irq_data_2_0~0.offset := 0, 0;~ldv_work_struct_3_0~0.base, ~ldv_work_struct_3_0~0.offset := 0, 0;~ldv_timer_list_4_3~0.base, ~ldv_timer_list_4_3~0.offset := 0, 0;~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_timer_list_4_2~0.base, ~ldv_timer_list_4_2~0.offset := 0, 0;~ldv_irq_1_1~0 := 0;~ldv_irq_2_3~0 := 0;~ldv_irq_line_1_3~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_irq_line_1_0~0 := 0;~tsc2005_pm_ops_group1~0.base, ~tsc2005_pm_ops_group1~0.offset := 0, 0;~ldv_timer_4_1~0 := 0;~ldv_timer_list_4_1~0.base, ~ldv_timer_list_4_1~0.offset := 0, 0;~ldv_state_variable_4~0 := 0;~#dev_attr_selftest~0.base, ~#dev_attr_selftest~0.offset := 42, 0;call #Ultimate.allocInit(43, 42);call write~init~$Pointer$(19, 0, ~#dev_attr_selftest~0.base, ~#dev_attr_selftest~0.offset, 8);call write~init~int(292, ~#dev_attr_selftest~0.base, 8 + ~#dev_attr_selftest~0.offset, 2);call write~init~int(0, ~#dev_attr_selftest~0.base, 10 + ~#dev_attr_selftest~0.offset, 1);call write~init~$Pointer$(0, 0, ~#dev_attr_selftest~0.base, 11 + ~#dev_attr_selftest~0.offset, 8);call write~init~int(0, ~#dev_attr_selftest~0.base, 19 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 20 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 21 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 22 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 23 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 24 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 25 + ~#dev_attr_selftest~0.offset, 1);call write~init~int(0, ~#dev_attr_selftest~0.base, 26 + ~#dev_attr_selftest~0.offset, 1);call write~init~$Pointer$(#funAddr~tsc2005_selftest_show.base, #funAddr~tsc2005_selftest_show.offset, ~#dev_attr_selftest~0.base, 27 + ~#dev_attr_selftest~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dev_attr_selftest~0.base, 35 + ~#dev_attr_selftest~0.offset, 8);~#tsc2005_attrs~0.base, ~#tsc2005_attrs~0.offset := 43, 0;call #Ultimate.allocInit(16, 43);call write~init~$Pointer$(~#dev_attr_selftest~0.base, ~#dev_attr_selftest~0.offset, ~#tsc2005_attrs~0.base, ~#tsc2005_attrs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_attrs~0.base, 8 + ~#tsc2005_attrs~0.offset, 8);~#tsc2005_attr_group~0.base, ~#tsc2005_attr_group~0.offset := 44, 0;call #Ultimate.allocInit(32, 44);call write~init~$Pointer$(0, 0, ~#tsc2005_attr_group~0.base, ~#tsc2005_attr_group~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_attr_is_visible.base, #funAddr~tsc2005_attr_is_visible.offset, ~#tsc2005_attr_group~0.base, 8 + ~#tsc2005_attr_group~0.offset, 8);call write~init~$Pointer$(~#tsc2005_attrs~0.base, ~#tsc2005_attrs~0.offset, ~#tsc2005_attr_group~0.base, 16 + ~#tsc2005_attr_group~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_attr_group~0.base, 24 + ~#tsc2005_attr_group~0.offset, 8);~#tsc2005_pm_ops~0.base, ~#tsc2005_pm_ops~0.offset := 45, 0;call #Ultimate.allocInit(184, 45);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 8 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_suspend.base, #funAddr~tsc2005_suspend.offset, ~#tsc2005_pm_ops~0.base, 16 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_resume.base, #funAddr~tsc2005_resume.offset, ~#tsc2005_pm_ops~0.base, 24 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_suspend.base, #funAddr~tsc2005_suspend.offset, ~#tsc2005_pm_ops~0.base, 32 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_resume.base, #funAddr~tsc2005_resume.offset, ~#tsc2005_pm_ops~0.base, 40 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_suspend.base, #funAddr~tsc2005_suspend.offset, ~#tsc2005_pm_ops~0.base, 48 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_resume.base, #funAddr~tsc2005_resume.offset, ~#tsc2005_pm_ops~0.base, 56 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 64 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 72 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 80 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 88 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 96 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 104 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 112 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 120 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 128 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 136 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 144 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 152 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 160 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 168 + ~#tsc2005_pm_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_pm_ops~0.base, 176 + ~#tsc2005_pm_ops~0.offset, 8);~#tsc2005_driver~0.base, ~#tsc2005_driver~0.offset := 46, 0;call #Ultimate.allocInit(149, 46);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_probe.base, #funAddr~tsc2005_probe.offset, ~#tsc2005_driver~0.base, 8 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~tsc2005_remove.base, #funAddr~tsc2005_remove.offset, ~#tsc2005_driver~0.base, 16 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 24 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(41, 0, ~#tsc2005_driver~0.base, 32 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 40 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#tsc2005_driver~0.base, 48 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 56 + ~#tsc2005_driver~0.offset, 8);call write~init~int(0, ~#tsc2005_driver~0.base, 64 + ~#tsc2005_driver~0.offset, 1);call write~init~int(0, ~#tsc2005_driver~0.base, 65 + ~#tsc2005_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 69 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 77 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 85 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 93 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 101 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 109 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 117 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 125 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(~#tsc2005_pm_ops~0.base, ~#tsc2005_pm_ops~0.offset, ~#tsc2005_driver~0.base, 133 + ~#tsc2005_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#tsc2005_driver~0.base, 141 + ~#tsc2005_driver~0.offset, 8);~ldv_retval_20~0 := 0;~ldv_retval_18~0 := 0;~ldv_retval_2~0 := 0;~ldv_retval_5~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_11~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_15~0 := 0;~ldv_retval_16~0 := 0;~ldv_retval_8~0 := 0;~ldv_retval_7~0 := 0;~ldv_retval_19~0 := 0;~ldv_retval_14~0 := 0;~ldv_retval_17~0 := 0;~ldv_retval_12~0 := 0;~ldv_retval_6~0 := 0;~ldv_retval_13~0 := 0;~ldv_retval_9~0 := 0;~ldv_retval_10~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_3~0 := 0;~ldv_mutex_i_mutex_of_inode~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_mutex_of_tsc2005~0 := 1; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret352#1.base, main_#t~ret352#1.offset, 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~ret356#1.base, main_#t~ret356#1.offset, main_#t~ret357#1.base, main_#t~ret357#1.offset, main_#t~nondet358#1, main_#t~switch359#1, main_#t~nondet360#1, main_#t~switch361#1, main_#t~ret362#1, main_#t~ret363#1, main_#t~ret364#1, main_#t~ret365#1, main_#t~ret366#1, main_#t~ret367#1, main_#t~ret368#1, main_#t~ret369#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~ret379#1, main_#t~ret380#1, main_#t~ret381#1, main_#t~nondet382#1, main_#t~switch383#1, main_#t~mem384#1, main_#t~ret385#1, main_#t~nondet386#1, main_#t~switch387#1, main_#t~ret388#1, main_#t~nondet389#1, main_#t~switch390#1, main_#t~ret391#1, main_#t~nondet392#1, main_#t~switch393#1, main_#t~ret394#1, main_#t~ret395#1, main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~37#1.base, main_~tmp~37#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___2~3#1.base, main_~tmp___2~3#1.offset, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset, main_~tmp___4~1#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1;call main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~37#1.base, main_~tmp~37#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___2~3#1.base, main_~tmp___2~3#1.offset;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset;havoc main_~tmp___4~1#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,960 INFO L272 TraceCheckUtils]: 2: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} call main_#t~ret352#1.base, main_#t~ret352#1.offset := ldv_init_zalloc(296); {33134#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:17:19,960 INFO L290 TraceCheckUtils]: 3: Hoare triple {33134#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {33057#true} is VALID [2022-02-20 22:17:19,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {33057#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {33142#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:17:19,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {33142#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {33057#true} is VALID [2022-02-20 22:17:19,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,961 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {33057#true} {33057#true} #2227#return; {33057#true} is VALID [2022-02-20 22:17:19,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {33057#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {33057#true} is VALID [2022-02-20 22:17:19,961 INFO L272 TraceCheckUtils]: 9: Hoare triple {33057#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {33057#true} is VALID [2022-02-20 22:17:19,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {33057#true} ~cond := #in~cond; {33057#true} is VALID [2022-02-20 22:17:19,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {33057#true} assume !(0 == ~cond); {33057#true} is VALID [2022-02-20 22:17:19,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,968 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {33057#true} {33057#true} #2229#return; {33057#true} is VALID [2022-02-20 22:17:19,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {33057#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {33057#true} is VALID [2022-02-20 22:17:19,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,969 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {33057#true} {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #2247#return; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} main_~tmp~37#1.base, main_~tmp~37#1.offset := main_#t~ret352#1.base, main_#t~ret352#1.offset;havoc main_#t~ret352#1.base, main_#t~ret352#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~37#1.base, main_~tmp~37#1.offset; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,969 INFO L272 TraceCheckUtils]: 18: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} call main_#t~ret353#1.base, main_#t~ret353#1.offset := ldv_init_zalloc(32); {33134#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:17:19,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {33134#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {33057#true} is VALID [2022-02-20 22:17:19,970 INFO L272 TraceCheckUtils]: 20: Hoare triple {33057#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {33142#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:17:19,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {33142#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {33057#true} is VALID [2022-02-20 22:17:19,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,970 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {33057#true} {33057#true} #2227#return; {33057#true} is VALID [2022-02-20 22:17:19,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {33057#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {33057#true} is VALID [2022-02-20 22:17:19,971 INFO L272 TraceCheckUtils]: 25: Hoare triple {33057#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {33057#true} is VALID [2022-02-20 22:17:19,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {33057#true} ~cond := #in~cond; {33057#true} is VALID [2022-02-20 22:17:19,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {33057#true} assume !(0 == ~cond); {33057#true} is VALID [2022-02-20 22:17:19,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,971 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {33057#true} {33057#true} #2229#return; {33057#true} is VALID [2022-02-20 22:17:19,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {33057#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {33057#true} is VALID [2022-02-20 22:17:19,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,972 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {33057#true} {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #2249#return; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset := main_#t~ret353#1.base, main_#t~ret353#1.offset;havoc main_#t~ret353#1.base, main_#t~ret353#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,973 INFO L272 TraceCheckUtils]: 34: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} call main_#t~ret354#1.base, main_#t~ret354#1.offset := ldv_init_zalloc(1); {33134#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:17:19,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {33134#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {33057#true} is VALID [2022-02-20 22:17:19,973 INFO L272 TraceCheckUtils]: 36: Hoare triple {33057#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {33142#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:17:19,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {33142#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {33057#true} is VALID [2022-02-20 22:17:19,973 INFO L290 TraceCheckUtils]: 38: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,974 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {33057#true} {33057#true} #2227#return; {33057#true} is VALID [2022-02-20 22:17:19,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {33057#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {33057#true} is VALID [2022-02-20 22:17:19,974 INFO L272 TraceCheckUtils]: 41: Hoare triple {33057#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {33057#true} is VALID [2022-02-20 22:17:19,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {33057#true} ~cond := #in~cond; {33057#true} is VALID [2022-02-20 22:17:19,974 INFO L290 TraceCheckUtils]: 43: Hoare triple {33057#true} assume !(0 == ~cond); {33057#true} is VALID [2022-02-20 22:17:19,974 INFO L290 TraceCheckUtils]: 44: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,974 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {33057#true} {33057#true} #2229#return; {33057#true} is VALID [2022-02-20 22:17:19,974 INFO L290 TraceCheckUtils]: 46: Hoare triple {33057#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {33057#true} is VALID [2022-02-20 22:17:19,975 INFO L290 TraceCheckUtils]: 47: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,975 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {33057#true} {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #2251#return; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset := main_#t~ret354#1.base, main_#t~ret354#1.offset;havoc main_#t~ret354#1.base, main_#t~ret354#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,976 INFO L272 TraceCheckUtils]: 50: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} call main_#t~ret355#1.base, main_#t~ret355#1.offset := ldv_init_zalloc(1416); {33134#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:17:19,976 INFO L290 TraceCheckUtils]: 51: Hoare triple {33134#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {33057#true} is VALID [2022-02-20 22:17:19,977 INFO L272 TraceCheckUtils]: 52: Hoare triple {33057#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {33142#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:17:19,977 INFO L290 TraceCheckUtils]: 53: Hoare triple {33142#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {33057#true} is VALID [2022-02-20 22:17:19,978 INFO L290 TraceCheckUtils]: 54: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,978 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {33057#true} {33057#true} #2227#return; {33057#true} is VALID [2022-02-20 22:17:19,978 INFO L290 TraceCheckUtils]: 56: Hoare triple {33057#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {33057#true} is VALID [2022-02-20 22:17:19,978 INFO L272 TraceCheckUtils]: 57: Hoare triple {33057#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {33057#true} is VALID [2022-02-20 22:17:19,978 INFO L290 TraceCheckUtils]: 58: Hoare triple {33057#true} ~cond := #in~cond; {33057#true} is VALID [2022-02-20 22:17:19,979 INFO L290 TraceCheckUtils]: 59: Hoare triple {33057#true} assume !(0 == ~cond); {33057#true} is VALID [2022-02-20 22:17:19,979 INFO L290 TraceCheckUtils]: 60: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,979 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {33057#true} {33057#true} #2229#return; {33057#true} is VALID [2022-02-20 22:17:19,979 INFO L290 TraceCheckUtils]: 62: Hoare triple {33057#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {33057#true} is VALID [2022-02-20 22:17:19,979 INFO L290 TraceCheckUtils]: 63: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,980 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {33057#true} {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #2253#return; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,980 INFO L290 TraceCheckUtils]: 65: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} main_~tmp___2~3#1.base, main_~tmp___2~3#1.offset := main_#t~ret355#1.base, main_#t~ret355#1.offset;havoc main_#t~ret355#1.base, main_#t~ret355#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___2~3#1.base, main_~tmp___2~3#1.offset; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,980 INFO L272 TraceCheckUtils]: 66: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} call main_#t~ret356#1.base, main_#t~ret356#1.offset := ldv_init_zalloc(48); {33134#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:17:19,981 INFO L290 TraceCheckUtils]: 67: Hoare triple {33134#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(~size); {33057#true} is VALID [2022-02-20 22:17:19,981 INFO L272 TraceCheckUtils]: 68: Hoare triple {33057#true} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, 1, ~size, ~size); {33142#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:17:19,981 INFO L290 TraceCheckUtils]: 69: Hoare triple {33142#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {33057#true} is VALID [2022-02-20 22:17:19,981 INFO L290 TraceCheckUtils]: 70: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,981 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {33057#true} {33057#true} #2227#return; {33057#true} is VALID [2022-02-20 22:17:19,982 INFO L290 TraceCheckUtils]: 72: Hoare triple {33057#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc34.base, #t~malloc34.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {33057#true} is VALID [2022-02-20 22:17:19,982 INFO L272 TraceCheckUtils]: 73: Hoare triple {33057#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {33057#true} is VALID [2022-02-20 22:17:19,982 INFO L290 TraceCheckUtils]: 74: Hoare triple {33057#true} ~cond := #in~cond; {33057#true} is VALID [2022-02-20 22:17:19,982 INFO L290 TraceCheckUtils]: 75: Hoare triple {33057#true} assume !(0 == ~cond); {33057#true} is VALID [2022-02-20 22:17:19,982 INFO L290 TraceCheckUtils]: 76: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,982 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {33057#true} {33057#true} #2229#return; {33057#true} is VALID [2022-02-20 22:17:19,982 INFO L290 TraceCheckUtils]: 78: Hoare triple {33057#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {33057#true} is VALID [2022-02-20 22:17:19,983 INFO L290 TraceCheckUtils]: 79: Hoare triple {33057#true} assume true; {33057#true} is VALID [2022-02-20 22:17:19,983 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {33057#true} {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #2255#return; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,983 INFO L290 TraceCheckUtils]: 81: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset := main_#t~ret356#1.base, main_#t~ret356#1.offset;havoc main_#t~ret356#1.base, main_#t~ret356#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___3~2#1.base, main_~tmp___3~2#1.offset;assume { :begin_inline_ldv_initialize } true; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,984 INFO L290 TraceCheckUtils]: 82: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_ldv_memset } true;ldv_memset_#in~s#1.base, ldv_memset_#in~s#1.offset, ldv_memset_#in~c#1, ldv_memset_#in~n#1 := main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset, 0, 4;havoc ldv_memset_#res#1.base, ldv_memset_#res#1.offset;havoc ldv_memset_#t~memset~res35#1.base, ldv_memset_#t~memset~res35#1.offset, ldv_memset_~s#1.base, ldv_memset_~s#1.offset, ldv_memset_~c#1, ldv_memset_~n#1, ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset;ldv_memset_~s#1.base, ldv_memset_~s#1.offset := ldv_memset_#in~s#1.base, ldv_memset_#in~s#1.offset;ldv_memset_~c#1 := ldv_memset_#in~c#1;ldv_memset_~n#1 := ldv_memset_#in~n#1;havoc ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,984 INFO L272 TraceCheckUtils]: 83: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} call ldv_memset_#t~memset~res35#1.base, ldv_memset_#t~memset~res35#1.offset := #Ultimate.C_memset(ldv_memset_~s#1.base, ldv_memset_~s#1.offset, ldv_memset_~c#1, ldv_memset_~n#1); {33171#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:17:19,984 INFO L290 TraceCheckUtils]: 84: Hoare triple {33171#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr488 := 0; {33057#true} is VALID [2022-02-20 22:17:19,984 INFO L290 TraceCheckUtils]: 85: Hoare triple {33057#true} assume !(#t~loopctr488 % 18446744073709551616 < #amount % 18446744073709551616); {33057#true} is VALID [2022-02-20 22:17:19,985 INFO L290 TraceCheckUtils]: 86: Hoare triple {33057#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {33057#true} is VALID [2022-02-20 22:17:19,985 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {33057#true} {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #2257#return; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,985 INFO L290 TraceCheckUtils]: 88: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset := ldv_memset_~s#1.base, ldv_memset_~s#1.offset;havoc ldv_memset_#t~memset~res35#1.base, ldv_memset_#t~memset~res35#1.offset;ldv_memset_#res#1.base, ldv_memset_#res#1.offset := ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,986 INFO L290 TraceCheckUtils]: 89: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} main_#t~ret357#1.base, main_#t~ret357#1.offset := ldv_memset_#res#1.base, ldv_memset_#res#1.offset;assume { :end_inline_ldv_memset } true;havoc main_#t~ret357#1.base, main_#t~ret357#1.offset;~ldv_state_variable_6~0 := 0;assume { :begin_inline_work_init_3 } true;~ldv_work_3_0~0 := 0;~ldv_work_3_1~0 := 0;~ldv_work_3_2~0 := 0;~ldv_work_3_3~0 := 0; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,986 INFO L290 TraceCheckUtils]: 90: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume { :end_inline_work_init_3 } true;~ldv_state_variable_3~0 := 1;~ldv_state_variable_7~0 := 0;~ldv_state_variable_2~0 := 1;~ldv_state_variable_8~0 := 0;~ldv_state_variable_1~0 := 1;assume { :begin_inline_timer_init_4 } true;~ldv_timer_4_0~0 := 0;~ldv_timer_4_1~0 := 0;~ldv_timer_4_2~0 := 0;~ldv_timer_4_3~0 := 0; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,986 INFO L290 TraceCheckUtils]: 91: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume { :end_inline_timer_init_4 } true;~ldv_state_variable_4~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_5~0 := 0; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,986 INFO L290 TraceCheckUtils]: 92: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume -2147483648 <= main_#t~nondet358#1 && main_#t~nondet358#1 <= 2147483647;main_~tmp___4~1#1 := main_#t~nondet358#1;havoc main_#t~nondet358#1;main_#t~switch359#1 := 0 == main_~tmp___4~1#1; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,987 INFO L290 TraceCheckUtils]: 93: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume !main_#t~switch359#1;main_#t~switch359#1 := main_#t~switch359#1 || 1 == main_~tmp___4~1#1; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,987 INFO L290 TraceCheckUtils]: 94: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume !main_#t~switch359#1;main_#t~switch359#1 := main_#t~switch359#1 || 2 == main_~tmp___4~1#1; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,987 INFO L290 TraceCheckUtils]: 95: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume !main_#t~switch359#1;main_#t~switch359#1 := main_#t~switch359#1 || 3 == main_~tmp___4~1#1; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,988 INFO L290 TraceCheckUtils]: 96: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume !main_#t~switch359#1;main_#t~switch359#1 := main_#t~switch359#1 || 4 == main_~tmp___4~1#1; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,988 INFO L290 TraceCheckUtils]: 97: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume !main_#t~switch359#1;main_#t~switch359#1 := main_#t~switch359#1 || 5 == main_~tmp___4~1#1; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,988 INFO L290 TraceCheckUtils]: 98: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume !main_#t~switch359#1;main_#t~switch359#1 := main_#t~switch359#1 || 6 == main_~tmp___4~1#1; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,988 INFO L290 TraceCheckUtils]: 99: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume !main_#t~switch359#1;main_#t~switch359#1 := main_#t~switch359#1 || 7 == main_~tmp___4~1#1; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,989 INFO L290 TraceCheckUtils]: 100: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume main_#t~switch359#1; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,989 INFO L290 TraceCheckUtils]: 101: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet389#1 && main_#t~nondet389#1 <= 2147483647;main_~tmp___8~0#1 := main_#t~nondet389#1;havoc main_#t~nondet389#1;main_#t~switch390#1 := 0 == main_~tmp___8~0#1; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,989 INFO L290 TraceCheckUtils]: 102: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume !main_#t~switch390#1;main_#t~switch390#1 := main_#t~switch390#1 || 1 == main_~tmp___8~0#1; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,989 INFO L290 TraceCheckUtils]: 103: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume main_#t~switch390#1; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,990 INFO L290 TraceCheckUtils]: 104: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_tsc2005_driver_init } true;havoc tsc2005_driver_init_#res#1;havoc tsc2005_driver_init_#t~ret324#1, tsc2005_driver_init_~tmp~28#1;havoc tsc2005_driver_init_~tmp~28#1;assume { :begin_inline_spi_register_driver } true;spi_register_driver_#in~arg0#1.base, spi_register_driver_#in~arg0#1.offset := ~#tsc2005_driver~0.base, ~#tsc2005_driver~0.offset;havoc spi_register_driver_#res#1;havoc spi_register_driver_#t~nondet482#1, spi_register_driver_~arg0#1.base, spi_register_driver_~arg0#1.offset;spi_register_driver_~arg0#1.base, spi_register_driver_~arg0#1.offset := spi_register_driver_#in~arg0#1.base, spi_register_driver_#in~arg0#1.offset;assume -2147483648 <= spi_register_driver_#t~nondet482#1 && spi_register_driver_#t~nondet482#1 <= 2147483647;spi_register_driver_#res#1 := spi_register_driver_#t~nondet482#1;havoc spi_register_driver_#t~nondet482#1; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,990 INFO L290 TraceCheckUtils]: 105: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} tsc2005_driver_init_#t~ret324#1 := spi_register_driver_#res#1;assume { :end_inline_spi_register_driver } true;assume -2147483648 <= tsc2005_driver_init_#t~ret324#1 && tsc2005_driver_init_#t~ret324#1 <= 2147483647;tsc2005_driver_init_~tmp~28#1 := tsc2005_driver_init_#t~ret324#1;havoc tsc2005_driver_init_#t~ret324#1;tsc2005_driver_init_#res#1 := tsc2005_driver_init_~tmp~28#1; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,990 INFO L290 TraceCheckUtils]: 106: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} main_#t~ret391#1 := tsc2005_driver_init_#res#1;assume { :end_inline_tsc2005_driver_init } true;assume -2147483648 <= main_#t~ret391#1 && main_#t~ret391#1 <= 2147483647;~ldv_retval_19~0 := main_#t~ret391#1;havoc main_#t~ret391#1; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,990 INFO L290 TraceCheckUtils]: 107: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume 0 != ~ldv_retval_19~0;~ldv_state_variable_0~0 := 3; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,991 INFO L290 TraceCheckUtils]: 108: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume { :begin_inline_ldv_check_final_state } true; {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:17:19,991 INFO L290 TraceCheckUtils]: 109: Hoare triple {33059#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume 1 != ~ldv_mutex_i_mutex_of_inode~0; {33058#false} is VALID [2022-02-20 22:17:19,991 INFO L272 TraceCheckUtils]: 110: Hoare triple {33058#false} call ldv_error(); {33058#false} is VALID [2022-02-20 22:17:19,991 INFO L290 TraceCheckUtils]: 111: Hoare triple {33058#false} assume !false; {33058#false} is VALID [2022-02-20 22:17:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-02-20 22:17:19,992 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:17:19,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673424217] [2022-02-20 22:17:19,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673424217] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:17:19,992 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:17:19,993 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:17:19,993 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138779589] [2022-02-20 22:17:19,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:17:19,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 112 [2022-02-20 22:17:19,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:17:19,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 22:17:20,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:17:20,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:17:20,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:17:20,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:17:20,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:17:20,047 INFO L87 Difference]: Start difference. First operand 3034 states and 4259 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 22:17:23,855 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 []