./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inl_p.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/ddv-machzwd/ddv_machzwd_inl_p.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-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 32bit --witnessprinter.graph.data.programhash 822210afb67ed99ceea45b432aca8ec250ff4c38d2893c644887ddfbc667fadf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:35:41,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:35:41,130 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:35:41,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:35:41,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:35:41,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:35:41,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:35:41,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:35:41,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:35:41,147 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:35:41,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:35:41,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:35:41,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:35:41,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:35:41,148 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:35:41,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:35:41,148 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:35:41,148 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:35:41,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:35:41,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:35:41,148 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:35:41,148 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:35:41,148 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:35:41,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:35:41,148 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:35:41,148 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:35:41,149 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:35:41,149 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:35:41,149 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:35:41,149 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:35:41,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:35:41,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:35:41,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:35:41,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:35:41,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:35:41,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:35:41,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:35:41,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:35:41,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:35:41,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:35:41,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:35:41,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:35:41,150 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 822210afb67ed99ceea45b432aca8ec250ff4c38d2893c644887ddfbc667fadf [2025-02-06 10:35:41,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:35:41,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:35:41,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:35:41,354 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:35:41,354 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:35:41,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inl_p.i [2025-02-06 10:35:42,495 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/430e76ffe/f1eb160a000443c7ab84b136cab25649/FLAG9bb009a18 [2025-02-06 10:35:42,868 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:35:42,870 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inl_p.i [2025-02-06 10:35:42,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/430e76ffe/f1eb160a000443c7ab84b136cab25649/FLAG9bb009a18 [2025-02-06 10:35:43,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/430e76ffe/f1eb160a000443c7ab84b136cab25649 [2025-02-06 10:35:43,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:35:43,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:35:43,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:35:43,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:35:43,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:35:43,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:35:43" (1/1) ... [2025-02-06 10:35:43,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ed3302f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:43, skipping insertion in model container [2025-02-06 10:35:43,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:35:43" (1/1) ... [2025-02-06 10:35:43,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:35:43,771 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 10:35:43,794 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 10:35:43,804 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 10:35:43,843 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 10:35:43,861 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 10:35:43,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:35:43,906 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:35:44,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:35:44,171 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:35:44,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:44 WrapperNode [2025-02-06 10:35:44,172 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:35:44,173 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:35:44,173 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:35:44,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:35:44,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:44" (1/1) ... [2025-02-06 10:35:44,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:44" (1/1) ... [2025-02-06 10:35:44,352 INFO L138 Inliner]: procedures = 473, calls = 2667, calls flagged for inlining = 55, calls inlined = 37, statements flattened = 3342 [2025-02-06 10:35:44,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:35:44,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:35:44,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:35:44,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:35:44,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:44" (1/1) ... [2025-02-06 10:35:44,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:44" (1/1) ... [2025-02-06 10:35:44,376 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:44" (1/1) ... [2025-02-06 10:35:44,430 INFO L175 MemorySlicer]: Split 2024 memory accesses to 27 slices as follows [5, 3, 35, 16, 1040, 480, 59, 35, 11, 5, 15, 120, 5, 67, 12, 2, 20, 2, 4, 0, 2, 3, 2, 18, 37, 21, 5]. 51 percent of accesses are in the largest equivalence class. The 1901 initializations are split as follows [3, 3, 15, 5, 1040, 480, 59, 32, 2, 1, 10, 120, 4, 67, 6, 2, 4, 0, 4, 0, 0, 0, 0, 18, 25, 0, 1]. The 58 writes are split as follows [0, 0, 6, 8, 0, 0, 0, 0, 5, 1, 2, 0, 0, 0, 6, 0, 4, 1, 0, 0, 0, 0, 2, 0, 0, 21, 2]. [2025-02-06 10:35:44,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:44" (1/1) ... [2025-02-06 10:35:44,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:44" (1/1) ... [2025-02-06 10:35:44,483 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:44" (1/1) ... [2025-02-06 10:35:44,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:44" (1/1) ... [2025-02-06 10:35:44,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:44" (1/1) ... [2025-02-06 10:35:44,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:44" (1/1) ... [2025-02-06 10:35:44,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:35:44,539 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:35:44,539 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:35:44,540 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:35:44,540 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:44" (1/1) ... [2025-02-06 10:35:44,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:35:44,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:35:44,571 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 10:35:44,583 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 10:35:44,601 INFO L130 BoogieDeclarations]: Found specification of procedure zf_timer_off [2025-02-06 10:35:44,602 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_timer_off [2025-02-06 10:35:44,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 10:35:44,602 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_begin [2025-02-06 10:35:44,602 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-02-06 10:35:44,602 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-02-06 10:35:44,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:35:44,602 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-02-06 10:35:44,602 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-02-06 10:35:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 10:35:44,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_end [2025-02-06 10:35:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure zf_get_control [2025-02-06 10:35:44,603 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_get_control [2025-02-06 10:35:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 10:35:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 10:35:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 10:35:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 10:35:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 10:35:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 10:35:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 10:35:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 10:35:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-06 10:35:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-06 10:35:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-06 10:35:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-06 10:35:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-06 10:35:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-06 10:35:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-06 10:35:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-06 10:35:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-06 10:35:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-06 10:35:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-06 10:35:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-06 10:35:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-02-06 10:35:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-02-06 10:35:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-02-06 10:35:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-02-06 10:35:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2025-02-06 10:35:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2025-02-06 10:35:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2025-02-06 10:35:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:35:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:35:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 10:35:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 10:35:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 10:35:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 10:35:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 10:35:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 10:35:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 10:35:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 10:35:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 10:35:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 10:35:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 10:35:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 10:35:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 10:35:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-06 10:35:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure request_region [2025-02-06 10:35:44,607 INFO L138 BoogieDeclarations]: Found implementation of procedure request_region [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-06 10:35:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-06 10:35:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-06 10:35:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-06 10:35:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-06 10:35:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-02-06 10:35:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-02-06 10:35:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-02-06 10:35:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-02-06 10:35:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2025-02-06 10:35:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2025-02-06 10:35:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2025-02-06 10:35:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 10:35:44,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 10:35:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irqsave [2025-02-06 10:35:44,608 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irqsave [2025-02-06 10:35:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-02-06 10:35:44,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-02-06 10:35:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure release_region [2025-02-06 10:35:44,609 INFO L138 BoogieDeclarations]: Found implementation of procedure release_region [2025-02-06 10:35:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:35:44,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:35:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_init [2025-02-06 10:35:44,609 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_init [2025-02-06 10:35:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 10:35:44,609 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 10:35:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-02-06 10:35:44,609 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-02-06 10:35:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:35:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:35:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:35:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 10:35:44,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 10:35:44,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 10:35:44,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 10:35:44,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 10:35:44,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 10:35:44,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 10:35:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 10:35:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 10:35:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-06 10:35:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-06 10:35:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-06 10:35:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-06 10:35:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-06 10:35:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-06 10:35:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-06 10:35:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-06 10:35:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-06 10:35:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-02-06 10:35:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-02-06 10:35:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-02-06 10:35:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-02-06 10:35:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2025-02-06 10:35:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2025-02-06 10:35:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2025-02-06 10:35:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-02-06 10:35:44,612 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-02-06 10:35:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_add [2025-02-06 10:35:44,613 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_add [2025-02-06 10:35:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-02-06 10:35:44,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-02-06 10:35:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 10:35:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 10:35:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 10:35:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 10:35:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-06 10:35:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-06 10:35:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-06 10:35:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-06 10:35:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-06 10:35:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-06 10:35:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-06 10:35:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-06 10:35:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#25 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#26 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-02-06 10:35:44,614 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2025-02-06 10:35:44,614 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2025-02-06 10:35:44,614 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2025-02-06 10:35:44,614 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure assert_context_process [2025-02-06 10:35:44,614 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_context_process [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure zf_set_control [2025-02-06 10:35:44,614 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_set_control [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 10:35:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure zf_readw [2025-02-06 10:35:44,617 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_readw [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure zf_ping [2025-02-06 10:35:44,617 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_ping [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-02-06 10:35:44,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-02-06 10:35:44,617 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-06 10:35:44,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 10:35:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 10:35:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 10:35:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 10:35:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 10:35:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 10:35:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-06 10:35:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-06 10:35:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-06 10:35:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-06 10:35:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-06 10:35:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-06 10:35:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-02-06 10:35:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-02-06 10:35:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-02-06 10:35:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-02-06 10:35:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-02-06 10:35:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-02-06 10:35:45,010 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:35:45,012 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:35:45,195 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3248: havoc get_user_#t~nondet671#1; [2025-02-06 10:35:45,207 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1508: havoc #t~ret200; [2025-02-06 10:35:45,215 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1470: havoc #t~ret199#1; [2025-02-06 10:35:45,215 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3964: havoc inw_#t~nondet753#1; [2025-02-06 10:35:45,275 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3264: havoc put_user_#t~nondet673#1; [2025-02-06 10:35:45,275 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3272: havoc copy_to_user_#t~nondet674#1; [2025-02-06 10:35:45,401 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1705: havoc zf_open_#t~ret218#1; [2025-02-06 10:35:45,402 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4514: havoc test_and_set_bit_#t~bitwise794#1; [2025-02-06 10:35:49,322 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3507: havoc misc_register_#t~ret713#1; [2025-02-06 10:35:49,471 INFO L? ?]: Removed 648 outVars from TransFormulas that were not future-live. [2025-02-06 10:35:49,471 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:35:49,521 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:35:49,521 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:35:49,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:35:49 BoogieIcfgContainer [2025-02-06 10:35:49,521 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:35:49,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:35:49,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:35:49,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:35:49,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:35:43" (1/3) ... [2025-02-06 10:35:49,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c9b763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:35:49, skipping insertion in model container [2025-02-06 10:35:49,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:44" (2/3) ... [2025-02-06 10:35:49,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c9b763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:35:49, skipping insertion in model container [2025-02-06 10:35:49,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:35:49" (3/3) ... [2025-02-06 10:35:49,535 INFO L128 eAbstractionObserver]: Analyzing ICFG ddv_machzwd_inl_p.i [2025-02-06 10:35:49,547 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:35:49,551 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ddv_machzwd_inl_p.i that has 29 procedures, 701 locations, 1 initial locations, 4 loop locations, and 205 error locations. [2025-02-06 10:35:49,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:35:49,591 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;@1662fc86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:35:49,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 205 error locations. [2025-02-06 10:35:49,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 697 states, 387 states have (on average 1.7881136950904393) internal successors, (692), 598 states have internal predecessors, (692), 78 states have call successors, (78), 26 states have call predecessors, (78), 26 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-06 10:35:49,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 10:35:49,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:49,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 10:35:49,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:35:49,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:49,604 INFO L85 PathProgramCache]: Analyzing trace with hash 926720359, now seen corresponding path program 1 times [2025-02-06 10:35:49,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:49,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502879678] [2025-02-06 10:35:49,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:49,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:51,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 10:35:52,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 10:35:52,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:52,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:53,059 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 10:35:53,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:53,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502879678] [2025-02-06 10:35:53,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502879678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:53,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:53,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:35:53,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786248696] [2025-02-06 10:35:53,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:53,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:35:53,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:53,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:35:53,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:35:53,090 INFO L87 Difference]: Start difference. First operand has 697 states, 387 states have (on average 1.7881136950904393) internal successors, (692), 598 states have internal predecessors, (692), 78 states have call successors, (78), 26 states have call predecessors, (78), 26 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:54,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:35:55,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:35:57,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:57,098 INFO L93 Difference]: Finished difference Result 1261 states and 1525 transitions. [2025-02-06 10:35:57,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:35:57,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-06 10:35:57,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:57,111 INFO L225 Difference]: With dead ends: 1261 [2025-02-06 10:35:57,111 INFO L226 Difference]: Without dead ends: 1257 [2025-02-06 10:35:57,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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 10:35:57,113 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 723 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:57,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 2501 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-06 10:35:57,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2025-02-06 10:35:57,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1044. [2025-02-06 10:35:57,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 651 states have (on average 1.771121351766513) internal successors, (1153), 873 states have internal predecessors, (1153), 138 states have call successors, (138), 50 states have call predecessors, (138), 50 states have return successors, (138), 131 states have call predecessors, (138), 138 states have call successors, (138) [2025-02-06 10:35:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1429 transitions. [2025-02-06 10:35:57,206 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1429 transitions. Word has length 5 [2025-02-06 10:35:57,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:57,206 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1429 transitions. [2025-02-06 10:35:57,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1429 transitions. [2025-02-06 10:35:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 10:35:57,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:57,206 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 10:35:57,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:35:57,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting spin_lock_initErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:35:57,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash 926720360, now seen corresponding path program 1 times [2025-02-06 10:35:57,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:57,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573254072] [2025-02-06 10:35:57,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:57,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:59,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 10:35:59,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 10:35:59,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:59,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:00,278 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 10:36:00,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:00,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573254072] [2025-02-06 10:36:00,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573254072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:36:00,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:36:00,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:36:00,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126711575] [2025-02-06 10:36:00,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:36:00,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:36:00,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:00,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:36:00,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:36:00,280 INFO L87 Difference]: Start difference. First operand 1044 states and 1429 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:36:02,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:36:03,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:36:04,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:04,579 INFO L93 Difference]: Finished difference Result 1183 states and 1531 transitions. [2025-02-06 10:36:04,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:36:04,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-06 10:36:04,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:04,585 INFO L225 Difference]: With dead ends: 1183 [2025-02-06 10:36:04,585 INFO L226 Difference]: Without dead ends: 1183 [2025-02-06 10:36:04,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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 10:36:04,588 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 279 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 2771 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:36:04,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 2771 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 10:36:04,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-02-06 10:36:04,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1124. [2025-02-06 10:36:04,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 699 states have (on average 1.7353361945636623) internal successors, (1213), 922 states have internal predecessors, (1213), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2025-02-06 10:36:04,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1527 transitions. [2025-02-06 10:36:04,636 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1527 transitions. Word has length 5 [2025-02-06 10:36:04,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:04,636 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1527 transitions. [2025-02-06 10:36:04,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:36:04,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1527 transitions. [2025-02-06 10:36:04,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:36:04,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:04,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:36:04,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:36:04,638 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr163REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:36:04,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:04,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1147177173, now seen corresponding path program 1 times [2025-02-06 10:36:04,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:04,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622651640] [2025-02-06 10:36:04,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:04,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:06,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:36:06,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:36:06,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:06,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:06,783 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 10:36:06,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:06,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622651640] [2025-02-06 10:36:06,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622651640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:36:06,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:36:06,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:36:06,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96276216] [2025-02-06 10:36:06,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:36:06,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:36:06,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:06,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:36:06,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:36:06,785 INFO L87 Difference]: Start difference. First operand 1124 states and 1527 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 10:36:07,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:07,198 INFO L93 Difference]: Finished difference Result 1330 states and 1614 transitions. [2025-02-06 10:36:07,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:36:07,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 10:36:07,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:07,202 INFO L225 Difference]: With dead ends: 1330 [2025-02-06 10:36:07,202 INFO L226 Difference]: Without dead ends: 1330 [2025-02-06 10:36:07,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:36:07,203 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 705 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:36:07,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1316 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:36:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-02-06 10:36:07,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1123. [2025-02-06 10:36:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 699 states have (on average 1.7281831187410586) internal successors, (1208), 921 states have internal predecessors, (1208), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2025-02-06 10:36:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1522 transitions. [2025-02-06 10:36:07,225 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1522 transitions. Word has length 11 [2025-02-06 10:36:07,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:07,225 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1522 transitions. [2025-02-06 10:36:07,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 10:36:07,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1522 transitions. [2025-02-06 10:36:07,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:36:07,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:07,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:36:07,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:36:07,226 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr164REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:36:07,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:07,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1147177172, now seen corresponding path program 1 times [2025-02-06 10:36:07,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:07,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434884055] [2025-02-06 10:36:07,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:07,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:09,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:36:09,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:36:09,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:09,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:09,750 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 10:36:09,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:09,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434884055] [2025-02-06 10:36:09,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434884055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:36:09,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:36:09,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:36:09,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844783271] [2025-02-06 10:36:09,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:36:09,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:36:09,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:09,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:36:09,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:36:09,751 INFO L87 Difference]: Start difference. First operand 1123 states and 1522 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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 10:36:12,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:36:12,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:12,669 INFO L93 Difference]: Finished difference Result 1187 states and 1537 transitions. [2025-02-06 10:36:12,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:36:12,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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 10:36:12,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:12,676 INFO L225 Difference]: With dead ends: 1187 [2025-02-06 10:36:12,676 INFO L226 Difference]: Without dead ends: 1187 [2025-02-06 10:36:12,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:36:12,678 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 277 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:36:12,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 2100 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-06 10:36:12,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-02-06 10:36:12,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1126. [2025-02-06 10:36:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 702 states have (on average 1.725071225071225) internal successors, (1211), 924 states have internal predecessors, (1211), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2025-02-06 10:36:12,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1525 transitions. [2025-02-06 10:36:12,710 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1525 transitions. Word has length 11 [2025-02-06 10:36:12,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:12,710 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1525 transitions. [2025-02-06 10:36:12,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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 10:36:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1525 transitions. [2025-02-06 10:36:12,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:36:12,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:12,710 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:36:12,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:36:12,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr164REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:36:12,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:12,712 INFO L85 PathProgramCache]: Analyzing trace with hash -499489766, now seen corresponding path program 1 times [2025-02-06 10:36:12,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:12,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868805263] [2025-02-06 10:36:12,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:12,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:14,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:36:14,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:36:14,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:14,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:36:15,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:15,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868805263] [2025-02-06 10:36:15,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868805263] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:36:15,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504794229] [2025-02-06 10:36:15,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:15,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:36:15,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:36:15,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:36:15,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:36:17,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:36:17,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:36:17,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:17,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:18,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 5614 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 10:36:18,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:36:18,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:36:18,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:36:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:36:18,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504794229] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:36:18,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:36:18,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 11 [2025-02-06 10:36:18,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317663919] [2025-02-06 10:36:18,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:36:18,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:36:18,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:18,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:36:18,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:36:18,275 INFO L87 Difference]: Start difference. First operand 1126 states and 1525 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:36:19,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:36:22,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:36:24,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:36:26,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:36:28,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:36:31,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:31,881 INFO L93 Difference]: Finished difference Result 1402 states and 1775 transitions. [2025-02-06 10:36:31,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:36:31,881 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 14 [2025-02-06 10:36:31,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:31,885 INFO L225 Difference]: With dead ends: 1402 [2025-02-06 10:36:31,886 INFO L226 Difference]: Without dead ends: 1402 [2025-02-06 10:36:31,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:36:31,886 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 745 mSDsluCounter, 4261 mSDsCounter, 0 mSdLazyCounter, 2564 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 5139 SdHoareTripleChecker+Invalid, 2711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 2564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:36:31,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 5139 Invalid, 2711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2564 Invalid, 0 Unknown, 0 Unchecked, 13.4s Time] [2025-02-06 10:36:31,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-02-06 10:36:31,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1278. [2025-02-06 10:36:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 812 states have (on average 1.7105911330049262) internal successors, (1389), 1035 states have internal predecessors, (1389), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-02-06 10:36:31,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1757 transitions. [2025-02-06 10:36:31,909 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1757 transitions. Word has length 14 [2025-02-06 10:36:31,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:31,909 INFO L471 AbstractCegarLoop]: Abstraction has 1278 states and 1757 transitions. [2025-02-06 10:36:31,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:36:31,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1757 transitions. [2025-02-06 10:36:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:36:31,909 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:31,909 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:36:31,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:36:32,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:36:32,111 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr161REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:36:32,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:32,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1775123445, now seen corresponding path program 1 times [2025-02-06 10:36:32,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:32,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199932812] [2025-02-06 10:36:32,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:32,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:33,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:36:33,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:36:33,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:33,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 10:36:34,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:34,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199932812] [2025-02-06 10:36:34,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199932812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:36:34,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:36:34,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:36:34,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868735424] [2025-02-06 10:36:34,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:36:34,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:36:34,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:34,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:36:34,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:36:34,293 INFO L87 Difference]: Start difference. First operand 1278 states and 1757 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 10:36:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:34,786 INFO L93 Difference]: Finished difference Result 1486 states and 1850 transitions. [2025-02-06 10:36:34,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:36:34,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 10:36:34,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:34,791 INFO L225 Difference]: With dead ends: 1486 [2025-02-06 10:36:34,791 INFO L226 Difference]: Without dead ends: 1486 [2025-02-06 10:36:34,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:36:34,792 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 691 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:36:34,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1320 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:36:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2025-02-06 10:36:34,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1276. [2025-02-06 10:36:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 812 states have (on average 1.6995073891625616) internal successors, (1380), 1033 states have internal predecessors, (1380), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-02-06 10:36:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1748 transitions. [2025-02-06 10:36:34,823 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1748 transitions. Word has length 24 [2025-02-06 10:36:34,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:34,824 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1748 transitions. [2025-02-06 10:36:34,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 10:36:34,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1748 transitions. [2025-02-06 10:36:34,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:36:34,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:34,824 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:36:34,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:36:34,825 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr162REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:36:34,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:34,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1775123446, now seen corresponding path program 1 times [2025-02-06 10:36:34,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:34,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151978344] [2025-02-06 10:36:34,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:34,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:36,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:36:36,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:36:36,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:36,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:36:37,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:37,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151978344] [2025-02-06 10:36:37,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151978344] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:36:37,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359025502] [2025-02-06 10:36:37,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:37,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:36:37,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:36:37,045 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:36:37,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:36:39,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:36:39,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:36:39,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:39,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:39,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 5674 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 10:36:39,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:36:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:36:39,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:36:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:36:39,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359025502] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:36:39,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:36:39,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 10:36:39,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114062421] [2025-02-06 10:36:39,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:36:39,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 10:36:39,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:39,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 10:36:39,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:36:39,875 INFO L87 Difference]: Start difference. First operand 1276 states and 1748 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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 10:36:39,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:39,987 INFO L93 Difference]: Finished difference Result 1294 states and 1766 transitions. [2025-02-06 10:36:39,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:36:39,987 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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 10:36:39,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:39,991 INFO L225 Difference]: With dead ends: 1294 [2025-02-06 10:36:39,991 INFO L226 Difference]: Without dead ends: 1294 [2025-02-06 10:36:39,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:36:39,991 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 13 mSDsluCounter, 3232 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4044 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:36:39,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4044 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:36:39,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2025-02-06 10:36:40,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2025-02-06 10:36:40,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 830 states have (on average 1.6843373493975904) internal successors, (1398), 1051 states have internal predecessors, (1398), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-02-06 10:36:40,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1766 transitions. [2025-02-06 10:36:40,011 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1766 transitions. Word has length 24 [2025-02-06 10:36:40,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:40,011 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1766 transitions. [2025-02-06 10:36:40,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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 10:36:40,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1766 transitions. [2025-02-06 10:36:40,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:36:40,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:40,012 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:36:40,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:36:40,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:36:40,216 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr162REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:36:40,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:40,217 INFO L85 PathProgramCache]: Analyzing trace with hash -2109337546, now seen corresponding path program 2 times [2025-02-06 10:36:40,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:40,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202351707] [2025-02-06 10:36:40,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:36:40,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:41,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-02-06 10:36:41,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-02-06 10:36:41,968 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 10:36:41,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:42,380 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 10:36:42,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:42,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202351707] [2025-02-06 10:36:42,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202351707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:36:42,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:36:42,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:36:42,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240074923] [2025-02-06 10:36:42,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:36:42,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:36:42,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:42,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:36:42,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:36:42,381 INFO L87 Difference]: Start difference. First operand 1294 states and 1766 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 10:36:43,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:43,638 INFO L93 Difference]: Finished difference Result 1350 states and 1778 transitions. [2025-02-06 10:36:43,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:36:43,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 42 [2025-02-06 10:36:43,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:43,642 INFO L225 Difference]: With dead ends: 1350 [2025-02-06 10:36:43,642 INFO L226 Difference]: Without dead ends: 1350 [2025-02-06 10:36:43,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:36:43,643 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 255 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:36:43,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1572 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 10:36:43,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2025-02-06 10:36:43,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1292. [2025-02-06 10:36:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 830 states have (on average 1.6819277108433734) internal successors, (1396), 1049 states have internal predecessors, (1396), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-02-06 10:36:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1764 transitions. [2025-02-06 10:36:43,662 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1764 transitions. Word has length 42 [2025-02-06 10:36:43,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:43,663 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 1764 transitions. [2025-02-06 10:36:43,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 10:36:43,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1764 transitions. [2025-02-06 10:36:43,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 10:36:43,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:43,665 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:36:43,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:36:43,666 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr157REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:36:43,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:43,666 INFO L85 PathProgramCache]: Analyzing trace with hash -191873309, now seen corresponding path program 1 times [2025-02-06 10:36:43,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:43,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235501831] [2025-02-06 10:36:43,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:43,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:45,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 10:36:45,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 10:36:45,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:45,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:45,712 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 10:36:45,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:45,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235501831] [2025-02-06 10:36:45,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235501831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:36:45,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:36:45,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:36:45,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630331492] [2025-02-06 10:36:45,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:36:45,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:36:45,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:45,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:36:45,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:36:45,714 INFO L87 Difference]: Start difference. First operand 1292 states and 1764 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:36:45,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:45,736 INFO L93 Difference]: Finished difference Result 1291 states and 1761 transitions. [2025-02-06 10:36:45,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:36:45,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 66 [2025-02-06 10:36:45,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:45,740 INFO L225 Difference]: With dead ends: 1291 [2025-02-06 10:36:45,740 INFO L226 Difference]: Without dead ends: 1291 [2025-02-06 10:36:45,740 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 10:36:45,742 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 814 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:36:45,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 815 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:36:45,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2025-02-06 10:36:45,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2025-02-06 10:36:45,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 829 states have (on average 1.6803377563329311) internal successors, (1393), 1048 states have internal predecessors, (1393), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-02-06 10:36:45,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1761 transitions. [2025-02-06 10:36:45,760 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1761 transitions. Word has length 66 [2025-02-06 10:36:45,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:45,760 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1761 transitions. [2025-02-06 10:36:45,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:36:45,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1761 transitions. [2025-02-06 10:36:45,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 10:36:45,761 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:45,762 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:36:45,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:36:45,762 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr157REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:36:45,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:45,765 INFO L85 PathProgramCache]: Analyzing trace with hash 294358723, now seen corresponding path program 1 times [2025-02-06 10:36:45,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:45,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669331395] [2025-02-06 10:36:45,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:45,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:47,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 10:36:47,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 10:36:47,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:47,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 10:36:47,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:47,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669331395] [2025-02-06 10:36:47,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669331395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:36:47,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:36:47,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:36:47,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410149275] [2025-02-06 10:36:47,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:36:47,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:36:47,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:47,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:36:47,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:36:47,826 INFO L87 Difference]: Start difference. First operand 1291 states and 1761 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 10:36:49,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:36:49,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:49,948 INFO L93 Difference]: Finished difference Result 1290 states and 1760 transitions. [2025-02-06 10:36:49,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:36:49,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2025-02-06 10:36:49,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:49,952 INFO L225 Difference]: With dead ends: 1290 [2025-02-06 10:36:49,952 INFO L226 Difference]: Without dead ends: 1290 [2025-02-06 10:36:49,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:36:49,954 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 1 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:36:49,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1420 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-06 10:36:49,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-02-06 10:36:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2025-02-06 10:36:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 829 states have (on average 1.6791314837153197) internal successors, (1392), 1047 states have internal predecessors, (1392), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-02-06 10:36:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1760 transitions. [2025-02-06 10:36:49,972 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1760 transitions. Word has length 68 [2025-02-06 10:36:49,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:49,972 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 1760 transitions. [2025-02-06 10:36:49,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 10:36:49,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1760 transitions. [2025-02-06 10:36:49,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 10:36:49,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:49,974 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:36:49,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:36:49,974 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr158REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:36:49,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:49,975 INFO L85 PathProgramCache]: Analyzing trace with hash 294358724, now seen corresponding path program 1 times [2025-02-06 10:36:49,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:49,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026719910] [2025-02-06 10:36:49,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:49,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:51,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 10:36:51,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 10:36:51,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:51,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:52,720 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 10:36:52,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:52,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026719910] [2025-02-06 10:36:52,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026719910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:36:52,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:36:52,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:36:52,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077235778] [2025-02-06 10:36:52,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:36:52,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:36:52,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:52,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:36:52,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:36:52,723 INFO L87 Difference]: Start difference. First operand 1290 states and 1760 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:36:56,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:36:56,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:56,826 INFO L93 Difference]: Finished difference Result 1289 states and 1759 transitions. [2025-02-06 10:36:56,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:36:56,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 68 [2025-02-06 10:36:56,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:56,834 INFO L225 Difference]: With dead ends: 1289 [2025-02-06 10:36:56,834 INFO L226 Difference]: Without dead ends: 1289 [2025-02-06 10:36:56,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:36:56,835 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 809 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:36:56,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1423 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 10:36:56,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2025-02-06 10:36:56,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1289. [2025-02-06 10:36:56,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 829 states have (on average 1.677925211097708) internal successors, (1391), 1046 states have internal predecessors, (1391), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-02-06 10:36:56,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1759 transitions. [2025-02-06 10:36:56,854 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1759 transitions. Word has length 68 [2025-02-06 10:36:56,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:56,855 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1759 transitions. [2025-02-06 10:36:56,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:36:56,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1759 transitions. [2025-02-06 10:36:56,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 10:36:56,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:56,857 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:36:56,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:36:56,857 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:36:56,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:56,858 INFO L85 PathProgramCache]: Analyzing trace with hash 95286464, now seen corresponding path program 1 times [2025-02-06 10:36:56,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:56,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230569394] [2025-02-06 10:36:56,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:56,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:58,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 10:36:58,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 10:36:58,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:58,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-06 10:36:58,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:58,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230569394] [2025-02-06 10:36:58,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230569394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:36:58,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:36:58,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:36:58,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402754390] [2025-02-06 10:36:58,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:36:58,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:36:58,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:58,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:36:58,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:36:58,979 INFO L87 Difference]: Start difference. First operand 1289 states and 1759 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 10:37:00,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:00,218 INFO L93 Difference]: Finished difference Result 1330 states and 1768 transitions. [2025-02-06 10:37:00,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:37:00,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 73 [2025-02-06 10:37:00,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:00,223 INFO L225 Difference]: With dead ends: 1330 [2025-02-06 10:37:00,223 INFO L226 Difference]: Without dead ends: 1318 [2025-02-06 10:37:00,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:37:00,226 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 95 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:00,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1378 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 10:37:00,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2025-02-06 10:37:00,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1285. [2025-02-06 10:37:00,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 827 states have (on average 1.6783555018137848) internal successors, (1388), 1044 states have internal predecessors, (1388), 183 states have call successors, (183), 79 states have call predecessors, (183), 78 states have return successors, (181), 174 states have call predecessors, (181), 181 states have call successors, (181) [2025-02-06 10:37:00,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1752 transitions. [2025-02-06 10:37:00,249 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1752 transitions. Word has length 73 [2025-02-06 10:37:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:00,249 INFO L471 AbstractCegarLoop]: Abstraction has 1285 states and 1752 transitions. [2025-02-06 10:37:00,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 10:37:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1752 transitions. [2025-02-06 10:37:00,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 10:37:00,251 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:00,251 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:00,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:37:00,251 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:37:00,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:00,251 INFO L85 PathProgramCache]: Analyzing trace with hash -661748068, now seen corresponding path program 1 times [2025-02-06 10:37:00,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:00,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547876038] [2025-02-06 10:37:00,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:00,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:02,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 10:37:02,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 10:37:02,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:02,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:03,065 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-06 10:37:03,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:03,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547876038] [2025-02-06 10:37:03,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547876038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:03,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:03,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:37:03,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167987915] [2025-02-06 10:37:03,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:03,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:37:03,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:03,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:37:03,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:37:03,067 INFO L87 Difference]: Start difference. First operand 1285 states and 1752 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 10:37:05,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:37:06,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:37:08,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:37:09,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:09,689 INFO L93 Difference]: Finished difference Result 1843 states and 2426 transitions. [2025-02-06 10:37:09,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:37:09,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 77 [2025-02-06 10:37:09,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:09,694 INFO L225 Difference]: With dead ends: 1843 [2025-02-06 10:37:09,694 INFO L226 Difference]: Without dead ends: 1843 [2025-02-06 10:37:09,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:37:09,695 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 802 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 1774 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 3143 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:09,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 3143 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1774 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2025-02-06 10:37:09,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2025-02-06 10:37:09,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1620. [2025-02-06 10:37:09,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1083 states have (on average 1.7026777469990766) internal successors, (1844), 1311 states have internal predecessors, (1844), 241 states have call successors, (241), 101 states have call predecessors, (241), 100 states have return successors, (239), 225 states have call predecessors, (239), 239 states have call successors, (239) [2025-02-06 10:37:09,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2324 transitions. [2025-02-06 10:37:09,717 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2324 transitions. Word has length 77 [2025-02-06 10:37:09,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:09,717 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 2324 transitions. [2025-02-06 10:37:09,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 10:37:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2324 transitions. [2025-02-06 10:37:09,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 10:37:09,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:09,718 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:09,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:37:09,718 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting spin_lock_initErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:37:09,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:09,719 INFO L85 PathProgramCache]: Analyzing trace with hash -661748067, now seen corresponding path program 1 times [2025-02-06 10:37:09,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:09,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55844454] [2025-02-06 10:37:09,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:09,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:11,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 10:37:11,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 10:37:11,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:11,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat