./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inb_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_inb_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 ee91797f6143b4fe80e7c90b0707f35813b28455783da5eca6bad66702efa7d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:35:38,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:35:38,646 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:38,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:35:38,652 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:35:38,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:35:38,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:35:38,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:35:38,672 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:35:38,673 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:35:38,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:35:38,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:35:38,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:35:38,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:35:38,674 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:35:38,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:35:38,674 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:35:38,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:35:38,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:35:38,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:35:38,675 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:35:38,675 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:35:38,675 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:35:38,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:35:38,675 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:35:38,675 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:35:38,675 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:35:38,675 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:35:38,675 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:35:38,676 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:35:38,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:35:38,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:35:38,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:35:38,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:35:38,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:35:38,677 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:35:38,677 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:35:38,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:35:38,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:35:38,677 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:35:38,677 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:35:38,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:35:38,677 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 -> ee91797f6143b4fe80e7c90b0707f35813b28455783da5eca6bad66702efa7d7 [2025-02-06 10:35:38,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:35:38,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:35:38,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:35:38,902 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:35:38,903 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:35:38,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inb_p.i [2025-02-06 10:35:40,029 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/952264cc7/af397d230937433485a581bd4375c545/FLAG4268b4e87 [2025-02-06 10:35:40,422 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:35:40,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inb_p.i [2025-02-06 10:35:40,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/952264cc7/af397d230937433485a581bd4375c545/FLAG4268b4e87 [2025-02-06 10:35:40,593 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/952264cc7/af397d230937433485a581bd4375c545 [2025-02-06 10:35:40,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:35:40,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:35:40,596 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:35:40,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:35:40,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:35:40,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:35:40" (1/1) ... [2025-02-06 10:35:40,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2598433d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:40, skipping insertion in model container [2025-02-06 10:35:40,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:35:40" (1/1) ... [2025-02-06 10:35:40,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:35:41,385 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:41,410 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:35:41,432 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:41,477 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:41,499 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:35:41,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:35:41,551 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:35:41,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:35:41,854 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:35:41,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:41 WrapperNode [2025-02-06 10:35:41,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:35:41,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:35:41,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:35:41,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:35:41,862 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:41" (1/1) ... [2025-02-06 10:35:41,904 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:41" (1/1) ... [2025-02-06 10:35:42,026 INFO L138 Inliner]: procedures = 473, calls = 2667, calls flagged for inlining = 55, calls inlined = 37, statements flattened = 3342 [2025-02-06 10:35:42,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:35:42,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:35:42,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:35:42,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:35:42,034 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:41" (1/1) ... [2025-02-06 10:35:42,034 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:41" (1/1) ... [2025-02-06 10:35:42,044 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:41" (1/1) ... [2025-02-06 10:35:42,091 INFO L175 MemorySlicer]: Split 2024 memory accesses to 27 slices as follows [5, 3, 35, 1040, 480, 59, 35, 37, 11, 5, 15, 120, 67, 2, 16, 2, 5, 0, 2, 20, 4, 2, 18, 3, 12, 21, 5]. 51 percent of accesses are in the largest equivalence class. The 1901 initializations are split as follows [3, 3, 15, 1040, 480, 59, 32, 25, 2, 1, 10, 120, 67, 0, 5, 0, 4, 0, 2, 4, 4, 0, 18, 0, 6, 0, 1]. The 58 writes are split as follows [0, 0, 6, 0, 0, 0, 0, 0, 5, 1, 2, 0, 0, 1, 8, 2, 0, 0, 0, 4, 0, 0, 0, 0, 6, 21, 2]. [2025-02-06 10:35:42,091 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:41" (1/1) ... [2025-02-06 10:35:42,092 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:41" (1/1) ... [2025-02-06 10:35:42,139 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:41" (1/1) ... [2025-02-06 10:35:42,151 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:41" (1/1) ... [2025-02-06 10:35:42,167 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:41" (1/1) ... [2025-02-06 10:35:42,179 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:41" (1/1) ... [2025-02-06 10:35:42,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:35:42,196 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:35:42,198 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:35:42,199 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:35:42,203 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:41" (1/1) ... [2025-02-06 10:35:42,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:35:42,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:35:42,244 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:42,248 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:42,263 INFO L130 BoogieDeclarations]: Found specification of procedure zf_timer_off [2025-02-06 10:35:42,263 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_timer_off [2025-02-06 10:35:42,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 10:35:42,263 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_begin [2025-02-06 10:35:42,263 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-02-06 10:35:42,263 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-02-06 10:35:42,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:35:42,264 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-02-06 10:35:42,264 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-02-06 10:35:42,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 10:35:42,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_end [2025-02-06 10:35:42,264 INFO L130 BoogieDeclarations]: Found specification of procedure zf_get_control [2025-02-06 10:35:42,264 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_get_control [2025-02-06 10:35:42,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 10:35:42,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 10:35:42,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 10:35:42,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 10:35:42,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 10:35:42,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 10:35:42,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 10:35:42,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 10:35:42,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-06 10:35:42,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-06 10:35:42,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-06 10:35:42,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-06 10:35:42,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-06 10:35:42,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-06 10:35:42,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-06 10:35:42,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-06 10:35:42,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-06 10:35:42,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-06 10:35:42,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-06 10:35:42,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-06 10:35:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-02-06 10:35:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-02-06 10:35:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-02-06 10:35:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-02-06 10:35:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2025-02-06 10:35:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2025-02-06 10:35:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2025-02-06 10:35:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:35:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:35:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 10:35:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 10:35:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 10:35:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 10:35:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 10:35:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 10:35:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 10:35:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 10:35:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 10:35:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 10:35:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 10:35:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 10:35:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 10:35:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-06 10:35:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-06 10:35:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-06 10:35:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-06 10:35:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-06 10:35:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-06 10:35:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-02-06 10:35:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-02-06 10:35:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-02-06 10:35:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-02-06 10:35:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-02-06 10:35:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-02-06 10:35:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:35:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure request_region [2025-02-06 10:35:42,268 INFO L138 BoogieDeclarations]: Found implementation of procedure request_region [2025-02-06 10:35:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:35:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:35:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:35:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 10:35:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 10:35:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 10:35:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 10:35:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 10:35:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 10:35:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 10:35:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 10:35:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 10:35:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-06 10:35:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-06 10:35:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-06 10:35:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-06 10:35:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-06 10:35:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-06 10:35:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-06 10:35:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-06 10:35:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-06 10:35:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-02-06 10:35:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-02-06 10:35:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-02-06 10:35:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-02-06 10:35:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2025-02-06 10:35:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2025-02-06 10:35:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2025-02-06 10:35:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 10:35:42,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 10:35:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irqsave [2025-02-06 10:35:42,270 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irqsave [2025-02-06 10:35:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-02-06 10:35:42,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-02-06 10:35:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure release_region [2025-02-06 10:35:42,270 INFO L138 BoogieDeclarations]: Found implementation of procedure release_region [2025-02-06 10:35:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:35:42,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:35:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_init [2025-02-06 10:35:42,270 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_init [2025-02-06 10:35:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 10:35:42,271 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 10:35:42,271 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-02-06 10:35:42,271 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-02-06 10:35:42,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:35:42,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:35:42,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:35:42,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 10:35:42,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 10:35:42,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 10:35:42,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 10:35:42,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 10:35:42,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 10:35:42,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 10:35:42,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 10:35:42,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 10:35:42,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-06 10:35:42,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-06 10:35:42,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-06 10:35:42,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-06 10:35:42,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-06 10:35:42,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-06 10:35:42,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-06 10:35:42,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-06 10:35:42,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-06 10:35:42,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-02-06 10:35:42,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-02-06 10:35:42,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-02-06 10:35:42,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-02-06 10:35:42,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2025-02-06 10:35:42,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2025-02-06 10:35:42,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2025-02-06 10:35:42,272 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-02-06 10:35:42,272 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-02-06 10:35:42,272 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_add [2025-02-06 10:35:42,273 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_add [2025-02-06 10:35:42,273 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-02-06 10:35:42,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-02-06 10:35:42,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 10:35:42,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 10:35:42,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 10:35:42,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 10:35:42,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-06 10:35:42,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-06 10:35:42,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-06 10:35:42,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-06 10:35:42,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-06 10:35:42,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-06 10:35:42,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-06 10:35:42,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-06 10:35:42,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-06 10:35:42,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-06 10:35:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-06 10:35:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-06 10:35:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-06 10:35:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-06 10:35:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-06 10:35:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-02-06 10:35:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-02-06 10:35:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-02-06 10:35:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-02-06 10:35:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-02-06 10:35:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2025-02-06 10:35:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#25 [2025-02-06 10:35:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#26 [2025-02-06 10:35:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-02-06 10:35:42,274 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-02-06 10:35:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2025-02-06 10:35:42,275 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2025-02-06 10:35:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2025-02-06 10:35:42,275 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2025-02-06 10:35:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2025-02-06 10:35:42,275 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2025-02-06 10:35:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure assert_context_process [2025-02-06 10:35:42,275 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_context_process [2025-02-06 10:35:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure zf_set_control [2025-02-06 10:35:42,275 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_set_control [2025-02-06 10:35:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:35:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:35:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 10:35:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 10:35:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 10:35:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 10:35:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 10:35:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 10:35:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 10:35:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 10:35:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 10:35:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 10:35:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 10:35:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 10:35:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 10:35:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-06 10:35:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-06 10:35:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-06 10:35:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-06 10:35:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-06 10:35:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-06 10:35:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-02-06 10:35:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-02-06 10:35:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-02-06 10:35:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-02-06 10:35:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-02-06 10:35:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-02-06 10:35:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure zf_readw [2025-02-06 10:35:42,277 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_readw [2025-02-06 10:35:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure zf_ping [2025-02-06 10:35:42,277 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_ping [2025-02-06 10:35:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-02-06 10:35:42,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-02-06 10:35:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-02-06 10:35:42,277 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-02-06 10:35:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-06 10:35:42,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-06 10:35:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:35:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:35:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 10:35:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 10:35:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 10:35:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 10:35:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 10:35:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 10:35:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 10:35:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 10:35:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 10:35:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 10:35:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 10:35:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 10:35:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 10:35:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-06 10:35:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-06 10:35:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-06 10:35:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-06 10:35:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-06 10:35:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-06 10:35:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-02-06 10:35:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-02-06 10:35:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-02-06 10:35:42,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-02-06 10:35:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-02-06 10:35:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-02-06 10:35:42,675 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:35:42,676 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:35:42,823 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3246: havoc get_user_#t~nondet671#1; [2025-02-06 10:35:42,841 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1508: havoc #t~ret200; [2025-02-06 10:35:42,857 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1470: havoc #t~ret199#1; [2025-02-06 10:35:42,857 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3962: havoc inw_#t~nondet753#1; [2025-02-06 10:35:42,925 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3262: havoc put_user_#t~nondet673#1; [2025-02-06 10:35:42,925 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3270: havoc copy_to_user_#t~nondet674#1; [2025-02-06 10:35:43,020 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4511: havoc test_and_set_bit_#t~bitwise794#1; [2025-02-06 10:35:43,020 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1705: havoc zf_open_#t~ret218#1; [2025-02-06 10:35:46,823 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3505: havoc misc_register_#t~ret713#1; [2025-02-06 10:35:47,041 INFO L? ?]: Removed 648 outVars from TransFormulas that were not future-live. [2025-02-06 10:35:47,041 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:35:47,075 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:35:47,076 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:35:47,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:35:47 BoogieIcfgContainer [2025-02-06 10:35:47,076 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:35:47,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:35:47,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:35:47,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:35:47,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:35:40" (1/3) ... [2025-02-06 10:35:47,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fe0fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:35:47, skipping insertion in model container [2025-02-06 10:35:47,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:41" (2/3) ... [2025-02-06 10:35:47,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fe0fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:35:47, skipping insertion in model container [2025-02-06 10:35:47,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:35:47" (3/3) ... [2025-02-06 10:35:47,083 INFO L128 eAbstractionObserver]: Analyzing ICFG ddv_machzwd_inb_p.i [2025-02-06 10:35:47,092 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:35:47,094 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ddv_machzwd_inb_p.i that has 29 procedures, 701 locations, 1 initial locations, 4 loop locations, and 205 error locations. [2025-02-06 10:35:47,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:35:47,130 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;@583aa057, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:35:47,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 205 error locations. [2025-02-06 10:35:47,134 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:47,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 10:35:47,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:47,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 10:35:47,138 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:47,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:47,141 INFO L85 PathProgramCache]: Analyzing trace with hash 926720359, now seen corresponding path program 1 times [2025-02-06 10:35:47,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:47,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922624026] [2025-02-06 10:35:47,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:47,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:49,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 10:35:49,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 10:35:49,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:49,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:50,372 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:50,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:50,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922624026] [2025-02-06 10:35:50,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922624026] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:50,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:50,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:35:50,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601517335] [2025-02-06 10:35:50,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:50,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:35:50,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:50,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:35:50,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:35:50,402 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:51,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:35:53,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:35:54,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:54,214 INFO L93 Difference]: Finished difference Result 1261 states and 1525 transitions. [2025-02-06 10:35:54,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:35:54,216 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:54,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:54,225 INFO L225 Difference]: With dead ends: 1261 [2025-02-06 10:35:54,225 INFO L226 Difference]: Without dead ends: 1257 [2025-02-06 10:35:54,226 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:54,228 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 723 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s 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.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:54,228 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.7s Time] [2025-02-06 10:35:54,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2025-02-06 10:35:54,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1044. [2025-02-06 10:35:54,310 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:54,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1429 transitions. [2025-02-06 10:35:54,324 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1429 transitions. Word has length 5 [2025-02-06 10:35:54,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:54,324 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1429 transitions. [2025-02-06 10:35:54,324 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:54,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1429 transitions. [2025-02-06 10:35:54,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 10:35:54,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:54,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 10:35:54,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:35:54,325 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:54,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:54,326 INFO L85 PathProgramCache]: Analyzing trace with hash 926720360, now seen corresponding path program 1 times [2025-02-06 10:35:54,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:54,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202159711] [2025-02-06 10:35:54,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:54,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:56,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 10:35:56,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 10:35:56,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:56,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:57,434 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:57,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:57,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202159711] [2025-02-06 10:35:57,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202159711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:57,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:57,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:35:57,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272123192] [2025-02-06 10:35:57,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:57,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:35:57,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:57,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:35:57,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:35:57,436 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:35:59,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:59,705 INFO L93 Difference]: Finished difference Result 1183 states and 1531 transitions. [2025-02-06 10:35:59,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:35:59,705 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:59,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:59,710 INFO L225 Difference]: With dead ends: 1183 [2025-02-06 10:35:59,710 INFO L226 Difference]: Without dead ends: 1183 [2025-02-06 10:35:59,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:35:59,711 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 279 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.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, 2.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:59,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 2771 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-06 10:35:59,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-02-06 10:35:59,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1124. [2025-02-06 10:35:59,735 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:35:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1527 transitions. [2025-02-06 10:35:59,739 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1527 transitions. Word has length 5 [2025-02-06 10:35:59,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:59,739 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1527 transitions. [2025-02-06 10:35:59,739 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:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1527 transitions. [2025-02-06 10:35:59,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:35:59,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:59,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:59,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:35:59,740 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:35:59,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:59,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1147177173, now seen corresponding path program 1 times [2025-02-06 10:35:59,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:59,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791088773] [2025-02-06 10:35:59,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:59,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:01,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:36:01,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:36:01,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:01,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:02,106 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:02,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:02,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791088773] [2025-02-06 10:36:02,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791088773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:36:02,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:36:02,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:36:02,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155083630] [2025-02-06 10:36:02,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:36:02,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:36:02,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:02,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:36:02,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:36:02,110 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:02,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:02,534 INFO L93 Difference]: Finished difference Result 1330 states and 1614 transitions. [2025-02-06 10:36:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:36:02,535 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:02,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:02,542 INFO L225 Difference]: With dead ends: 1330 [2025-02-06 10:36:02,542 INFO L226 Difference]: Without dead ends: 1330 [2025-02-06 10:36:02,543 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:02,543 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:02,543 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:02,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-02-06 10:36:02,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1123. [2025-02-06 10:36:02,569 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:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1522 transitions. [2025-02-06 10:36:02,574 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1522 transitions. Word has length 11 [2025-02-06 10:36:02,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:02,574 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1522 transitions. [2025-02-06 10:36:02,574 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:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1522 transitions. [2025-02-06 10:36:02,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:36:02,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:02,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:36:02,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:36:02,575 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:02,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:02,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1147177172, now seen corresponding path program 1 times [2025-02-06 10:36:02,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:02,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211903719] [2025-02-06 10:36:02,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:02,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:04,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:36:04,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:36:04,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:04,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:05,042 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:05,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:05,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211903719] [2025-02-06 10:36:05,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211903719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:36:05,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:36:05,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:36:05,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613643994] [2025-02-06 10:36:05,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:36:05,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:36:05,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:05,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:36:05,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:36:05,045 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:06,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:36:07,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:07,080 INFO L93 Difference]: Finished difference Result 1187 states and 1537 transitions. [2025-02-06 10:36:07,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:36:07,081 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:07,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:07,085 INFO L225 Difference]: With dead ends: 1187 [2025-02-06 10:36:07,085 INFO L226 Difference]: Without dead ends: 1187 [2025-02-06 10:36:07,086 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:07,088 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 277 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:36:07,089 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.0s Time] [2025-02-06 10:36:07,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-02-06 10:36:07,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1126. [2025-02-06 10:36:07,117 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:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1525 transitions. [2025-02-06 10:36:07,121 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1525 transitions. Word has length 11 [2025-02-06 10:36:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:07,121 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1525 transitions. [2025-02-06 10:36:07,121 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:07,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1525 transitions. [2025-02-06 10:36:07,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:36:07,122 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:07,122 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:36:07,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:36:07,122 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:07,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:07,122 INFO L85 PathProgramCache]: Analyzing trace with hash -499489766, now seen corresponding path program 1 times [2025-02-06 10:36:07,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:07,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973204565] [2025-02-06 10:36:07,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:07,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:09,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:36:09,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:36:09,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:09,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:09,856 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:09,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:09,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973204565] [2025-02-06 10:36:09,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973204565] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:36:09,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928760036] [2025-02-06 10:36:09,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:09,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:36:09,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:36:09,862 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:09,865 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:11,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:36:12,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:36:12,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:12,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:12,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 5614 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 10:36:12,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:36:12,635 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:12,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:36:12,714 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:12,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928760036] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:36:12,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:36:12,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 11 [2025-02-06 10:36:12,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425072243] [2025-02-06 10:36:12,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:36:12,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:36:12,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:12,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:36:12,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:36:12,716 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:14,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:36:16,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:36:17,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:36:20,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:36:22,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:22,757 INFO L93 Difference]: Finished difference Result 1402 states and 1775 transitions. [2025-02-06 10:36:22,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:36:22,758 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:22,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:22,763 INFO L225 Difference]: With dead ends: 1402 [2025-02-06 10:36:22,763 INFO L226 Difference]: Without dead ends: 1402 [2025-02-06 10:36:22,763 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:22,764 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 745 mSDsluCounter, 4261 mSDsCounter, 0 mSdLazyCounter, 2564 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s 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, 9.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:36:22,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 5139 Invalid, 2711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2564 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2025-02-06 10:36:22,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-02-06 10:36:22,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1278. [2025-02-06 10:36:22,786 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:22,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1757 transitions. [2025-02-06 10:36:22,791 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1757 transitions. Word has length 14 [2025-02-06 10:36:22,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:22,791 INFO L471 AbstractCegarLoop]: Abstraction has 1278 states and 1757 transitions. [2025-02-06 10:36:22,791 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:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1757 transitions. [2025-02-06 10:36:22,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:36:22,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:22,792 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:22,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 10:36:22,993 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:22,994 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:22,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:22,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1775123445, now seen corresponding path program 1 times [2025-02-06 10:36:22,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:22,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298040519] [2025-02-06 10:36:22,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:22,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:24,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:36:24,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:36:24,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:24,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:25,168 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:25,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:25,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298040519] [2025-02-06 10:36:25,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298040519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:36:25,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:36:25,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:36:25,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054311430] [2025-02-06 10:36:25,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:36:25,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:36:25,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:25,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:36:25,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:36:25,170 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:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:25,687 INFO L93 Difference]: Finished difference Result 1486 states and 1850 transitions. [2025-02-06 10:36:25,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:36:25,688 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:25,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:25,692 INFO L225 Difference]: With dead ends: 1486 [2025-02-06 10:36:25,692 INFO L226 Difference]: Without dead ends: 1486 [2025-02-06 10:36:25,692 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:25,693 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:25,693 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:25,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2025-02-06 10:36:25,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1276. [2025-02-06 10:36:25,715 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:25,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1748 transitions. [2025-02-06 10:36:25,718 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1748 transitions. Word has length 24 [2025-02-06 10:36:25,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:25,718 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1748 transitions. [2025-02-06 10:36:25,719 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:25,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1748 transitions. [2025-02-06 10:36:25,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:36:25,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:25,719 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:25,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:36:25,719 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:25,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:25,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1775123446, now seen corresponding path program 1 times [2025-02-06 10:36:25,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:25,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360348943] [2025-02-06 10:36:25,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:25,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:27,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:36:27,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:36:27,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:27,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:27,952 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:27,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:27,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360348943] [2025-02-06 10:36:27,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360348943] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:36:27,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098840527] [2025-02-06 10:36:27,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:27,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:36:27,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:36:27,956 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:27,957 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:30,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:36:30,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:36:30,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:30,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:30,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 5674 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 10:36:30,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:36:30,681 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:30,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:36:30,741 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:30,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098840527] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:36:30,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:36:30,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 10:36:30,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182183309] [2025-02-06 10:36:30,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:36:30,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 10:36:30,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:30,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 10:36:30,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:36:30,743 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:30,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:30,854 INFO L93 Difference]: Finished difference Result 1294 states and 1766 transitions. [2025-02-06 10:36:30,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:36:30,855 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:30,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:30,859 INFO L225 Difference]: With dead ends: 1294 [2025-02-06 10:36:30,859 INFO L226 Difference]: Without dead ends: 1294 [2025-02-06 10:36:30,859 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:30,860 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:30,860 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:30,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2025-02-06 10:36:30,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2025-02-06 10:36:30,879 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:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1766 transitions. [2025-02-06 10:36:30,882 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1766 transitions. Word has length 24 [2025-02-06 10:36:30,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:30,882 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1766 transitions. [2025-02-06 10:36:30,882 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:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1766 transitions. [2025-02-06 10:36:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:36:30,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:30,883 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:30,899 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:31,088 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:31,088 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:31,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:31,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2109337546, now seen corresponding path program 2 times [2025-02-06 10:36:31,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:31,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245422174] [2025-02-06 10:36:31,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:36:31,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:32,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-02-06 10:36:32,966 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:32,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 10:36:32,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:33,452 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:33,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:33,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245422174] [2025-02-06 10:36:33,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245422174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:36:33,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:36:33,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:36:33,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207168069] [2025-02-06 10:36:33,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:36:33,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:36:33,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:33,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:36:33,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:36:33,453 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:35,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:36:35,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:35,916 INFO L93 Difference]: Finished difference Result 1350 states and 1778 transitions. [2025-02-06 10:36:35,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:36:35,916 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:35,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:35,920 INFO L225 Difference]: With dead ends: 1350 [2025-02-06 10:36:35,920 INFO L226 Difference]: Without dead ends: 1350 [2025-02-06 10:36:35,922 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:35,923 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 255 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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, 2.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:36:35,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1572 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-06 10:36:35,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2025-02-06 10:36:35,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1292. [2025-02-06 10:36:35,946 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:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1764 transitions. [2025-02-06 10:36:35,950 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1764 transitions. Word has length 42 [2025-02-06 10:36:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:35,951 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 1764 transitions. [2025-02-06 10:36:35,951 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:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1764 transitions. [2025-02-06 10:36:35,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 10:36:35,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:35,954 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:35,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:36:35,954 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:35,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:35,954 INFO L85 PathProgramCache]: Analyzing trace with hash -191873309, now seen corresponding path program 1 times [2025-02-06 10:36:35,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:35,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029207100] [2025-02-06 10:36:35,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:35,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:37,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 10:36:37,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 10:36:37,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:37,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:38,071 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:38,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:38,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029207100] [2025-02-06 10:36:38,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029207100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:36:38,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:36:38,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:36:38,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864857678] [2025-02-06 10:36:38,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:36:38,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:36:38,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:38,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:36:38,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:36:38,073 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:38,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:38,099 INFO L93 Difference]: Finished difference Result 1291 states and 1761 transitions. [2025-02-06 10:36:38,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:36:38,100 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:38,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:38,103 INFO L225 Difference]: With dead ends: 1291 [2025-02-06 10:36:38,103 INFO L226 Difference]: Without dead ends: 1291 [2025-02-06 10:36:38,103 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:38,104 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:38,104 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:38,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2025-02-06 10:36:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2025-02-06 10:36:38,118 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:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1761 transitions. [2025-02-06 10:36:38,121 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1761 transitions. Word has length 66 [2025-02-06 10:36:38,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:38,121 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1761 transitions. [2025-02-06 10:36:38,121 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:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1761 transitions. [2025-02-06 10:36:38,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 10:36:38,122 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:38,122 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:38,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:36:38,122 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:38,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:38,122 INFO L85 PathProgramCache]: Analyzing trace with hash 294358723, now seen corresponding path program 1 times [2025-02-06 10:36:38,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:38,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634729091] [2025-02-06 10:36:38,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:38,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:39,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 10:36:40,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 10:36:40,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:40,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:40,349 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:40,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:40,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634729091] [2025-02-06 10:36:40,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634729091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:36:40,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:36:40,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:36:40,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132618859] [2025-02-06 10:36:40,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:36:40,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:36:40,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:40,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:36:40,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:36:40,352 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:43,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:36:43,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:43,577 INFO L93 Difference]: Finished difference Result 1290 states and 1760 transitions. [2025-02-06 10:36:43,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:36:43,578 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:43,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:43,581 INFO L225 Difference]: With dead ends: 1290 [2025-02-06 10:36:43,581 INFO L226 Difference]: Without dead ends: 1290 [2025-02-06 10:36:43,581 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:43,581 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 1 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s 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, 3.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:36:43,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1420 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-06 10:36:43,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-02-06 10:36:43,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2025-02-06 10:36:43,595 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:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1760 transitions. [2025-02-06 10:36:43,597 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1760 transitions. Word has length 68 [2025-02-06 10:36:43,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:43,598 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 1760 transitions. [2025-02-06 10:36:43,598 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:43,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1760 transitions. [2025-02-06 10:36:43,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 10:36:43,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:43,599 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:43,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:36:43,599 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:43,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:43,599 INFO L85 PathProgramCache]: Analyzing trace with hash 294358724, now seen corresponding path program 1 times [2025-02-06 10:36:43,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:43,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365821872] [2025-02-06 10:36:43,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:43,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:45,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 10:36:45,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 10:36:45,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:45,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:46,043 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:46,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:46,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365821872] [2025-02-06 10:36:46,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365821872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:36:46,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:36:46,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:36:46,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801585511] [2025-02-06 10:36:46,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:36:46,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:36:46,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:46,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:36:46,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:36:46,045 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:47,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:36:47,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:47,589 INFO L93 Difference]: Finished difference Result 1289 states and 1759 transitions. [2025-02-06 10:36:47,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:36:47,590 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:47,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:47,593 INFO L225 Difference]: With dead ends: 1289 [2025-02-06 10:36:47,593 INFO L226 Difference]: Without dead ends: 1289 [2025-02-06 10:36:47,593 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:47,594 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 809 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:36:47,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1423 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 10:36:47,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2025-02-06 10:36:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1289. [2025-02-06 10:36:47,608 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:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1759 transitions. [2025-02-06 10:36:47,610 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1759 transitions. Word has length 68 [2025-02-06 10:36:47,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:47,611 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1759 transitions. [2025-02-06 10:36:47,611 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:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1759 transitions. [2025-02-06 10:36:47,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 10:36:47,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:47,613 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:47,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:36:47,614 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:47,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:47,614 INFO L85 PathProgramCache]: Analyzing trace with hash 95286464, now seen corresponding path program 1 times [2025-02-06 10:36:47,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:47,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693742918] [2025-02-06 10:36:47,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:47,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:49,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 10:36:49,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 10:36:49,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:49,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:49,504 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:49,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:49,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693742918] [2025-02-06 10:36:49,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693742918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:36:49,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:36:49,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:36:49,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998931348] [2025-02-06 10:36:49,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:36:49,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:36:49,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:49,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:36:49,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:36:49,508 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:36:51,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:36:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:51,650 INFO L93 Difference]: Finished difference Result 1330 states and 1768 transitions. [2025-02-06 10:36:51,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:36:51,650 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:36:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:51,653 INFO L225 Difference]: With dead ends: 1330 [2025-02-06 10:36:51,653 INFO L226 Difference]: Without dead ends: 1318 [2025-02-06 10:36:51,654 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:51,654 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 95 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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, 2.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:36:51,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1378 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-06 10:36:51,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2025-02-06 10:36:51,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1285. [2025-02-06 10:36:51,671 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:36:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1752 transitions. [2025-02-06 10:36:51,673 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1752 transitions. Word has length 73 [2025-02-06 10:36:51,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:51,674 INFO L471 AbstractCegarLoop]: Abstraction has 1285 states and 1752 transitions. [2025-02-06 10:36:51,674 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:36:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1752 transitions. [2025-02-06 10:36:51,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 10:36:51,674 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:51,675 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:36:51,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:36:51,675 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:36:51,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:51,675 INFO L85 PathProgramCache]: Analyzing trace with hash -661748068, now seen corresponding path program 1 times [2025-02-06 10:36:51,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:51,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030052490] [2025-02-06 10:36:51,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:51,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:53,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 10:36:53,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 10:36:53,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:53,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:54,332 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:36:54,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:54,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030052490] [2025-02-06 10:36:54,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030052490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:36:54,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:36:54,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:36:54,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67717345] [2025-02-06 10:36:54,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:36:54,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:36:54,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:54,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:36:54,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:36:54,335 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:36:55,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:36:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:58,605 INFO L93 Difference]: Finished difference Result 1843 states and 2426 transitions. [2025-02-06 10:36:58,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:36:58,606 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:36:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:58,611 INFO L225 Difference]: With dead ends: 1843 [2025-02-06 10:36:58,611 INFO L226 Difference]: Without dead ends: 1843 [2025-02-06 10:36:58,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:36:58,612 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 802 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 1774 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s 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, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:36:58,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 3143 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1774 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 10:36:58,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2025-02-06 10:36:58,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1620. [2025-02-06 10:36:58,636 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:36:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2324 transitions. [2025-02-06 10:36:58,639 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2324 transitions. Word has length 77 [2025-02-06 10:36:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:58,639 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 2324 transitions. [2025-02-06 10:36:58,639 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:36:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2324 transitions. [2025-02-06 10:36:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 10:36:58,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:58,640 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:36:58,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:36:58,640 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:36:58,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:58,641 INFO L85 PathProgramCache]: Analyzing trace with hash -661748067, now seen corresponding path program 1 times [2025-02-06 10:36:58,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:58,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801373578] [2025-02-06 10:36:58,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:58,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:00,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 10:37:00,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 10:37:00,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:00,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:01,280 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:01,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:01,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801373578] [2025-02-06 10:37:01,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801373578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:01,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:01,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:37:01,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267128337] [2025-02-06 10:37:01,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:01,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:37:01,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:01,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:37:01,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:37:01,281 INFO L87 Difference]: Start difference. First operand 1620 states and 2324 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:03,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:37:05,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:37:06,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:06,804 INFO L93 Difference]: Finished difference Result 2050 states and 2659 transitions. [2025-02-06 10:37:06,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:37:06,805 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:06,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:06,815 INFO L225 Difference]: With dead ends: 2050 [2025-02-06 10:37:06,815 INFO L226 Difference]: Without dead ends: 2050 [2025-02-06 10:37:06,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:37:06,816 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 1037 mSDsluCounter, 2054 mSDsCounter, 0 mSdLazyCounter, 2455 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 2628 SdHoareTripleChecker+Invalid, 2462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:06,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 2628 Invalid, 2462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2455 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-02-06 10:37:06,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2025-02-06 10:37:06,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 1804. [2025-02-06 10:37:06,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1225 states have (on average 1.7118367346938776) internal successors, (2097), 1449 states have internal predecessors, (2097), 268 states have call successors, (268), 116 states have call predecessors, (268), 115 states have return successors, (266), 257 states have call predecessors, (266), 266 states have call successors, (266) [2025-02-06 10:37:06,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2631 transitions. [2025-02-06 10:37:06,846 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2631 transitions. Word has length 77 [2025-02-06 10:37:06,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:06,846 INFO L471 AbstractCegarLoop]: Abstraction has 1804 states and 2631 transitions. [2025-02-06 10:37:06,846 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:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2631 transitions. [2025-02-06 10:37:06,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 10:37:06,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:06,847 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:06,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:37:06,847 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr49REQUIRES_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:06,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:06,847 INFO L85 PathProgramCache]: Analyzing trace with hash -649358766, now seen corresponding path program 1 times [2025-02-06 10:37:06,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:06,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678212521] [2025-02-06 10:37:06,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:06,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms