./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../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.3.0-?-798a7b3-m [2025-03-04 09:11:13,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:11:13,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 09:11:13,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:11:13,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:11:13,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:11:13,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:11:13,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:11:13,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:11:13,789 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:11:13,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:11:13,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:11:13,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:11:13,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:11:13,790 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:11:13,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:11:13,790 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:11:13,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:11:13,790 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:11:13,790 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:11:13,790 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:11:13,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:11:13,790 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:11:13,790 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:11:13,790 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:11:13,791 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:11:13,791 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:11:13,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:11:13,791 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:11:13,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:11:13,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:11:13,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:11:13,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:11:13,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:11:13,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:11:13,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:11:13,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:11:13,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:11:13,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:11:13,792 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2025-03-04 09:11:14,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:11:14,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:11:14,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:11:14,041 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:11:14,041 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:11:14,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2025-03-04 09:11:15,177 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41d91c16b/cae2c1ce4ffd4cff813bc2d7f4129b1b/FLAG495f738a2 [2025-03-04 09:11:15,518 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:11:15,519 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 [2025-03-04 09:11:15,543 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41d91c16b/cae2c1ce4ffd4cff813bc2d7f4129b1b/FLAG495f738a2 [2025-03-04 09:11:15,557 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41d91c16b/cae2c1ce4ffd4cff813bc2d7f4129b1b [2025-03-04 09:11:15,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:11:15,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:11:15,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:11:15,564 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:11:15,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:11:15,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:11:15" (1/1) ... [2025-03-04 09:11:15,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@791e552b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:11:15, skipping insertion in model container [2025-03-04 09:11:15,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:11:15" (1/1) ... [2025-03-04 09:11:15,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:11:15,988 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:15,992 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:15,999 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,000 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,000 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,003 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,004 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,007 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,008 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,009 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,012 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,012 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,013 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,015 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,016 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,021 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,021 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,022 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,029 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,035 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,036 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,036 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,037 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,039 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,040 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,048 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,048 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,049 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,049 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,053 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,058 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,083 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,087 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,087 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,087 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,092 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,092 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,104 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,127 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:11:16,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:11:16,141 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:11:16,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:11:16,249 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:11:16,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:11:16 WrapperNode [2025-03-04 09:11:16,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:11:16,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:11:16,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:11:16,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:11:16,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:11:16" (1/1) ... [2025-03-04 09:11:16,269 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:11:16" (1/1) ... [2025-03-04 09:11:16,302 INFO L138 Inliner]: procedures = 118, calls = 369, calls flagged for inlining = 54, calls inlined = 37, statements flattened = 914 [2025-03-04 09:11:16,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:11:16,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:11:16,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:11:16,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:11:16,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:11:16" (1/1) ... [2025-03-04 09:11:16,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:11:16" (1/1) ... [2025-03-04 09:11:16,316 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:11:16" (1/1) ... [2025-03-04 09:11:16,363 INFO L175 MemorySlicer]: Split 91 memory accesses to 9 slices as follows [26, 2, 2, 3, 10, 10, 12, 22, 4]. 29 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0, 0, 0, 0, 0, 0, 0]. The 50 writes are split as follows [1, 0, 0, 2, 9, 3, 12, 22, 1]. [2025-03-04 09:11:16,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:11:16" (1/1) ... [2025-03-04 09:11:16,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:11:16" (1/1) ... [2025-03-04 09:11:16,392 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:11:16" (1/1) ... [2025-03-04 09:11:16,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:11:16" (1/1) ... [2025-03-04 09:11:16,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:11:16" (1/1) ... [2025-03-04 09:11:16,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:11:16" (1/1) ... [2025-03-04 09:11:16,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:11:16,423 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:11:16,424 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:11:16,424 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:11:16,424 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:11:16" (1/1) ... [2025-03-04 09:11:16,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:11:16,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:11:16,471 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) [2025-03-04 09:11:16,474 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 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-03-04 09:11:16,492 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 09:11:16,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:11:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 09:11:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 09:11:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 09:11:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 09:11:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 09:11:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 09:11:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_time_to_tm [2025-03-04 09:11:16,493 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_time_to_tm [2025-03-04 09:11:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_proc [2025-03-04 09:11:16,493 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_proc [2025-03-04 09:11:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2025-03-04 09:11:16,493 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2025-03-04 09:11:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure outer_sync [2025-03-04 09:11:16,493 INFO L138 BoogieDeclarations]: Found implementation of procedure outer_sync [2025-03-04 09:11:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_remove [2025-03-04 09:11:16,493 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_remove [2025-03-04 09:11:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_shutdown [2025-03-04 09:11:16,493 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_shutdown [2025-03-04 09:11:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 09:11:16,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 09:11:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_tm_to_time [2025-03-04 09:11:16,493 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_tm_to_time [2025-03-04 09:11:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2025-03-04 09:11:16,493 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2025-03-04 09:11:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 09:11:16,493 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 09:11:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_alarm [2025-03-04 09:11:16,493 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_alarm [2025-03-04 09:11:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:11:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:11:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:11:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 09:11:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 09:11:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 09:11:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 09:11:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 09:11:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 09:11:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 09:11:16,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 09:11:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_check [2025-03-04 09:11:16,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_check [2025-03-04 09:11:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_alarm_irq_enable [2025-03-04 09:11:16,497 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_alarm_irq_enable [2025-03-04 09:11:16,497 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_iounmap [2025-03-04 09:11:16,498 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_iounmap [2025-03-04 09:11:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 09:11:16,498 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 09:11:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 09:11:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:11:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_device_unregister [2025-03-04 09:11:16,499 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_device_unregister [2025-03-04 09:11:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 09:11:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2025-03-04 09:11:16,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2025-03-04 09:11:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 09:11:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 09:11:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 09:11:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 09:11:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 09:11:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 09:11:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 09:11:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 09:11:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 09:11:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-04 09:11:16,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-04 09:11:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure device_may_wakeup [2025-03-04 09:11:16,499 INFO L138 BoogieDeclarations]: Found implementation of procedure device_may_wakeup [2025-03-04 09:11:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-03-04 09:11:16,499 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-03-04 09:11:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2025-03-04 09:11:16,500 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2025-03-04 09:11:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:11:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2025-03-04 09:11:16,500 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2025-03-04 09:11:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2025-03-04 09:11:16,500 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2025-03-04 09:11:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-04 09:11:16,500 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-04 09:11:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_read_time [2025-03-04 09:11:16,500 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_read_time [2025-03-04 09:11:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_wait_while_busy [2025-03-04 09:11:16,500 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_wait_while_busy [2025-03-04 09:11:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:11:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:11:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:11:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 09:11:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 09:11:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 09:11:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 09:11:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 09:11:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 09:11:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2025-03-04 09:11:16,500 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2025-03-04 09:11:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-04 09:11:16,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-04 09:11:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_time [2025-03-04 09:11:16,500 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_time [2025-03-04 09:11:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:11:16,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:11:16,728 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:11:16,729 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:11:16,755 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2807: havoc #t~ret273.base, #t~ret273.offset; [2025-03-04 09:11:16,892 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 09:11:16,949 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1788: havoc dev_name_#t~mem58#1.base, dev_name_#t~mem58#1.offset; [2025-03-04 09:11:16,950 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2886: havoc seq_printf_#t~nondet288#1; [2025-03-04 09:11:16,950 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1602: havoc kobject_name_#t~mem10#1.base, kobject_name_#t~mem10#1.offset; [2025-03-04 09:11:16,956 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2826: havoc #t~nondet277; [2025-03-04 09:11:17,053 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1779: havoc #t~mem52;havoc #t~mem53.base, #t~mem53.offset;havoc #t~short54; [2025-03-04 09:11:17,075 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2875: havoc #t~nondet286; [2025-03-04 09:11:17,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2858: havoc #t~ret283.base, #t~ret283.offset; [2025-03-04 09:11:17,088 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2815: havoc dev_set_drvdata_#t~nondet275#1; [2025-03-04 09:11:17,145 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989: call ULTIMATE.dealloc(~#sec~3.base, ~#sec~3.offset);havoc ~#sec~3.base, ~#sec~3.offset; [2025-03-04 09:11:17,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2804: havoc #t~nondet272; [2025-03-04 09:11:17,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1770: havoc #t~mem42;havoc #t~mem43; [2025-03-04 09:11:17,275 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903: call ULTIMATE.dealloc(~#sec~1#1.base, ~#sec~1#1.offset);havoc ~#sec~1#1.base, ~#sec~1#1.offset; [2025-03-04 09:11:17,276 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882: havoc rtc_valid_tm_#t~nondet287#1; [2025-03-04 09:11:21,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2844: havoc ldv_release_3_#t~nondet280#1; [2025-03-04 09:11:21,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2402: call ULTIMATE.dealloc(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset);havoc main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset; [2025-03-04 09:11:21,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2848: havoc platform_driver_probe_#t~nondet281#1; [2025-03-04 09:11:21,608 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2836: havoc ldv_probe_2_#t~nondet278#1; [2025-03-04 09:11:21,608 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2840: havoc ldv_probe_3_#t~nondet279#1; [2025-03-04 09:11:21,731 INFO L? ?]: Removed 550 outVars from TransFormulas that were not future-live. [2025-03-04 09:11:21,731 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:11:21,754 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:11:21,758 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:11:21,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:11:21 BoogieIcfgContainer [2025-03-04 09:11:21,758 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:11:21,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:11:21,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:11:21,764 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:11:21,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:11:15" (1/3) ... [2025-03-04 09:11:21,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672a4691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:11:21, skipping insertion in model container [2025-03-04 09:11:21,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:11:16" (2/3) ... [2025-03-04 09:11:21,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672a4691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:11:21, skipping insertion in model container [2025-03-04 09:11:21,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:11:21" (3/3) ... [2025-03-04 09:11:21,766 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2025-03-04 09:11:21,775 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:11:21,776 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i that has 33 procedures, 588 locations, 1 initial locations, 1 loop locations, and 111 error locations. [2025-03-04 09:11:21,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:11:21,842 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;@129993a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:11:21,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 111 error locations. [2025-03-04 09:11:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 587 states, 364 states have (on average 1.5741758241758241) internal successors, (573), 484 states have internal predecessors, (573), 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) [2025-03-04 09:11:21,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 09:11:21,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:11:21,855 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:11:21,855 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-04 09:11:21,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:11:21,859 INFO L85 PathProgramCache]: Analyzing trace with hash -774568941, now seen corresponding path program 1 times [2025-03-04 09:11:21,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:11:21,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037297348] [2025-03-04 09:11:21,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:11:21,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:11:22,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:11:22,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:11:22,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:11:22,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:11:22,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:11:22,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:11:22,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037297348] [2025-03-04 09:11:22,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037297348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:11:22,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:11:22,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:11:22,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991114600] [2025-03-04 09:11:22,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:11:22,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:11:22,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:11:22,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:11:22,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:11:22,459 INFO L87 Difference]: Start difference. First operand has 587 states, 364 states have (on average 1.5741758241758241) internal successors, (573), 484 states have internal predecessors, (573), 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 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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) [2025-03-04 09:11:26,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:11:30,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:11:34,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:11:35,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:11:35,778 INFO L93 Difference]: Finished difference Result 935 states and 1240 transitions. [2025-03-04 09:11:35,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:11:35,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2025-03-04 09:11:35,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:11:35,797 INFO L225 Difference]: With dead ends: 935 [2025-03-04 09:11:35,797 INFO L226 Difference]: Without dead ends: 921 [2025-03-04 09:11:35,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:11:35,800 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 496 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 159 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:11:35,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 1687 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1114 Invalid, 3 Unknown, 0 Unchecked, 13.2s Time] [2025-03-04 09:11:35,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-03-04 09:11:35,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 825. [2025-03-04 09:11:35,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 563 states have (on average 1.5754884547069272) internal successors, (887), 677 states have internal predecessors, (887), 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) [2025-03-04 09:11:35,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1163 transitions. [2025-03-04 09:11:35,903 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1163 transitions. Word has length 10 [2025-03-04 09:11:35,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:11:35,904 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1163 transitions. [2025-03-04 09:11:35,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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) [2025-03-04 09:11:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1163 transitions. [2025-03-04 09:11:35,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 09:11:35,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:11:35,905 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:11:35,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:11:35,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-04 09:11:35,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:11:35,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1758167362, now seen corresponding path program 1 times [2025-03-04 09:11:35,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:11:35,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640888170] [2025-03-04 09:11:35,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:11:35,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:11:35,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:11:36,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:11:36,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:11:36,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:11:36,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:11:36,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:11:36,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640888170] [2025-03-04 09:11:36,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640888170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:11:36,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:11:36,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:11:36,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078953416] [2025-03-04 09:11:36,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:11:36,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:11:36,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:11:36,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:11:36,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:11:36,306 INFO L87 Difference]: Start difference. First operand 825 states and 1163 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2025-03-04 09:11:40,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:11:44,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:11:48,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:11:49,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:11:49,295 INFO L93 Difference]: Finished difference Result 1214 states and 1771 transitions. [2025-03-04 09:11:49,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:11:49,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2025-03-04 09:11:49,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:11:49,304 INFO L225 Difference]: With dead ends: 1214 [2025-03-04 09:11:49,304 INFO L226 Difference]: Without dead ends: 1214 [2025-03-04 09:11:49,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:11:49,305 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 486 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 146 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:11:49,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1637 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1110 Invalid, 3 Unknown, 0 Unchecked, 12.9s Time] [2025-03-04 09:11:49,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2025-03-04 09:11:49,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1142. [2025-03-04 09:11:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 827 states have (on average 1.611850060459492) internal successors, (1333), 944 states have internal predecessors, (1333), 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) [2025-03-04 09:11:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1759 transitions. [2025-03-04 09:11:49,339 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1759 transitions. Word has length 11 [2025-03-04 09:11:49,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:11:49,339 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1759 transitions. [2025-03-04 09:11:49,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2025-03-04 09:11:49,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1759 transitions. [2025-03-04 09:11:49,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 09:11:49,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:11:49,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:11:49,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:11:49,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-04 09:11:49,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:11:49,341 INFO L85 PathProgramCache]: Analyzing trace with hash -625907500, now seen corresponding path program 1 times [2025-03-04 09:11:49,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:11:49,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636548716] [2025-03-04 09:11:49,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:11:49,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:11:49,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 09:11:49,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 09:11:49,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:11:49,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:11:49,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:11:49,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:11:49,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636548716] [2025-03-04 09:11:49,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636548716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:11:49,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:11:49,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:11:49,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473789013] [2025-03-04 09:11:49,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:11:49,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:11:49,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:11:49,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:11:49,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:11:49,487 INFO L87 Difference]: Start difference. First operand 1142 states and 1759 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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) [2025-03-04 09:11:53,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:11:53,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:11:53,557 INFO L93 Difference]: Finished difference Result 2225 states and 3430 transitions. [2025-03-04 09:11:53,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:11:53,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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 24 [2025-03-04 09:11:53,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:11:53,567 INFO L225 Difference]: With dead ends: 2225 [2025-03-04 09:11:53,567 INFO L226 Difference]: Without dead ends: 2225 [2025-03-04 09:11:53,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:11:53,568 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 659 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:11:53,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1390 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-03-04 09:11:53,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2225 states. [2025-03-04 09:11:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2225 to 2113. [2025-03-04 09:11:53,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2113 states, 1605 states have (on average 1.6174454828660436) internal successors, (2596), 1729 states have internal predecessors, (2596), 315 states have call successors, (315), 60 states have call predecessors, (315), 82 states have return successors, (515), 335 states have call predecessors, (515), 314 states have call successors, (515) [2025-03-04 09:11:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 3426 transitions. [2025-03-04 09:11:53,649 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 3426 transitions. Word has length 24 [2025-03-04 09:11:53,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:11:53,649 INFO L471 AbstractCegarLoop]: Abstraction has 2113 states and 3426 transitions. [2025-03-04 09:11:53,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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) [2025-03-04 09:11:53,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 3426 transitions. [2025-03-04 09:11:53,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 09:11:53,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:11:53,651 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:11:53,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:11:53,651 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-04 09:11:53,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:11:53,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1422693073, now seen corresponding path program 1 times [2025-03-04 09:11:53,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:11:53,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649315236] [2025-03-04 09:11:53,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:11:53,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:11:53,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 09:11:53,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 09:11:53,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:11:53,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:11:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 09:11:53,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:11:53,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649315236] [2025-03-04 09:11:53,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649315236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:11:53,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:11:53,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:11:53,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667726374] [2025-03-04 09:11:53,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:11:53,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:11:53,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:11:53,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:11:53,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:11:53,941 INFO L87 Difference]: Start difference. First operand 2113 states and 3426 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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) [2025-03-04 09:11:57,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:12:01,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:12:05,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:12:09,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:12:13,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:12:15,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:12:15,523 INFO L93 Difference]: Finished difference Result 2688 states and 4411 transitions. [2025-03-04 09:12:15,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:12:15,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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 27 [2025-03-04 09:12:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:12:15,535 INFO L225 Difference]: With dead ends: 2688 [2025-03-04 09:12:15,535 INFO L226 Difference]: Without dead ends: 2688 [2025-03-04 09:12:15,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:12:15,537 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 819 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 288 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 2377 SdHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1947 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:12:15,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 2377 Invalid, 2240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 1947 Invalid, 5 Unknown, 0 Unchecked, 21.5s Time] [2025-03-04 09:12:15,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2025-03-04 09:12:15,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2170. [2025-03-04 09:12:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 1651 states have (on average 1.6165960024227741) internal successors, (2669), 1776 states have internal predecessors, (2669), 319 states have call successors, (319), 60 states have call predecessors, (319), 90 states have return successors, (611), 345 states have call predecessors, (611), 318 states have call successors, (611) [2025-03-04 09:12:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3599 transitions. [2025-03-04 09:12:15,595 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3599 transitions. Word has length 27 [2025-03-04 09:12:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:12:15,596 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 3599 transitions. [2025-03-04 09:12:15,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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) [2025-03-04 09:12:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3599 transitions. [2025-03-04 09:12:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 09:12:15,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:12:15,597 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 09:12:15,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:12:15,599 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-04 09:12:15,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:12:15,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1153811546, now seen corresponding path program 1 times [2025-03-04 09:12:15,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:12:15,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143290986] [2025-03-04 09:12:15,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:12:15,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:12:15,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 09:12:15,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 09:12:15,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:12:15,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:12:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 09:12:16,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:12:16,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143290986] [2025-03-04 09:12:16,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143290986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:12:16,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:12:16,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:12:16,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775487557] [2025-03-04 09:12:16,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:12:16,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:12:16,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:12:16,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:12:16,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:12:16,022 INFO L87 Difference]: Start difference. First operand 2170 states and 3599 transitions. Second operand has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 8 states have internal predecessors, (17), 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) [2025-03-04 09:12:20,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:12:24,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:12:28,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:12:32,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:12:36,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:12:40,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:12:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:12:42,413 INFO L93 Difference]: Finished difference Result 3891 states and 6754 transitions. [2025-03-04 09:12:42,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:12:42,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 8 states have internal predecessors, (17), 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 28 [2025-03-04 09:12:42,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:12:42,429 INFO L225 Difference]: With dead ends: 3891 [2025-03-04 09:12:42,429 INFO L226 Difference]: Without dead ends: 3891 [2025-03-04 09:12:42,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 09:12:42,430 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 905 mSDsluCounter, 2388 mSDsCounter, 0 mSdLazyCounter, 2729 mSolverCounterSat, 238 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 2947 SdHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 2729 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:12:42,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 2947 Invalid, 2973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 2729 Invalid, 6 Unknown, 0 Unchecked, 26.3s Time] [2025-03-04 09:12:42,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3891 states. [2025-03-04 09:12:42,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3891 to 3743. [2025-03-04 09:12:42,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3743 states, 2958 states have (on average 1.6501014198782962) internal successors, (4881), 3092 states have internal predecessors, (4881), 580 states have call successors, (580), 60 states have call predecessors, (580), 96 states have return successors, (1259), 612 states have call predecessors, (1259), 579 states have call successors, (1259) [2025-03-04 09:12:42,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 6720 transitions. [2025-03-04 09:12:42,557 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 6720 transitions. Word has length 28 [2025-03-04 09:12:42,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:12:42,558 INFO L471 AbstractCegarLoop]: Abstraction has 3743 states and 6720 transitions. [2025-03-04 09:12:42,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 8 states have internal predecessors, (17), 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) [2025-03-04 09:12:42,558 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 6720 transitions. [2025-03-04 09:12:42,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 09:12:42,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:12:42,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:12:42,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:12:42,560 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-04 09:12:42,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:12:42,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1231222067, now seen corresponding path program 1 times [2025-03-04 09:12:42,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:12:42,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360447909] [2025-03-04 09:12:42,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:12:42,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:12:42,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 09:12:42,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 09:12:42,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:12:42,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:12:42,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:12:42,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:12:42,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360447909] [2025-03-04 09:12:42,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360447909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:12:42,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:12:42,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:12:42,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652939017] [2025-03-04 09:12:42,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:12:42,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:12:42,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:12:42,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:12:42,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:12:42,803 INFO L87 Difference]: Start difference. First operand 3743 states and 6720 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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) [2025-03-04 09:12:46,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:12:50,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:12:54,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:12:55,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:12:55,665 INFO L93 Difference]: Finished difference Result 4120 states and 7336 transitions. [2025-03-04 09:12:55,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:12:55,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 27 [2025-03-04 09:12:55,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:12:55,680 INFO L225 Difference]: With dead ends: 4120 [2025-03-04 09:12:55,680 INFO L226 Difference]: Without dead ends: 4115 [2025-03-04 09:12:55,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:12:55,683 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 464 mSDsluCounter, 1406 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 129 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:12:55,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 2102 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1204 Invalid, 3 Unknown, 0 Unchecked, 12.8s Time] [2025-03-04 09:12:55,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4115 states. [2025-03-04 09:12:55,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4115 to 4043. [2025-03-04 09:12:55,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4043 states, 3209 states have (on average 1.6512932377687752) internal successors, (5299), 3345 states have internal predecessors, (5299), 629 states have call successors, (629), 60 states have call predecessors, (629), 96 states have return successors, (1377), 661 states have call predecessors, (1377), 628 states have call successors, (1377) [2025-03-04 09:12:55,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4043 states to 4043 states and 7305 transitions. [2025-03-04 09:12:55,781 INFO L78 Accepts]: Start accepts. Automaton has 4043 states and 7305 transitions. Word has length 27 [2025-03-04 09:12:55,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:12:55,781 INFO L471 AbstractCegarLoop]: Abstraction has 4043 states and 7305 transitions. [2025-03-04 09:12:55,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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) [2025-03-04 09:12:55,781 INFO L276 IsEmpty]: Start isEmpty. Operand 4043 states and 7305 transitions. [2025-03-04 09:12:55,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 09:12:55,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:12:55,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:12:55,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:12:55,782 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting tegra_rtc_procErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-04 09:12:55,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:12:55,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1949680916, now seen corresponding path program 1 times [2025-03-04 09:12:55,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:12:55,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001617334] [2025-03-04 09:12:55,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:12:55,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:12:55,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 09:12:55,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 09:12:55,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:12:55,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:12:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:12:55,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:12:55,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001617334] [2025-03-04 09:12:55,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001617334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:12:55,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:12:55,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:12:55,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744771963] [2025-03-04 09:12:55,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:12:55,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:12:55,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:12:55,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:12:55,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:12:55,896 INFO L87 Difference]: Start difference. First operand 4043 states and 7305 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2025-03-04 09:12:55,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:12:55,921 INFO L93 Difference]: Finished difference Result 2533 states and 4343 transitions. [2025-03-04 09:12:55,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:12:55,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2025-03-04 09:12:55,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:12:55,931 INFO L225 Difference]: With dead ends: 2533 [2025-03-04 09:12:55,931 INFO L226 Difference]: Without dead ends: 2533 [2025-03-04 09:12:55,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:12:55,932 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 441 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:12:55,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 444 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:12:55,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2533 states. [2025-03-04 09:12:55,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2533 to 2533. [2025-03-04 09:12:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2533 states, 1999 states have (on average 1.4842421210605303) internal successors, (2967), 2055 states have internal predecessors, (2967), 407 states have call successors, (407), 48 states have call predecessors, (407), 78 states have return successors, (969), 433 states have call predecessors, (969), 406 states have call successors, (969) [2025-03-04 09:12:55,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2533 states to 2533 states and 4343 transitions. [2025-03-04 09:12:55,991 INFO L78 Accepts]: Start accepts. Automaton has 2533 states and 4343 transitions. Word has length 28 [2025-03-04 09:12:55,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:12:55,991 INFO L471 AbstractCegarLoop]: Abstraction has 2533 states and 4343 transitions. [2025-03-04 09:12:55,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2025-03-04 09:12:55,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 4343 transitions. [2025-03-04 09:12:55,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 09:12:55,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:12:55,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:12:55,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:12:55,994 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_irq_1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-04 09:12:55,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:12:55,994 INFO L85 PathProgramCache]: Analyzing trace with hash -234699780, now seen corresponding path program 1 times [2025-03-04 09:12:55,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:12:55,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877982311] [2025-03-04 09:12:55,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:12:55,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:12:56,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 09:12:56,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 09:12:56,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:12:56,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:12:56,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:12:56,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:12:56,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877982311] [2025-03-04 09:12:56,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877982311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:12:56,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:12:56,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:12:56,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583665923] [2025-03-04 09:12:56,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:12:56,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:12:56,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:12:56,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:12:56,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:12:56,125 INFO L87 Difference]: Start difference. First operand 2533 states and 4343 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:12:56,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:12:56,213 INFO L93 Difference]: Finished difference Result 5065 states and 8813 transitions. [2025-03-04 09:12:56,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:12:56,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2025-03-04 09:12:56,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:12:56,238 INFO L225 Difference]: With dead ends: 5065 [2025-03-04 09:12:56,238 INFO L226 Difference]: Without dead ends: 5065 [2025-03-04 09:12:56,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:12:56,239 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 442 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:12:56,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1951 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:12:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5065 states. [2025-03-04 09:12:56,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5065 to 4923. [2025-03-04 09:12:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4923 states, 3904 states have (on average 1.4938524590163935) internal successors, (5832), 4049 states have internal predecessors, (5832), 812 states have call successors, (812), 97 states have call predecessors, (812), 158 states have return successors, (2076), 784 states have call predecessors, (2076), 811 states have call successors, (2076) [2025-03-04 09:12:56,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4923 states to 4923 states and 8720 transitions. [2025-03-04 09:12:56,408 INFO L78 Accepts]: Start accepts. Automaton has 4923 states and 8720 transitions. Word has length 34 [2025-03-04 09:12:56,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:12:56,408 INFO L471 AbstractCegarLoop]: Abstraction has 4923 states and 8720 transitions. [2025-03-04 09:12:56,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:12:56,408 INFO L276 IsEmpty]: Start isEmpty. Operand 4923 states and 8720 transitions. [2025-03-04 09:12:56,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 09:12:56,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:12:56,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:12:56,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:12:56,411 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_irq_1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-04 09:12:56,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:12:56,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1588203985, now seen corresponding path program 1 times [2025-03-04 09:12:56,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:12:56,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277134262] [2025-03-04 09:12:56,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:12:56,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:12:56,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 09:12:56,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 09:12:56,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:12:56,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:12:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:12:56,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:12:56,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277134262] [2025-03-04 09:12:56,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277134262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:12:56,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:12:56,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:12:56,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252184025] [2025-03-04 09:12:56,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:12:56,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:12:56,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:12:56,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:12:56,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:12:56,543 INFO L87 Difference]: Start difference. First operand 4923 states and 8720 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:12:56,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:12:56,643 INFO L93 Difference]: Finished difference Result 4947 states and 8648 transitions. [2025-03-04 09:12:56,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:12:56,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2025-03-04 09:12:56,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:12:56,656 INFO L225 Difference]: With dead ends: 4947 [2025-03-04 09:12:56,656 INFO L226 Difference]: Without dead ends: 4947 [2025-03-04 09:12:56,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:12:56,657 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 435 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:12:56,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1313 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:12:56,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2025-03-04 09:12:56,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 4913. [2025-03-04 09:12:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4913 states, 3912 states have (on average 1.4897750511247443) internal successors, (5828), 4037 states have internal predecessors, (5828), 792 states have call successors, (792), 99 states have call predecessors, (792), 160 states have return successors, (1976), 784 states have call predecessors, (1976), 791 states have call successors, (1976) [2025-03-04 09:12:56,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4913 states to 4913 states and 8596 transitions. [2025-03-04 09:12:56,758 INFO L78 Accepts]: Start accepts. Automaton has 4913 states and 8596 transitions. Word has length 37 [2025-03-04 09:12:56,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:12:56,758 INFO L471 AbstractCegarLoop]: Abstraction has 4913 states and 8596 transitions. [2025-03-04 09:12:56,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:12:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 4913 states and 8596 transitions. [2025-03-04 09:12:56,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 09:12:56,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:12:56,759 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:12:56,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:12:56,760 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_irq_1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-04 09:12:56,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:12:56,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2038690226, now seen corresponding path program 1 times [2025-03-04 09:12:56,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:12:56,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604470854] [2025-03-04 09:12:56,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:12:56,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:12:56,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 09:12:56,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 09:12:56,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:12:56,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:12:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:12:56,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:12:56,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604470854] [2025-03-04 09:12:56,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604470854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:12:56,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:12:56,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:12:56,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852734066] [2025-03-04 09:12:56,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:12:56,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:12:56,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:12:56,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:12:56,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:12:56,879 INFO L87 Difference]: Start difference. First operand 4913 states and 8596 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:12:56,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:12:56,969 INFO L93 Difference]: Finished difference Result 4937 states and 8524 transitions. [2025-03-04 09:12:56,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:12:56,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2025-03-04 09:12:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:12:56,982 INFO L225 Difference]: With dead ends: 4937 [2025-03-04 09:12:56,982 INFO L226 Difference]: Without dead ends: 4937 [2025-03-04 09:12:56,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:12:56,983 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 436 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:12:56,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1310 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:12:56,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4937 states.