./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 440f273968b34677cc4ba81db9f48373d3cac4b8a75ac1f970ae3fdbbff89c17 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 18:20:41,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 18:20:41,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-24 18:20:41,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 18:20:41,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 18:20:41,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 18:20:41,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 18:20:41,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 18:20:41,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 18:20:41,784 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 18:20:41,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 18:20:41,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 18:20:41,798 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 18:20:41,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 18:20:41,799 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 18:20:41,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 18:20:41,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 18:20:41,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 18:20:41,800 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 18:20:41,800 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 18:20:41,800 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 18:20:41,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 18:20:41,806 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 18:20:41,806 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 18:20:41,806 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 18:20:41,806 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 18:20:41,806 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 18:20:41,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 18:20:41,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 18:20:41,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 18:20:41,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:20:41,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 18:20:41,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 18:20:41,807 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 18:20:41,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 18:20:41,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 18:20:41,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 18:20:41,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 18:20:41,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 18:20:41,808 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 440f273968b34677cc4ba81db9f48373d3cac4b8a75ac1f970ae3fdbbff89c17 [2024-10-24 18:20:42,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 18:20:42,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 18:20:42,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 18:20:42,063 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 18:20:42,064 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 18:20:42,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2024-10-24 18:20:43,498 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 18:20:43,799 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 18:20:43,800 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2024-10-24 18:20:43,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04d554bb8/e72673e85b7d43839bf62c852fad74cf/FLAGf03eabd20 [2024-10-24 18:20:43,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04d554bb8/e72673e85b7d43839bf62c852fad74cf [2024-10-24 18:20:43,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 18:20:43,837 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 18:20:43,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 18:20:43,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 18:20:43,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 18:20:43,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:20:43" (1/1) ... [2024-10-24 18:20:43,845 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33942dd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:20:43, skipping insertion in model container [2024-10-24 18:20:43,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:20:43" (1/1) ... [2024-10-24 18:20:43,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:20:44,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:20:45,007 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-24 18:20:45,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2fd15e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:20:45, skipping insertion in model container [2024-10-24 18:20:45,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 18:20:45,009 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 18:20:45,011 INFO L158 Benchmark]: Toolchain (without parser) took 1173.26ms. Allocated memory is still 163.6MB. Free memory was 92.2MB in the beginning and 109.4MB in the end (delta: -17.2MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-10-24 18:20:45,012 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 109.1MB. Free memory was 78.4MB in the beginning and 78.3MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 18:20:45,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1169.52ms. Allocated memory is still 163.6MB. Free memory was 92.0MB in the beginning and 109.4MB in the end (delta: -17.4MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-10-24 18:20:45,014 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 109.1MB. Free memory was 78.4MB in the beginning and 78.3MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1169.52ms. Allocated memory is still 163.6MB. Free memory was 92.0MB in the beginning and 109.4MB in the end (delta: -17.4MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1836]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 440f273968b34677cc4ba81db9f48373d3cac4b8a75ac1f970ae3fdbbff89c17 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 18:20:47,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 18:20:47,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2024-10-24 18:20:47,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 18:20:47,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 18:20:47,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 18:20:47,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 18:20:47,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 18:20:47,874 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 18:20:47,877 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 18:20:47,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 18:20:47,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 18:20:47,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 18:20:47,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 18:20:47,879 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 18:20:47,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 18:20:47,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 18:20:47,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 18:20:47,883 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 18:20:47,883 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 18:20:47,884 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 18:20:47,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 18:20:47,887 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 18:20:47,888 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 18:20:47,888 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 18:20:47,888 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 18:20:47,888 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 18:20:47,888 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 18:20:47,889 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 18:20:47,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 18:20:47,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 18:20:47,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 18:20:47,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:20:47,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 18:20:47,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 18:20:47,904 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 18:20:47,904 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 18:20:47,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 18:20:47,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 18:20:47,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 18:20:47,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 18:20:47,907 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 18:20:47,907 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 440f273968b34677cc4ba81db9f48373d3cac4b8a75ac1f970ae3fdbbff89c17 [2024-10-24 18:20:48,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 18:20:48,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 18:20:48,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 18:20:48,210 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 18:20:48,210 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 18:20:48,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2024-10-24 18:20:49,967 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 18:20:50,320 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 18:20:50,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2024-10-24 18:20:50,353 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61530fc65/0d443514bb764f0c9dbb6aed34f4690b/FLAG440f2429c [2024-10-24 18:20:50,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61530fc65/0d443514bb764f0c9dbb6aed34f4690b [2024-10-24 18:20:50,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 18:20:50,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 18:20:50,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 18:20:50,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 18:20:50,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 18:20:50,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:20:50" (1/1) ... [2024-10-24 18:20:50,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@688d6f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:20:50, skipping insertion in model container [2024-10-24 18:20:50,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:20:50" (1/1) ... [2024-10-24 18:20:50,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:20:51,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:20:51,276 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 18:20:51,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:20:51,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:20:51,427 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 18:20:51,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:20:51,670 INFO L204 MainTranslator]: Completed translation [2024-10-24 18:20:51,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:20:51 WrapperNode [2024-10-24 18:20:51,672 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 18:20:51,673 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 18:20:51,673 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 18:20:51,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 18:20:51,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:20:51" (1/1) ... [2024-10-24 18:20:51,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:20:51" (1/1) ... [2024-10-24 18:20:51,802 INFO L138 Inliner]: procedures = 121, calls = 369, calls flagged for inlining = 54, calls inlined = 37, statements flattened = 836 [2024-10-24 18:20:51,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 18:20:51,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 18:20:51,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 18:20:51,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 18:20:51,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:20:51" (1/1) ... [2024-10-24 18:20:51,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:20:51" (1/1) ... [2024-10-24 18:20:51,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:20:51" (1/1) ... [2024-10-24 18:20:51,922 INFO L175 MemorySlicer]: Split 88 memory accesses to 9 slices as follows [2, 3, 2, 26, 10, 10, 11, 20, 4]. 30 percent of accesses are in the largest equivalence class. The 33 initializations are split as follows [2, 0, 0, 0, 0, 0, 11, 20, 0]. The 16 writes are split as follows [0, 2, 0, 1, 9, 3, 0, 0, 1]. [2024-10-24 18:20:51,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:20:51" (1/1) ... [2024-10-24 18:20:51,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:20:51" (1/1) ... [2024-10-24 18:20:51,981 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:20:51" (1/1) ... [2024-10-24 18:20:51,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:20:51" (1/1) ... [2024-10-24 18:20:52,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:20:51" (1/1) ... [2024-10-24 18:20:52,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:20:51" (1/1) ... [2024-10-24 18:20:52,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 18:20:52,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 18:20:52,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 18:20:52,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 18:20:52,047 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:20:51" (1/1) ... [2024-10-24 18:20:52,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:20:52,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 18:20:52,124 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 18:20:52,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 18:20:52,190 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2024-10-24 18:20:52,191 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2024-10-24 18:20:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 18:20:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 18:20:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 18:20:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 18:20:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-24 18:20:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-24 18:20:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-24 18:20:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-24 18:20:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-24 18:20:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2024-10-24 18:20:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2024-10-24 18:20:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2024-10-24 18:20:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#3 [2024-10-24 18:20:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#4 [2024-10-24 18:20:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#5 [2024-10-24 18:20:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#6 [2024-10-24 18:20:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#7 [2024-10-24 18:20:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#8 [2024-10-24 18:20:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 18:20:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 18:20:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 18:20:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-24 18:20:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-24 18:20:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-24 18:20:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-24 18:20:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-10-24 18:20:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-10-24 18:20:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-24 18:20:52,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-24 18:20:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_time_to_tm [2024-10-24 18:20:52,195 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_time_to_tm [2024-10-24 18:20:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_proc [2024-10-24 18:20:52,195 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_proc [2024-10-24 18:20:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2024-10-24 18:20:52,196 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2024-10-24 18:20:52,196 INFO L130 BoogieDeclarations]: Found specification of procedure outer_sync [2024-10-24 18:20:52,196 INFO L138 BoogieDeclarations]: Found implementation of procedure outer_sync [2024-10-24 18:20:52,196 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_remove [2024-10-24 18:20:52,196 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_remove [2024-10-24 18:20:52,196 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_shutdown [2024-10-24 18:20:52,196 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_shutdown [2024-10-24 18:20:52,196 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-24 18:20:52,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-24 18:20:52,196 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_tm_to_time [2024-10-24 18:20:52,196 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_tm_to_time [2024-10-24 18:20:52,196 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2024-10-24 18:20:52,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2024-10-24 18:20:52,196 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-24 18:20:52,196 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-24 18:20:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_alarm [2024-10-24 18:20:52,197 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_alarm [2024-10-24 18:20:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-24 18:20:52,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-24 18:20:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_check [2024-10-24 18:20:52,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_check [2024-10-24 18:20:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_alarm_irq_enable [2024-10-24 18:20:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_alarm_irq_enable [2024-10-24 18:20:52,201 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_iounmap [2024-10-24 18:20:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_iounmap [2024-10-24 18:20:52,201 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 18:20:52,202 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 18:20:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 18:20:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 18:20:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_device_unregister [2024-10-24 18:20:52,202 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_device_unregister [2024-10-24 18:20:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 18:20:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2024-10-24 18:20:52,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2024-10-24 18:20:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 18:20:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 18:20:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 18:20:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 18:20:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-24 18:20:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-24 18:20:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-24 18:20:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-24 18:20:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-24 18:20:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2024-10-24 18:20:52,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2024-10-24 18:20:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure device_may_wakeup [2024-10-24 18:20:52,203 INFO L138 BoogieDeclarations]: Found implementation of procedure device_may_wakeup [2024-10-24 18:20:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2024-10-24 18:20:52,203 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2024-10-24 18:20:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2024-10-24 18:20:52,203 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2024-10-24 18:20:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2024-10-24 18:20:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2024-10-24 18:20:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2024-10-24 18:20:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#3 [2024-10-24 18:20:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#4 [2024-10-24 18:20:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#5 [2024-10-24 18:20:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#6 [2024-10-24 18:20:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#7 [2024-10-24 18:20:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#8 [2024-10-24 18:20:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 18:20:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 18:20:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 18:20:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 18:20:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-24 18:20:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-24 18:20:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-24 18:20:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-24 18:20:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-24 18:20:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 18:20:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 18:20:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 18:20:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-24 18:20:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-24 18:20:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-24 18:20:52,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-24 18:20:52,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-10-24 18:20:52,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-10-24 18:20:52,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 18:20:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2024-10-24 18:20:52,212 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2024-10-24 18:20:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 18:20:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 18:20:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-24 18:20:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-24 18:20:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-24 18:20:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-24 18:20:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-24 18:20:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-24 18:20:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-24 18:20:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2024-10-24 18:20:52,214 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2024-10-24 18:20:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 18:20:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 18:20:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 18:20:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 18:20:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-24 18:20:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-24 18:20:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-24 18:20:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-24 18:20:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-24 18:20:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-24 18:20:52,215 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-24 18:20:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_read_time [2024-10-24 18:20:52,215 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_read_time [2024-10-24 18:20:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_wait_while_busy [2024-10-24 18:20:52,216 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_wait_while_busy [2024-10-24 18:20:52,216 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2024-10-24 18:20:52,216 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2024-10-24 18:20:52,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-10-24 18:20:52,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-10-24 18:20:52,217 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_time [2024-10-24 18:20:52,217 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_time [2024-10-24 18:20:52,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 18:20:52,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 18:20:52,630 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 18:20:52,633 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 18:20:52,669 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-24 18:20:55,112 INFO L? ?]: Removed 565 outVars from TransFormulas that were not future-live. [2024-10-24 18:20:55,112 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 18:20:55,240 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 18:20:55,241 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 18:20:55,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:20:55 BoogieIcfgContainer [2024-10-24 18:20:55,241 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 18:20:55,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 18:20:55,243 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 18:20:55,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 18:20:55,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:20:50" (1/3) ... [2024-10-24 18:20:55,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f22369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:20:55, skipping insertion in model container [2024-10-24 18:20:55,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:20:51" (2/3) ... [2024-10-24 18:20:55,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f22369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:20:55, skipping insertion in model container [2024-10-24 18:20:55,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:20:55" (3/3) ... [2024-10-24 18:20:55,249 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2024-10-24 18:20:55,266 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 18:20:55,266 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 111 error locations. [2024-10-24 18:20:55,321 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 18:20:55,328 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b3f7c1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 18:20:55,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 111 error locations. [2024-10-24 18:20:55,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 494 states, 271 states have (on average 1.7490774907749078) internal successors, (474), 391 states have internal predecessors, (474), 80 states have call successors, (80), 32 states have call predecessors, (80), 31 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2024-10-24 18:20:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-24 18:20:55,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:20:55,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:20:55,343 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [tegra_rtc_procErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2024-10-24 18:20:55,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:20:55,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1869912866, now seen corresponding path program 1 times [2024-10-24 18:20:55,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:20:55,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916304042] [2024-10-24 18:20:55,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:20:55,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:20:55,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:20:55,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:20:55,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 18:20:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:20:55,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 18:20:55,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:20:55,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 18:20:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:20:55,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:20:55,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:20:55,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916304042] [2024-10-24 18:20:55,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916304042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:20:55,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:20:55,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:20:55,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520887077] [2024-10-24 18:20:55,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:20:55,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 18:20:55,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:20:55,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 18:20:55,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:20:55,745 INFO L87 Difference]: Start difference. First operand has 494 states, 271 states have (on average 1.7490774907749078) internal successors, (474), 391 states have internal predecessors, (474), 80 states have call successors, (80), 32 states have call predecessors, (80), 31 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:20:58,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:20:58,536 INFO L93 Difference]: Finished difference Result 788 states and 1085 transitions. [2024-10-24 18:20:58,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 18:20:58,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-10-24 18:20:58,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:20:58,556 INFO L225 Difference]: With dead ends: 788 [2024-10-24 18:20:58,556 INFO L226 Difference]: Without dead ends: 775 [2024-10-24 18:20:58,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 18:20:58,561 INFO L432 NwaCegarLoop]: 407 mSDtfsCounter, 409 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-24 18:20:58,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1266 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-24 18:20:58,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-10-24 18:20:58,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 687. [2024-10-24 18:20:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 425 states have (on average 1.7435294117647058) internal successors, (741), 539 states have internal predecessors, (741), 110 states have call successors, (110), 31 states have call predecessors, (110), 41 states have return successors, (166), 120 states have call predecessors, (166), 109 states have call successors, (166) [2024-10-24 18:20:58,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1017 transitions. [2024-10-24 18:20:58,650 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1017 transitions. Word has length 8 [2024-10-24 18:20:58,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:20:58,651 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1017 transitions. [2024-10-24 18:20:58,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:20:58,651 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1017 transitions. [2024-10-24 18:20:58,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 18:20:58,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:20:58,652 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:20:58,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 18:20:58,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:20:58,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [tegra_rtc_procErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2024-10-24 18:20:58,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:20:58,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2132723485, now seen corresponding path program 1 times [2024-10-24 18:20:58,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:20:58,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035914385] [2024-10-24 18:20:58,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:20:58,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:20:58,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:20:58,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:20:58,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 18:20:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:20:59,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 18:20:59,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:20:59,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 18:20:59,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:20:59,148 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:20:59,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:20:59,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035914385] [2024-10-24 18:20:59,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035914385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:20:59,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:20:59,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:20:59,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125423771] [2024-10-24 18:20:59,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:20:59,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 18:20:59,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:20:59,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 18:20:59,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:20:59,151 INFO L87 Difference]: Start difference. First operand 687 states and 1017 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:21:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:21:02,576 INFO L93 Difference]: Finished difference Result 1038 states and 1587 transitions. [2024-10-24 18:21:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:21:02,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-10-24 18:21:02,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:21:02,584 INFO L225 Difference]: With dead ends: 1038 [2024-10-24 18:21:02,585 INFO L226 Difference]: Without dead ends: 1038 [2024-10-24 18:21:02,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 18:21:02,586 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 400 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-24 18:21:02,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1234 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-24 18:21:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2024-10-24 18:21:02,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 969. [2024-10-24 18:21:02,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 654 states have (on average 1.761467889908257) internal successors, (1152), 771 states have internal predecessors, (1152), 162 states have call successors, (162), 31 states have call predecessors, (162), 42 states have return successors, (264), 172 states have call predecessors, (264), 161 states have call successors, (264) [2024-10-24 18:21:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1578 transitions. [2024-10-24 18:21:02,643 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1578 transitions. Word has length 9 [2024-10-24 18:21:02,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:21:02,643 INFO L471 AbstractCegarLoop]: Abstraction has 969 states and 1578 transitions. [2024-10-24 18:21:02,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:21:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1578 transitions. [2024-10-24 18:21:02,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 18:21:02,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:21:02,645 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:21:02,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 18:21:02,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:02,851 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [tegra_rtc_procErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2024-10-24 18:21:02,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:21:02,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1109959934, now seen corresponding path program 1 times [2024-10-24 18:21:02,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:21:02,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28191923] [2024-10-24 18:21:02,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:21:02,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:02,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:21:02,857 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:21:02,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 18:21:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:21:03,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:21:03,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:21:03,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:21:03,108 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:21:03,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:21:03,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28191923] [2024-10-24 18:21:03,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28191923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:21:03,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:21:03,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:21:03,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517730831] [2024-10-24 18:21:03,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:21:03,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:21:03,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:21:03,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:21:03,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:21:03,110 INFO L87 Difference]: Start difference. First operand 969 states and 1578 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:21:03,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:21:03,615 INFO L93 Difference]: Finished difference Result 971 states and 1580 transitions. [2024-10-24 18:21:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:21:03,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-24 18:21:03,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:21:03,621 INFO L225 Difference]: With dead ends: 971 [2024-10-24 18:21:03,621 INFO L226 Difference]: Without dead ends: 971 [2024-10-24 18:21:03,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:21:03,623 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 3 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 18:21:03,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1621 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 18:21:03,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2024-10-24 18:21:03,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 971. [2024-10-24 18:21:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 656 states have (on average 1.7591463414634145) internal successors, (1154), 773 states have internal predecessors, (1154), 162 states have call successors, (162), 31 states have call predecessors, (162), 42 states have return successors, (264), 172 states have call predecessors, (264), 161 states have call successors, (264) [2024-10-24 18:21:03,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1580 transitions. [2024-10-24 18:21:03,697 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1580 transitions. Word has length 18 [2024-10-24 18:21:03,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:21:03,698 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1580 transitions. [2024-10-24 18:21:03,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:21:03,698 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1580 transitions. [2024-10-24 18:21:03,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 18:21:03,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:21:03,702 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:21:03,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 18:21:03,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:03,906 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [tegra_rtc_procErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2024-10-24 18:21:03,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:21:03,908 INFO L85 PathProgramCache]: Analyzing trace with hash 630288707, now seen corresponding path program 1 times [2024-10-24 18:21:03,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:21:03,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038358565] [2024-10-24 18:21:03,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:21:03,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:03,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:21:03,911 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:21:03,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 18:21:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:21:04,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:21:04,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:21:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:21:04,179 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 18:21:04,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:21:04,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:21:04,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038358565] [2024-10-24 18:21:04,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038358565] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 18:21:04,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 18:21:04,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 18:21:04,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633356245] [2024-10-24 18:21:04,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 18:21:04,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 18:21:04,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:21:04,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 18:21:04,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 18:21:04,242 INFO L87 Difference]: Start difference. First operand 971 states and 1580 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:21:04,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:21:04,921 INFO L93 Difference]: Finished difference Result 977 states and 1586 transitions. [2024-10-24 18:21:04,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 18:21:04,922 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-10-24 18:21:04,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:21:04,927 INFO L225 Difference]: With dead ends: 977 [2024-10-24 18:21:04,928 INFO L226 Difference]: Without dead ends: 977 [2024-10-24 18:21:04,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-24 18:21:04,931 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 10 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2164 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 18:21:04,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2164 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 18:21:04,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-10-24 18:21:04,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2024-10-24 18:21:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 662 states have (on average 1.7522658610271904) internal successors, (1160), 779 states have internal predecessors, (1160), 162 states have call successors, (162), 31 states have call predecessors, (162), 42 states have return successors, (264), 172 states have call predecessors, (264), 161 states have call successors, (264) [2024-10-24 18:21:04,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1586 transitions. [2024-10-24 18:21:04,973 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1586 transitions. Word has length 19 [2024-10-24 18:21:04,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:21:04,973 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1586 transitions. [2024-10-24 18:21:04,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:21:04,973 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1586 transitions. [2024-10-24 18:21:04,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-24 18:21:04,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:21:04,976 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:21:04,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 18:21:05,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:05,181 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [tegra_rtc_procErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2024-10-24 18:21:05,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:21:05,181 INFO L85 PathProgramCache]: Analyzing trace with hash 161264314, now seen corresponding path program 1 times [2024-10-24 18:21:05,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:21:05,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927010473] [2024-10-24 18:21:05,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:21:05,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:05,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:21:05,185 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:21:05,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 18:21:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:21:05,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 18:21:05,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:21:05,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 18:21:05,612 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_zalloc_~p~1#1.base| (_ BitVec 64))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_zalloc_~p~1#1.base|)) (= |c_#valid| (store |c_old(#valid)| |ldv_zalloc_~p~1#1.base| (select |c_#valid| |ldv_zalloc_~p~1#1.base|))))) is different from true [2024-10-24 18:21:05,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2024-10-24 18:21:05,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2024-10-24 18:21:05,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2024-10-24 18:21:05,717 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-24 18:21:05,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-24 18:21:05,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 18:21:05,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:21:05,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:21:05,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927010473] [2024-10-24 18:21:05,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927010473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:21:05,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:21:05,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 18:21:05,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638910495] [2024-10-24 18:21:05,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:21:05,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 18:21:05,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:21:05,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 18:21:05,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-10-24 18:21:05,739 INFO L87 Difference]: Start difference. First operand 977 states and 1586 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 18:21:08,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:21:08,343 INFO L93 Difference]: Finished difference Result 1171 states and 1844 transitions. [2024-10-24 18:21:08,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 18:21:08,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2024-10-24 18:21:08,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:21:08,350 INFO L225 Difference]: With dead ends: 1171 [2024-10-24 18:21:08,350 INFO L226 Difference]: Without dead ends: 1171 [2024-10-24 18:21:08,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2024-10-24 18:21:08,351 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 400 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 2297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1087 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-24 18:21:08,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1210 Invalid, 2297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1062 Invalid, 0 Unknown, 1087 Unchecked, 2.5s Time] [2024-10-24 18:21:08,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2024-10-24 18:21:08,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 976. [2024-10-24 18:21:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 662 states have (on average 1.7507552870090635) internal successors, (1159), 778 states have internal predecessors, (1159), 162 states have call successors, (162), 31 states have call predecessors, (162), 42 states have return successors, (264), 172 states have call predecessors, (264), 161 states have call successors, (264) [2024-10-24 18:21:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1585 transitions. [2024-10-24 18:21:08,385 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1585 transitions. Word has length 22 [2024-10-24 18:21:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:21:08,386 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1585 transitions. [2024-10-24 18:21:08,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 18:21:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1585 transitions. [2024-10-24 18:21:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 18:21:08,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:21:08,387 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:21:08,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 18:21:08,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:08,589 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [tegra_rtc_procErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2024-10-24 18:21:08,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:21:08,590 INFO L85 PathProgramCache]: Analyzing trace with hash 704226951, now seen corresponding path program 1 times [2024-10-24 18:21:08,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:21:08,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507521197] [2024-10-24 18:21:08,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:21:08,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:08,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:21:08,594 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:21:08,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 18:21:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:21:08,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 18:21:08,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:21:08,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 18:21:09,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 18:21:09,070 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_zalloc_~p~1#1.base| (_ BitVec 64))) (and (= |c_#length| (store |c_old(#length)| |ldv_zalloc_~p~1#1.base| (select |c_#length| |ldv_zalloc_~p~1#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_zalloc_~p~1#1.base|)))) is different from true [2024-10-24 18:21:09,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 18:21:09,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 18:21:09,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 18:21:09,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 18:21:09,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 18:21:09,210 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 18:21:09,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 18:21:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 18:21:09,262 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:21:09,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:21:09,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507521197] [2024-10-24 18:21:09,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507521197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:21:09,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:21:09,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 18:21:09,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121266575] [2024-10-24 18:21:09,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:21:09,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 18:21:09,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:21:09,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 18:21:09,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-10-24 18:21:09,264 INFO L87 Difference]: Start difference. First operand 976 states and 1585 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 18:21:13,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:21:13,631 INFO L93 Difference]: Finished difference Result 1475 states and 2389 transitions. [2024-10-24 18:21:13,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 18:21:13,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 23 [2024-10-24 18:21:13,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:21:13,640 INFO L225 Difference]: With dead ends: 1475 [2024-10-24 18:21:13,640 INFO L226 Difference]: Without dead ends: 1475 [2024-10-24 18:21:13,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=37, Unknown=1, NotChecked=12, Total=72 [2024-10-24 18:21:13,641 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 590 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 3159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1362 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-24 18:21:13,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 1363 Invalid, 3159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1607 Invalid, 0 Unknown, 1362 Unchecked, 4.2s Time] [2024-10-24 18:21:13,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2024-10-24 18:21:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1111. [2024-10-24 18:21:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 773 states have (on average 1.7542043984476068) internal successors, (1356), 889 states have internal predecessors, (1356), 187 states have call successors, (187), 31 states have call predecessors, (187), 42 states have return successors, (310), 197 states have call predecessors, (310), 186 states have call successors, (310) [2024-10-24 18:21:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1853 transitions. [2024-10-24 18:21:13,681 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1853 transitions. Word has length 23 [2024-10-24 18:21:13,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:21:13,681 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1853 transitions. [2024-10-24 18:21:13,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 18:21:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1853 transitions. [2024-10-24 18:21:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-24 18:21:13,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:21:13,683 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:21:13,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 18:21:13,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:13,887 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [tegra_rtc_procErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2024-10-24 18:21:13,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:21:13,888 INFO L85 PathProgramCache]: Analyzing trace with hash -422878398, now seen corresponding path program 2 times [2024-10-24 18:21:13,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:21:13,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532299346] [2024-10-24 18:21:13,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 18:21:13,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:13,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:21:13,894 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:21:13,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 18:21:14,209 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 18:21:14,210 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 18:21:14,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 18:21:14,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:21:14,234 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 18:21:14,234 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:21:14,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:21:14,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532299346] [2024-10-24 18:21:14,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532299346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:21:14,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:21:14,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:21:14,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555711428] [2024-10-24 18:21:14,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:21:14,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:21:14,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:21:14,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:21:14,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:21:14,237 INFO L87 Difference]: Start difference. First operand 1111 states and 1853 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:21:14,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:21:14,747 INFO L93 Difference]: Finished difference Result 2176 states and 3625 transitions. [2024-10-24 18:21:14,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:21:14,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-24 18:21:14,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:21:14,759 INFO L225 Difference]: With dead ends: 2176 [2024-10-24 18:21:14,759 INFO L226 Difference]: Without dead ends: 2176 [2024-10-24 18:21:14,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:21:14,761 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 573 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 18:21:14,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 1078 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 18:21:14,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2024-10-24 18:21:14,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2064. [2024-10-24 18:21:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2064 states, 1509 states have (on average 1.757455268389662) internal successors, (2652), 1633 states have internal predecessors, (2652), 364 states have call successors, (364), 60 states have call predecessors, (364), 82 states have return successors, (605), 384 states have call predecessors, (605), 363 states have call successors, (605) [2024-10-24 18:21:14,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 3621 transitions. [2024-10-24 18:21:14,837 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 3621 transitions. Word has length 22 [2024-10-24 18:21:14,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:21:14,838 INFO L471 AbstractCegarLoop]: Abstraction has 2064 states and 3621 transitions. [2024-10-24 18:21:14,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:21:14,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 3621 transitions. [2024-10-24 18:21:14,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 18:21:14,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:21:14,841 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:21:14,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-24 18:21:15,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:15,042 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [tegra_rtc_procErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2024-10-24 18:21:15,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:21:15,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1652847304, now seen corresponding path program 1 times [2024-10-24 18:21:15,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:21:15,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987779865] [2024-10-24 18:21:15,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:21:15,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:15,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:21:15,049 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:21:15,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 18:21:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:21:15,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 18:21:15,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:21:15,807 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#ldvarg2~0#1.base_22| (_ BitVec 64))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#ldvarg2~0#1.base_22| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#ldvarg2~0#1.base_22|)))) is different from true [2024-10-24 18:21:15,808 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 18:21:15,808 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:21:15,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:21:15,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987779865] [2024-10-24 18:21:15,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987779865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:21:15,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:21:15,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:21:15,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068867549] [2024-10-24 18:21:15,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:21:15,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 18:21:15,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:21:15,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 18:21:15,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-10-24 18:21:15,810 INFO L87 Difference]: Start difference. First operand 2064 states and 3621 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:21:17,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:21:17,721 INFO L93 Difference]: Finished difference Result 2407 states and 4167 transitions. [2024-10-24 18:21:17,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:21:17,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-10-24 18:21:17,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:21:17,731 INFO L225 Difference]: With dead ends: 2407 [2024-10-24 18:21:17,731 INFO L226 Difference]: Without dead ends: 2405 [2024-10-24 18:21:17,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-10-24 18:21:17,732 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 382 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1059 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 18:21:17,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1017 Invalid, 1979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 781 Invalid, 0 Unknown, 1059 Unchecked, 1.9s Time] [2024-10-24 18:21:17,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2024-10-24 18:21:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2333. [2024-10-24 18:21:17,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2333 states, 1729 states have (on average 1.7576633892423366) internal successors, (3039), 1855 states have internal predecessors, (3039), 413 states have call successors, (413), 60 states have call predecessors, (413), 82 states have return successors, (695), 433 states have call predecessors, (695), 412 states have call successors, (695) [2024-10-24 18:21:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 4147 transitions. [2024-10-24 18:21:17,796 INFO L78 Accepts]: Start accepts. Automaton has 2333 states and 4147 transitions. Word has length 25 [2024-10-24 18:21:17,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:21:17,797 INFO L471 AbstractCegarLoop]: Abstraction has 2333 states and 4147 transitions. [2024-10-24 18:21:17,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:21:17,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 4147 transitions. [2024-10-24 18:21:17,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-24 18:21:17,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:21:17,799 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:21:17,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 18:21:18,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:18,002 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting tegra_rtc_procErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [tegra_rtc_procErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2024-10-24 18:21:18,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:21:18,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1892113325, now seen corresponding path program 1 times [2024-10-24 18:21:18,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:21:18,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883615798] [2024-10-24 18:21:18,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:21:18,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:18,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:21:18,006 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:21:18,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 18:21:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:21:18,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 18:21:18,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:21:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 18:21:18,205 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:21:18,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:21:18,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883615798] [2024-10-24 18:21:18,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883615798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:21:18,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:21:18,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:21:18,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419808513] [2024-10-24 18:21:18,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:21:18,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:21:18,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:21:18,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:21:18,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:21:18,207 INFO L87 Difference]: Start difference. First operand 2333 states and 4147 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:21:18,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:21:18,341 INFO L93 Difference]: Finished difference Result 1485 states and 2477 transitions. [2024-10-24 18:21:18,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:21:18,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-10-24 18:21:18,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:21:18,347 INFO L225 Difference]: With dead ends: 1485 [2024-10-24 18:21:18,347 INFO L226 Difference]: Without dead ends: 1485 [2024-10-24 18:21:18,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:21:18,347 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 367 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 18:21:18,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 326 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 18:21:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2024-10-24 18:21:18,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1485. [2024-10-24 18:21:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1485 states, 1091 states have (on average 1.5719523373052247) internal successors, (1715), 1145 states have internal predecessors, (1715), 277 states have call successors, (277), 48 states have call predecessors, (277), 68 states have return successors, (485), 295 states have call predecessors, (485), 276 states have call successors, (485) [2024-10-24 18:21:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 2477 transitions. [2024-10-24 18:21:18,381 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 2477 transitions. Word has length 29 [2024-10-24 18:21:18,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:21:18,382 INFO L471 AbstractCegarLoop]: Abstraction has 1485 states and 2477 transitions. [2024-10-24 18:21:18,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:21:18,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 2477 transitions. [2024-10-24 18:21:18,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-24 18:21:18,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:21:18,383 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:21:18,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 18:21:18,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:18,584 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [tegra_rtc_procErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2024-10-24 18:21:18,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:21:18,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1002495087, now seen corresponding path program 1 times [2024-10-24 18:21:18,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:21:18,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813092007] [2024-10-24 18:21:18,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:21:18,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:18,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:21:18,587 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:21:18,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 18:21:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:21:18,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:21:18,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:21:18,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 18:21:18,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:21:18,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:21:18,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813092007] [2024-10-24 18:21:18,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1813092007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:21:18,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:21:18,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:21:18,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647406818] [2024-10-24 18:21:18,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:21:18,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 18:21:18,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:21:18,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 18:21:18,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:21:18,874 INFO L87 Difference]: Start difference. First operand 1485 states and 2477 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 18:21:19,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:21:19,174 INFO L93 Difference]: Finished difference Result 1497 states and 2471 transitions. [2024-10-24 18:21:19,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 18:21:19,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-10-24 18:21:19,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:21:19,180 INFO L225 Difference]: With dead ends: 1497 [2024-10-24 18:21:19,180 INFO L226 Difference]: Without dead ends: 1497 [2024-10-24 18:21:19,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 18:21:19,181 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 360 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 18:21:19,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 960 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 18:21:19,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2024-10-24 18:21:19,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1495. [2024-10-24 18:21:19,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 1099 states have (on average 1.5641492265696086) internal successors, (1719), 1153 states have internal predecessors, (1719), 277 states have call successors, (277), 50 states have call predecessors, (277), 70 states have return successors, (473), 295 states have call predecessors, (473), 276 states have call successors, (473) [2024-10-24 18:21:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 2469 transitions. [2024-10-24 18:21:19,217 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 2469 transitions. Word has length 36 [2024-10-24 18:21:19,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:21:19,217 INFO L471 AbstractCegarLoop]: Abstraction has 1495 states and 2469 transitions. [2024-10-24 18:21:19,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 18:21:19,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 2469 transitions. [2024-10-24 18:21:19,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-24 18:21:19,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:21:19,219 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:21:19,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-24 18:21:19,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:19,424 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [tegra_rtc_procErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2024-10-24 18:21:19,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:21:19,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1917393006, now seen corresponding path program 1 times [2024-10-24 18:21:19,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:21:19,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762885916] [2024-10-24 18:21:19,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:21:19,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:19,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:21:19,429 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:21:19,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 18:21:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:21:19,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:21:19,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:21:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 18:21:19,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:21:19,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:21:19,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762885916] [2024-10-24 18:21:19,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762885916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:21:19,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:21:19,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:21:19,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515011449] [2024-10-24 18:21:19,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:21:19,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 18:21:19,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:21:19,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 18:21:19,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:21:19,688 INFO L87 Difference]: Start difference. First operand 1495 states and 2469 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 18:21:19,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:21:19,972 INFO L93 Difference]: Finished difference Result 1507 states and 2463 transitions. [2024-10-24 18:21:19,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 18:21:19,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-10-24 18:21:19,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:21:19,977 INFO L225 Difference]: With dead ends: 1507 [2024-10-24 18:21:19,978 INFO L226 Difference]: Without dead ends: 1507 [2024-10-24 18:21:19,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 18:21:19,978 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 358 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 18:21:19,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 957 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 18:21:19,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2024-10-24 18:21:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1505. [2024-10-24 18:21:20,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1107 states have (on average 1.5564588979223126) internal successors, (1723), 1161 states have internal predecessors, (1723), 277 states have call successors, (277), 52 states have call predecessors, (277), 72 states have return successors, (461), 295 states have call predecessors, (461), 276 states have call successors, (461) [2024-10-24 18:21:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2461 transitions. [2024-10-24 18:21:20,012 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2461 transitions. Word has length 37 [2024-10-24 18:21:20,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:21:20,012 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2461 transitions. [2024-10-24 18:21:20,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 18:21:20,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2461 transitions. [2024-10-24 18:21:20,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 18:21:20,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:21:20,013 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:21:20,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-24 18:21:20,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:20,214 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [tegra_rtc_procErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2024-10-24 18:21:20,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:21:20,215 INFO L85 PathProgramCache]: Analyzing trace with hash 2113307087, now seen corresponding path program 1 times [2024-10-24 18:21:20,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:21:20,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244084856] [2024-10-24 18:21:20,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:21:20,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:20,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:21:20,218 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:21:20,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 18:21:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:21:20,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:21:20,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:21:20,464 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 18:21:20,465 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:21:20,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:21:20,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244084856] [2024-10-24 18:21:20,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244084856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:21:20,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:21:20,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:21:20,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089648671] [2024-10-24 18:21:20,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:21:20,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 18:21:20,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:21:20,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 18:21:20,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:21:20,467 INFO L87 Difference]: Start difference. First operand 1505 states and 2461 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 18:21:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:21:20,858 INFO L93 Difference]: Finished difference Result 1517 states and 2455 transitions. [2024-10-24 18:21:20,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 18:21:20,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-10-24 18:21:20,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:21:20,865 INFO L225 Difference]: With dead ends: 1517 [2024-10-24 18:21:20,865 INFO L226 Difference]: Without dead ends: 1517 [2024-10-24 18:21:20,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 18:21:20,867 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 359 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 18:21:20,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 954 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 18:21:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-10-24 18:21:20,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1515. [2024-10-24 18:21:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1115 states have (on average 1.5488789237668161) internal successors, (1727), 1169 states have internal predecessors, (1727), 277 states have call successors, (277), 54 states have call predecessors, (277), 74 states have return successors, (449), 295 states have call predecessors, (449), 276 states have call successors, (449) [2024-10-24 18:21:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2453 transitions. [2024-10-24 18:21:20,960 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2453 transitions. Word has length 35 [2024-10-24 18:21:20,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:21:20,961 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 2453 transitions. [2024-10-24 18:21:20,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 18:21:20,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2453 transitions. [2024-10-24 18:21:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 18:21:20,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:21:20,962 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:21:20,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-24 18:21:21,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:21,164 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [tegra_rtc_procErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2024-10-24 18:21:21,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:21:21,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1364646476, now seen corresponding path program 1 times [2024-10-24 18:21:21,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:21:21,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978250007] [2024-10-24 18:21:21,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:21:21,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:21,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:21:21,168 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:21:21,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-24 18:21:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:21:21,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:21:21,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:21:21,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 18:21:21,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:21:21,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:21:21,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978250007] [2024-10-24 18:21:21,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978250007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:21:21,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:21:21,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:21:21,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239233151] [2024-10-24 18:21:21,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:21:21,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 18:21:21,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:21:21,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 18:21:21,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:21:21,496 INFO L87 Difference]: Start difference. First operand 1515 states and 2453 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 18:21:21,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:21:21,984 INFO L93 Difference]: Finished difference Result 2950 states and 4824 transitions. [2024-10-24 18:21:21,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 18:21:21,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-10-24 18:21:21,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:21:21,998 INFO L225 Difference]: With dead ends: 2950 [2024-10-24 18:21:21,999 INFO L226 Difference]: Without dead ends: 2950 [2024-10-24 18:21:21,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 18:21:21,999 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 330 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 18:21:22,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1276 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 18:21:22,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2024-10-24 18:21:22,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2785. [2024-10-24 18:21:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2785 states, 2094 states have (on average 1.5616045845272206) internal successors, (3270), 2163 states have internal predecessors, (3270), 502 states have call successors, (502), 101 states have call predecessors, (502), 140 states have return successors, (900), 524 states have call predecessors, (900), 501 states have call successors, (900) [2024-10-24 18:21:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 4672 transitions. [2024-10-24 18:21:22,094 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 4672 transitions. Word has length 34 [2024-10-24 18:21:22,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:21:22,094 INFO L471 AbstractCegarLoop]: Abstraction has 2785 states and 4672 transitions. [2024-10-24 18:21:22,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 18:21:22,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 4672 transitions. [2024-10-24 18:21:22,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-24 18:21:22,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:21:22,096 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:21:22,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-24 18:21:22,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:22,297 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [tegra_rtc_procErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2024-10-24 18:21:22,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:21:22,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1257322941, now seen corresponding path program 1 times [2024-10-24 18:21:22,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:21:22,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807115945] [2024-10-24 18:21:22,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:21:22,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:22,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:21:22,301 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:21:22,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-24 18:21:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:21:22,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 18:21:22,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:21:22,587 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 18:21:22,587 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:21:22,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:21:22,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807115945] [2024-10-24 18:21:22,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807115945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:21:22,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:21:22,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:21:22,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633844653] [2024-10-24 18:21:22,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:21:22,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:21:22,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:21:22,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:21:22,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:21:22,589 INFO L87 Difference]: Start difference. First operand 2785 states and 4672 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 18:21:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:21:22,740 INFO L93 Difference]: Finished difference Result 2788 states and 4664 transitions. [2024-10-24 18:21:22,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:21:22,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2024-10-24 18:21:22,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:21:22,752 INFO L225 Difference]: With dead ends: 2788 [2024-10-24 18:21:22,752 INFO L226 Difference]: Without dead ends: 2788 [2024-10-24 18:21:22,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:21:22,753 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 348 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 18:21:22,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 326 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 18:21:22,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2024-10-24 18:21:22,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2785. [2024-10-24 18:21:22,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2785 states, 2094 states have (on average 1.556829035339064) internal successors, (3260), 2163 states have internal predecessors, (3260), 502 states have call successors, (502), 101 states have call predecessors, (502), 140 states have return successors, (900), 524 states have call predecessors, (900), 501 states have call successors, (900) [2024-10-24 18:21:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 4662 transitions. [2024-10-24 18:21:22,861 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 4662 transitions. Word has length 45 [2024-10-24 18:21:22,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:21:22,862 INFO L471 AbstractCegarLoop]: Abstraction has 2785 states and 4662 transitions. [2024-10-24 18:21:22,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 18:21:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 4662 transitions. [2024-10-24 18:21:22,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 18:21:22,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:21:22,864 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:21:22,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-24 18:21:23,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:23,068 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting device_may_wakeupErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [tegra_rtc_procErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2024-10-24 18:21:23,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:21:23,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1843050792, now seen corresponding path program 1 times [2024-10-24 18:21:23,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:21:23,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670654820] [2024-10-24 18:21:23,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:21:23,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:23,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:21:23,071 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:21:23,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-24 18:21:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:21:23,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 18:21:23,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:21:23,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 18:21:23,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:21:23,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:21:23,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670654820] [2024-10-24 18:21:23,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670654820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:21:23,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:21:23,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:21:23,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661482198] [2024-10-24 18:21:23,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:21:23,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:21:23,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:21:23,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:21:23,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:21:23,354 INFO L87 Difference]: Start difference. First operand 2785 states and 4662 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 18:21:23,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:21:23,601 INFO L93 Difference]: Finished difference Result 3741 states and 6074 transitions. [2024-10-24 18:21:23,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:21:23,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-10-24 18:21:23,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:21:23,636 INFO L225 Difference]: With dead ends: 3741 [2024-10-24 18:21:23,636 INFO L226 Difference]: Without dead ends: 3741 [2024-10-24 18:21:23,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:21:23,637 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 153 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 18:21:23,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 642 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 18:21:23,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2024-10-24 18:21:23,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3723. [2024-10-24 18:21:23,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3723 states, 2901 states have (on average 1.5367114788004137) internal successors, (4458), 2989 states have internal predecessors, (4458), 595 states have call successors, (595), 130 states have call predecessors, (595), 178 states have return successors, (1015), 611 states have call predecessors, (1015), 594 states have call successors, (1015) [2024-10-24 18:21:23,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3723 states to 3723 states and 6068 transitions. [2024-10-24 18:21:23,788 INFO L78 Accepts]: Start accepts. Automaton has 3723 states and 6068 transitions. Word has length 42 [2024-10-24 18:21:23,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:21:23,789 INFO L471 AbstractCegarLoop]: Abstraction has 3723 states and 6068 transitions. [2024-10-24 18:21:23,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 18:21:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 6068 transitions. [2024-10-24 18:21:23,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 18:21:23,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:21:23,794 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:21:23,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-24 18:21:23,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:23,995 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [tegra_rtc_procErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2024-10-24 18:21:23,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:21:23,999 INFO L85 PathProgramCache]: Analyzing trace with hash 384578268, now seen corresponding path program 1 times [2024-10-24 18:21:23,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:21:23,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374307424] [2024-10-24 18:21:23,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:21:23,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:23,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:21:24,005 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:21:24,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-24 18:21:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 18:21:24,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 18:21:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 18:21:25,417 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 18:21:25,418 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 18:21:25,419 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (110 of 111 remaining) [2024-10-24 18:21:25,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_procErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 111 remaining) [2024-10-24 18:21:25,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_procErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 111 remaining) [2024-10-24 18:21:25,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_procErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 111 remaining) [2024-10-24 18:21:25,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_procErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 111 remaining) [2024-10-24 18:21:25,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_procErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 111 remaining) [2024-10-24 18:21:25,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_procErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 111 remaining) [2024-10-24 18:21:25,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_procErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 111 remaining) [2024-10-24 18:21:25,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_procErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 111 remaining) [2024-10-24 18:21:25,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location outer_syncErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 111 remaining) [2024-10-24 18:21:25,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location outer_syncErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 111 remaining) [2024-10-24 18:21:25,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location outer_syncErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 111 remaining) [2024-10-24 18:21:25,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location outer_syncErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 111 remaining) [2024-10-24 18:21:25,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_removeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 111 remaining) [2024-10-24 18:21:25,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_removeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 111 remaining) [2024-10-24 18:21:25,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_removeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 111 remaining) [2024-10-24 18:21:25,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_removeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 111 remaining) [2024-10-24 18:21:25,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_removeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 111 remaining) [2024-10-24 18:21:25,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_removeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 111 remaining) [2024-10-24 18:21:25,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_removeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 111 remaining) [2024-10-24 18:21:25,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_removeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 111 remaining) [2024-10-24 18:21:25,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location kfreeErr0ASSERT_VIOLATIONMEMORY_FREE (89 of 111 remaining) [2024-10-24 18:21:25,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location kfreeErr1ASSERT_VIOLATIONMEMORY_FREE (88 of 111 remaining) [2024-10-24 18:21:25,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location kfreeErr2ASSERT_VIOLATIONMEMORY_FREE (87 of 111 remaining) [2024-10-24 18:21:25,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 111 remaining) [2024-10-24 18:21:25,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 111 remaining) [2024-10-24 18:21:25,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 111 remaining) [2024-10-24 18:21:25,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 111 remaining) [2024-10-24 18:21:25,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 111 remaining) [2024-10-24 18:21:25,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 111 remaining) [2024-10-24 18:21:25,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 111 remaining) [2024-10-24 18:21:25,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 111 remaining) [2024-10-24 18:21:25,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 111 remaining) [2024-10-24 18:21:25,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 111 remaining) [2024-10-24 18:21:25,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 111 remaining) [2024-10-24 18:21:25,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 111 remaining) [2024-10-24 18:21:25,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (74 of 111 remaining) [2024-10-24 18:21:25,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_alarm_irq_enableErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 111 remaining) [2024-10-24 18:21:25,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_alarm_irq_enableErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 111 remaining) [2024-10-24 18:21:25,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_alarm_irq_enableErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 111 remaining) [2024-10-24 18:21:25,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_alarm_irq_enableErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 111 remaining) [2024-10-24 18:21:25,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_alarm_irq_enableErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 111 remaining) [2024-10-24 18:21:25,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_alarm_irq_enableErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 111 remaining) [2024-10-24 18:21:25,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_alarm_irq_enableErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 111 remaining) [2024-10-24 18:21:25,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_alarm_irq_enableErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 111 remaining) [2024-10-24 18:21:25,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 111 remaining) [2024-10-24 18:21:25,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 111 remaining) [2024-10-24 18:21:25,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 111 remaining) [2024-10-24 18:21:25,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_irq_1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 111 remaining) [2024-10-24 18:21:25,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_irq_1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 111 remaining) [2024-10-24 18:21:25,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_irq_1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 111 remaining) [2024-10-24 18:21:25,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location device_may_wakeupErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 111 remaining) [2024-10-24 18:21:25,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location device_may_wakeupErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 111 remaining) [2024-10-24 18:21:25,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location device_may_wakeupErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 111 remaining) [2024-10-24 18:21:25,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location device_may_wakeupErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 111 remaining) [2024-10-24 18:21:25,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_read_timeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 111 remaining) [2024-10-24 18:21:25,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_read_timeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 111 remaining) [2024-10-24 18:21:25,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_read_timeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 111 remaining) [2024-10-24 18:21:25,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_read_timeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 111 remaining) [2024-10-24 18:21:25,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_read_timeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 111 remaining) [2024-10-24 18:21:25,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_read_timeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 111 remaining) [2024-10-24 18:21:25,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_read_timeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 111 remaining) [2024-10-24 18:21:25,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_read_timeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 111 remaining) [2024-10-24 18:21:25,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_wait_while_busyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 111 remaining) [2024-10-24 18:21:25,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_wait_while_busyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 111 remaining) [2024-10-24 18:21:25,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_wait_while_busyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 111 remaining) [2024-10-24 18:21:25,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_wait_while_busyErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 111 remaining) [2024-10-24 18:21:25,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location resource_sizeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 111 remaining) [2024-10-24 18:21:25,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location resource_sizeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 111 remaining) [2024-10-24 18:21:25,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location resource_sizeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 111 remaining) [2024-10-24 18:21:25,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location resource_sizeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 111 remaining) [2024-10-24 18:21:25,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_timeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 111 remaining) [2024-10-24 18:21:25,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_timeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 111 remaining) [2024-10-24 18:21:25,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_timeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 111 remaining) [2024-10-24 18:21:25,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_timeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 111 remaining) [2024-10-24 18:21:25,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_timeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 111 remaining) [2024-10-24 18:21:25,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_timeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 111 remaining) [2024-10-24 18:21:25,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (33 of 111 remaining) [2024-10-24 18:21:25,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (32 of 111 remaining) [2024-10-24 18:21:25,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 111 remaining) [2024-10-24 18:21:25,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 111 remaining) [2024-10-24 18:21:25,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 111 remaining) [2024-10-24 18:21:25,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 111 remaining) [2024-10-24 18:21:25,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 111 remaining) [2024-10-24 18:21:25,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 111 remaining) [2024-10-24 18:21:25,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 111 remaining) [2024-10-24 18:21:25,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 111 remaining) [2024-10-24 18:21:25,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 111 remaining) [2024-10-24 18:21:25,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 111 remaining) [2024-10-24 18:21:25,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 111 remaining) [2024-10-24 18:21:25,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 111 remaining) [2024-10-24 18:21:25,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 111 remaining) [2024-10-24 18:21:25,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 111 remaining) [2024-10-24 18:21:25,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 111 remaining) [2024-10-24 18:21:25,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 111 remaining) [2024-10-24 18:21:25,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 111 remaining) [2024-10-24 18:21:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 111 remaining) [2024-10-24 18:21:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 111 remaining) [2024-10-24 18:21:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 111 remaining) [2024-10-24 18:21:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 111 remaining) [2024-10-24 18:21:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 111 remaining) [2024-10-24 18:21:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 111 remaining) [2024-10-24 18:21:25,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 111 remaining) [2024-10-24 18:21:25,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 111 remaining) [2024-10-24 18:21:25,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 111 remaining) [2024-10-24 18:21:25,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 111 remaining) [2024-10-24 18:21:25,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 111 remaining) [2024-10-24 18:21:25,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 111 remaining) [2024-10-24 18:21:25,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 111 remaining) [2024-10-24 18:21:25,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 111 remaining) [2024-10-24 18:21:25,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 111 remaining) [2024-10-24 18:21:25,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-24 18:21:25,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:21:25,646 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:21:25,783 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 18:21:25,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:21:25 BoogieIcfgContainer [2024-10-24 18:21:25,790 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 18:21:25,791 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 18:21:25,791 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 18:21:25,791 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 18:21:25,791 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:20:55" (3/4) ... [2024-10-24 18:21:25,794 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 18:21:25,799 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 18:21:25,799 INFO L158 Benchmark]: Toolchain (without parser) took 35425.11ms. Allocated memory was 69.2MB in the beginning and 278.9MB in the end (delta: 209.7MB). Free memory was 36.6MB in the beginning and 70.0MB in the end (delta: -33.4MB). Peak memory consumption was 177.1MB. Max. memory is 16.1GB. [2024-10-24 18:21:25,800 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 52.4MB. Free memory is still 27.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 18:21:25,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1295.93ms. Allocated memory was 69.2MB in the beginning and 96.5MB in the end (delta: 27.3MB). Free memory was 36.4MB in the beginning and 59.1MB in the end (delta: -22.7MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2024-10-24 18:21:25,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 133.72ms. Allocated memory is still 96.5MB. Free memory was 59.1MB in the beginning and 53.0MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 18:21:25,800 INFO L158 Benchmark]: Boogie Preprocessor took 238.03ms. Allocated memory is still 96.5MB. Free memory was 53.0MB in the beginning and 35.1MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 18:21:25,800 INFO L158 Benchmark]: RCFGBuilder took 3195.48ms. Allocated memory was 96.5MB in the beginning and 176.2MB in the end (delta: 79.7MB). Free memory was 35.1MB in the beginning and 106.2MB in the end (delta: -71.1MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2024-10-24 18:21:25,800 INFO L158 Benchmark]: TraceAbstraction took 30547.17ms. Allocated memory was 176.2MB in the beginning and 278.9MB in the end (delta: 102.8MB). Free memory was 106.2MB in the beginning and 70.0MB in the end (delta: 36.2MB). Peak memory consumption was 140.0MB. Max. memory is 16.1GB. [2024-10-24 18:21:25,800 INFO L158 Benchmark]: Witness Printer took 8.45ms. Allocated memory is still 278.9MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 18:21:25,803 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 52.4MB. Free memory is still 27.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1295.93ms. Allocated memory was 69.2MB in the beginning and 96.5MB in the end (delta: 27.3MB). Free memory was 36.4MB in the beginning and 59.1MB in the end (delta: -22.7MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 133.72ms. Allocated memory is still 96.5MB. Free memory was 59.1MB in the beginning and 53.0MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 238.03ms. Allocated memory is still 96.5MB. Free memory was 53.0MB in the beginning and 35.1MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * RCFGBuilder took 3195.48ms. Allocated memory was 96.5MB in the beginning and 176.2MB in the end (delta: 79.7MB). Free memory was 35.1MB in the beginning and 106.2MB in the end (delta: -71.1MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * TraceAbstraction took 30547.17ms. Allocated memory was 176.2MB in the beginning and 278.9MB in the end (delta: 102.8MB). Free memory was 106.2MB in the beginning and 70.0MB in the end (delta: 36.2MB). Peak memory consumption was 140.0MB. Max. memory is 16.1GB. * Witness Printer took 8.45ms. Allocated memory is still 278.9MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 2396]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of large string literal at line 2227, overapproximation of memtrack at line 2396. Possible FailurePath: [L1695] int ldv_irq_1_2 = 0; [L1696] int LDV_IN_INTERRUPT = 1; [L1697] int ldv_irq_1_3 = 0; [L1698] struct platform_device *tegra_rtc_driver_group0 ; [L1699] void *ldv_irq_data_1_1 ; [L1700] int ldv_irq_1_1 = 0; [L1701] int ldv_irq_1_0 = 0; [L1702] int ldv_irq_line_1_3 ; [L1703] void *ldv_irq_data_1_0 ; [L1704] int ldv_state_variable_0 ; [L1705] struct device *tegra_rtc_ops_group1 ; [L1706] int ldv_state_variable_3 ; [L1707] int ldv_irq_line_1_0 ; [L1708] int ldv_state_variable_2 ; [L1709] void *ldv_irq_data_1_3 ; [L1710] int ref_cnt ; [L1711] int ldv_irq_line_1_1 ; [L1712] struct rtc_time *tegra_rtc_ops_group0 ; [L1713] void *ldv_irq_data_1_2 ; [L1714] int ldv_state_variable_1 ; [L1715] int ldv_irq_line_1_2 ; [L1716] struct rtc_wkalrm *tegra_rtc_ops_group2 ; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2243] int ldv_retval_2 ; [L2244] int ldv_retval_0 ; [L2246] int ldv_retval_1 ; [L2769] int ldv_init = 0; [L2398] struct seq_file *ldvarg1 ; [L2399] void *tmp ; [L2400] unsigned int ldvarg0 ; [L2401] unsigned int tmp___0 ; [L2402] pm_message_t ldvarg2 ; [L2403] int tmp___1 ; [L2404] int tmp___2 ; [L2405] int tmp___3 ; [L2406] int tmp___4 ; VAL [LDV_IN_INTERRUPT=1, __this_module={0:0}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg2={63:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2408] CALL, EXPR ldv_zalloc(136U) VAL [LDV_IN_INTERRUPT=1, __this_module={0:0}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1636] void *p ; [L1637] void *tmp ; [L1638] int tmp___0 ; [L1640] tmp___0 = __VERIFIER_nondet_int() [L1641] COND FALSE !(tmp___0 != 0) [L1644] EXPR, FCALL calloc(1U, size) [L1644] tmp = calloc(1U, size) [L1645] p = tmp VAL [LDV_IN_INTERRUPT=1, \old(size)=136, __this_module={0:0}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, p={30:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1646] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={0:0}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1613] COND FALSE !(!cond) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={0:0}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1646] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(size)=136, __this_module={0:0}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, p={30:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1647] CALL, EXPR ldv_is_err(p) VAL [LDV_IN_INTERRUPT=1, \old(ptr)={30:0}, __this_module={0:0}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2736] return ((unsigned long )ptr > 2012UL); [L1647] RET, EXPR ldv_is_err(p) VAL [LDV_IN_INTERRUPT=1, \old(size)=136, __this_module={0:0}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, p={30:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1647] CALL assume_abort_if_not(ldv_is_err(p) == 0) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={0:0}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1613] COND FALSE !(!cond) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={0:0}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1647] RET assume_abort_if_not(ldv_is_err(p) == 0) VAL [LDV_IN_INTERRUPT=1, \old(size)=136, __this_module={0:0}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, p={30:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1648] return (p); VAL [LDV_IN_INTERRUPT=1, \old(size)=136, \result={30:0}, __this_module={0:0}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2408] RET, EXPR ldv_zalloc(136U) VAL [LDV_IN_INTERRUPT=1, __this_module={0:0}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg2={63:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2408] tmp = ldv_zalloc(136U) [L2409] ldvarg1 = (struct seq_file *)tmp [L2410] tmp___0 = __VERIFIER_nondet_uint() [L2411] ldvarg0 = tmp___0 [L2412] FCALL ldv_initialize() [L2413] FCALL memset((void *)(& ldvarg2), 0, 4U) [L2414] ldv_state_variable_1 = 1 [L2415] ref_cnt = 0 [L2416] ldv_state_variable_0 = 1 [L2417] ldv_state_variable_3 = 0 [L2418] ldv_state_variable_2 = 0 VAL [LDV_IN_INTERRUPT=1, __this_module={0:0}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg1={30:0}, ldvarg2={63:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2420] tmp___1 = __VERIFIER_nondet_int() [L2422] case 0: [L2428] case 1: [L2430] tmp___2 = __VERIFIER_nondet_int() [L2432] case 0: VAL [LDV_IN_INTERRUPT=1, __this_module={0:0}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg1={30:0}, ldvarg2={63:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___1=1, tmp___2=1] [L2428] case 1: [L2440] case 1: VAL [LDV_IN_INTERRUPT=1, __this_module={0:0}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg1={30:0}, ldvarg2={63:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___1=1] [L2428] case 1: [L2442] CALL, EXPR tegra_rtc_init() [L2230] int tmp ; [L2232] CALL, EXPR platform_driver_probe(& tegra_rtc_driver, & tegra_rtc_probe) [L2848] return __VERIFIER_nondet_int(); [L2232] RET, EXPR platform_driver_probe(& tegra_rtc_driver, & tegra_rtc_probe) [L2232] tmp = platform_driver_probe(& tegra_rtc_driver, & tegra_rtc_probe) [L2233] return (tmp); [L2442] RET, EXPR tegra_rtc_init() [L2442] ldv_retval_0 = tegra_rtc_init() [L2428] case 1: [L2450] ldv_state_variable_0 = 2 VAL [LDV_IN_INTERRUPT=1, __this_module={0:0}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=2, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg1={30:0}, ldvarg2={63:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___1=1] [L2635] FCALL ldv_check_final_state() [L2636] return 0; [L2636] return 0; VAL [LDV_IN_INTERRUPT=1, \result=0, __this_module={0:0}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=2, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg1={30:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___1=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 2896]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 2896]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 2896]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 33 procedures, 495 locations, 111 error locations. Started 1 CEGAR loops. OverallTime: 30.4s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 19.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5158 SdHoareTripleChecker+Valid, 17.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5042 mSDsluCounter, 16394 SdHoareTripleChecker+Invalid, 15.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3508 IncrementalHoareTripleChecker+Unchecked, 10488 mSDsCounter, 806 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7193 IncrementalHoareTripleChecker+Invalid, 11507 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 806 mSolverCounterUnsat, 5906 mSDtfsCounter, 7193 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 426 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3723occurred in iteration=15, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 1092 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 443 NumberOfCodeBlocks, 439 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 407 ConstructedInterpolants, 13 QuantifiedInterpolants, 1277 SizeOfPredicates, 16 NumberOfNonLiveVariables, 3540 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 106/108 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 18:21:25,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample