./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-c00e63d-m [2025-02-06 12:00:00,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:00:00,800 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-06 12:00:00,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:00:00,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:00:00,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:00:00,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:00:00,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:00:00,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:00:00,831 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:00:00,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:00:00,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:00:00,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:00:00,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:00:00,831 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:00:00,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:00:00,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:00:00,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:00:00,831 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:00:00,831 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:00:00,831 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:00:00,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:00:00,831 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:00:00,832 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:00:00,832 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:00:00,832 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:00:00,832 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:00:00,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:00:00,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:00:00,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:00:00,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:00:00,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:00:00,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:00:00,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:00:00,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:00:00,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:00:00,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:00:00,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:00:00,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:00:00,832 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-jdk21/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-02-06 12:00:01,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:00:01,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:00:01,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:00:01,079 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:00:01,079 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:00:01,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/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-02-06 12:00:02,365 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e05559a68/42b7eb75e8ea4581a0fcc9bc3918110d/FLAG62efe6519 [2025-02-06 12:00:02,802 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:00:02,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/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-02-06 12:00:02,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e05559a68/42b7eb75e8ea4581a0fcc9bc3918110d/FLAG62efe6519 [2025-02-06 12:00:02,839 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e05559a68/42b7eb75e8ea4581a0fcc9bc3918110d [2025-02-06 12:00:02,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:00:02,843 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:00:02,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:00:02,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:00:02,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:00:02,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:00:02" (1/1) ... [2025-02-06 12:00:02,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d2e8051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:00:02, skipping insertion in model container [2025-02-06 12:00:02,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:00:02" (1/1) ... [2025-02-06 12:00:02,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:00:03,395 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,399 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,405 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,405 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,406 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,410 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,412 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,416 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,417 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,419 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,424 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,424 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,425 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,430 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,431 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,438 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,440 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,440 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,447 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,462 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,463 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,464 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,465 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,466 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,467 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,471 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,472 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,472 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,473 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,476 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,479 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,499 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,500 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,500 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,501 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,505 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,506 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,519 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,539 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:00:03,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:00:03,560 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:00:03,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:00:03,716 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:00:03,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:00:03 WrapperNode [2025-02-06 12:00:03,721 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:00:03,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:00:03,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:00:03,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:00:03,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:00:03" (1/1) ... [2025-02-06 12:00:03,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:00:03" (1/1) ... [2025-02-06 12:00:03,834 INFO L138 Inliner]: procedures = 118, calls = 369, calls flagged for inlining = 54, calls inlined = 37, statements flattened = 914 [2025-02-06 12:00:03,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:00:03,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:00:03,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:00:03,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:00:03,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:00:03" (1/1) ... [2025-02-06 12:00:03,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:00:03" (1/1) ... [2025-02-06 12:00:03,852 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:00:03" (1/1) ... [2025-02-06 12:00:03,908 INFO L175 MemorySlicer]: Split 91 memory accesses to 9 slices as follows [2, 3, 10, 26, 4, 10, 12, 2, 22]. 29 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 0, 0]. The 50 writes are split as follows [0, 2, 3, 1, 1, 9, 12, 0, 22]. [2025-02-06 12:00:03,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:00:03" (1/1) ... [2025-02-06 12:00:03,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:00:03" (1/1) ... [2025-02-06 12:00:03,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:00:03" (1/1) ... [2025-02-06 12:00:03,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:00:03" (1/1) ... [2025-02-06 12:00:03,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:00:03" (1/1) ... [2025-02-06 12:00:03,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:00:03" (1/1) ... [2025-02-06 12:00:03,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:00:03,964 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:00:03,964 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:00:03,964 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:00:03,965 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:00:03" (1/1) ... [2025-02-06 12:00:03,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:00:03,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:00:04,011 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:00:04,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:00:04,082 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-02-06 12:00:04,082 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-02-06 12:00:04,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 12:00:04,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 12:00:04,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 12:00:04,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 12:00:04,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 12:00:04,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 12:00:04,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 12:00:04,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 12:00:04,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-06 12:00:04,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 12:00:04,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 12:00:04,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 12:00:04,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 12:00:04,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 12:00:04,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 12:00:04,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 12:00:04,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-06 12:00:04,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-06 12:00:04,084 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-02-06 12:00:04,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-02-06 12:00:04,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:00:04,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:00:04,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:00:04,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 12:00:04,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 12:00:04,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 12:00:04,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 12:00:04,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 12:00:04,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 12:00:04,085 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_time_to_tm [2025-02-06 12:00:04,085 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_time_to_tm [2025-02-06 12:00:04,085 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_proc [2025-02-06 12:00:04,085 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_proc [2025-02-06 12:00:04,085 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2025-02-06 12:00:04,086 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2025-02-06 12:00:04,086 INFO L130 BoogieDeclarations]: Found specification of procedure outer_sync [2025-02-06 12:00:04,086 INFO L138 BoogieDeclarations]: Found implementation of procedure outer_sync [2025-02-06 12:00:04,086 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_remove [2025-02-06 12:00:04,086 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_remove [2025-02-06 12:00:04,086 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_shutdown [2025-02-06 12:00:04,086 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_shutdown [2025-02-06 12:00:04,086 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 12:00:04,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 12:00:04,086 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_tm_to_time [2025-02-06 12:00:04,086 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_tm_to_time [2025-02-06 12:00:04,087 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2025-02-06 12:00:04,087 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2025-02-06 12:00:04,087 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-02-06 12:00:04,087 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-02-06 12:00:04,087 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_alarm [2025-02-06 12:00:04,087 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_alarm [2025-02-06 12:00:04,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:00:04,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:00:04,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:00:04,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 12:00:04,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 12:00:04,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 12:00:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 12:00:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 12:00:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 12:00:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-02-06 12:00:04,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-02-06 12:00:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_check [2025-02-06 12:00:04,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_check [2025-02-06 12:00:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_alarm_irq_enable [2025-02-06 12:00:04,088 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_alarm_irq_enable [2025-02-06 12:00:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_iounmap [2025-02-06 12:00:04,088 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_iounmap [2025-02-06 12:00:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 12:00:04,088 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 12:00:04,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:00:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:00:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_device_unregister [2025-02-06 12:00:04,089 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_device_unregister [2025-02-06 12:00:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:00:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2025-02-06 12:00:04,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2025-02-06 12:00:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 12:00:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 12:00:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 12:00:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 12:00:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 12:00:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 12:00:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 12:00:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 12:00:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 12:00:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-02-06 12:00:04,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-02-06 12:00:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure device_may_wakeup [2025-02-06 12:00:04,090 INFO L138 BoogieDeclarations]: Found implementation of procedure device_may_wakeup [2025-02-06 12:00:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-02-06 12:00:04,090 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-02-06 12:00:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2025-02-06 12:00:04,090 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2025-02-06 12:00:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:00:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2025-02-06 12:00:04,090 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2025-02-06 12:00:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2025-02-06 12:00:04,090 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2025-02-06 12:00:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-02-06 12:00:04,090 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-02-06 12:00:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_read_time [2025-02-06 12:00:04,090 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_read_time [2025-02-06 12:00:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_wait_while_busy [2025-02-06 12:00:04,090 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_wait_while_busy [2025-02-06 12:00:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:00:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:00:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:00:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 12:00:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 12:00:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 12:00:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 12:00:04,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 12:00:04,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 12:00:04,091 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2025-02-06 12:00:04,091 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2025-02-06 12:00:04,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-02-06 12:00:04,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-02-06 12:00:04,091 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_time [2025-02-06 12:00:04,091 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_time [2025-02-06 12:00:04,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:00:04,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:00:04,370 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:00:04,373 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:00:04,397 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2807: havoc #t~ret273.base, #t~ret273.offset; [2025-02-06 12:00:04,512 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-02-06 12:00:04,629 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1788: havoc dev_name_#t~mem58#1.base, dev_name_#t~mem58#1.offset; [2025-02-06 12:00:04,629 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2886: havoc seq_printf_#t~nondet288#1; [2025-02-06 12:00:04,629 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1602: havoc kobject_name_#t~mem10#1.base, kobject_name_#t~mem10#1.offset; [2025-02-06 12:00:04,633 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2826: havoc #t~nondet277; [2025-02-06 12:00:04,787 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1779: havoc #t~mem52;havoc #t~mem53.base, #t~mem53.offset;havoc #t~short54; [2025-02-06 12:00:04,819 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2875: havoc #t~nondet286; [2025-02-06 12:00:04,823 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2858: havoc #t~ret283.base, #t~ret283.offset; [2025-02-06 12:00:04,833 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2815: havoc dev_set_drvdata_#t~nondet275#1; [2025-02-06 12:00:04,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989: call ULTIMATE.dealloc(~#sec~3.base, ~#sec~3.offset);havoc ~#sec~3.base, ~#sec~3.offset; [2025-02-06 12:00:04,896 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2804: havoc #t~nondet272; [2025-02-06 12:00:04,993 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1770: havoc #t~mem42;havoc #t~mem43; [2025-02-06 12:00:05,038 INFO L1309 $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-02-06 12:00:05,038 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882: havoc rtc_valid_tm_#t~nondet287#1; [2025-02-06 12:00:09,445 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2844: havoc ldv_release_3_#t~nondet280#1; [2025-02-06 12:00:09,446 INFO L1309 $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-02-06 12:00:09,446 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2848: havoc platform_driver_probe_#t~nondet281#1; [2025-02-06 12:00:09,446 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2836: havoc ldv_probe_2_#t~nondet278#1; [2025-02-06 12:00:09,446 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2840: havoc ldv_probe_3_#t~nondet279#1; [2025-02-06 12:00:09,596 INFO L? ?]: Removed 550 outVars from TransFormulas that were not future-live. [2025-02-06 12:00:09,597 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:00:09,641 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:00:09,641 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:00:09,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:00:09 BoogieIcfgContainer [2025-02-06 12:00:09,646 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:00:09,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:00:09,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:00:09,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:00:09,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:00:02" (1/3) ... [2025-02-06 12:00:09,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f5ceba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:00:09, skipping insertion in model container [2025-02-06 12:00:09,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:00:03" (2/3) ... [2025-02-06 12:00:09,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f5ceba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:00:09, skipping insertion in model container [2025-02-06 12:00:09,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:00:09" (3/3) ... [2025-02-06 12:00:09,655 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2025-02-06 12:00:09,668 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:00:09,671 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-02-06 12:00:09,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:00:09,771 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;@9fbf410, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:00:09,773 INFO L334 AbstractCegarLoop]: Starting to check reachability of 111 error locations. [2025-02-06 12:00:09,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 591 states, 364 states have (on average 1.5741758241758241) internal successors, (573), 488 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-02-06 12:00:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 12:00:09,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:00:09,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:00:09,789 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-02-06 12:00:09,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:00:09,794 INFO L85 PathProgramCache]: Analyzing trace with hash -774568941, now seen corresponding path program 1 times [2025-02-06 12:00:09,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:00:09,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240108896] [2025-02-06 12:00:09,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:00:09,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:00:09,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:00:10,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:00:10,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:00:10,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:00:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:00:10,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:00:10,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240108896] [2025-02-06 12:00:10,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240108896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:00:10,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:00:10,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:00:10,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891080377] [2025-02-06 12:00:10,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:00:10,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:00:10,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:00:10,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:00:10,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:00:10,528 INFO L87 Difference]: Start difference. First operand has 591 states, 364 states have (on average 1.5741758241758241) internal successors, (573), 488 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-02-06 12:00:14,547 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-02-06 12:00:18,559 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-02-06 12:00:22,564 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-02-06 12:00:23,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:00:23,741 INFO L93 Difference]: Finished difference Result 942 states and 1240 transitions. [2025-02-06 12:00:23,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:00:23,742 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-02-06 12:00:23,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:00:23,758 INFO L225 Difference]: With dead ends: 942 [2025-02-06 12:00:23,759 INFO L226 Difference]: Without dead ends: 921 [2025-02-06 12:00:23,760 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-02-06 12:00:23,761 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 496 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 159 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:00:23,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 1661 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1112 Invalid, 3 Unknown, 0 Unchecked, 13.1s Time] [2025-02-06 12:00:23,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-02-06 12:00:23,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 825. [2025-02-06 12:00:23,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 563 states have (on average 1.5630550621669628) internal successors, (880), 677 states have internal predecessors, (880), 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-02-06 12:00:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1156 transitions. [2025-02-06 12:00:23,860 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1156 transitions. Word has length 10 [2025-02-06 12:00:23,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:00:23,861 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1156 transitions. [2025-02-06 12:00:23,861 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-02-06 12:00:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1156 transitions. [2025-02-06 12:00:23,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 12:00:23,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:00:23,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:00:23,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:00:23,862 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-02-06 12:00:23,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:00:23,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1758167362, now seen corresponding path program 1 times [2025-02-06 12:00:23,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:00:23,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535674242] [2025-02-06 12:00:23,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:00:23,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:00:23,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:00:23,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:00:23,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:00:23,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:00:24,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:00:24,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:00:24,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535674242] [2025-02-06 12:00:24,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535674242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:00:24,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:00:24,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:00:24,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215803563] [2025-02-06 12:00:24,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:00:24,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:00:24,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:00:24,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:00:24,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:00:24,210 INFO L87 Difference]: Start difference. First operand 825 states and 1156 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-02-06 12:00:28,221 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-02-06 12:00:32,225 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-02-06 12:00:36,236 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-02-06 12:00:37,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:00:37,407 INFO L93 Difference]: Finished difference Result 1214 states and 1758 transitions. [2025-02-06 12:00:37,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:00:37,407 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-02-06 12:00:37,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:00:37,416 INFO L225 Difference]: With dead ends: 1214 [2025-02-06 12:00:37,418 INFO L226 Difference]: Without dead ends: 1214 [2025-02-06 12:00:37,418 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-02-06 12:00:37,419 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 482 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 147 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:00:37,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1605 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1102 Invalid, 3 Unknown, 0 Unchecked, 13.1s Time] [2025-02-06 12:00:37,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2025-02-06 12:00:37,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1142. [2025-02-06 12:00:37,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 827 states have (on average 1.596130592503023) internal successors, (1320), 944 states have internal predecessors, (1320), 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-02-06 12:00:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1746 transitions. [2025-02-06 12:00:37,463 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1746 transitions. Word has length 11 [2025-02-06 12:00:37,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:00:37,463 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1746 transitions. [2025-02-06 12:00:37,463 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-02-06 12:00:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1746 transitions. [2025-02-06 12:00:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 12:00:37,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:00:37,465 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-02-06 12:00:37,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:00:37,465 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-02-06 12:00:37,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:00:37,465 INFO L85 PathProgramCache]: Analyzing trace with hash -625907500, now seen corresponding path program 1 times [2025-02-06 12:00:37,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:00:37,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327325898] [2025-02-06 12:00:37,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:00:37,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:00:37,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 12:00:37,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 12:00:37,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:00:37,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:00:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:00:37,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:00:37,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327325898] [2025-02-06 12:00:37,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327325898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:00:37,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:00:37,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:00:37,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541102388] [2025-02-06 12:00:37,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:00:37,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:00:37,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:00:37,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:00:37,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:00:37,614 INFO L87 Difference]: Start difference. First operand 1142 states and 1746 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-02-06 12:00:41,621 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-02-06 12:00:41,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:00:41,730 INFO L93 Difference]: Finished difference Result 2225 states and 3408 transitions. [2025-02-06 12:00:41,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:00:41,731 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-02-06 12:00:41,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:00:41,752 INFO L225 Difference]: With dead ends: 2225 [2025-02-06 12:00:41,753 INFO L226 Difference]: Without dead ends: 2225 [2025-02-06 12:00:41,753 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-02-06 12:00:41,754 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 656 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:00:41,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1383 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 12:00:41,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2225 states. [2025-02-06 12:00:41,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2225 to 2113. [2025-02-06 12:00:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2113 states, 1605 states have (on average 1.6037383177570093) internal successors, (2574), 1729 states have internal predecessors, (2574), 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-02-06 12:00:41,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 3404 transitions. [2025-02-06 12:00:41,868 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 3404 transitions. Word has length 24 [2025-02-06 12:00:41,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:00:41,868 INFO L471 AbstractCegarLoop]: Abstraction has 2113 states and 3404 transitions. [2025-02-06 12:00:41,869 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-02-06 12:00:41,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 3404 transitions. [2025-02-06 12:00:41,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 12:00:41,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:00:41,872 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-02-06 12:00:41,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:00:41,872 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-02-06 12:00:41,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:00:41,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1422693073, now seen corresponding path program 1 times [2025-02-06 12:00:41,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:00:41,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701810707] [2025-02-06 12:00:41,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:00:41,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:00:41,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 12:00:41,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 12:00:41,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:00:41,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:00:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 12:00:42,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:00:42,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701810707] [2025-02-06 12:00:42,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701810707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:00:42,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:00:42,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:00:42,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282292104] [2025-02-06 12:00:42,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:00:42,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:00:42,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:00:42,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:00:42,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:00:42,474 INFO L87 Difference]: Start difference. First operand 2113 states and 3404 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-02-06 12:00:46,480 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-02-06 12:00:50,486 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-02-06 12:00:54,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-02-06 12:00:58,500 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-02-06 12:01:02,504 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-02-06 12:01:04,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:01:04,088 INFO L93 Difference]: Finished difference Result 2688 states and 4384 transitions. [2025-02-06 12:01:04,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:01:04,089 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-02-06 12:01:04,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:01:04,099 INFO L225 Difference]: With dead ends: 2688 [2025-02-06 12:01:04,099 INFO L226 Difference]: Without dead ends: 2688 [2025-02-06 12:01:04,099 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-02-06 12:01:04,100 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 826 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 1860 mSolverCounterSat, 294 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 2311 SdHoareTripleChecker+Invalid, 2159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 1860 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:01:04,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 2311 Invalid, 2159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 1860 Invalid, 5 Unknown, 0 Unchecked, 21.5s Time] [2025-02-06 12:01:04,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2025-02-06 12:01:04,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2170. [2025-02-06 12:01:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 1651 states have (on average 1.6032707450030286) internal successors, (2647), 1776 states have internal predecessors, (2647), 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-02-06 12:01:04,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3577 transitions. [2025-02-06 12:01:04,166 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3577 transitions. Word has length 27 [2025-02-06 12:01:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:01:04,166 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 3577 transitions. [2025-02-06 12:01:04,166 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-02-06 12:01:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3577 transitions. [2025-02-06 12:01:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 12:01:04,167 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:01:04,167 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-02-06 12:01:04,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:01:04,168 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-02-06 12:01:04,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:01:04,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1153811546, now seen corresponding path program 1 times [2025-02-06 12:01:04,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:01:04,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354332312] [2025-02-06 12:01:04,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:01:04,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:01:04,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 12:01:04,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 12:01:04,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:01:04,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:01:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 12:01:04,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:01:04,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354332312] [2025-02-06 12:01:04,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354332312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:01:04,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:01:04,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:01:04,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751869436] [2025-02-06 12:01:04,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:01:04,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:01:04,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:01:04,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:01:04,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:01:04,581 INFO L87 Difference]: Start difference. First operand 2170 states and 3577 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-02-06 12:01:08,588 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-02-06 12:01:12,601 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-02-06 12:01:16,606 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-02-06 12:01:20,619 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-02-06 12:01:24,623 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-02-06 12:01:28,629 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-02-06 12:01:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:01:31,011 INFO L93 Difference]: Finished difference Result 3891 states and 6707 transitions. [2025-02-06 12:01:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:01:31,011 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-02-06 12:01:31,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:01:31,028 INFO L225 Difference]: With dead ends: 3891 [2025-02-06 12:01:31,028 INFO L226 Difference]: Without dead ends: 3891 [2025-02-06 12:01:31,028 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-02-06 12:01:31,029 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 1045 mSDsluCounter, 2196 mSDsCounter, 0 mSdLazyCounter, 2758 mSolverCounterSat, 382 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 3146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 2758 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:01:31,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 2792 Invalid, 3146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 2758 Invalid, 6 Unknown, 0 Unchecked, 26.3s Time] [2025-02-06 12:01:31,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3891 states. [2025-02-06 12:01:31,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3891 to 3743. [2025-02-06 12:01:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3743 states, 2958 states have (on average 1.6342123056119) internal successors, (4834), 3092 states have internal predecessors, (4834), 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-02-06 12:01:31,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 6673 transitions. [2025-02-06 12:01:31,150 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 6673 transitions. Word has length 28 [2025-02-06 12:01:31,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:01:31,151 INFO L471 AbstractCegarLoop]: Abstraction has 3743 states and 6673 transitions. [2025-02-06 12:01:31,151 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-02-06 12:01:31,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 6673 transitions. [2025-02-06 12:01:31,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 12:01:31,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:01:31,152 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-02-06 12:01:31,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:01:31,153 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-02-06 12:01:31,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:01:31,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1231222067, now seen corresponding path program 1 times [2025-02-06 12:01:31,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:01:31,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811436566] [2025-02-06 12:01:31,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:01:31,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:01:31,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 12:01:31,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 12:01:31,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:01:31,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:01:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:01:31,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:01:31,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811436566] [2025-02-06 12:01:31,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811436566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:01:31,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:01:31,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:01:31,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214245903] [2025-02-06 12:01:31,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:01:31,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:01:31,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:01:31,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:01:31,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:01:31,415 INFO L87 Difference]: Start difference. First operand 3743 states and 6673 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-02-06 12:01:35,422 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-02-06 12:01:39,425 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-02-06 12:01:43,430 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-02-06 12:01:44,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:01:44,283 INFO L93 Difference]: Finished difference Result 4120 states and 7284 transitions. [2025-02-06 12:01:44,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:01:44,284 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-02-06 12:01:44,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:01:44,298 INFO L225 Difference]: With dead ends: 4120 [2025-02-06 12:01:44,299 INFO L226 Difference]: Without dead ends: 4115 [2025-02-06 12:01:44,300 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-02-06 12:01:44,301 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 460 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 127 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 2169 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:01:44,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 2169 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1215 Invalid, 3 Unknown, 0 Unchecked, 12.8s Time] [2025-02-06 12:01:44,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4115 states. [2025-02-06 12:01:44,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4115 to 4043. [2025-02-06 12:01:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4043 states, 3209 states have (on average 1.6350888127142411) internal successors, (5247), 3345 states have internal predecessors, (5247), 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-02-06 12:01:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4043 states to 4043 states and 7253 transitions. [2025-02-06 12:01:44,398 INFO L78 Accepts]: Start accepts. Automaton has 4043 states and 7253 transitions. Word has length 27 [2025-02-06 12:01:44,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:01:44,399 INFO L471 AbstractCegarLoop]: Abstraction has 4043 states and 7253 transitions. [2025-02-06 12:01:44,399 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-02-06 12:01:44,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4043 states and 7253 transitions. [2025-02-06 12:01:44,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 12:01:44,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:01:44,400 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-02-06 12:01:44,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:01:44,400 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-02-06 12:01:44,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:01:44,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1949680916, now seen corresponding path program 1 times [2025-02-06 12:01:44,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:01:44,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170717411] [2025-02-06 12:01:44,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:01:44,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:01:44,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 12:01:44,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 12:01:44,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:01:44,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:01:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:01:44,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:01:44,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170717411] [2025-02-06 12:01:44,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170717411] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:01:44,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:01:44,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:01:44,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322483735] [2025-02-06 12:01:44,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:01:44,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:01:44,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:01:44,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:01:44,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:01:44,512 INFO L87 Difference]: Start difference. First operand 4043 states and 7253 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-02-06 12:01:44,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:01:44,534 INFO L93 Difference]: Finished difference Result 2533 states and 4291 transitions. [2025-02-06 12:01:44,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:01:44,535 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-02-06 12:01:44,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:01:44,546 INFO L225 Difference]: With dead ends: 2533 [2025-02-06 12:01:44,546 INFO L226 Difference]: Without dead ends: 2513 [2025-02-06 12:01:44,546 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-02-06 12:01:44,546 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 437 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:01:44,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 441 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:01:44,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2025-02-06 12:01:44,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2513. [2025-02-06 12:01:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 1979 states have (on average 1.4628600303183426) internal successors, (2895), 2035 states have internal predecessors, (2895), 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-02-06 12:01:44,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 4271 transitions. [2025-02-06 12:01:44,604 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 4271 transitions. Word has length 28 [2025-02-06 12:01:44,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:01:44,604 INFO L471 AbstractCegarLoop]: Abstraction has 2513 states and 4271 transitions. [2025-02-06 12:01:44,605 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-02-06 12:01:44,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 4271 transitions. [2025-02-06 12:01:44,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 12:01:44,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:01:44,607 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] [2025-02-06 12:01:44,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:01:44,607 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-02-06 12:01:44,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:01:44,608 INFO L85 PathProgramCache]: Analyzing trace with hash 150923167, now seen corresponding path program 1 times [2025-02-06 12:01:44,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:01:44,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163028345] [2025-02-06 12:01:44,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:01:44,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:01:44,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 12:01:44,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 12:01:44,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:01:44,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:01:44,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:01:44,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:01:44,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163028345] [2025-02-06 12:01:44,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163028345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:01:44,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:01:44,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:01:44,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944104356] [2025-02-06 12:01:44,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:01:44,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:01:44,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:01:44,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:01:44,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:01:44,753 INFO L87 Difference]: Start difference. First operand 2513 states and 4271 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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-02-06 12:01:44,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:01:44,791 INFO L93 Difference]: Finished difference Result 2497 states and 4187 transitions. [2025-02-06 12:01:44,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:01:44,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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 36 [2025-02-06 12:01:44,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:01:44,799 INFO L225 Difference]: With dead ends: 2497 [2025-02-06 12:01:44,800 INFO L226 Difference]: Without dead ends: 2473 [2025-02-06 12:01:44,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:01:44,800 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 426 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:01:44,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1296 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:01:44,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states.