./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ef1ebb9985ad6dadbe7cf99c72a7d7cbd507bc2d179a6afec5353fae325d63f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:12:06,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:12:06,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:12:06,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:12:06,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:12:06,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:12:06,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:12:06,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:12:06,498 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:12:06,498 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:12:06,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:12:06,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:12:06,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:12:06,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:12:06,499 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:12:06,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:12:06,499 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:12:06,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:12:06,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:12:06,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:12:06,499 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:12:06,499 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:12:06,499 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:12:06,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:12:06,499 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:12:06,501 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:12:06,501 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:12:06,501 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:12:06,501 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:12:06,501 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:12:06,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:12:06,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:12:06,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:12:06,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:12:06,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:12:06,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:12:06,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:12:06,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:12:06,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:12:06,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:12:06,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:12:06,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:12:06,502 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ef1ebb9985ad6dadbe7cf99c72a7d7cbd507bc2d179a6afec5353fae325d63f [2025-03-09 01:12:06,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:12:06,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:12:06,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:12:06,711 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:12:06,711 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:12:06,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i [2025-03-09 01:12:07,832 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a9e450e2/1df224a600c84ac1894cdbf68a666977/FLAG01846c8d5 [2025-03-09 01:12:08,146 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:12:08,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i [2025-03-09 01:12:08,161 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a9e450e2/1df224a600c84ac1894cdbf68a666977/FLAG01846c8d5 [2025-03-09 01:12:08,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a9e450e2/1df224a600c84ac1894cdbf68a666977 [2025-03-09 01:12:08,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:12:08,388 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:12:08,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:12:08,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:12:08,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:12:08,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:12:08" (1/1) ... [2025-03-09 01:12:08,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a2629a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:08, skipping insertion in model container [2025-03-09 01:12:08,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:12:08" (1/1) ... [2025-03-09 01:12:08,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:12:08,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:12:08,945 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:12:09,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:12:09,083 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:12:09,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:09 WrapperNode [2025-03-09 01:12:09,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:12:09,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:12:09,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:12:09,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:12:09,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:09" (1/1) ... [2025-03-09 01:12:09,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:09" (1/1) ... [2025-03-09 01:12:09,148 INFO L138 Inliner]: procedures = 491, calls = 159, calls flagged for inlining = 48, calls inlined = 122, statements flattened = 1857 [2025-03-09 01:12:09,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:12:09,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:12:09,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:12:09,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:12:09,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:09" (1/1) ... [2025-03-09 01:12:09,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:09" (1/1) ... [2025-03-09 01:12:09,179 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:09" (1/1) ... [2025-03-09 01:12:09,220 INFO L175 MemorySlicer]: Split 311 memory accesses to 9 slices as follows [2, 2, 2, 80, 6, 195, 12, 4, 8]. 63 percent of accesses are in the largest equivalence class. The 54 initializations are split as follows [2, 0, 0, 20, 0, 26, 4, 0, 2]. The 95 writes are split as follows [0, 1, 1, 20, 4, 61, 4, 2, 2]. [2025-03-09 01:12:09,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:09" (1/1) ... [2025-03-09 01:12:09,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:09" (1/1) ... [2025-03-09 01:12:09,259 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:09" (1/1) ... [2025-03-09 01:12:09,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:09" (1/1) ... [2025-03-09 01:12:09,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:09" (1/1) ... [2025-03-09 01:12:09,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:09" (1/1) ... [2025-03-09 01:12:09,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:12:09,291 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:12:09,292 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:12:09,292 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:12:09,295 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:09" (1/1) ... [2025-03-09 01:12:09,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:12:09,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:12:09,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:12:09,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:12:09,343 INFO L130 BoogieDeclarations]: Found specification of procedure Stealer [2025-03-09 01:12:09,344 INFO L138 BoogieDeclarations]: Found implementation of procedure Stealer [2025-03-09 01:12:09,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:12:09,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:12:09,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:12:09,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:12:09,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:12:09,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:12:09,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 01:12:09,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 01:12:09,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-09 01:12:09,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-09 01:12:09,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-09 01:12:09,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-09 01:12:09,345 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 01:12:09,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:12:09,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 01:12:09,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 01:12:09,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 01:12:09,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 01:12:09,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-09 01:12:09,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-09 01:12:09,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-09 01:12:09,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-09 01:12:09,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-09 01:12:09,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:12:09,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:12:09,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:12:09,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 01:12:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 01:12:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 01:12:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 01:12:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 01:12:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-09 01:12:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-09 01:12:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-09 01:12:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-09 01:12:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 01:12:09,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-09 01:12:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-09 01:12:09,352 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:12:09,628 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:12:09,630 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:12:09,944 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1935: havoc ~#r~0#1.base, ~#r~0#1.offset; [2025-03-09 01:12:09,945 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1935-1: SUMMARY for call ULTIMATE.dealloc(~#r~0#1.base, ~#r~0#1.offset); srcloc: null [2025-03-09 01:12:09,945 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:09,945 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-1: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:09,945 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-7: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:09,945 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-8: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:09,945 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828: havoc readV_#t~mem39#1; [2025-03-09 01:12:09,945 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-5: havoc readV_#t~mem39#1; [2025-03-09 01:12:11,581 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:11,582 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-1: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:11,582 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-7: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:11,582 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-8: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:11,582 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-14: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:11,582 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-15: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:11,582 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-21: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:11,582 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-22: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:11,582 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-28: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:11,582 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-29: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:11,582 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-35: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:11,582 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-36: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:11,582 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-42: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:11,582 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-43: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:11,582 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-49: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:11,582 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-50: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:11,582 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-56: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:11,582 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-57: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:11,582 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828: havoc readV_#t~mem39#1; [2025-03-09 01:12:11,582 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-63: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:11,582 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-64: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:11,582 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-5: havoc readV_#t~mem39#1; [2025-03-09 01:12:11,583 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-70: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:11,583 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-71: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:11,583 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-10: havoc readV_#t~mem39#1; [2025-03-09 01:12:11,583 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-15: havoc readV_#t~mem39#1; [2025-03-09 01:12:11,583 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-77: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:11,583 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-78: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-20: havoc readV_#t~mem39#1; [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-84: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-85: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-25: havoc readV_#t~mem39#1; [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-91: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-30: havoc readV_#t~mem39#1; [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-92: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-35: havoc readV_#t~mem39#1; [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-98: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-99: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-40: havoc readV_#t~mem39#1; [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-105: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-106: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-45: havoc readV_#t~mem39#1; [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-50: havoc readV_#t~mem39#1; [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-112: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-113: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-55: havoc readV_#t~mem39#1; [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-119: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-120: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-60: havoc readV_#t~mem39#1; [2025-03-09 01:12:11,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-126: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:11,585 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-65: havoc readV_#t~mem39#1; [2025-03-09 01:12:11,585 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-127: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:11,585 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-70: havoc readV_#t~mem39#1; [2025-03-09 01:12:11,585 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-133: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-03-09 01:12:11,585 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-134: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-03-09 01:12:11,585 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-75: havoc readV_#t~mem39#1; [2025-03-09 01:12:11,586 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-80: havoc readV_#t~mem39#1; [2025-03-09 01:12:11,586 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-85: havoc readV_#t~mem39#1; [2025-03-09 01:12:11,586 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-90: havoc readV_#t~mem39#1; [2025-03-09 01:12:11,586 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-95: havoc readV_#t~mem39#1; [2025-03-09 01:12:11,586 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882: havoc Pop_~temp~2#1; [2025-03-09 01:12:11,586 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-9: havoc Pop_~temp~2#1; [2025-03-09 01:12:11,586 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888: havoc Pop_#t~ret61#1; [2025-03-09 01:12:11,586 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888-8: havoc Pop_#t~ret61#1; [2025-03-09 01:12:11,587 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1946: havoc main_~#handles~0#1.base, main_~#handles~0#1.offset; [2025-03-09 01:12:11,587 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1946-1: SUMMARY for call ULTIMATE.dealloc(main_~#handles~0#1.base, main_~#handles~0#1.offset); srcloc: null [2025-03-09 01:12:11,588 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:12:11,588 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:12:12,496 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:12:12,496 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:12:12,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:12:12 BoogieIcfgContainer [2025-03-09 01:12:12,496 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:12:12,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:12:12,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:12:12,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:12:12,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:12:08" (1/3) ... [2025-03-09 01:12:12,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6223dbd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:12:12, skipping insertion in model container [2025-03-09 01:12:12,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:09" (2/3) ... [2025-03-09 01:12:12,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6223dbd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:12:12, skipping insertion in model container [2025-03-09 01:12:12,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:12:12" (3/3) ... [2025-03-09 01:12:12,507 INFO L128 eAbstractionObserver]: Analyzing ICFG workstealqueue_mutex-2.i [2025-03-09 01:12:12,520 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:12:12,522 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG workstealqueue_mutex-2.i that has 2 procedures, 857 locations, 1 initial locations, 11 loop locations, and 520 error locations. [2025-03-09 01:12:12,523 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:12:12,667 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-09 01:12:12,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 860 places, 938 transitions, 1883 flow [2025-03-09 01:12:13,014 INFO L124 PetriNetUnfolderBase]: 154/1765 cut-off events. [2025-03-09 01:12:13,015 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:12:13,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1770 conditions, 1765 events. 154/1765 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 13306 event pairs, 0 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 907. Up to 6 conditions per place. [2025-03-09 01:12:13,030 INFO L82 GeneralOperation]: Start removeDead. Operand has 860 places, 938 transitions, 1883 flow [2025-03-09 01:12:13,061 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 860 places, 938 transitions, 1883 flow [2025-03-09 01:12:13,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:12:13,080 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;@4e938624, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:12:13,080 INFO L334 AbstractCegarLoop]: Starting to check reachability of 565 error locations. [2025-03-09 01:12:13,083 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:12:13,084 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-09 01:12:13,084 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:12:13,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:13,084 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-09 01:12:13,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr474REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 562 more)] === [2025-03-09 01:12:13,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:13,089 INFO L85 PathProgramCache]: Analyzing trace with hash 184377, now seen corresponding path program 1 times [2025-03-09 01:12:13,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:13,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923369431] [2025-03-09 01:12:13,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:13,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:13,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 01:12:13,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 01:12:13,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:13,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:12:13,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:13,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923369431] [2025-03-09 01:12:13,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923369431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:13,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:13,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:12:13,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372855914] [2025-03-09 01:12:13,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:13,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:12:13,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:13,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:12:13,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:12:13,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 938 [2025-03-09 01:12:13,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 860 places, 938 transitions, 1883 flow. Second operand has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:13,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:13,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 938 [2025-03-09 01:12:13,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:20,248 INFO L124 PetriNetUnfolderBase]: 35990/78012 cut-off events. [2025-03-09 01:12:20,251 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-03-09 01:12:20,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143494 conditions, 78012 events. 35990/78012 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 924. Compared 791143 event pairs, 8610 based on Foata normal form. 764/49329 useless extension candidates. Maximal degree in co-relation 142240. Up to 36104 conditions per place. [2025-03-09 01:12:20,607 INFO L140 encePairwiseOnDemand]: 620/938 looper letters, 943 selfloop transitions, 73 changer transitions 0/1209 dead transitions. [2025-03-09 01:12:20,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 1209 transitions, 4457 flow [2025-03-09 01:12:20,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:12:20,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:12:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2034 transitions. [2025-03-09 01:12:20,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7228144989339019 [2025-03-09 01:12:20,635 INFO L175 Difference]: Start difference. First operand has 860 places, 938 transitions, 1883 flow. Second operand 3 states and 2034 transitions. [2025-03-09 01:12:20,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 1209 transitions, 4457 flow [2025-03-09 01:12:20,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 1209 transitions, 4457 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:12:20,669 INFO L231 Difference]: Finished difference. Result has 668 places, 804 transitions, 2139 flow [2025-03-09 01:12:20,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=938, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2139, PETRI_PLACES=668, PETRI_TRANSITIONS=804} [2025-03-09 01:12:20,676 INFO L279 CegarLoopForPetriNet]: 860 programPoint places, -192 predicate places. [2025-03-09 01:12:20,676 INFO L471 AbstractCegarLoop]: Abstraction has has 668 places, 804 transitions, 2139 flow [2025-03-09 01:12:20,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:20,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:20,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-09 01:12:20,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:12:20,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr475REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 562 more)] === [2025-03-09 01:12:20,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:20,678 INFO L85 PathProgramCache]: Analyzing trace with hash 184378, now seen corresponding path program 1 times [2025-03-09 01:12:20,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:20,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101488558] [2025-03-09 01:12:20,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:20,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:20,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 01:12:20,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 01:12:20,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:20,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:12:20,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:20,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101488558] [2025-03-09 01:12:20,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101488558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:20,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:20,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:12:20,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916211176] [2025-03-09 01:12:20,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:20,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:12:20,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:20,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:12:20,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:12:21,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 938 [2025-03-09 01:12:21,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 668 places, 804 transitions, 2139 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:21,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:21,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 938 [2025-03-09 01:12:21,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:27,434 INFO L124 PetriNetUnfolderBase]: 35049/77183 cut-off events. [2025-03-09 01:12:27,435 INFO L125 PetriNetUnfolderBase]: For 7776/8088 co-relation queries the response was YES. [2025-03-09 01:12:27,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152763 conditions, 77183 events. 35049/77183 cut-off events. For 7776/8088 co-relation queries the response was YES. Maximal size of possible extension queue 933. Compared 781689 event pairs, 22562 based on Foata normal form. 2/51124 useless extension candidates. Maximal degree in co-relation 151399. Up to 62506 conditions per place. [2025-03-09 01:12:27,717 INFO L140 encePairwiseOnDemand]: 931/938 looper letters, 552 selfloop transitions, 4 changer transitions 0/816 dead transitions. [2025-03-09 01:12:27,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 816 transitions, 3279 flow [2025-03-09 01:12:27,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:12:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:12:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions. [2025-03-09 01:12:27,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43354655294953803 [2025-03-09 01:12:27,721 INFO L175 Difference]: Start difference. First operand has 668 places, 804 transitions, 2139 flow. Second operand 3 states and 1220 transitions. [2025-03-09 01:12:27,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 816 transitions, 3279 flow [2025-03-09 01:12:27,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 665 places, 816 transitions, 3131 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:12:27,761 INFO L231 Difference]: Finished difference. Result has 666 places, 804 transitions, 2011 flow [2025-03-09 01:12:27,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=938, PETRI_DIFFERENCE_MINUEND_FLOW=1987, PETRI_DIFFERENCE_MINUEND_PLACES=663, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=801, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=797, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2011, PETRI_PLACES=666, PETRI_TRANSITIONS=804} [2025-03-09 01:12:27,763 INFO L279 CegarLoopForPetriNet]: 860 programPoint places, -194 predicate places. [2025-03-09 01:12:27,763 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 804 transitions, 2011 flow [2025-03-09 01:12:27,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:27,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:27,763 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:12:27,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:12:27,764 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr470REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 562 more)] === [2025-03-09 01:12:27,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:27,764 INFO L85 PathProgramCache]: Analyzing trace with hash 177383369, now seen corresponding path program 1 times [2025-03-09 01:12:27,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:27,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663371307] [2025-03-09 01:12:27,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:27,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:27,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:12:27,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:12:27,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:27,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:27,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:12:27,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:27,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663371307] [2025-03-09 01:12:27,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663371307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:27,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:27,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:12:27,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408106179] [2025-03-09 01:12:27,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:27,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:12:27,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:27,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:12:27,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:12:28,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 938 [2025-03-09 01:12:28,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 804 transitions, 2011 flow. Second operand has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:28,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:28,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 938 [2025-03-09 01:12:28,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:35,856 INFO L124 PetriNetUnfolderBase]: 38291/82772 cut-off events. [2025-03-09 01:12:35,856 INFO L125 PetriNetUnfolderBase]: For 4701/4754 co-relation queries the response was YES. [2025-03-09 01:12:35,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164195 conditions, 82772 events. 38291/82772 cut-off events. For 4701/4754 co-relation queries the response was YES. Maximal size of possible extension queue 986. Compared 840620 event pairs, 8264 based on Foata normal form. 45/53466 useless extension candidates. Maximal degree in co-relation 162870. Up to 36171 conditions per place. [2025-03-09 01:12:36,223 INFO L140 encePairwiseOnDemand]: 785/938 looper letters, 1003 selfloop transitions, 195 changer transitions 0/1388 dead transitions. [2025-03-09 01:12:36,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 1388 transitions, 5620 flow [2025-03-09 01:12:36,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:12:36,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:12:36,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2181 transitions. [2025-03-09 01:12:36,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4650319829424307 [2025-03-09 01:12:36,228 INFO L175 Difference]: Start difference. First operand has 666 places, 804 transitions, 2011 flow. Second operand 5 states and 2181 transitions. [2025-03-09 01:12:36,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 1388 transitions, 5620 flow [2025-03-09 01:12:36,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 667 places, 1388 transitions, 5615 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:12:36,247 INFO L231 Difference]: Finished difference. Result has 670 places, 910 transitions, 3088 flow [2025-03-09 01:12:36,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=938, PETRI_DIFFERENCE_MINUEND_FLOW=2003, PETRI_DIFFERENCE_MINUEND_PLACES=663, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=802, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=660, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3088, PETRI_PLACES=670, PETRI_TRANSITIONS=910} [2025-03-09 01:12:36,248 INFO L279 CegarLoopForPetriNet]: 860 programPoint places, -190 predicate places. [2025-03-09 01:12:36,248 INFO L471 AbstractCegarLoop]: Abstraction has has 670 places, 910 transitions, 3088 flow [2025-03-09 01:12:36,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:36,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:36,248 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:12:36,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:12:36,249 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr471REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 562 more)] === [2025-03-09 01:12:36,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:36,249 INFO L85 PathProgramCache]: Analyzing trace with hash 177383370, now seen corresponding path program 1 times [2025-03-09 01:12:36,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:36,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407805409] [2025-03-09 01:12:36,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:36,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:36,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:12:36,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:12:36,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:36,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:36,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:12:36,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:36,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407805409] [2025-03-09 01:12:36,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407805409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:36,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:36,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:12:36,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901505519] [2025-03-09 01:12:36,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:36,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:12:36,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:36,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:12:36,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:12:36,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 938 [2025-03-09 01:12:36,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 670 places, 910 transitions, 3088 flow. Second operand has 4 states, 4 states have (on average 235.75) internal successors, (943), 4 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:36,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:36,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 938 [2025-03-09 01:12:36,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:44,692 INFO L124 PetriNetUnfolderBase]: 37326/82422 cut-off events. [2025-03-09 01:12:44,692 INFO L125 PetriNetUnfolderBase]: For 23374/23748 co-relation queries the response was YES. [2025-03-09 01:12:44,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177594 conditions, 82422 events. 37326/82422 cut-off events. For 23374/23748 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 844546 event pairs, 22269 based on Foata normal form. 0/58771 useless extension candidates. Maximal degree in co-relation 176130. Up to 66729 conditions per place. [2025-03-09 01:12:45,075 INFO L140 encePairwiseOnDemand]: 931/938 looper letters, 653 selfloop transitions, 6 changer transitions 0/921 dead transitions. [2025-03-09 01:12:45,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 672 places, 921 transitions, 4433 flow [2025-03-09 01:12:45,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:12:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:12:45,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1450 transitions. [2025-03-09 01:12:45,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38646055437100213 [2025-03-09 01:12:45,078 INFO L175 Difference]: Start difference. First operand has 670 places, 910 transitions, 3088 flow. Second operand 4 states and 1450 transitions. [2025-03-09 01:12:45,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 672 places, 921 transitions, 4433 flow [2025-03-09 01:12:45,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 672 places, 921 transitions, 4433 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:12:45,233 INFO L231 Difference]: Finished difference. Result has 672 places, 909 transitions, 3098 flow [2025-03-09 01:12:45,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=938, PETRI_DIFFERENCE_MINUEND_FLOW=3086, PETRI_DIFFERENCE_MINUEND_PLACES=669, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=909, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=903, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3098, PETRI_PLACES=672, PETRI_TRANSITIONS=909} [2025-03-09 01:12:45,234 INFO L279 CegarLoopForPetriNet]: 860 programPoint places, -188 predicate places. [2025-03-09 01:12:45,234 INFO L471 AbstractCegarLoop]: Abstraction has has 672 places, 909 transitions, 3098 flow [2025-03-09 01:12:45,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 235.75) internal successors, (943), 4 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:45,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:45,235 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:12:45,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:12:45,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr465REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 562 more)] === [2025-03-09 01:12:45,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:45,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1624367133, now seen corresponding path program 1 times [2025-03-09 01:12:45,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:45,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219046309] [2025-03-09 01:12:45,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:45,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:45,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:12:45,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:12:45,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:45,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:12:45,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:45,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219046309] [2025-03-09 01:12:45,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219046309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:45,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:45,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:12:45,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316404124] [2025-03-09 01:12:45,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:45,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:12:45,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:45,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:12:45,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:12:45,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 938 [2025-03-09 01:12:45,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 672 places, 909 transitions, 3098 flow. Second operand has 4 states, 4 states have (on average 270.5) internal successors, (1082), 4 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:45,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:45,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 938 [2025-03-09 01:12:45,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand