./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_outw_p.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 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_outw_p.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b53e6434f29888ec2b0851eb0bdc5bf356c532d72069865339d3ff2265f37df --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:39:20,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:39:20,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:39:20,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:39:20,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:39:20,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:39:20,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:39:20,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:39:20,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:39:20,826 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:39:20,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:39:20,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:39:20,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:39:20,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:39:20,827 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:39:20,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:39:20,827 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:39:20,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:39:20,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:39:20,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:39:20,828 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:39:20,828 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:39:20,828 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:39:20,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:39:20,828 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:39:20,828 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:39:20,828 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:39:20,828 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:39:20,828 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:39:20,828 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:39:20,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:39:20,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:39:20,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:39:20,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:39:20,829 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:39:20,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:39:20,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:39:20,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:39:20,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:39:20,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:39:20,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:39:20,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:39:20,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:39:20,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:39:20,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:39:20,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:39:20,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:39:20,830 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 -> 7b53e6434f29888ec2b0851eb0bdc5bf356c532d72069865339d3ff2265f37df [2025-01-09 22:39:21,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:39:21,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:39:21,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:39:21,031 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:39:21,032 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:39:21,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_outw_p.i [2025-01-09 22:39:22,207 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb7c6f50d/e5f746cf53a1406ca21c16cb79f73861/FLAG19ad697fb [2025-01-09 22:39:22,608 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:39:22,609 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_outw_p.i [2025-01-09 22:39:22,632 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb7c6f50d/e5f746cf53a1406ca21c16cb79f73861/FLAG19ad697fb [2025-01-09 22:39:22,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb7c6f50d/e5f746cf53a1406ca21c16cb79f73861 [2025-01-09 22:39:22,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:39:22,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:39:22,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:39:22,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:39:22,788 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:39:22,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:39:22" (1/1) ... [2025-01-09 22:39:22,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@349b2610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:39:22, skipping insertion in model container [2025-01-09 22:39:22,789 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:39:22" (1/1) ... [2025-01-09 22:39:22,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:39:23,409 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:39:23,422 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:39:23,433 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:39:23,473 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:39:23,491 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:39:23,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:39:23,539 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:39:23,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:39:23,844 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:39:23,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:39:23 WrapperNode [2025-01-09 22:39:23,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:39:23,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:39:23,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:39:23,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:39:23,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:39:23" (1/1) ... [2025-01-09 22:39:23,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:39:23" (1/1) ... [2025-01-09 22:39:24,000 INFO L138 Inliner]: procedures = 473, calls = 2667, calls flagged for inlining = 55, calls inlined = 37, statements flattened = 3342 [2025-01-09 22:39:24,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:39:24,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:39:24,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:39:24,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:39:24,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:39:23" (1/1) ... [2025-01-09 22:39:24,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:39:23" (1/1) ... [2025-01-09 22:39:24,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:39:23" (1/1) ... [2025-01-09 22:39:24,132 INFO L175 MemorySlicer]: Split 2024 memory accesses to 27 slices as follows [5, 2, 3, 2, 35, 1040, 480, 59, 35, 11, 5, 15, 120, 67, 0, 2, 20, 16, 4, 5, 2, 18, 3, 12, 21, 5, 37]. 51 percent of accesses are in the largest equivalence class. The 1901 initializations are split as follows [3, 0, 3, 0, 15, 1040, 480, 59, 32, 2, 1, 10, 120, 67, 0, 2, 4, 5, 4, 4, 0, 18, 0, 6, 0, 1, 25]. The 58 writes are split as follows [0, 1, 0, 2, 6, 0, 0, 0, 0, 5, 1, 2, 0, 0, 0, 0, 4, 8, 0, 0, 0, 0, 0, 6, 21, 2, 0]. [2025-01-09 22:39:24,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:39:23" (1/1) ... [2025-01-09 22:39:24,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:39:23" (1/1) ... [2025-01-09 22:39:24,201 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:39:23" (1/1) ... [2025-01-09 22:39:24,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:39:23" (1/1) ... [2025-01-09 22:39:24,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:39:23" (1/1) ... [2025-01-09 22:39:24,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:39:23" (1/1) ... [2025-01-09 22:39:24,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:39:23" (1/1) ... [2025-01-09 22:39:24,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:39:24,276 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:39:24,276 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:39:24,276 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:39:24,277 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:39:23" (1/1) ... [2025-01-09 22:39:24,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:39:24,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:39:24,304 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-01-09 22:39:24,306 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-01-09 22:39:24,332 INFO L130 BoogieDeclarations]: Found specification of procedure zf_timer_off [2025-01-09 22:39:24,333 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_timer_off [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 22:39:24,333 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_begin [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-01-09 22:39:24,333 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-01-09 22:39:24,333 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 22:39:24,333 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_end [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure zf_get_control [2025-01-09 22:39:24,333 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_get_control [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-09 22:39:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-01-09 22:39:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-01-09 22:39:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-01-09 22:39:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-01-09 22:39:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:39:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure request_region [2025-01-09 22:39:24,335 INFO L138 BoogieDeclarations]: Found implementation of procedure request_region [2025-01-09 22:39:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:39:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:39:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:39:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 22:39:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 22:39:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 22:39:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 22:39:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 22:39:24,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 22:39:24,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 22:39:24,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 22:39:24,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 22:39:24,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 22:39:24,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irqsave [2025-01-09 22:39:24,337 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irqsave [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-01-09 22:39:24,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure release_region [2025-01-09 22:39:24,337 INFO L138 BoogieDeclarations]: Found implementation of procedure release_region [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:39:24,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_init [2025-01-09 22:39:24,337 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_init [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 22:39:24,337 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-01-09 22:39:24,337 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:39:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:39:24,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:39:24,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:39:24,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 22:39:24,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 22:39:24,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 22:39:24,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 22:39:24,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 22:39:24,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 22:39:24,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 22:39:24,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 22:39:24,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 22:39:24,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 22:39:24,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 22:39:24,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 22:39:24,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 22:39:24,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 22:39:24,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-09 22:39:24,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-09 22:39:24,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-01-09 22:39:24,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-01-09 22:39:24,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-01-09 22:39:24,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-01-09 22:39:24,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-01-09 22:39:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2025-01-09 22:39:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2025-01-09 22:39:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2025-01-09 22:39:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-01-09 22:39:24,343 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-01-09 22:39:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_add [2025-01-09 22:39:24,343 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_add [2025-01-09 22:39:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-01-09 22:39:24,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-01-09 22:39:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 22:39:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 22:39:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#25 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#26 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 22:39:24,344 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2025-01-09 22:39:24,344 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2025-01-09 22:39:24,344 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2025-01-09 22:39:24,344 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure assert_context_process [2025-01-09 22:39:24,344 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_context_process [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure zf_set_control [2025-01-09 22:39:24,344 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_set_control [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 22:39:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 22:39:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 22:39:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 22:39:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 22:39:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 22:39:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 22:39:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 22:39:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 22:39:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 22:39:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 22:39:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 22:39:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 22:39:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 22:39:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 22:39:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-09 22:39:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-01-09 22:39:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-01-09 22:39:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-01-09 22:39:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-01-09 22:39:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-01-09 22:39:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure zf_readw [2025-01-09 22:39:24,348 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_readw [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure zf_ping [2025-01-09 22:39:24,348 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_ping [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-01-09 22:39:24,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-01-09 22:39:24,348 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-01-09 22:39:24,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 22:39:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 22:39:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-01-09 22:39:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-01-09 22:39:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-01-09 22:39:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-01-09 22:39:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-01-09 22:39:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-01-09 22:39:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-01-09 22:39:24,660 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:39:24,662 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:39:29,115 INFO L? ?]: Removed 648 outVars from TransFormulas that were not future-live. [2025-01-09 22:39:29,115 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:39:29,144 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:39:29,144 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 22:39:29,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:39:29 BoogieIcfgContainer [2025-01-09 22:39:29,144 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:39:29,146 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:39:29,146 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:39:29,148 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:39:29,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:39:22" (1/3) ... [2025-01-09 22:39:29,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613dd8a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:39:29, skipping insertion in model container [2025-01-09 22:39:29,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:39:23" (2/3) ... [2025-01-09 22:39:29,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613dd8a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:39:29, skipping insertion in model container [2025-01-09 22:39:29,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:39:29" (3/3) ... [2025-01-09 22:39:29,153 INFO L128 eAbstractionObserver]: Analyzing ICFG ddv_machzwd_outw_p.i [2025-01-09 22:39:29,162 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:39:29,165 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ddv_machzwd_outw_p.i that has 29 procedures, 701 locations, 1 initial locations, 4 loop locations, and 205 error locations. [2025-01-09 22:39:29,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:39:29,199 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;@423c6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:39:29,199 INFO L334 AbstractCegarLoop]: Starting to check reachability of 205 error locations. [2025-01-09 22:39:29,203 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-01-09 22:39:29,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:39:29,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:29,206 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:39:29,206 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:29,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:29,214 INFO L85 PathProgramCache]: Analyzing trace with hash 451259655, now seen corresponding path program 1 times [2025-01-09 22:39:29,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:29,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644239529] [2025-01-09 22:39:29,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:29,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:31,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:39:31,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:39:31,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:31,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:32,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:39:32,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:32,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644239529] [2025-01-09 22:39:32,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644239529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:32,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:32,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:39:32,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948935300] [2025-01-09 22:39:32,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:32,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:39:32,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:32,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:39:32,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:39:32,465 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-01-09 22:39:34,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:36,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:37,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:37,603 INFO L93 Difference]: Finished difference Result 1261 states and 1525 transitions. [2025-01-09 22:39:37,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:39:37,605 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-01-09 22:39:37,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:37,616 INFO L225 Difference]: With dead ends: 1261 [2025-01-09 22:39:37,618 INFO L226 Difference]: Without dead ends: 1257 [2025-01-09 22:39:37,619 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-01-09 22:39:37,621 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 723 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 2543 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:37,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 2543 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-01-09 22:39:37,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2025-01-09 22:39:37,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1044. [2025-01-09 22:39:37,699 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-01-09 22:39:37,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1429 transitions. [2025-01-09 22:39:37,707 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1429 transitions. Word has length 5 [2025-01-09 22:39:37,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:37,707 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1429 transitions. [2025-01-09 22:39:37,707 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-01-09 22:39:37,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1429 transitions. [2025-01-09 22:39:37,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:39:37,708 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:37,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:39:37,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:39:37,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:37,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:37,709 INFO L85 PathProgramCache]: Analyzing trace with hash 451259656, now seen corresponding path program 1 times [2025-01-09 22:39:37,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:37,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635336943] [2025-01-09 22:39:37,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:37,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:39,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:39:39,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:39:39,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:39,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:39:40,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:40,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635336943] [2025-01-09 22:39:40,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635336943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:40,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:40,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:39:40,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799726771] [2025-01-09 22:39:40,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:40,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:39:40,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:40,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:39:40,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:39:40,374 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-01-09 22:39:41,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:43,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:43,369 INFO L93 Difference]: Finished difference Result 1183 states and 1531 transitions. [2025-01-09 22:39:43,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:39:43,369 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-01-09 22:39:43,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:43,374 INFO L225 Difference]: With dead ends: 1183 [2025-01-09 22:39:43,374 INFO L226 Difference]: Without dead ends: 1183 [2025-01-09 22:39:43,374 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-01-09 22:39:43,375 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 279 mSDsluCounter, 1924 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 2807 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:43,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 2807 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-09 22:39:43,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-01-09 22:39:43,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1124. [2025-01-09 22:39:43,396 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-01-09 22:39:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1527 transitions. [2025-01-09 22:39:43,402 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1527 transitions. Word has length 5 [2025-01-09 22:39:43,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:43,402 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1527 transitions. [2025-01-09 22:39:43,402 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-01-09 22:39:43,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1527 transitions. [2025-01-09 22:39:43,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:39:43,403 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:43,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:43,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:39:43,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:43,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:43,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2014150784, now seen corresponding path program 1 times [2025-01-09 22:39:43,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:43,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175913588] [2025-01-09 22:39:43,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:43,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:45,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:39:45,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:39:45,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:45,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:39:45,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:45,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175913588] [2025-01-09 22:39:45,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175913588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:45,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:45,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:39:45,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264678820] [2025-01-09 22:39:45,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:45,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:39:45,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:45,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:39:45,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:39:45,580 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-01-09 22:39:46,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:46,044 INFO L93 Difference]: Finished difference Result 1330 states and 1614 transitions. [2025-01-09 22:39:46,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:39:46,045 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-01-09 22:39:46,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:46,050 INFO L225 Difference]: With dead ends: 1330 [2025-01-09 22:39:46,052 INFO L226 Difference]: Without dead ends: 1330 [2025-01-09 22:39:46,052 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-01-09 22:39:46,052 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 705 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:46,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1336 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:39:46,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-01-09 22:39:46,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1123. [2025-01-09 22:39:46,075 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-01-09 22:39:46,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1522 transitions. [2025-01-09 22:39:46,080 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1522 transitions. Word has length 11 [2025-01-09 22:39:46,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:46,080 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1522 transitions. [2025-01-09 22:39:46,080 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-01-09 22:39:46,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1522 transitions. [2025-01-09 22:39:46,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:39:46,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:46,081 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:46,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:39:46,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:46,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:46,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2014150785, now seen corresponding path program 1 times [2025-01-09 22:39:46,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:46,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267552172] [2025-01-09 22:39:46,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:46,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:47,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:39:47,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:39:47,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:47,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:48,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:39:48,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:48,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267552172] [2025-01-09 22:39:48,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267552172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:48,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:48,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:39:48,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152877198] [2025-01-09 22:39:48,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:48,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:39:48,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:48,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:39:48,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:39:48,443 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-01-09 22:39:52,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:52,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:52,919 INFO L93 Difference]: Finished difference Result 1187 states and 1537 transitions. [2025-01-09 22:39:52,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:39:52,919 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-01-09 22:39:52,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:52,923 INFO L225 Difference]: With dead ends: 1187 [2025-01-09 22:39:52,923 INFO L226 Difference]: Without dead ends: 1187 [2025-01-09 22:39:52,924 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-01-09 22:39:52,924 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 277 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:52,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 2127 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-01-09 22:39:52,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-01-09 22:39:52,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1126. [2025-01-09 22:39:52,942 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-01-09 22:39:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1525 transitions. [2025-01-09 22:39:52,946 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1525 transitions. Word has length 11 [2025-01-09 22:39:52,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:52,947 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1525 transitions. [2025-01-09 22:39:52,947 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-01-09 22:39:52,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1525 transitions. [2025-01-09 22:39:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:39:52,947 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:52,947 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:52,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:39:52,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:52,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:52,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1421665366, now seen corresponding path program 1 times [2025-01-09 22:39:52,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:52,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715258509] [2025-01-09 22:39:52,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:52,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:54,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:39:54,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:39:54,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:54,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:55,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:39:55,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:55,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715258509] [2025-01-09 22:39:55,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715258509] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:39:55,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530998384] [2025-01-09 22:39:55,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:55,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:39:55,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:39:55,286 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-01-09 22:39:55,288 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-01-09 22:39:57,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:39:58,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:39:58,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:58,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:58,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 5614 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:39:58,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:39:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:39:58,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:39:58,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:39:58,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530998384] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:39:58,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:39:58,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 11 [2025-01-09 22:39:58,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916575746] [2025-01-09 22:39:58,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:39:58,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:39:58,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:58,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:39:58,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:39:58,275 INFO L87 Difference]: Start difference. First operand 1126 states and 1525 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:39:59,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:40:02,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:40:06,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:40:10,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:40:11,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:40:14,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:14,717 INFO L93 Difference]: Finished difference Result 1402 states and 1775 transitions. [2025-01-09 22:40:14,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:40:14,718 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-01-09 22:40:14,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:14,722 INFO L225 Difference]: With dead ends: 1402 [2025-01-09 22:40:14,723 INFO L226 Difference]: Without dead ends: 1402 [2025-01-09 22:40:14,723 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-01-09 22:40:14,723 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 745 mSDsluCounter, 4326 mSDsCounter, 0 mSdLazyCounter, 2473 mSolverCounterSat, 147 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 5213 SdHoareTripleChecker+Invalid, 2622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 2473 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:14,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 5213 Invalid, 2622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2473 Invalid, 2 Unknown, 0 Unchecked, 16.2s Time] [2025-01-09 22:40:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-01-09 22:40:14,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1278. [2025-01-09 22:40:14,748 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-01-09 22:40:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1757 transitions. [2025-01-09 22:40:14,752 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1757 transitions. Word has length 14 [2025-01-09 22:40:14,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:14,752 INFO L471 AbstractCegarLoop]: Abstraction has 1278 states and 1757 transitions. [2025-01-09 22:40:14,752 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-01-09 22:40:14,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1757 transitions. [2025-01-09 22:40:14,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:40:14,753 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:14,753 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:40:14,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 22:40:14,954 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-01-09 22:40:14,954 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:40:14,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:14,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1317601804, now seen corresponding path program 1 times [2025-01-09 22:40:14,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:14,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68355951] [2025-01-09 22:40:14,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:14,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:16,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:40:16,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:40:16,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:16,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:17,079 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:40:17,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:17,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68355951] [2025-01-09 22:40:17,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68355951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:40:17,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:40:17,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:40:17,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535187568] [2025-01-09 22:40:17,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:40:17,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:40:17,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:17,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:40:17,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:40:17,080 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-01-09 22:40:17,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:17,643 INFO L93 Difference]: Finished difference Result 1486 states and 1850 transitions. [2025-01-09 22:40:17,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:40:17,643 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-01-09 22:40:17,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:17,648 INFO L225 Difference]: With dead ends: 1486 [2025-01-09 22:40:17,648 INFO L226 Difference]: Without dead ends: 1486 [2025-01-09 22:40:17,648 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-01-09 22:40:17,650 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 691 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:17,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1340 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:40:17,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2025-01-09 22:40:17,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1276. [2025-01-09 22:40:17,671 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-01-09 22:40:17,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1748 transitions. [2025-01-09 22:40:17,674 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1748 transitions. Word has length 24 [2025-01-09 22:40:17,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:17,675 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1748 transitions. [2025-01-09 22:40:17,675 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-01-09 22:40:17,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1748 transitions. [2025-01-09 22:40:17,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:40:17,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:17,675 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:40:17,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:40:17,675 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:40:17,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:17,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1317601805, now seen corresponding path program 1 times [2025-01-09 22:40:17,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:17,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801259327] [2025-01-09 22:40:17,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:17,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:19,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:40:19,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:40:19,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:19,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:40:19,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:19,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801259327] [2025-01-09 22:40:19,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801259327] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:40:19,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106013547] [2025-01-09 22:40:19,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:19,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:40:19,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:40:19,799 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-01-09 22:40:19,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-01-09 22:40:21,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:40:22,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:40:22,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:22,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:22,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 5674 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 22:40:22,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:40:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:40:22,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:40:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:40:22,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106013547] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:40:22,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:40:22,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 22:40:22,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420858540] [2025-01-09 22:40:22,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:40:22,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:40:22,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:22,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:40:22,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:40:22,412 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-01-09 22:40:22,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:22,509 INFO L93 Difference]: Finished difference Result 1294 states and 1766 transitions. [2025-01-09 22:40:22,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:40:22,510 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-01-09 22:40:22,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:22,513 INFO L225 Difference]: With dead ends: 1294 [2025-01-09 22:40:22,513 INFO L226 Difference]: Without dead ends: 1294 [2025-01-09 22:40:22,513 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-01-09 22:40:22,514 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 13 mSDsluCounter, 3272 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4094 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:22,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4094 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:40:22,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2025-01-09 22:40:22,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2025-01-09 22:40:22,530 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-01-09 22:40:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1766 transitions. [2025-01-09 22:40:22,533 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1766 transitions. Word has length 24 [2025-01-09 22:40:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:22,533 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1766 transitions. [2025-01-09 22:40:22,533 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-01-09 22:40:22,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1766 transitions. [2025-01-09 22:40:22,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:40:22,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:22,534 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:40:22,550 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-01-09 22:40:22,738 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-01-09 22:40:22,738 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:40:22,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:22,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1524319213, now seen corresponding path program 2 times [2025-01-09 22:40:22,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:22,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076830813] [2025-01-09 22:40:22,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:40:22,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:24,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 22:40:24,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-01-09 22:40:24,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:40:24,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:40:25,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:25,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076830813] [2025-01-09 22:40:25,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076830813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:40:25,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:40:25,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:40:25,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370019309] [2025-01-09 22:40:25,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:40:25,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:40:25,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:25,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:40:25,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:40:25,046 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-01-09 22:40:26,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:40:26,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:26,577 INFO L93 Difference]: Finished difference Result 1350 states and 1778 transitions. [2025-01-09 22:40:26,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:40:26,578 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-01-09 22:40:26,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:26,581 INFO L225 Difference]: With dead ends: 1350 [2025-01-09 22:40:26,581 INFO L226 Difference]: Without dead ends: 1350 [2025-01-09 22:40:26,581 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-01-09 22:40:26,582 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 255 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:26,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1593 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 22:40:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2025-01-09 22:40:26,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1292. [2025-01-09 22:40:26,597 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-01-09 22:40:26,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1764 transitions. [2025-01-09 22:40:26,600 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1764 transitions. Word has length 42 [2025-01-09 22:40:26,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:26,601 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 1764 transitions. [2025-01-09 22:40:26,601 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-01-09 22:40:26,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1764 transitions. [2025-01-09 22:40:26,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 22:40:26,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:26,602 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-01-09 22:40:26,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:40:26,602 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:40:26,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:26,602 INFO L85 PathProgramCache]: Analyzing trace with hash 79929795, now seen corresponding path program 1 times [2025-01-09 22:40:26,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:26,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83870452] [2025-01-09 22:40:26,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:26,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:28,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 22:40:28,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 22:40:28,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:28,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:28,652 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-09 22:40:28,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:28,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83870452] [2025-01-09 22:40:28,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83870452] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:40:28,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:40:28,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:40:28,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821165986] [2025-01-09 22:40:28,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:40:28,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:40:28,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:28,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:40:28,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:40:28,654 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-01-09 22:40:28,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:28,672 INFO L93 Difference]: Finished difference Result 1291 states and 1761 transitions. [2025-01-09 22:40:28,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:40:28,673 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-01-09 22:40:28,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:28,676 INFO L225 Difference]: With dead ends: 1291 [2025-01-09 22:40:28,677 INFO L226 Difference]: Without dead ends: 1291 [2025-01-09 22:40:28,677 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-01-09 22:40:28,677 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 814 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:28,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 824 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:40:28,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2025-01-09 22:40:28,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2025-01-09 22:40:28,693 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-01-09 22:40:28,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1761 transitions. [2025-01-09 22:40:28,696 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1761 transitions. Word has length 66 [2025-01-09 22:40:28,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:28,697 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1761 transitions. [2025-01-09 22:40:28,697 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-01-09 22:40:28,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1761 transitions. [2025-01-09 22:40:28,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 22:40:28,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:28,698 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-01-09 22:40:28,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:40:28,698 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:40:28,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:28,698 INFO L85 PathProgramCache]: Analyzing trace with hash -506371522, now seen corresponding path program 1 times [2025-01-09 22:40:28,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:28,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707589582] [2025-01-09 22:40:28,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:28,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:30,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 22:40:30,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 22:40:30,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:30,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-09 22:40:30,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:30,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707589582] [2025-01-09 22:40:30,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707589582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:40:30,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:40:30,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:40:30,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424843578] [2025-01-09 22:40:30,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:40:30,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:40:30,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:30,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:40:30,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:40:30,698 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-01-09 22:40:32,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:40:32,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:32,670 INFO L93 Difference]: Finished difference Result 1290 states and 1760 transitions. [2025-01-09 22:40:32,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:40:32,670 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-01-09 22:40:32,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:32,673 INFO L225 Difference]: With dead ends: 1290 [2025-01-09 22:40:32,673 INFO L226 Difference]: Without dead ends: 1290 [2025-01-09 22:40:32,673 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-01-09 22:40:32,674 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 1 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:32,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1438 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 22:40:32,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-01-09 22:40:32,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2025-01-09 22:40:32,688 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-01-09 22:40:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1760 transitions. [2025-01-09 22:40:32,690 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1760 transitions. Word has length 68 [2025-01-09 22:40:32,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:32,691 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 1760 transitions. [2025-01-09 22:40:32,691 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-01-09 22:40:32,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1760 transitions. [2025-01-09 22:40:32,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 22:40:32,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:32,692 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-01-09 22:40:32,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:40:32,692 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:40:32,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:32,692 INFO L85 PathProgramCache]: Analyzing trace with hash -506371521, now seen corresponding path program 1 times [2025-01-09 22:40:32,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:32,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568112219] [2025-01-09 22:40:32,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:32,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:34,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 22:40:34,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 22:40:34,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:34,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-09 22:40:35,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:35,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568112219] [2025-01-09 22:40:35,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568112219] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:40:35,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:40:35,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:40:35,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451661723] [2025-01-09 22:40:35,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:40:35,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:40:35,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:35,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:40:35,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:40:35,349 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-01-09 22:40:36,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:40:36,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:36,765 INFO L93 Difference]: Finished difference Result 1289 states and 1759 transitions. [2025-01-09 22:40:36,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:40:36,765 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-01-09 22:40:36,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:36,769 INFO L225 Difference]: With dead ends: 1289 [2025-01-09 22:40:36,769 INFO L226 Difference]: Without dead ends: 1289 [2025-01-09 22:40:36,769 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-01-09 22:40:36,770 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 809 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:36,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1441 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 22:40:36,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2025-01-09 22:40:36,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1289. [2025-01-09 22:40:36,784 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-01-09 22:40:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1759 transitions. [2025-01-09 22:40:36,787 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1759 transitions. Word has length 68 [2025-01-09 22:40:36,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:36,787 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1759 transitions. [2025-01-09 22:40:36,787 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-01-09 22:40:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1759 transitions. [2025-01-09 22:40:36,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 22:40:36,788 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:36,788 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-01-09 22:40:36,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:40:36,788 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr164ASSERT_VIOLATIONMEMORY_LEAK === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:40:36,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:36,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1842524180, now seen corresponding path program 1 times [2025-01-09 22:40:36,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:36,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716697537] [2025-01-09 22:40:36,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:36,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:38,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 22:40:38,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 22:40:38,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:38,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-01-09 22:40:38,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:38,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716697537] [2025-01-09 22:40:38,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716697537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:40:38,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:40:38,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:40:38,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547587460] [2025-01-09 22:40:38,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:40:38,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:40:38,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:38,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:40:38,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:40:38,813 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-01-09 22:40:41,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:40:41,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:41,718 INFO L93 Difference]: Finished difference Result 1330 states and 1768 transitions. [2025-01-09 22:40:41,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:40:41,719 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-01-09 22:40:41,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:41,722 INFO L225 Difference]: With dead ends: 1330 [2025-01-09 22:40:41,723 INFO L226 Difference]: Without dead ends: 1318 [2025-01-09 22:40:41,724 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-01-09 22:40:41,724 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 95 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:41,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1396 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-09 22:40:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2025-01-09 22:40:41,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1285. [2025-01-09 22:40:41,740 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-01-09 22:40:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1752 transitions. [2025-01-09 22:40:41,743 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1752 transitions. Word has length 73 [2025-01-09 22:40:41,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:41,743 INFO L471 AbstractCegarLoop]: Abstraction has 1285 states and 1752 transitions. [2025-01-09 22:40:41,743 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-01-09 22:40:41,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1752 transitions. [2025-01-09 22:40:41,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 22:40:41,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:41,744 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-01-09 22:40:41,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:40:41,745 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:40:41,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:41,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1000086965, now seen corresponding path program 1 times [2025-01-09 22:40:41,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:41,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950731619] [2025-01-09 22:40:41,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:41,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:43,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 22:40:43,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 22:40:43,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:43,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-01-09 22:40:44,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:44,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950731619] [2025-01-09 22:40:44,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950731619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:40:44,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:40:44,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:40:44,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171712835] [2025-01-09 22:40:44,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:40:44,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:40:44,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:44,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:40:44,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:40:44,377 INFO L87 Difference]: Start difference. First operand 1285 states and 1752 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:40:46,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:40:48,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:40:49,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:40:50,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:40:50,656 INFO L93 Difference]: Finished difference Result 1843 states and 2426 transitions. [2025-01-09 22:40:50,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:40:50,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 77 [2025-01-09 22:40:50,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:40:50,661 INFO L225 Difference]: With dead ends: 1843 [2025-01-09 22:40:50,661 INFO L226 Difference]: Without dead ends: 1843 [2025-01-09 22:40:50,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:40:50,662 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 802 mSDsluCounter, 2502 mSDsCounter, 0 mSdLazyCounter, 1722 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 3195 SdHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:40:50,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 3195 Invalid, 1730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1722 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2025-01-09 22:40:50,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2025-01-09 22:40:50,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1620. [2025-01-09 22:40:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1083 states have (on average 1.7026777469990766) internal successors, (1844), 1311 states have internal predecessors, (1844), 241 states have call successors, (241), 101 states have call predecessors, (241), 100 states have return successors, (239), 225 states have call predecessors, (239), 239 states have call successors, (239) [2025-01-09 22:40:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2324 transitions. [2025-01-09 22:40:50,683 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2324 transitions. Word has length 77 [2025-01-09 22:40:50,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:40:50,683 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 2324 transitions. [2025-01-09 22:40:50,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:40:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2324 transitions. [2025-01-09 22:40:50,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 22:40:50,684 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:40:50,684 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-01-09 22:40:50,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:40:50,685 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:40:50,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:40:50,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1000086966, now seen corresponding path program 1 times [2025-01-09 22:40:50,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:40:50,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836639430] [2025-01-09 22:40:50,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:40:50,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:40:52,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 22:40:52,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 22:40:52,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:40:52,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:40:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-01-09 22:40:53,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:40:53,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836639430] [2025-01-09 22:40:53,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836639430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:40:53,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:40:53,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:40:53,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868879974] [2025-01-09 22:40:53,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:40:53,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:40:53,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:40:53,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:40:53,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:40:53,490 INFO L87 Difference]: Start difference. First operand 1620 states and 2324 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)