./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_outl.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 345f2c82068eea48aca6314e15d35413af585b08222f0693277bcfbc8625f6ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:36:36,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:36:36,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:36:36,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:36:36,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:36:36,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:36:36,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:36:36,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:36:36,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:36:36,644 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:36:36,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:36:36,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:36:36,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:36:36,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:36:36,646 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:36:36,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:36:36,646 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:36:36,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:36:36,646 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:36:36,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:36:36,647 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:36:36,647 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:36:36,647 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:36:36,647 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:36:36,647 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:36:36,647 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:36:36,647 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:36:36,647 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:36:36,647 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:36:36,648 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:36:36,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:36:36,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:36:36,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:36:36,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:36:36,648 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:36:36,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:36:36,649 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:36:36,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:36:36,649 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:36:36,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:36:36,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:36:36,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:36:36,649 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 345f2c82068eea48aca6314e15d35413af585b08222f0693277bcfbc8625f6ae [2025-02-06 10:36:36,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:36:36,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:36:36,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:36:36,953 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:36:36,953 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:36:36,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_outl.i [2025-02-06 10:36:38,358 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4477eecfd/ba743297fbbf47ed84bc204e2c256cfb/FLAGa5cefee4e [2025-02-06 10:36:38,845 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:36:38,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_outl.i [2025-02-06 10:36:38,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4477eecfd/ba743297fbbf47ed84bc204e2c256cfb/FLAGa5cefee4e [2025-02-06 10:36:38,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4477eecfd/ba743297fbbf47ed84bc204e2c256cfb [2025-02-06 10:36:38,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:36:38,901 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:36:38,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:36:38,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:36:38,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:36:38,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:36:38" (1/1) ... [2025-02-06 10:36:38,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@447f8446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:36:38, skipping insertion in model container [2025-02-06 10:36:38,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:36:38" (1/1) ... [2025-02-06 10:36:38,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:36:39,711 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:36:39,739 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:36:39,768 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:36:39,900 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:36:39,944 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:36:39,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:36:40,002 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:36:40,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:36:40,401 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:36:40,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:36:40 WrapperNode [2025-02-06 10:36:40,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:36:40,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:36:40,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:36:40,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:36:40,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:36:40" (1/1) ... [2025-02-06 10:36:40,478 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:36:40" (1/1) ... [2025-02-06 10:36:40,639 INFO L138 Inliner]: procedures = 473, calls = 2667, calls flagged for inlining = 55, calls inlined = 37, statements flattened = 3342 [2025-02-06 10:36:40,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:36:40,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:36:40,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:36:40,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:36:40,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:36:40" (1/1) ... [2025-02-06 10:36:40,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:36:40" (1/1) ... [2025-02-06 10:36:40,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:36:40" (1/1) ... [2025-02-06 10:36:40,771 INFO L175 MemorySlicer]: Split 2024 memory accesses to 27 slices as follows [5, 16, 3, 35, 1040, 3, 480, 59, 35, 11, 5, 15, 120, 67, 12, 37, 2, 5, 20, 2, 4, 2, 18, 21, 5, 2, 0]. 51 percent of accesses are in the largest equivalence class. The 1901 initializations are split as follows [3, 5, 3, 15, 1040, 0, 480, 59, 32, 2, 1, 10, 120, 67, 6, 25, 2, 4, 4, 0, 4, 0, 18, 0, 1, 0, 0]. The 58 writes are split as follows [0, 8, 0, 6, 0, 0, 0, 0, 0, 5, 1, 2, 0, 0, 6, 0, 0, 0, 4, 1, 0, 0, 0, 21, 2, 2, 0]. [2025-02-06 10:36:40,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:36:40" (1/1) ... [2025-02-06 10:36:40,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:36:40" (1/1) ... [2025-02-06 10:36:40,863 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:36:40" (1/1) ... [2025-02-06 10:36:40,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:36:40" (1/1) ... [2025-02-06 10:36:40,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:36:40" (1/1) ... [2025-02-06 10:36:40,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:36:40" (1/1) ... [2025-02-06 10:36:40,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:36:40,934 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:36:40,935 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:36:40,935 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:36:40,936 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:36:40" (1/1) ... [2025-02-06 10:36:40,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:36:40,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:36:40,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:36:40,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:36:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure zf_timer_off [2025-02-06 10:36:40,996 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_timer_off [2025-02-06 10:36:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 10:36:40,996 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_begin [2025-02-06 10:36:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-02-06 10:36:40,997 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-02-06 10:36:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:36:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-02-06 10:36:40,997 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-02-06 10:36:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 10:36:40,997 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_end [2025-02-06 10:36:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure zf_get_control [2025-02-06 10:36:40,997 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_get_control [2025-02-06 10:36:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 10:36:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 10:36:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 10:36:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 10:36:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 10:36:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 10:36:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 10:36:40,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 10:36:40,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-06 10:36:40,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-06 10:36:40,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-06 10:36:40,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-06 10:36:41,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-06 10:36:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-06 10:36:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-06 10:36:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-06 10:36:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-06 10:36:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-06 10:36:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-06 10:36:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-06 10:36:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-02-06 10:36:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-02-06 10:36:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-02-06 10:36:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-02-06 10:36:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2025-02-06 10:36:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2025-02-06 10:36:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2025-02-06 10:36:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:36:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-02-06 10:36:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:36:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure request_region [2025-02-06 10:36:41,003 INFO L138 BoogieDeclarations]: Found implementation of procedure request_region [2025-02-06 10:36:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:36:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:36:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:36:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 10:36:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 10:36:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 10:36:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 10:36:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 10:36:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 10:36:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 10:36:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 10:36:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 10:36:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-06 10:36:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-06 10:36:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-06 10:36:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-06 10:36:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-06 10:36:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-06 10:36:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-06 10:36:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-06 10:36:41,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-06 10:36:41,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-02-06 10:36:41,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-02-06 10:36:41,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-02-06 10:36:41,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-02-06 10:36:41,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2025-02-06 10:36:41,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2025-02-06 10:36:41,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2025-02-06 10:36:41,007 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 10:36:41,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 10:36:41,007 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irqsave [2025-02-06 10:36:41,007 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irqsave [2025-02-06 10:36:41,007 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-02-06 10:36:41,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-02-06 10:36:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure release_region [2025-02-06 10:36:41,008 INFO L138 BoogieDeclarations]: Found implementation of procedure release_region [2025-02-06 10:36:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:36:41,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:36:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_init [2025-02-06 10:36:41,008 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_init [2025-02-06 10:36:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 10:36:41,008 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 10:36:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-02-06 10:36:41,008 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-02-06 10:36:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:36:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:36:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:36:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 10:36:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 10:36:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 10:36:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 10:36:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 10:36:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 10:36:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-02-06 10:36:41,009 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_add [2025-02-06 10:36:41,009 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_add [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-02-06 10:36:41,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 10:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#25 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#26 [2025-02-06 10:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-02-06 10:36:41,010 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-02-06 10:36:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2025-02-06 10:36:41,013 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2025-02-06 10:36:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2025-02-06 10:36:41,014 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2025-02-06 10:36:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2025-02-06 10:36:41,014 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2025-02-06 10:36:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure assert_context_process [2025-02-06 10:36:41,014 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_context_process [2025-02-06 10:36:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure zf_set_control [2025-02-06 10:36:41,014 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_set_control [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-02-06 10:36:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure zf_readw [2025-02-06 10:36:41,016 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_readw [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure zf_ping [2025-02-06 10:36:41,016 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_ping [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-02-06 10:36:41,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-02-06 10:36:41,016 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-06 10:36:41,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-06 10:36:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-06 10:36:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-06 10:36:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-06 10:36:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-06 10:36:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-02-06 10:36:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-02-06 10:36:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-02-06 10:36:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-02-06 10:36:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-02-06 10:36:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-02-06 10:36:41,528 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:36:41,531 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:36:41,803 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3245: havoc get_user_#t~nondet671#1; [2025-02-06 10:36:41,823 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1508: havoc #t~ret200; [2025-02-06 10:36:41,840 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1470: havoc #t~ret199#1; [2025-02-06 10:36:41,841 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3961: havoc inw_#t~nondet753#1; [2025-02-06 10:36:41,953 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3269: havoc copy_to_user_#t~nondet674#1; [2025-02-06 10:36:41,954 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3261: havoc put_user_#t~nondet673#1; [2025-02-06 10:36:42,123 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1705: havoc zf_open_#t~ret218#1; [2025-02-06 10:36:42,124 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4510: havoc test_and_set_bit_#t~bitwise794#1; [2025-02-06 10:36:47,218 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3504: havoc misc_register_#t~ret713#1; [2025-02-06 10:36:47,401 INFO L? ?]: Removed 648 outVars from TransFormulas that were not future-live. [2025-02-06 10:36:47,401 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:36:47,461 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:36:47,464 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:36:47,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:36:47 BoogieIcfgContainer [2025-02-06 10:36:47,464 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:36:47,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:36:47,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:36:47,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:36:47,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:36:38" (1/3) ... [2025-02-06 10:36:47,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48413451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:36:47, skipping insertion in model container [2025-02-06 10:36:47,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:36:40" (2/3) ... [2025-02-06 10:36:47,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48413451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:36:47, skipping insertion in model container [2025-02-06 10:36:47,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:36:47" (3/3) ... [2025-02-06 10:36:47,474 INFO L128 eAbstractionObserver]: Analyzing ICFG ddv_machzwd_outl.i [2025-02-06 10:36:47,489 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:36:47,492 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-02-06 10:36:47,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:36:47,558 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;@5ee2e86b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:36:47,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 205 error locations. [2025-02-06 10:36:47,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 697 states, 387 states have (on average 1.7881136950904393) internal successors, (692), 598 states have internal predecessors, (692), 78 states have call successors, (78), 26 states have call predecessors, (78), 26 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-06 10:36:47,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 10:36:47,574 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:47,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 10:36:47,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:36:47,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:47,580 INFO L85 PathProgramCache]: Analyzing trace with hash 926720359, now seen corresponding path program 1 times [2025-02-06 10:36:47,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:47,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276275349] [2025-02-06 10:36:47,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:47,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:49,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 10:36:50,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 10:36:50,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:50,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:51,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:36:51,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:51,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276275349] [2025-02-06 10:36:51,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276275349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:36:51,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:36:51,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:36:51,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061367298] [2025-02-06 10:36:51,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:36:51,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:36:51,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:51,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:36:51,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:36:51,496 INFO L87 Difference]: Start difference. First operand has 697 states, 387 states have (on average 1.7881136950904393) internal successors, (692), 598 states have internal predecessors, (692), 78 states have call successors, (78), 26 states have call predecessors, (78), 26 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:36:52,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:36:54,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:36:54,981 INFO L93 Difference]: Finished difference Result 1261 states and 1525 transitions. [2025-02-06 10:36:54,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:36:54,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-06 10:36:54,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:36:54,995 INFO L225 Difference]: With dead ends: 1261 [2025-02-06 10:36:54,995 INFO L226 Difference]: Without dead ends: 1257 [2025-02-06 10:36:54,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:36:54,998 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 723 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:36:54,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 2501 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-06 10:36:55,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2025-02-06 10:36:55,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1044. [2025-02-06 10:36:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 651 states have (on average 1.771121351766513) internal successors, (1153), 873 states have internal predecessors, (1153), 138 states have call successors, (138), 50 states have call predecessors, (138), 50 states have return successors, (138), 131 states have call predecessors, (138), 138 states have call successors, (138) [2025-02-06 10:36:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1429 transitions. [2025-02-06 10:36:55,120 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1429 transitions. Word has length 5 [2025-02-06 10:36:55,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:36:55,121 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1429 transitions. [2025-02-06 10:36:55,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:36:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1429 transitions. [2025-02-06 10:36:55,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 10:36:55,121 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:36:55,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 10:36:55,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:36:55,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting spin_lock_initErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:36:55,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:36:55,122 INFO L85 PathProgramCache]: Analyzing trace with hash 926720360, now seen corresponding path program 1 times [2025-02-06 10:36:55,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:36:55,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179605876] [2025-02-06 10:36:55,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:36:55,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:36:57,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 10:36:57,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 10:36:57,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:36:57,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:36:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:36:58,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:36:58,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179605876] [2025-02-06 10:36:58,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179605876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:36:58,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:36:58,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:36:58,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174565586] [2025-02-06 10:36:58,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:36:58,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:36:58,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:58,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:36:58,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:36:58,614 INFO L87 Difference]: Start difference. First operand 1044 states and 1429 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:36:59,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:37:01,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:37:02,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:02,346 INFO L93 Difference]: Finished difference Result 1183 states and 1531 transitions. [2025-02-06 10:37:02,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:37:02,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-06 10:37:02,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:02,358 INFO L225 Difference]: With dead ends: 1183 [2025-02-06 10:37:02,359 INFO L226 Difference]: Without dead ends: 1183 [2025-02-06 10:37:02,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:37:02,360 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 279 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s 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.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:02,360 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.6s Time] [2025-02-06 10:37:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-02-06 10:37:02,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1124. [2025-02-06 10:37:02,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 699 states have (on average 1.7353361945636623) internal successors, (1213), 922 states have internal predecessors, (1213), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2025-02-06 10:37:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1527 transitions. [2025-02-06 10:37:02,418 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1527 transitions. Word has length 5 [2025-02-06 10:37:02,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:02,418 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1527 transitions. [2025-02-06 10:37:02,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:37:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1527 transitions. [2025-02-06 10:37:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:37:02,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:02,419 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:02,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:37:02,420 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr163REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:37:02,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:02,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1147177173, now seen corresponding path program 1 times [2025-02-06 10:37:02,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:02,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636761015] [2025-02-06 10:37:02,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:02,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:04,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:37:04,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:37:04,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:04,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:37:04,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:04,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636761015] [2025-02-06 10:37:04,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636761015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:04,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:04,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:37:04,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589812243] [2025-02-06 10:37:04,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:04,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:37:04,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:04,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:37:04,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:37:04,850 INFO L87 Difference]: Start difference. First operand 1124 states and 1527 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:37:05,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:05,394 INFO L93 Difference]: Finished difference Result 1330 states and 1614 transitions. [2025-02-06 10:37:05,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:37:05,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-06 10:37:05,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:05,401 INFO L225 Difference]: With dead ends: 1330 [2025-02-06 10:37:05,401 INFO L226 Difference]: Without dead ends: 1330 [2025-02-06 10:37:05,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:37:05,402 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 705 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:05,403 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.5s Time] [2025-02-06 10:37:05,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-02-06 10:37:05,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1123. [2025-02-06 10:37:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 699 states have (on average 1.7281831187410586) internal successors, (1208), 921 states have internal predecessors, (1208), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2025-02-06 10:37:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1522 transitions. [2025-02-06 10:37:05,445 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1522 transitions. Word has length 11 [2025-02-06 10:37:05,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:05,446 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1522 transitions. [2025-02-06 10:37:05,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:37:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1522 transitions. [2025-02-06 10:37:05,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:37:05,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:05,446 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:05,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:37:05,447 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr164REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:37:05,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:05,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1147177172, now seen corresponding path program 1 times [2025-02-06 10:37:05,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:05,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559733375] [2025-02-06 10:37:05,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:05,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:07,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:37:07,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:37:07,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:07,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:08,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:37:08,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:08,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559733375] [2025-02-06 10:37:08,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559733375] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:08,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:08,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:37:08,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928605221] [2025-02-06 10:37:08,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:08,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:37:08,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:08,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:37:08,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:37:08,141 INFO L87 Difference]: Start difference. First operand 1123 states and 1522 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:37:09,731 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-02-06 10:37:10,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:10,411 INFO L93 Difference]: Finished difference Result 1187 states and 1537 transitions. [2025-02-06 10:37:10,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:37:10,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-06 10:37:10,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:10,416 INFO L225 Difference]: With dead ends: 1187 [2025-02-06 10:37:10,417 INFO L226 Difference]: Without dead ends: 1187 [2025-02-06 10:37:10,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:37:10,418 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 277 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:10,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 2100 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-06 10:37:10,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-02-06 10:37:10,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1126. [2025-02-06 10:37:10,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 702 states have (on average 1.725071225071225) internal successors, (1211), 924 states have internal predecessors, (1211), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2025-02-06 10:37:10,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1525 transitions. [2025-02-06 10:37:10,449 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1525 transitions. Word has length 11 [2025-02-06 10:37:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:10,449 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1525 transitions. [2025-02-06 10:37:10,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:37:10,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1525 transitions. [2025-02-06 10:37:10,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:37:10,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:10,450 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:10,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:37:10,450 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr164REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:37:10,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:10,451 INFO L85 PathProgramCache]: Analyzing trace with hash -499489766, now seen corresponding path program 1 times [2025-02-06 10:37:10,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:10,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573736197] [2025-02-06 10:37:10,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:10,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:12,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:37:12,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:37:12,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:12,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:37:13,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:13,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573736197] [2025-02-06 10:37:13,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573736197] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:13,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829924042] [2025-02-06 10:37:13,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:13,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:13,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:13,315 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:37:13,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:37:15,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:37:16,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:37:16,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:16,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:16,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 5614 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 10:37:16,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:37:16,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:37:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:37:16,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829924042] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:37:16,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:37:16,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 11 [2025-02-06 10:37:16,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890018207] [2025-02-06 10:37:16,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:37:16,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:37:16,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:16,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:37:16,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:37:16,445 INFO L87 Difference]: Start difference. First operand 1126 states and 1525 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:37:18,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:37:21,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:37:22,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:37:23,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:37:26,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:37:28,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:28,408 INFO L93 Difference]: Finished difference Result 1402 states and 1775 transitions. [2025-02-06 10:37:28,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:37:28,409 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 14 [2025-02-06 10:37:28,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:28,415 INFO L225 Difference]: With dead ends: 1402 [2025-02-06 10:37:28,415 INFO L226 Difference]: Without dead ends: 1402 [2025-02-06 10:37:28,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:37:28,416 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 745 mSDsluCounter, 4261 mSDsCounter, 0 mSdLazyCounter, 2564 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s 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, 11.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:28,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 5139 Invalid, 2711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2564 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2025-02-06 10:37:28,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-02-06 10:37:28,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1278. [2025-02-06 10:37:28,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 812 states have (on average 1.7105911330049262) internal successors, (1389), 1035 states have internal predecessors, (1389), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-02-06 10:37:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1757 transitions. [2025-02-06 10:37:28,454 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1757 transitions. Word has length 14 [2025-02-06 10:37:28,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:28,455 INFO L471 AbstractCegarLoop]: Abstraction has 1278 states and 1757 transitions. [2025-02-06 10:37:28,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:37:28,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1757 transitions. [2025-02-06 10:37:28,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:37:28,456 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:28,456 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:28,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 10:37:28,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:28,657 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr161REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:37:28,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:28,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1775123445, now seen corresponding path program 1 times [2025-02-06 10:37:28,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:28,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807050579] [2025-02-06 10:37:28,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:28,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:30,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:37:30,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:37:30,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:30,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 10:37:30,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:30,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807050579] [2025-02-06 10:37:30,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807050579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:30,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:30,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:37:30,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072514844] [2025-02-06 10:37:30,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:30,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:37:30,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:30,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:37:30,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:37:30,781 INFO L87 Difference]: Start difference. First operand 1278 states and 1757 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:37:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:31,382 INFO L93 Difference]: Finished difference Result 1486 states and 1850 transitions. [2025-02-06 10:37:31,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:37:31,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-02-06 10:37:31,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:31,388 INFO L225 Difference]: With dead ends: 1486 [2025-02-06 10:37:31,388 INFO L226 Difference]: Without dead ends: 1486 [2025-02-06 10:37:31,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:37:31,389 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 691 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:31,389 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.6s Time] [2025-02-06 10:37:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2025-02-06 10:37:31,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1276. [2025-02-06 10:37:31,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 812 states have (on average 1.6995073891625616) internal successors, (1380), 1033 states have internal predecessors, (1380), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-02-06 10:37:31,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1748 transitions. [2025-02-06 10:37:31,430 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1748 transitions. Word has length 24 [2025-02-06 10:37:31,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:31,430 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1748 transitions. [2025-02-06 10:37:31,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:37:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1748 transitions. [2025-02-06 10:37:31,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:37:31,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:31,431 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:31,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:37:31,431 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr162REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:37:31,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:31,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1775123446, now seen corresponding path program 1 times [2025-02-06 10:37:31,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:31,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030780380] [2025-02-06 10:37:31,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:31,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:33,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:37:33,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:37:33,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:33,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:37:33,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:33,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030780380] [2025-02-06 10:37:33,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030780380] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:33,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977805616] [2025-02-06 10:37:33,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:33,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:33,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:33,797 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:37:33,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:37:35,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:37:36,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:37:36,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:36,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:36,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 5674 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 10:37:36,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:37:36,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:37:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:37:36,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977805616] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:37:36,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:37:36,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 10:37:36,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139865140] [2025-02-06 10:37:36,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:37:36,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 10:37:36,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:36,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 10:37:36,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:37:36,523 INFO L87 Difference]: Start difference. First operand 1276 states and 1748 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:37:36,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:36,676 INFO L93 Difference]: Finished difference Result 1294 states and 1766 transitions. [2025-02-06 10:37:36,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:37:36,677 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-02-06 10:37:36,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:36,683 INFO L225 Difference]: With dead ends: 1294 [2025-02-06 10:37:36,683 INFO L226 Difference]: Without dead ends: 1294 [2025-02-06 10:37:36,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:37:36,685 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 13 mSDsluCounter, 3232 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4044 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:36,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4044 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:37:36,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2025-02-06 10:37:36,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2025-02-06 10:37:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 830 states have (on average 1.6843373493975904) internal successors, (1398), 1051 states have internal predecessors, (1398), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-02-06 10:37:36,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1766 transitions. [2025-02-06 10:37:36,723 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1766 transitions. Word has length 24 [2025-02-06 10:37:36,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:36,724 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1766 transitions. [2025-02-06 10:37:36,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:37:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1766 transitions. [2025-02-06 10:37:36,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:37:36,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:36,725 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:36,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:37:36,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:36,926 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr162REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:37:36,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:36,927 INFO L85 PathProgramCache]: Analyzing trace with hash -2109337546, now seen corresponding path program 2 times [2025-02-06 10:37:36,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:36,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026761627] [2025-02-06 10:37:36,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:37:36,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:38,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-02-06 10:37:38,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-02-06 10:37:38,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 10:37:38,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:39,335 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 10:37:39,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:39,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026761627] [2025-02-06 10:37:39,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026761627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:39,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:39,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:37:39,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949638587] [2025-02-06 10:37:39,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:39,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:37:39,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:39,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:37:39,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:37:39,336 INFO L87 Difference]: Start difference. First operand 1294 states and 1766 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:37:43,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:37:43,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:43,865 INFO L93 Difference]: Finished difference Result 1350 states and 1778 transitions. [2025-02-06 10:37:43,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:37:43,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2025-02-06 10:37:43,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:43,870 INFO L225 Difference]: With dead ends: 1350 [2025-02-06 10:37:43,870 INFO L226 Difference]: Without dead ends: 1350 [2025-02-06 10:37:43,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:37:43,870 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 255 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:43,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1572 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-06 10:37:43,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2025-02-06 10:37:43,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1292. [2025-02-06 10:37:43,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 830 states have (on average 1.6819277108433734) internal successors, (1396), 1049 states have internal predecessors, (1396), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-02-06 10:37:43,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1764 transitions. [2025-02-06 10:37:43,899 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1764 transitions. Word has length 42 [2025-02-06 10:37:43,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:43,899 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 1764 transitions. [2025-02-06 10:37:43,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:37:43,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1764 transitions. [2025-02-06 10:37:43,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 10:37:43,901 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:43,902 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:43,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:37:43,902 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr157REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:37:43,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:43,902 INFO L85 PathProgramCache]: Analyzing trace with hash -191873309, now seen corresponding path program 1 times [2025-02-06 10:37:43,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:43,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599056570] [2025-02-06 10:37:43,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:43,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:45,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 10:37:45,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 10:37:45,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:45,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:46,082 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 10:37:46,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:46,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599056570] [2025-02-06 10:37:46,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599056570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:46,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:46,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:37:46,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604042040] [2025-02-06 10:37:46,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:46,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:37:46,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:46,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:37:46,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:37:46,085 INFO L87 Difference]: Start difference. First operand 1292 states and 1764 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:37:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:46,126 INFO L93 Difference]: Finished difference Result 1291 states and 1761 transitions. [2025-02-06 10:37:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:37:46,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 66 [2025-02-06 10:37:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:46,132 INFO L225 Difference]: With dead ends: 1291 [2025-02-06 10:37:46,132 INFO L226 Difference]: Without dead ends: 1291 [2025-02-06 10:37:46,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:37:46,133 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 814 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:46,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 815 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:37:46,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2025-02-06 10:37:46,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2025-02-06 10:37:46,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 829 states have (on average 1.6803377563329311) internal successors, (1393), 1048 states have internal predecessors, (1393), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-02-06 10:37:46,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1761 transitions. [2025-02-06 10:37:46,165 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1761 transitions. Word has length 66 [2025-02-06 10:37:46,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:46,165 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1761 transitions. [2025-02-06 10:37:46,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:37:46,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1761 transitions. [2025-02-06 10:37:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 10:37:46,168 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:46,169 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:46,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:37:46,169 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr157REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:37:46,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:46,170 INFO L85 PathProgramCache]: Analyzing trace with hash 294358723, now seen corresponding path program 1 times [2025-02-06 10:37:46,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:46,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191829955] [2025-02-06 10:37:46,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:46,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:47,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 10:37:47,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 10:37:47,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:47,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:48,350 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 10:37:48,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:48,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191829955] [2025-02-06 10:37:48,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191829955] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:48,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:48,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:37:48,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855881815] [2025-02-06 10:37:48,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:48,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:37:48,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:48,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:37:48,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:37:48,353 INFO L87 Difference]: Start difference. First operand 1291 states and 1761 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 10:37:49,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:49,633 INFO L93 Difference]: Finished difference Result 1290 states and 1760 transitions. [2025-02-06 10:37:49,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:37:49,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2025-02-06 10:37:49,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:49,638 INFO L225 Difference]: With dead ends: 1290 [2025-02-06 10:37:49,638 INFO L226 Difference]: Without dead ends: 1290 [2025-02-06 10:37:49,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:37:49,639 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 1 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:49,639 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.3s Time] [2025-02-06 10:37:49,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-02-06 10:37:49,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2025-02-06 10:37:49,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 829 states have (on average 1.6791314837153197) internal successors, (1392), 1047 states have internal predecessors, (1392), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-02-06 10:37:49,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1760 transitions. [2025-02-06 10:37:49,665 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1760 transitions. Word has length 68 [2025-02-06 10:37:49,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:49,665 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 1760 transitions. [2025-02-06 10:37:49,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 10:37:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1760 transitions. [2025-02-06 10:37:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 10:37:49,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:49,666 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:49,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:37:49,666 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr158REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:37:49,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:49,667 INFO L85 PathProgramCache]: Analyzing trace with hash 294358724, now seen corresponding path program 1 times [2025-02-06 10:37:49,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:49,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195881202] [2025-02-06 10:37:49,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:49,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:51,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 10:37:51,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 10:37:51,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:51,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:52,558 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 10:37:52,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:52,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195881202] [2025-02-06 10:37:52,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195881202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:52,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:52,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:37:52,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354783019] [2025-02-06 10:37:52,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:52,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:37:52,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:52,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:37:52,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:37:52,562 INFO L87 Difference]: Start difference. First operand 1290 states and 1760 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:37:53,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:37:54,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:54,081 INFO L93 Difference]: Finished difference Result 1289 states and 1759 transitions. [2025-02-06 10:37:54,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:37:54,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 68 [2025-02-06 10:37:54,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:54,086 INFO L225 Difference]: With dead ends: 1289 [2025-02-06 10:37:54,087 INFO L226 Difference]: Without dead ends: 1289 [2025-02-06 10:37:54,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:37:54,087 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 809 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:54,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1423 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 10:37:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2025-02-06 10:37:54,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1289. [2025-02-06 10:37:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 829 states have (on average 1.677925211097708) internal successors, (1391), 1046 states have internal predecessors, (1391), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-02-06 10:37:54,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1759 transitions. [2025-02-06 10:37:54,133 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1759 transitions. Word has length 68 [2025-02-06 10:37:54,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:54,134 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1759 transitions. [2025-02-06 10:37:54,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:37:54,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1759 transitions. [2025-02-06 10:37:54,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 10:37:54,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:54,137 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:54,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:37:54,137 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:37:54,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:54,138 INFO L85 PathProgramCache]: Analyzing trace with hash 95286464, now seen corresponding path program 1 times [2025-02-06 10:37:54,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:54,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463800419] [2025-02-06 10:37:54,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:54,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:55,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 10:37:56,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 10:37:56,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:56,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:56,256 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-06 10:37:56,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:56,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463800419] [2025-02-06 10:37:56,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463800419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:56,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:56,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:37:56,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775670309] [2025-02-06 10:37:56,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:56,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:37:56,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:56,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:37:56,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:37:56,258 INFO L87 Difference]: Start difference. First operand 1289 states and 1759 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 10:37:58,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:37:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:58,389 INFO L93 Difference]: Finished difference Result 1330 states and 1768 transitions. [2025-02-06 10:37:58,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:37:58,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 73 [2025-02-06 10:37:58,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:58,394 INFO L225 Difference]: With dead ends: 1330 [2025-02-06 10:37:58,394 INFO L226 Difference]: Without dead ends: 1318 [2025-02-06 10:37:58,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:37:58,394 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 95 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:58,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1378 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-06 10:37:58,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2025-02-06 10:37:58,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1285. [2025-02-06 10:37:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 827 states have (on average 1.6783555018137848) internal successors, (1388), 1044 states have internal predecessors, (1388), 183 states have call successors, (183), 79 states have call predecessors, (183), 78 states have return successors, (181), 174 states have call predecessors, (181), 181 states have call successors, (181) [2025-02-06 10:37:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1752 transitions. [2025-02-06 10:37:58,421 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1752 transitions. Word has length 73 [2025-02-06 10:37:58,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:58,422 INFO L471 AbstractCegarLoop]: Abstraction has 1285 states and 1752 transitions. [2025-02-06 10:37:58,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 10:37:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1752 transitions. [2025-02-06 10:37:58,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 10:37:58,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:58,423 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:58,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:37:58,423 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-06 10:37:58,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:58,424 INFO L85 PathProgramCache]: Analyzing trace with hash -661748068, now seen corresponding path program 1 times [2025-02-06 10:37:58,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:58,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309052215] [2025-02-06 10:37:58,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:58,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms