./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_outl.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_outl.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 345f2c82068eea48aca6314e15d35413af585b08222f0693277bcfbc8625f6ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:54:53,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:54:53,647 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:54:53,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:54:53,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:54:53,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:54:53,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:54:53,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:54:53,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:54:53,677 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:54:53,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:54:53,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:54:53,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:54:53,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:54:53,678 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:54:53,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:54:53,678 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:54:53,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:54:53,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:54:53,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:54:53,679 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:54:53,679 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:54:53,679 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:54:53,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:54:53,679 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:54:53,679 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:54:53,679 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:54:53,679 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:54:53,679 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:54:53,679 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:54:53,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:54:53,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:54:53,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:54:53,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:54:53,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:54:53,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:54:53,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:54:53,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:54:53,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:54:53,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:54:53,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:54:53,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:54:53,681 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 345f2c82068eea48aca6314e15d35413af585b08222f0693277bcfbc8625f6ae [2025-03-04 07:54:53,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:54:53,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:54:53,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:54:53,918 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:54:53,918 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:54:53,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_outl.i [2025-03-04 07:54:55,083 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760c812c4/abcdb91563244297859dffdf70b8fcca/FLAGd07e99030 [2025-03-04 07:54:55,457 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:54:55,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_outl.i [2025-03-04 07:54:55,480 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760c812c4/abcdb91563244297859dffdf70b8fcca/FLAGd07e99030 [2025-03-04 07:54:55,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760c812c4/abcdb91563244297859dffdf70b8fcca [2025-03-04 07:54:55,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:54:55,664 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:54:55,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:54:55,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:54:55,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:54:55,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:54:55" (1/1) ... [2025-03-04 07:54:55,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf13700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:55, skipping insertion in model container [2025-03-04 07:54:55,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:54:55" (1/1) ... [2025-03-04 07:54:55,723 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:54:56,288 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:54:56,302 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:54:56,312 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:54:56,354 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:54:56,370 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:54:56,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:54:56,409 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:54:56,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:54:56,663 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:54:56,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:56 WrapperNode [2025-03-04 07:54:56,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:54:56,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:54:56,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:54:56,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:54:56,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:56" (1/1) ... [2025-03-04 07:54:56,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:56" (1/1) ... [2025-03-04 07:54:56,845 INFO L138 Inliner]: procedures = 473, calls = 2667, calls flagged for inlining = 55, calls inlined = 37, statements flattened = 3342 [2025-03-04 07:54:56,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:54:56,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:54:56,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:54:56,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:54:56,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:56" (1/1) ... [2025-03-04 07:54:56,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:56" (1/1) ... [2025-03-04 07:54:56,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:56" (1/1) ... [2025-03-04 07:54:56,955 INFO L175 MemorySlicer]: Split 2024 memory accesses to 27 slices as follows [5, 16, 3, 0, 35, 1040, 480, 59, 35, 11, 5, 15, 120, 67, 37, 3, 12, 2, 20, 4, 5, 2, 18, 21, 5, 2, 2]. 51 percent of accesses are in the largest equivalence class. The 1901 initializations are split as follows [3, 5, 3, 0, 15, 1040, 480, 59, 32, 2, 1, 10, 120, 67, 25, 0, 6, 2, 4, 4, 4, 0, 18, 0, 1, 0, 0]. The 58 writes are split as follows [0, 8, 0, 0, 6, 0, 0, 0, 0, 5, 1, 2, 0, 0, 0, 0, 6, 0, 4, 0, 0, 0, 0, 21, 2, 2, 1]. [2025-03-04 07:54:56,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:56" (1/1) ... [2025-03-04 07:54:56,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:56" (1/1) ... [2025-03-04 07:54:57,027 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:56" (1/1) ... [2025-03-04 07:54:57,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:56" (1/1) ... [2025-03-04 07:54:57,057 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:56" (1/1) ... [2025-03-04 07:54:57,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:56" (1/1) ... [2025-03-04 07:54:57,090 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:54:57,091 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:54:57,091 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:54:57,091 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:54:57,092 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:56" (1/1) ... [2025-03-04 07:54:57,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:54:57,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:57,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:54:57,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:54:57,140 INFO L130 BoogieDeclarations]: Found specification of procedure zf_timer_off [2025-03-04 07:54:57,140 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_timer_off [2025-03-04 07:54:57,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 07:54:57,140 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_begin [2025-03-04 07:54:57,140 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-03-04 07:54:57,140 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-03-04 07:54:57,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:54:57,140 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-03-04 07:54:57,141 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-03-04 07:54:57,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 07:54:57,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_end [2025-03-04 07:54:57,141 INFO L130 BoogieDeclarations]: Found specification of procedure zf_get_control [2025-03-04 07:54:57,141 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_get_control [2025-03-04 07:54:57,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 07:54:57,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 07:54:57,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 07:54:57,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 07:54:57,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 07:54:57,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 07:54:57,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 07:54:57,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 07:54:57,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 07:54:57,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 07:54:57,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 07:54:57,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 07:54:57,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 07:54:57,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-04 07:54:57,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure request_region [2025-03-04 07:54:57,144 INFO L138 BoogieDeclarations]: Found implementation of procedure request_region [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-04 07:54:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-03-04 07:54:57,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-03-04 07:54:57,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2025-03-04 07:54:57,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2025-03-04 07:54:57,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2025-03-04 07:54:57,147 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 07:54:57,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irqsave [2025-03-04 07:54:57,148 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irqsave [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-03-04 07:54:57,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure release_region [2025-03-04 07:54:57,148 INFO L138 BoogieDeclarations]: Found implementation of procedure release_region [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:54:57,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_init [2025-03-04 07:54:57,148 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_init [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 07:54:57,148 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-03-04 07:54:57,148 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-04 07:54:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-03-04 07:54:57,149 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_add [2025-03-04 07:54:57,149 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_add [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-03-04 07:54:57,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-04 07:54:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-03-04 07:54:57,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-03-04 07:54:57,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2025-03-04 07:54:57,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#25 [2025-03-04 07:54:57,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#26 [2025-03-04 07:54:57,151 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 07:54:57,152 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 07:54:57,152 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2025-03-04 07:54:57,152 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2025-03-04 07:54:57,152 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2025-03-04 07:54:57,152 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2025-03-04 07:54:57,152 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2025-03-04 07:54:57,152 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2025-03-04 07:54:57,152 INFO L130 BoogieDeclarations]: Found specification of procedure assert_context_process [2025-03-04 07:54:57,152 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_context_process [2025-03-04 07:54:57,152 INFO L130 BoogieDeclarations]: Found specification of procedure zf_set_control [2025-03-04 07:54:57,153 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_set_control [2025-03-04 07:54:57,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:54:57,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:54:57,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 07:54:57,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 07:54:57,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 07:54:57,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 07:54:57,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 07:54:57,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 07:54:57,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 07:54:57,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 07:54:57,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure zf_readw [2025-03-04 07:54:57,154 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_readw [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure zf_ping [2025-03-04 07:54:57,154 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_ping [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-03-04 07:54:57,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-03-04 07:54:57,154 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-04 07:54:57,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 07:54:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 07:54:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 07:54:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 07:54:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 07:54:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 07:54:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 07:54:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 07:54:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 07:54:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 07:54:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 07:54:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 07:54:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 07:54:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-04 07:54:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-04 07:54:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-04 07:54:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-04 07:54:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-03-04 07:54:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-03-04 07:54:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-03-04 07:54:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-03-04 07:54:57,545 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:54:57,547 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:54:57,744 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3245: havoc get_user_#t~nondet671#1; [2025-03-04 07:54:57,758 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1508: havoc #t~ret200; [2025-03-04 07:54:57,766 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1470: havoc #t~ret199#1; [2025-03-04 07:54:57,766 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3961: havoc inw_#t~nondet753#1; [2025-03-04 07:54:57,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3269: havoc copy_to_user_#t~nondet674#1; [2025-03-04 07:54:57,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3261: havoc put_user_#t~nondet673#1; [2025-03-04 07:54:57,964 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1705: havoc zf_open_#t~ret218#1; [2025-03-04 07:54:57,964 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4510: havoc test_and_set_bit_#t~bitwise794#1; [2025-03-04 07:55:02,213 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3504: havoc misc_register_#t~ret713#1; [2025-03-04 07:55:02,372 INFO L? ?]: Removed 648 outVars from TransFormulas that were not future-live. [2025-03-04 07:55:02,372 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:55:02,408 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:55:02,408 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:55:02,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:55:02 BoogieIcfgContainer [2025-03-04 07:55:02,410 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:55:02,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:55:02,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:55:02,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:55:02,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:54:55" (1/3) ... [2025-03-04 07:55:02,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780f1903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:55:02, skipping insertion in model container [2025-03-04 07:55:02,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:56" (2/3) ... [2025-03-04 07:55:02,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780f1903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:55:02, skipping insertion in model container [2025-03-04 07:55:02,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:55:02" (3/3) ... [2025-03-04 07:55:02,420 INFO L128 eAbstractionObserver]: Analyzing ICFG ddv_machzwd_outl.i [2025-03-04 07:55:02,431 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:55:02,433 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ddv_machzwd_outl.i that has 29 procedures, 701 locations, 1 initial locations, 4 loop locations, and 205 error locations. [2025-03-04 07:55:02,473 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:55:02,484 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;@19e5123a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:55:02,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 205 error locations. [2025-03-04 07:55:02,493 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-03-04 07:55:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:55:02,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:55:02,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:55:02,497 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-03-04 07:55:02,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:55:02,502 INFO L85 PathProgramCache]: Analyzing trace with hash 926720359, now seen corresponding path program 1 times [2025-03-04 07:55:02,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:55:02,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756652761] [2025-03-04 07:55:02,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:55:02,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:55:04,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:55:04,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:55:04,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:55:04,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:55:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:55:05,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:55:05,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756652761] [2025-03-04 07:55:05,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756652761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:55:05,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:55:05,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:55:05,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321595666] [2025-03-04 07:55:05,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:55:05,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:55:05,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:55:05,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:55:05,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:55:05,771 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-03-04 07:55:07,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:55:09,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:55:10,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:55:10,525 INFO L93 Difference]: Finished difference Result 1261 states and 1525 transitions. [2025-03-04 07:55:10,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:55:10,527 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-03-04 07:55:10,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:55:10,535 INFO L225 Difference]: With dead ends: 1261 [2025-03-04 07:55:10,535 INFO L226 Difference]: Without dead ends: 1257 [2025-03-04 07:55:10,536 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-03-04 07:55:10,537 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 723 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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, 4.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:55:10,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 2501 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-04 07:55:10,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2025-03-04 07:55:10,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1044. [2025-03-04 07:55:10,598 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-03-04 07:55:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1429 transitions. [2025-03-04 07:55:10,609 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1429 transitions. Word has length 5 [2025-03-04 07:55:10,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:55:10,609 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1429 transitions. [2025-03-04 07:55:10,609 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-03-04 07:55:10,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1429 transitions. [2025-03-04 07:55:10,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:55:10,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:55:10,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:55:10,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:55:10,610 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-03-04 07:55:10,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:55:10,610 INFO L85 PathProgramCache]: Analyzing trace with hash 926720360, now seen corresponding path program 1 times [2025-03-04 07:55:10,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:55:10,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846152706] [2025-03-04 07:55:10,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:55:10,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:55:12,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:55:12,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:55:12,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:55:12,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:55:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:55:13,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:55:13,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846152706] [2025-03-04 07:55:13,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846152706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:55:13,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:55:13,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:55:13,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077136017] [2025-03-04 07:55:13,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:55:13,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:55:13,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:55:13,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:55:13,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:55:13,523 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-03-04 07:55:14,865 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-03-04 07:55:16,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:55:17,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:55:17,083 INFO L93 Difference]: Finished difference Result 1183 states and 1531 transitions. [2025-03-04 07:55:17,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:55:17,083 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-03-04 07:55:17,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:55:17,090 INFO L225 Difference]: With dead ends: 1183 [2025-03-04 07:55:17,090 INFO L226 Difference]: Without dead ends: 1183 [2025-03-04 07:55:17,090 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-03-04 07:55:17,091 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 279 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s 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, 3.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:55:17,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 2771 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-04 07:55:17,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-03-04 07:55:17,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1124. [2025-03-04 07:55:17,124 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-03-04 07:55:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1527 transitions. [2025-03-04 07:55:17,130 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1527 transitions. Word has length 5 [2025-03-04 07:55:17,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:55:17,130 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1527 transitions. [2025-03-04 07:55:17,130 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-03-04 07:55:17,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1527 transitions. [2025-03-04 07:55:17,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:55:17,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:55:17,131 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:55:17,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:55:17,131 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-03-04 07:55:17,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:55:17,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1147177173, now seen corresponding path program 1 times [2025-03-04 07:55:17,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:55:17,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180446762] [2025-03-04 07:55:17,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:55:17,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:55:18,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:55:18,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:55:18,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:55:18,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:55:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:55:19,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:55:19,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180446762] [2025-03-04 07:55:19,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180446762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:55:19,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:55:19,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:55:19,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683734431] [2025-03-04 07:55:19,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:55:19,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:55:19,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:55:19,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:55:19,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:55:19,275 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-03-04 07:55:19,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:55:19,699 INFO L93 Difference]: Finished difference Result 1330 states and 1614 transitions. [2025-03-04 07:55:19,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:55:19,700 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-03-04 07:55:19,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:55:19,705 INFO L225 Difference]: With dead ends: 1330 [2025-03-04 07:55:19,706 INFO L226 Difference]: Without dead ends: 1330 [2025-03-04 07:55:19,706 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-03-04 07:55:19,707 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-03-04 07:55:19,707 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-03-04 07:55:19,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-03-04 07:55:19,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1123. [2025-03-04 07:55:19,724 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-03-04 07:55:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1522 transitions. [2025-03-04 07:55:19,728 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1522 transitions. Word has length 11 [2025-03-04 07:55:19,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:55:19,728 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1522 transitions. [2025-03-04 07:55:19,728 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-03-04 07:55:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1522 transitions. [2025-03-04 07:55:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:55:19,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:55:19,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:55:19,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:55:19,729 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-03-04 07:55:19,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:55:19,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1147177172, now seen corresponding path program 1 times [2025-03-04 07:55:19,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:55:19,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143132002] [2025-03-04 07:55:19,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:55:19,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:55:21,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:55:21,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:55:21,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:55:21,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:55:22,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:55:22,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:55:22,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143132002] [2025-03-04 07:55:22,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143132002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:55:22,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:55:22,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:55:22,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238623515] [2025-03-04 07:55:22,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:55:22,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:55:22,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:55:22,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:55:22,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:55:22,077 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-03-04 07:55:23,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:55:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:55:23,712 INFO L93 Difference]: Finished difference Result 1187 states and 1537 transitions. [2025-03-04 07:55:23,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:55:23,712 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-03-04 07:55:23,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:55:23,716 INFO L225 Difference]: With dead ends: 1187 [2025-03-04 07:55:23,716 INFO L226 Difference]: Without dead ends: 1187 [2025-03-04 07:55:23,716 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-03-04 07:55:23,716 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 277 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:55:23,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 2100 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 07:55:23,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-03-04 07:55:23,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1126. [2025-03-04 07:55:23,740 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-03-04 07:55:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1525 transitions. [2025-03-04 07:55:23,744 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1525 transitions. Word has length 11 [2025-03-04 07:55:23,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:55:23,744 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1525 transitions. [2025-03-04 07:55:23,744 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-03-04 07:55:23,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1525 transitions. [2025-03-04 07:55:23,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 07:55:23,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:55:23,744 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:55:23,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:55:23,745 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-03-04 07:55:23,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:55:23,745 INFO L85 PathProgramCache]: Analyzing trace with hash -499489766, now seen corresponding path program 1 times [2025-03-04 07:55:23,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:55:23,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511997861] [2025-03-04 07:55:23,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:55:23,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:55:25,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:55:25,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:55:25,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:55:25,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:55:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:55:26,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:55:26,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511997861] [2025-03-04 07:55:26,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511997861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:55:26,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207254748] [2025-03-04 07:55:26,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:55:26,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:55:26,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:55:26,234 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:55:26,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:55:28,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:55:28,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:55:28,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:55:28,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:55:28,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 5614 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:55:28,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:55:28,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:55:28,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:55:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:55:29,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207254748] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:55:29,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:55:29,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 11 [2025-03-04 07:55:29,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606291334] [2025-03-04 07:55:29,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:55:29,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:55:29,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:55:29,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:55:29,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:55:29,090 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-03-04 07:55:32,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:55:33,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:55:34,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:55:35,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:55:37,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:55:38,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:55:38,823 INFO L93 Difference]: Finished difference Result 1402 states and 1775 transitions. [2025-03-04 07:55:38,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:55:38,823 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-03-04 07:55:38,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:55:38,830 INFO L225 Difference]: With dead ends: 1402 [2025-03-04 07:55:38,830 INFO L226 Difference]: Without dead ends: 1402 [2025-03-04 07:55:38,831 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-03-04 07:55:38,832 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 745 mSDsluCounter, 4261 mSDsCounter, 0 mSdLazyCounter, 2564 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s 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.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:55:38,833 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.6s Time] [2025-03-04 07:55:38,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-03-04 07:55:38,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1278. [2025-03-04 07:55:38,860 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-03-04 07:55:38,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1757 transitions. [2025-03-04 07:55:38,864 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1757 transitions. Word has length 14 [2025-03-04 07:55:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:55:38,864 INFO L471 AbstractCegarLoop]: Abstraction has 1278 states and 1757 transitions. [2025-03-04 07:55:38,864 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-03-04 07:55:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1757 transitions. [2025-03-04 07:55:38,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:55:38,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:55:38,865 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:55:38,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:55:39,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:55:39,066 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-03-04 07:55:39,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:55:39,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1775123445, now seen corresponding path program 1 times [2025-03-04 07:55:39,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:55:39,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332420066] [2025-03-04 07:55:39,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:55:39,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:55:40,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:55:40,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:55:40,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:55:40,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:55:41,243 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:55:41,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:55:41,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332420066] [2025-03-04 07:55:41,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332420066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:55:41,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:55:41,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:55:41,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207106867] [2025-03-04 07:55:41,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:55:41,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:55:41,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:55:41,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:55:41,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:55:41,244 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-03-04 07:55:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:55:41,709 INFO L93 Difference]: Finished difference Result 1486 states and 1850 transitions. [2025-03-04 07:55:41,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:55:41,710 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-03-04 07:55:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:55:41,714 INFO L225 Difference]: With dead ends: 1486 [2025-03-04 07:55:41,714 INFO L226 Difference]: Without dead ends: 1486 [2025-03-04 07:55:41,715 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-03-04 07:55:41,716 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.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:55:41,716 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.4s Time] [2025-03-04 07:55:41,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2025-03-04 07:55:41,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1276. [2025-03-04 07:55:41,742 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-03-04 07:55:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1748 transitions. [2025-03-04 07:55:41,745 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1748 transitions. Word has length 24 [2025-03-04 07:55:41,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:55:41,746 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1748 transitions. [2025-03-04 07:55:41,746 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-03-04 07:55:41,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1748 transitions. [2025-03-04 07:55:41,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:55:41,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:55:41,746 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:55:41,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:55:41,747 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-03-04 07:55:41,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:55:41,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1775123446, now seen corresponding path program 1 times [2025-03-04 07:55:41,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:55:41,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603378875] [2025-03-04 07:55:41,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:55:41,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:55:43,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:55:43,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:55:43,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:55:43,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:55:43,933 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:55:43,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:55:43,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603378875] [2025-03-04 07:55:43,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603378875] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:55:43,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273806111] [2025-03-04 07:55:43,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:55:43,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:55:43,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:55:43,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:55:43,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:55:46,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:55:46,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:55:46,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:55:46,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:55:46,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 5674 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:55:46,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:55:46,494 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:55:46,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:55:46,561 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:55:46,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273806111] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:55:46,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:55:46,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 07:55:46,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495422991] [2025-03-04 07:55:46,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:55:46,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:55:46,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:55:46,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:55:46,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:55:46,562 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-03-04 07:55:46,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:55:46,700 INFO L93 Difference]: Finished difference Result 1294 states and 1766 transitions. [2025-03-04 07:55:46,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:55:46,701 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-03-04 07:55:46,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:55:46,706 INFO L225 Difference]: With dead ends: 1294 [2025-03-04 07:55:46,706 INFO L226 Difference]: Without dead ends: 1294 [2025-03-04 07:55:46,707 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-03-04 07:55:46,708 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-03-04 07:55:46,709 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-03-04 07:55:46,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2025-03-04 07:55:46,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2025-03-04 07:55:46,736 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-03-04 07:55:46,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1766 transitions. [2025-03-04 07:55:46,740 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1766 transitions. Word has length 24 [2025-03-04 07:55:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:55:46,741 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1766 transitions. [2025-03-04 07:55:46,741 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-03-04 07:55:46,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1766 transitions. [2025-03-04 07:55:46,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:55:46,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:55:46,742 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:55:46,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:55:46,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 07:55:46,943 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-03-04 07:55:46,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:55:46,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2109337546, now seen corresponding path program 2 times [2025-03-04 07:55:46,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:55:46,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38151555] [2025-03-04 07:55:46,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:55:46,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:55:48,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 07:55:48,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-03-04 07:55:48,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:55:48,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:55:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 07:55:49,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:55:49,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38151555] [2025-03-04 07:55:49,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38151555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:55:49,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:55:49,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:55:49,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423020850] [2025-03-04 07:55:49,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:55:49,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:55:49,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:55:49,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:55:49,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:55:49,265 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-03-04 07:55:50,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:55:51,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:55:51,185 INFO L93 Difference]: Finished difference Result 1350 states and 1778 transitions. [2025-03-04 07:55:51,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:55:51,186 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-03-04 07:55:51,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:55:51,189 INFO L225 Difference]: With dead ends: 1350 [2025-03-04 07:55:51,189 INFO L226 Difference]: Without dead ends: 1350 [2025-03-04 07:55:51,190 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-03-04 07:55:51,190 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 255 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 07:55:51,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1572 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 07:55:51,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2025-03-04 07:55:51,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1292. [2025-03-04 07:55:51,207 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-03-04 07:55:51,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1764 transitions. [2025-03-04 07:55:51,210 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1764 transitions. Word has length 42 [2025-03-04 07:55:51,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:55:51,210 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 1764 transitions. [2025-03-04 07:55:51,210 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-03-04 07:55:51,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1764 transitions. [2025-03-04 07:55:51,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 07:55:51,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:55:51,212 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-03-04 07:55:51,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:55:51,212 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-03-04 07:55:51,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:55:51,213 INFO L85 PathProgramCache]: Analyzing trace with hash -191873309, now seen corresponding path program 1 times [2025-03-04 07:55:51,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:55:51,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687623754] [2025-03-04 07:55:51,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:55:51,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:55:52,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 07:55:53,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 07:55:53,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:55:53,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:55:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 07:55:53,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:55:53,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687623754] [2025-03-04 07:55:53,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687623754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:55:53,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:55:53,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:55:53,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559195312] [2025-03-04 07:55:53,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:55:53,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:55:53,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:55:53,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:55:53,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:55:53,386 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-03-04 07:55:53,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:55:53,421 INFO L93 Difference]: Finished difference Result 1291 states and 1761 transitions. [2025-03-04 07:55:53,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:55:53,421 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-03-04 07:55:53,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:55:53,426 INFO L225 Difference]: With dead ends: 1291 [2025-03-04 07:55:53,426 INFO L226 Difference]: Without dead ends: 1291 [2025-03-04 07:55:53,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:55:53,427 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-03-04 07:55:53,427 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-03-04 07:55:53,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2025-03-04 07:55:53,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2025-03-04 07:55:53,449 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-03-04 07:55:53,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1761 transitions. [2025-03-04 07:55:53,454 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1761 transitions. Word has length 66 [2025-03-04 07:55:53,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:55:53,454 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1761 transitions. [2025-03-04 07:55:53,454 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-03-04 07:55:53,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1761 transitions. [2025-03-04 07:55:53,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 07:55:53,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:55:53,456 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-03-04 07:55:53,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:55:53,456 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-03-04 07:55:53,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:55:53,456 INFO L85 PathProgramCache]: Analyzing trace with hash 294358723, now seen corresponding path program 1 times [2025-03-04 07:55:53,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:55:53,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846116823] [2025-03-04 07:55:53,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:55:53,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:55:55,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 07:55:55,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 07:55:55,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:55:55,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:55:55,618 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 07:55:55,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:55:55,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846116823] [2025-03-04 07:55:55,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846116823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:55:55,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:55:55,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:55:55,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15764133] [2025-03-04 07:55:55,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:55:55,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:55:55,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:55:55,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:55:55,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:55:55,625 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-03-04 07:55:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:55:56,767 INFO L93 Difference]: Finished difference Result 1290 states and 1760 transitions. [2025-03-04 07:55:56,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:55:56,768 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-03-04 07:55:56,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:55:56,772 INFO L225 Difference]: With dead ends: 1290 [2025-03-04 07:55:56,772 INFO L226 Difference]: Without dead ends: 1290 [2025-03-04 07:55:56,772 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-03-04 07:55:56,773 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 1 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.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, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:55:56,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1420 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 07:55:56,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-03-04 07:55:56,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2025-03-04 07:55:56,789 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-03-04 07:55:56,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1760 transitions. [2025-03-04 07:55:56,794 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1760 transitions. Word has length 68 [2025-03-04 07:55:56,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:55:56,795 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 1760 transitions. [2025-03-04 07:55:56,795 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-03-04 07:55:56,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1760 transitions. [2025-03-04 07:55:56,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 07:55:56,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:55:56,796 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-03-04 07:55:56,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:55:56,797 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-03-04 07:55:56,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:55:56,797 INFO L85 PathProgramCache]: Analyzing trace with hash 294358724, now seen corresponding path program 1 times [2025-03-04 07:55:56,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:55:56,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266426475] [2025-03-04 07:55:56,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:55:56,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:55:58,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 07:55:58,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 07:55:58,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:55:58,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:55:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 07:55:59,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:55:59,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266426475] [2025-03-04 07:55:59,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266426475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:55:59,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:55:59,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:55:59,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510030921] [2025-03-04 07:55:59,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:55:59,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:55:59,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:55:59,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:55:59,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:55:59,439 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-03-04 07:56:00,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:56:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:00,739 INFO L93 Difference]: Finished difference Result 1289 states and 1759 transitions. [2025-03-04 07:56:00,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:56:00,739 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-03-04 07:56:00,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:00,742 INFO L225 Difference]: With dead ends: 1289 [2025-03-04 07:56:00,742 INFO L226 Difference]: Without dead ends: 1289 [2025-03-04 07:56:00,742 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-03-04 07:56:00,743 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 809 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:00,743 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.3s Time] [2025-03-04 07:56:00,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2025-03-04 07:56:00,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1289. [2025-03-04 07:56:00,757 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-03-04 07:56:00,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1759 transitions. [2025-03-04 07:56:00,759 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1759 transitions. Word has length 68 [2025-03-04 07:56:00,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:00,760 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1759 transitions. [2025-03-04 07:56:00,760 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-03-04 07:56:00,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1759 transitions. [2025-03-04 07:56:00,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 07:56:00,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:00,760 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-03-04 07:56:00,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:56:00,761 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-03-04 07:56:00,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:00,761 INFO L85 PathProgramCache]: Analyzing trace with hash 95286464, now seen corresponding path program 1 times [2025-03-04 07:56:00,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:00,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880342503] [2025-03-04 07:56:00,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:00,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:02,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 07:56:02,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 07:56:02,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:02,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:02,818 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 07:56:02,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:02,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880342503] [2025-03-04 07:56:02,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880342503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:02,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:02,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:56:02,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103268101] [2025-03-04 07:56:02,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:02,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:56:02,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:02,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:56:02,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:56:02,820 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-03-04 07:56:04,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:56:04,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:04,372 INFO L93 Difference]: Finished difference Result 1330 states and 1768 transitions. [2025-03-04 07:56:04,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:56:04,372 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-03-04 07:56:04,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:04,376 INFO L225 Difference]: With dead ends: 1330 [2025-03-04 07:56:04,376 INFO L226 Difference]: Without dead ends: 1318 [2025-03-04 07:56:04,376 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-03-04 07:56:04,377 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 95 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:04,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1378 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 07:56:04,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2025-03-04 07:56:04,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1285. [2025-03-04 07:56:04,393 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-03-04 07:56:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1752 transitions. [2025-03-04 07:56:04,396 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1752 transitions. Word has length 73 [2025-03-04 07:56:04,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:04,396 INFO L471 AbstractCegarLoop]: Abstraction has 1285 states and 1752 transitions. [2025-03-04 07:56:04,396 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-03-04 07:56:04,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1752 transitions. [2025-03-04 07:56:04,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 07:56:04,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:04,397 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-03-04 07:56:04,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:56:04,397 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-03-04 07:56:04,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:04,398 INFO L85 PathProgramCache]: Analyzing trace with hash -661748068, now seen corresponding path program 1 times [2025-03-04 07:56:04,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:04,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448780460] [2025-03-04 07:56:04,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:04,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:06,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 07:56:06,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 07:56:06,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:06,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 07:56:07,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:07,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448780460] [2025-03-04 07:56:07,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448780460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:07,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:07,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:56:07,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216346632] [2025-03-04 07:56:07,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:07,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:56:07,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:07,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:56:07,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:56:07,134 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-03-04 07:56:08,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:56:09,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:56:10,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:56:11,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:11,626 INFO L93 Difference]: Finished difference Result 1843 states and 2426 transitions. [2025-03-04 07:56:11,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:56:11,627 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-03-04 07:56:11,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:11,632 INFO L225 Difference]: With dead ends: 1843 [2025-03-04 07:56:11,632 INFO L226 Difference]: Without dead ends: 1843 [2025-03-04 07:56:11,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:56:11,632 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 802 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 1774 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:11,633 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.4s Time] [2025-03-04 07:56:11,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2025-03-04 07:56:11,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1620. [2025-03-04 07:56:11,655 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-03-04 07:56:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2324 transitions. [2025-03-04 07:56:11,658 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2324 transitions. Word has length 77 [2025-03-04 07:56:11,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:11,659 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 2324 transitions. [2025-03-04 07:56:11,659 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-03-04 07:56:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2324 transitions. [2025-03-04 07:56:11,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 07:56:11,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:11,659 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-03-04 07:56:11,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:56:11,659 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-03-04 07:56:11,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:11,660 INFO L85 PathProgramCache]: Analyzing trace with hash -661748067, now seen corresponding path program 1 times [2025-03-04 07:56:11,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:11,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345473405] [2025-03-04 07:56:11,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:11,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:13,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 07:56:13,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 07:56:13,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:13,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:14,558 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 07:56:14,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:14,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345473405] [2025-03-04 07:56:14,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345473405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:14,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:14,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:56:14,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254657438] [2025-03-04 07:56:14,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:14,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:56:14,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:14,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:56:14,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:56:14,561 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-03-04 07:56:15,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:56:17,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:56:18,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:56:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:20,235 INFO L93 Difference]: Finished difference Result 2050 states and 2659 transitions. [2025-03-04 07:56:20,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:56:20,235 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-03-04 07:56:20,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:56:20,240 INFO L225 Difference]: With dead ends: 2050 [2025-03-04 07:56:20,240 INFO L226 Difference]: Without dead ends: 2050 [2025-03-04 07:56:20,240 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-03-04 07:56:20,241 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 1037 mSDsluCounter, 2054 mSDsCounter, 0 mSdLazyCounter, 2455 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s 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.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:56:20,241 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.6s Time] [2025-03-04 07:56:20,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2025-03-04 07:56:20,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 1804. [2025-03-04 07:56:20,263 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-03-04 07:56:20,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2631 transitions. [2025-03-04 07:56:20,268 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2631 transitions. Word has length 77 [2025-03-04 07:56:20,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:56:20,268 INFO L471 AbstractCegarLoop]: Abstraction has 1804 states and 2631 transitions. [2025-03-04 07:56:20,268 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-03-04 07:56:20,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2631 transitions. [2025-03-04 07:56:20,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 07:56:20,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:56:20,269 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-03-04 07:56:20,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:56:20,269 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-03-04 07:56:20,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:56:20,270 INFO L85 PathProgramCache]: Analyzing trace with hash -649358766, now seen corresponding path program 1 times [2025-03-04 07:56:20,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:56:20,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850243355] [2025-03-04 07:56:20,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:56:20,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:56:22,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 07:56:22,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 07:56:22,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:56:22,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:56:22,521 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 07:56:22,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:56:22,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850243355] [2025-03-04 07:56:22,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850243355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:56:22,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:56:22,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:56:22,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299083312] [2025-03-04 07:56:22,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:56:22,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:56:22,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:56:22,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:56:22,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:56:22,522 INFO L87 Difference]: Start difference. First operand 1804 states and 2631 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 07:56:22,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:56:22,906 INFO L93 Difference]: Finished difference Result 1996 states and 2716 transitions. [2025-03-04 07:56:22,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:56:22,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 80 [2025-03-04 07:56:22,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted.