./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/libvsync/clhlock.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/libvsync/clhlock.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 bed480fb9329cf4d2bde4e192428cf2ff72174b29c5e6148c18915395bc76ca3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:15:36,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:15:37,043 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:15:37,046 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:15:37,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:15:37,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:15:37,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:15:37,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:15:37,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:15:37,067 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:15:37,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:15:37,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:15:37,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:15:37,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:15:37,067 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:15:37,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:15:37,067 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:15:37,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:15:37,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:15:37,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:15:37,067 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:15:37,067 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:15:37,067 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:15:37,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:15:37,068 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:15:37,068 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:15:37,068 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:15:37,068 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:15:37,068 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:15:37,068 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:15:37,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:15:37,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:15:37,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:15:37,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:15:37,068 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:15:37,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:15:37,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:15:37,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:15:37,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:15:37,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:15:37,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:15:37,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:15:37,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:15:37,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:15:37,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:15:37,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:15:37,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:15:37,069 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 -> bed480fb9329cf4d2bde4e192428cf2ff72174b29c5e6148c18915395bc76ca3 [2025-01-10 01:15:37,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:15:37,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:15:37,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:15:37,298 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:15:37,298 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:15:37,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/clhlock.i [2025-01-10 01:15:38,501 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/526ab0475/9d6b4f619d4a4727a6b7e53d43a0046a/FLAG3d1cb4543 [2025-01-10 01:15:39,055 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:15:39,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/clhlock.i [2025-01-10 01:15:39,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/526ab0475/9d6b4f619d4a4727a6b7e53d43a0046a/FLAG3d1cb4543 [2025-01-10 01:15:39,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/526ab0475/9d6b4f619d4a4727a6b7e53d43a0046a [2025-01-10 01:15:39,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:15:39,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:15:39,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:15:39,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:15:39,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:15:39,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:15:39" (1/1) ... [2025-01-10 01:15:39,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35585358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:39, skipping insertion in model container [2025-01-10 01:15:39,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:15:39" (1/1) ... [2025-01-10 01:15:39,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:15:40,826 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-10 01:15:40,830 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-10 01:15:40,830 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-10 01:15:40,834 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-10 01:15:40,834 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-10 01:15:40,915 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-10 01:15:40,920 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-10 01:15:41,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:15:41,142 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:15:41,204 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-01-10 01:15:41,206 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-01-10 01:15:41,206 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-01-10 01:15:41,206 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-01-10 01:15:41,207 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-01-10 01:15:41,207 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-01-10 01:15:41,207 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-01-10 01:15:41,207 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-01-10 01:15:41,208 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-01-10 01:15:41,208 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-01-10 01:15:41,208 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-01-10 01:15:41,208 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-01-10 01:15:41,209 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-01-10 01:15:41,209 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-01-10 01:15:41,209 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-01-10 01:15:41,209 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-01-10 01:15:41,210 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-01-10 01:15:41,210 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-01-10 01:15:41,210 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-01-10 01:15:41,210 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-01-10 01:15:41,210 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-01-10 01:15:41,211 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-01-10 01:15:41,211 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-01-10 01:15:41,211 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-01-10 01:15:41,211 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-01-10 01:15:41,211 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-01-10 01:15:41,211 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-01-10 01:15:41,212 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-01-10 01:15:41,212 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-01-10 01:15:41,212 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-01-10 01:15:41,212 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-01-10 01:15:41,213 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-01-10 01:15:41,213 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-01-10 01:15:41,213 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-01-10 01:15:41,213 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-01-10 01:15:41,214 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-01-10 01:15:41,214 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-01-10 01:15:41,214 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-01-10 01:15:41,214 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-01-10 01:15:41,215 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-01-10 01:15:41,215 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-01-10 01:15:41,215 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-01-10 01:15:41,216 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-01-10 01:15:41,216 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-01-10 01:15:41,216 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-01-10 01:15:41,217 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-01-10 01:15:41,217 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-01-10 01:15:41,217 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-01-10 01:15:41,218 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-01-10 01:15:41,218 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-01-10 01:15:41,218 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-01-10 01:15:41,219 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-01-10 01:15:41,219 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-01-10 01:15:41,219 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-01-10 01:15:41,220 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-01-10 01:15:41,220 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-01-10 01:15:41,220 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-01-10 01:15:41,221 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-01-10 01:15:41,221 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-01-10 01:15:41,221 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-01-10 01:15:41,223 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-01-10 01:15:41,223 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-01-10 01:15:41,223 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-01-10 01:15:41,224 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-01-10 01:15:41,224 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-01-10 01:15:41,225 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-01-10 01:15:41,226 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-01-10 01:15:41,226 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-01-10 01:15:41,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-01-10 01:15:41,229 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-01-10 01:15:41,229 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-01-10 01:15:41,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-01-10 01:15:41,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-01-10 01:15:41,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-01-10 01:15:41,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-01-10 01:15:41,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-01-10 01:15:41,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-01-10 01:15:41,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-01-10 01:15:41,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-01-10 01:15:41,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-01-10 01:15:41,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-01-10 01:15:41,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-01-10 01:15:41,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-01-10 01:15:41,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-01-10 01:15:41,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-01-10 01:15:41,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-01-10 01:15:41,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-01-10 01:15:41,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-01-10 01:15:41,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-01-10 01:15:41,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-01-10 01:15:41,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-01-10 01:15:41,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-01-10 01:15:41,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-01-10 01:15:41,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-01-10 01:15:41,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-01-10 01:15:41,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-01-10 01:15:41,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-01-10 01:15:41,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-01-10 01:15:41,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-01-10 01:15:41,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-01-10 01:15:41,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:15:41,541 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:15:41,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:41 WrapperNode [2025-01-10 01:15:41,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:15:41,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:15:41,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:15:41,544 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:15:41,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:41" (1/1) ... [2025-01-10 01:15:41,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:41" (1/1) ... [2025-01-10 01:15:41,621 INFO L138 Inliner]: procedures = 919, calls = 937, calls flagged for inlining = 820, calls inlined = 37, statements flattened = 315 [2025-01-10 01:15:41,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:15:41,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:15:41,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:15:41,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:15:41,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:41" (1/1) ... [2025-01-10 01:15:41,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:41" (1/1) ... [2025-01-10 01:15:41,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:41" (1/1) ... [2025-01-10 01:15:41,657 INFO L175 MemorySlicer]: Split 29 memory accesses to 4 slices as follows [2, 9, 16, 2]. 55 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 2, 9, 0]. The 8 writes are split as follows [0, 5, 2, 1]. [2025-01-10 01:15:41,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:41" (1/1) ... [2025-01-10 01:15:41,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:41" (1/1) ... [2025-01-10 01:15:41,672 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:41" (1/1) ... [2025-01-10 01:15:41,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:41" (1/1) ... [2025-01-10 01:15:41,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:41" (1/1) ... [2025-01-10 01:15:41,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:41" (1/1) ... [2025-01-10 01:15:41,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:41" (1/1) ... [2025-01-10 01:15:41,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:15:41,697 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:15:41,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:15:41,697 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:15:41,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:41" (1/1) ... [2025-01-10 01:15:41,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:15:41,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:41,722 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-10 01:15:41,724 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-10 01:15:41,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:15:41,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:15:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 01:15:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 01:15:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:15:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 01:15:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 01:15:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 01:15:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-10 01:15:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:15:41,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:15:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-01-10 01:15:41,740 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-01-10 01:15:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:15:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 01:15:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 01:15:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 01:15:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-10 01:15:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:15:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:15:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 01:15:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 01:15:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:15:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 01:15:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 01:15:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-10 01:15:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-10 01:15:41,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:15:41,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:15:41,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 01:15:41,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 01:15:41,743 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:15:41,883 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:15:41,885 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:15:42,406 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:15:42,407 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:15:42,590 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:15:42,590 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2025-01-10 01:15:42,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:15:42 BoogieIcfgContainer [2025-01-10 01:15:42,591 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:15:42,593 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:15:42,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:15:42,597 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:15:42,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:15:39" (1/3) ... [2025-01-10 01:15:42,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37be7597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:15:42, skipping insertion in model container [2025-01-10 01:15:42,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:41" (2/3) ... [2025-01-10 01:15:42,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37be7597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:15:42, skipping insertion in model container [2025-01-10 01:15:42,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:15:42" (3/3) ... [2025-01-10 01:15:42,599 INFO L128 eAbstractionObserver]: Analyzing ICFG clhlock.i [2025-01-10 01:15:42,614 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:15:42,616 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG clhlock.i that has 2 procedures, 141 locations, 1 initial locations, 37 loop locations, and 35 error locations. [2025-01-10 01:15:42,616 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:15:42,713 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 01:15:42,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 203 transitions, 413 flow [2025-01-10 01:15:42,801 INFO L124 PetriNetUnfolderBase]: 75/247 cut-off events. [2025-01-10 01:15:42,803 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 01:15:42,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 247 events. 75/247 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 754 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 166. Up to 6 conditions per place. [2025-01-10 01:15:42,809 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 203 transitions, 413 flow [2025-01-10 01:15:42,815 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 203 transitions, 413 flow [2025-01-10 01:15:42,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:15:42,832 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;@2e93b82c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:15:42,832 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-01-10 01:15:42,837 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:15:42,838 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-01-10 01:15:42,838 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:15:42,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:42,839 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 01:15:42,839 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:15:42,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:42,844 INFO L85 PathProgramCache]: Analyzing trace with hash 37277, now seen corresponding path program 1 times [2025-01-10 01:15:42,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:42,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374595824] [2025-01-10 01:15:42,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:42,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:42,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 01:15:42,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 01:15:42,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:42,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:43,194 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-10 01:15:43,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:43,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374595824] [2025-01-10 01:15:43,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374595824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:43,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:43,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:15:43,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103396780] [2025-01-10 01:15:43,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:43,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:43,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:43,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:43,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:43,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 203 [2025-01-10 01:15:43,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 203 transitions, 413 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-01-10 01:15:43,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:43,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 203 [2025-01-10 01:15:43,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:43,575 INFO L124 PetriNetUnfolderBase]: 487/1475 cut-off events. [2025-01-10 01:15:43,575 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:15:43,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 1475 events. 487/1475 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 9756 event pairs, 430 based on Foata normal form. 716/1893 useless extension candidates. Maximal degree in co-relation 2388. Up to 992 conditions per place. [2025-01-10 01:15:43,590 INFO L140 encePairwiseOnDemand]: 143/203 looper letters, 73 selfloop transitions, 2 changer transitions 0/143 dead transitions. [2025-01-10 01:15:43,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 143 transitions, 443 flow [2025-01-10 01:15:43,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:43,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2025-01-10 01:15:43,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5533661740558292 [2025-01-10 01:15:43,604 INFO L175 Difference]: Start difference. First operand has 144 places, 203 transitions, 413 flow. Second operand 3 states and 337 transitions. [2025-01-10 01:15:43,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 143 transitions, 443 flow [2025-01-10 01:15:43,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 143 transitions, 443 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:15:43,614 INFO L231 Difference]: Finished difference. Result has 141 places, 143 transitions, 297 flow [2025-01-10 01:15:43,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=141, PETRI_TRANSITIONS=143} [2025-01-10 01:15:43,620 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, -3 predicate places. [2025-01-10 01:15:43,621 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 143 transitions, 297 flow [2025-01-10 01:15:43,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-01-10 01:15:43,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:43,621 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 01:15:43,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:15:43,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:15:43,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:43,622 INFO L85 PathProgramCache]: Analyzing trace with hash 37278, now seen corresponding path program 1 times [2025-01-10 01:15:43,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:43,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010678150] [2025-01-10 01:15:43,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:43,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:43,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 01:15:43,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 01:15:43,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:43,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:43,793 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-10 01:15:43,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:43,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010678150] [2025-01-10 01:15:43,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010678150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:43,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:43,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:15:43,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901839347] [2025-01-10 01:15:43,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:43,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:43,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:43,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:43,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:43,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 203 [2025-01-10 01:15:43,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 143 transitions, 297 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-01-10 01:15:43,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:43,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 203 [2025-01-10 01:15:43,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:44,104 INFO L124 PetriNetUnfolderBase]: 487/1474 cut-off events. [2025-01-10 01:15:44,104 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:15:44,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2476 conditions, 1474 events. 487/1474 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 9735 event pairs, 430 based on Foata normal form. 0/1177 useless extension candidates. Maximal degree in co-relation 2464. Up to 992 conditions per place. [2025-01-10 01:15:44,109 INFO L140 encePairwiseOnDemand]: 200/203 looper letters, 72 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2025-01-10 01:15:44,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 142 transitions, 443 flow [2025-01-10 01:15:44,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:44,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:44,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2025-01-10 01:15:44,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.458128078817734 [2025-01-10 01:15:44,111 INFO L175 Difference]: Start difference. First operand has 141 places, 143 transitions, 297 flow. Second operand 3 states and 279 transitions. [2025-01-10 01:15:44,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 142 transitions, 443 flow [2025-01-10 01:15:44,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 142 transitions, 439 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:15:44,113 INFO L231 Difference]: Finished difference. Result has 140 places, 142 transitions, 295 flow [2025-01-10 01:15:44,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=295, PETRI_PLACES=140, PETRI_TRANSITIONS=142} [2025-01-10 01:15:44,114 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2025-01-10 01:15:44,114 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 142 transitions, 295 flow [2025-01-10 01:15:44,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-01-10 01:15:44,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:44,114 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:15:44,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:15:44,114 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:15:44,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:44,115 INFO L85 PathProgramCache]: Analyzing trace with hash 35864125, now seen corresponding path program 1 times [2025-01-10 01:15:44,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:44,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176544530] [2025-01-10 01:15:44,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:44,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:44,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:15:44,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:15:44,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:44,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:44,181 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-10 01:15:44,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:44,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176544530] [2025-01-10 01:15:44,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176544530] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:44,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:44,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:15:44,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839925113] [2025-01-10 01:15:44,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:44,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:15:44,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:44,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:15:44,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:15:44,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 203 [2025-01-10 01:15:44,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 142 transitions, 295 flow. Second operand has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 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-01-10 01:15:44,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:44,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 203 [2025-01-10 01:15:44,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:44,493 INFO L124 PetriNetUnfolderBase]: 487/1473 cut-off events. [2025-01-10 01:15:44,494 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:15:44,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2474 conditions, 1473 events. 487/1473 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 9755 event pairs, 430 based on Foata normal form. 0/1177 useless extension candidates. Maximal degree in co-relation 2462. Up to 988 conditions per place. [2025-01-10 01:15:44,500 INFO L140 encePairwiseOnDemand]: 199/203 looper letters, 70 selfloop transitions, 3 changer transitions 0/141 dead transitions. [2025-01-10 01:15:44,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 141 transitions, 439 flow [2025-01-10 01:15:44,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:15:44,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:15:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 346 transitions. [2025-01-10 01:15:44,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42610837438423643 [2025-01-10 01:15:44,503 INFO L175 Difference]: Start difference. First operand has 140 places, 142 transitions, 295 flow. Second operand 4 states and 346 transitions. [2025-01-10 01:15:44,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 141 transitions, 439 flow [2025-01-10 01:15:44,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 141 transitions, 435 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:15:44,505 INFO L231 Difference]: Finished difference. Result has 140 places, 141 transitions, 295 flow [2025-01-10 01:15:44,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=140, PETRI_TRANSITIONS=141} [2025-01-10 01:15:44,506 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2025-01-10 01:15:44,506 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 141 transitions, 295 flow [2025-01-10 01:15:44,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 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-01-10 01:15:44,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:44,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:15:44,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:15:44,507 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:15:44,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:44,508 INFO L85 PathProgramCache]: Analyzing trace with hash 35864126, now seen corresponding path program 1 times [2025-01-10 01:15:44,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:44,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913984754] [2025-01-10 01:15:44,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:44,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:44,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:15:44,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:15:44,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:44,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:44,648 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-10 01:15:44,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:44,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913984754] [2025-01-10 01:15:44,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913984754] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:44,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:44,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:15:44,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581675371] [2025-01-10 01:15:44,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:44,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:15:44,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:44,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:15:44,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:15:44,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 203 [2025-01-10 01:15:44,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 141 transitions, 295 flow. Second operand has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 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-01-10 01:15:44,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:44,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 203 [2025-01-10 01:15:44,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:44,983 INFO L124 PetriNetUnfolderBase]: 487/1472 cut-off events. [2025-01-10 01:15:44,983 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:15:44,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2473 conditions, 1472 events. 487/1472 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 9734 event pairs, 430 based on Foata normal form. 0/1177 useless extension candidates. Maximal degree in co-relation 2456. Up to 988 conditions per place. [2025-01-10 01:15:44,988 INFO L140 encePairwiseOnDemand]: 199/203 looper letters, 69 selfloop transitions, 3 changer transitions 0/140 dead transitions. [2025-01-10 01:15:44,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 140 transitions, 437 flow [2025-01-10 01:15:44,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:15:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:15:44,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 345 transitions. [2025-01-10 01:15:44,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4248768472906404 [2025-01-10 01:15:44,990 INFO L175 Difference]: Start difference. First operand has 140 places, 141 transitions, 295 flow. Second operand 4 states and 345 transitions. [2025-01-10 01:15:44,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 140 transitions, 437 flow [2025-01-10 01:15:44,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 140 transitions, 431 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:15:44,992 INFO L231 Difference]: Finished difference. Result has 139 places, 140 transitions, 293 flow [2025-01-10 01:15:44,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=293, PETRI_PLACES=139, PETRI_TRANSITIONS=140} [2025-01-10 01:15:44,993 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, -5 predicate places. [2025-01-10 01:15:44,993 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 140 transitions, 293 flow [2025-01-10 01:15:44,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 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-01-10 01:15:44,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:44,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:44,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:15:44,993 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:15:44,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:44,994 INFO L85 PathProgramCache]: Analyzing trace with hash -514956172, now seen corresponding path program 1 times [2025-01-10 01:15:44,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:44,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987990102] [2025-01-10 01:15:44,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:44,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:45,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:15:45,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:15:45,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:45,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:45,028 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-10 01:15:45,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:45,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987990102] [2025-01-10 01:15:45,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987990102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:45,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:45,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:15:45,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703729294] [2025-01-10 01:15:45,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:45,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:45,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:45,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:45,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:45,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 203 [2025-01-10 01:15:45,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 140 transitions, 293 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-01-10 01:15:45,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:45,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 203 [2025-01-10 01:15:45,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:45,258 INFO L124 PetriNetUnfolderBase]: 487/1473 cut-off events. [2025-01-10 01:15:45,258 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:15:45,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 1473 events. 487/1473 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 9756 event pairs, 430 based on Foata normal form. 0/1178 useless extension candidates. Maximal degree in co-relation 2458. Up to 992 conditions per place. [2025-01-10 01:15:45,265 INFO L140 encePairwiseOnDemand]: 200/203 looper letters, 71 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2025-01-10 01:15:45,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 141 transitions, 441 flow [2025-01-10 01:15:45,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:45,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2025-01-10 01:15:45,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45648604269293924 [2025-01-10 01:15:45,266 INFO L175 Difference]: Start difference. First operand has 139 places, 140 transitions, 293 flow. Second operand 3 states and 278 transitions. [2025-01-10 01:15:45,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 141 transitions, 441 flow [2025-01-10 01:15:45,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 141 transitions, 435 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:15:45,272 INFO L231 Difference]: Finished difference. Result has 139 places, 141 transitions, 299 flow [2025-01-10 01:15:45,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=299, PETRI_PLACES=139, PETRI_TRANSITIONS=141} [2025-01-10 01:15:45,274 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, -5 predicate places. [2025-01-10 01:15:45,274 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 141 transitions, 299 flow [2025-01-10 01:15:45,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-01-10 01:15:45,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:45,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:45,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:15:45,274 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:15:45,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:45,275 INFO L85 PathProgramCache]: Analyzing trace with hash 415589916, now seen corresponding path program 1 times [2025-01-10 01:15:45,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:45,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368013883] [2025-01-10 01:15:45,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:45,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:45,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:15:45,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:15:45,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:45,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:45,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:45,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368013883] [2025-01-10 01:15:45,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368013883] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:15:45,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354240486] [2025-01-10 01:15:45,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:45,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:45,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:45,340 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-10 01:15:45,342 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-10 01:15:45,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:15:45,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:15:45,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:45,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:45,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:15:45,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:15:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:45,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:15:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:45,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354240486] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:15:45,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:15:45,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-10 01:15:45,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146219055] [2025-01-10 01:15:45,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:15:45,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:15:45,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:45,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:15:45,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:15:45,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 203 [2025-01-10 01:15:45,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 141 transitions, 299 flow. Second operand has 6 states, 6 states have (on average 70.83333333333333) internal successors, (425), 6 states have internal predecessors, (425), 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-01-10 01:15:45,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:45,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 203 [2025-01-10 01:15:45,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:45,710 INFO L124 PetriNetUnfolderBase]: 487/1475 cut-off events. [2025-01-10 01:15:45,710 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 01:15:45,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2484 conditions, 1475 events. 487/1475 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 9731 event pairs, 430 based on Foata normal form. 0/1180 useless extension candidates. Maximal degree in co-relation 2456. Up to 992 conditions per place. [2025-01-10 01:15:45,716 INFO L140 encePairwiseOnDemand]: 200/203 looper letters, 71 selfloop transitions, 4 changer transitions 0/143 dead transitions. [2025-01-10 01:15:45,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 143 transitions, 457 flow [2025-01-10 01:15:45,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:15:45,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:15:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 417 transitions. [2025-01-10 01:15:45,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41083743842364534 [2025-01-10 01:15:45,718 INFO L175 Difference]: Start difference. First operand has 139 places, 141 transitions, 299 flow. Second operand 5 states and 417 transitions. [2025-01-10 01:15:45,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 143 transitions, 457 flow [2025-01-10 01:15:45,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 143 transitions, 453 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 01:15:45,722 INFO L231 Difference]: Finished difference. Result has 144 places, 143 transitions, 321 flow [2025-01-10 01:15:45,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=321, PETRI_PLACES=144, PETRI_TRANSITIONS=143} [2025-01-10 01:15:45,723 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 0 predicate places. [2025-01-10 01:15:45,724 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 143 transitions, 321 flow [2025-01-10 01:15:45,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.83333333333333) internal successors, (425), 6 states have internal predecessors, (425), 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-01-10 01:15:45,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:45,724 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:45,733 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-10 01:15:45,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:45,929 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:15:45,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:45,930 INFO L85 PathProgramCache]: Analyzing trace with hash 99340572, now seen corresponding path program 2 times [2025-01-10 01:15:45,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:45,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463812237] [2025-01-10 01:15:45,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:15:45,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:45,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:15:45,942 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-01-10 01:15:45,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:15:45,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:15:45,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:45,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463812237] [2025-01-10 01:15:45,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463812237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:45,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:45,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:15:45,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049505968] [2025-01-10 01:15:45,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:45,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:45,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:45,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:45,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:46,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 203 [2025-01-10 01:15:46,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 143 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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-01-10 01:15:46,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:46,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 203 [2025-01-10 01:15:46,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:46,255 INFO L124 PetriNetUnfolderBase]: 583/1705 cut-off events. [2025-01-10 01:15:46,256 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 01:15:46,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2909 conditions, 1705 events. 583/1705 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 11727 event pairs, 430 based on Foata normal form. 0/1394 useless extension candidates. Maximal degree in co-relation 2865. Up to 994 conditions per place. [2025-01-10 01:15:46,261 INFO L140 encePairwiseOnDemand]: 199/203 looper letters, 123 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2025-01-10 01:15:46,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 189 transitions, 663 flow [2025-01-10 01:15:46,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:46,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2025-01-10 01:15:46,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5188834154351396 [2025-01-10 01:15:46,263 INFO L175 Difference]: Start difference. First operand has 144 places, 143 transitions, 321 flow. Second operand 3 states and 316 transitions. [2025-01-10 01:15:46,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 189 transitions, 663 flow [2025-01-10 01:15:46,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 189 transitions, 653 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-01-10 01:15:46,265 INFO L231 Difference]: Finished difference. Result has 143 places, 141 transitions, 311 flow [2025-01-10 01:15:46,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=143, PETRI_TRANSITIONS=141} [2025-01-10 01:15:46,266 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, -1 predicate places. [2025-01-10 01:15:46,266 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 141 transitions, 311 flow [2025-01-10 01:15:46,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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-01-10 01:15:46,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:46,266 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:46,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:15:46,266 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:15:46,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:46,267 INFO L85 PathProgramCache]: Analyzing trace with hash 99340573, now seen corresponding path program 1 times [2025-01-10 01:15:46,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:46,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732898309] [2025-01-10 01:15:46,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:46,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:46,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:15:46,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:15:46,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:46,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:15:46,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:46,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732898309] [2025-01-10 01:15:46,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732898309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:46,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:46,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:15:46,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341994734] [2025-01-10 01:15:46,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:46,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:15:46,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:46,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:15:46,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:15:46,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 203 [2025-01-10 01:15:46,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 141 transitions, 311 flow. Second operand has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 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-01-10 01:15:46,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:46,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 203 [2025-01-10 01:15:46,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:46,770 INFO L124 PetriNetUnfolderBase]: 534/1591 cut-off events. [2025-01-10 01:15:46,771 INFO L125 PetriNetUnfolderBase]: For 57/59 co-relation queries the response was YES. [2025-01-10 01:15:46,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2741 conditions, 1591 events. 534/1591 cut-off events. For 57/59 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 10888 event pairs, 295 based on Foata normal form. 0/1287 useless extension candidates. Maximal degree in co-relation 2700. Up to 662 conditions per place. [2025-01-10 01:15:46,779 INFO L140 encePairwiseOnDemand]: 196/203 looper letters, 168 selfloop transitions, 5 changer transitions 0/237 dead transitions. [2025-01-10 01:15:46,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 237 transitions, 849 flow [2025-01-10 01:15:46,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:15:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:15:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 436 transitions. [2025-01-10 01:15:46,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5369458128078818 [2025-01-10 01:15:46,785 INFO L175 Difference]: Start difference. First operand has 143 places, 141 transitions, 311 flow. Second operand 4 states and 436 transitions. [2025-01-10 01:15:46,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 237 transitions, 849 flow [2025-01-10 01:15:46,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 237 transitions, 845 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:15:46,791 INFO L231 Difference]: Finished difference. Result has 145 places, 141 transitions, 329 flow [2025-01-10 01:15:46,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=329, PETRI_PLACES=145, PETRI_TRANSITIONS=141} [2025-01-10 01:15:46,792 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 1 predicate places. [2025-01-10 01:15:46,792 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 141 transitions, 329 flow [2025-01-10 01:15:46,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 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-01-10 01:15:46,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:46,792 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:46,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:15:46,792 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:15:46,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:46,793 INFO L85 PathProgramCache]: Analyzing trace with hash 396800093, now seen corresponding path program 1 times [2025-01-10 01:15:46,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:46,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551447855] [2025-01-10 01:15:46,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:46,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:46,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:15:46,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:15:46,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:46,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:15:46,829 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:15:46,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:15:46,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:15:46,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:46,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:15:46,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:15:46,875 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:15:46,876 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (59 of 60 remaining) [2025-01-10 01:15:46,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 60 remaining) [2025-01-10 01:15:46,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 60 remaining) [2025-01-10 01:15:46,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 60 remaining) [2025-01-10 01:15:46,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 60 remaining) [2025-01-10 01:15:46,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 60 remaining) [2025-01-10 01:15:46,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 60 remaining) [2025-01-10 01:15:46,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 60 remaining) [2025-01-10 01:15:46,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 60 remaining) [2025-01-10 01:15:46,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (50 of 60 remaining) [2025-01-10 01:15:46,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (49 of 60 remaining) [2025-01-10 01:15:46,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (48 of 60 remaining) [2025-01-10 01:15:46,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 60 remaining) [2025-01-10 01:15:46,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 60 remaining) [2025-01-10 01:15:46,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 60 remaining) [2025-01-10 01:15:46,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 60 remaining) [2025-01-10 01:15:46,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 60 remaining) [2025-01-10 01:15:46,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 60 remaining) [2025-01-10 01:15:46,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 60 remaining) [2025-01-10 01:15:46,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 60 remaining) [2025-01-10 01:15:46,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 60 remaining) [2025-01-10 01:15:46,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 60 remaining) [2025-01-10 01:15:46,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 60 remaining) [2025-01-10 01:15:46,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 60 remaining) [2025-01-10 01:15:46,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 60 remaining) [2025-01-10 01:15:46,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 60 remaining) [2025-01-10 01:15:46,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 60 remaining) [2025-01-10 01:15:46,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 60 remaining) [2025-01-10 01:15:46,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 60 remaining) [2025-01-10 01:15:46,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 60 remaining) [2025-01-10 01:15:46,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 60 remaining) [2025-01-10 01:15:46,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 60 remaining) [2025-01-10 01:15:46,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 60 remaining) [2025-01-10 01:15:46,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 60 remaining) [2025-01-10 01:15:46,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 60 remaining) [2025-01-10 01:15:46,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 60 remaining) [2025-01-10 01:15:46,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 60 remaining) [2025-01-10 01:15:46,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 60 remaining) [2025-01-10 01:15:46,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 60 remaining) [2025-01-10 01:15:46,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 60 remaining) [2025-01-10 01:15:46,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 60 remaining) [2025-01-10 01:15:46,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 60 remaining) [2025-01-10 01:15:46,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 60 remaining) [2025-01-10 01:15:46,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 60 remaining) [2025-01-10 01:15:46,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 60 remaining) [2025-01-10 01:15:46,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 60 remaining) [2025-01-10 01:15:46,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 60 remaining) [2025-01-10 01:15:46,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 60 remaining) [2025-01-10 01:15:46,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 60 remaining) [2025-01-10 01:15:46,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 60 remaining) [2025-01-10 01:15:46,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 60 remaining) [2025-01-10 01:15:46,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 60 remaining) [2025-01-10 01:15:46,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 60 remaining) [2025-01-10 01:15:46,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 60 remaining) [2025-01-10 01:15:46,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 60 remaining) [2025-01-10 01:15:46,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 60 remaining) [2025-01-10 01:15:46,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 60 remaining) [2025-01-10 01:15:46,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 60 remaining) [2025-01-10 01:15:46,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 60 remaining) [2025-01-10 01:15:46,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 60 remaining) [2025-01-10 01:15:46,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:15:46,882 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:46,884 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 01:15:46,884 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 01:15:46,971 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:15:46,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 326 transitions, 668 flow [2025-01-10 01:15:47,007 INFO L124 PetriNetUnfolderBase]: 135/447 cut-off events. [2025-01-10 01:15:47,008 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:15:47,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 447 events. 135/447 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1907 event pairs, 0 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 318. Up to 12 conditions per place. [2025-01-10 01:15:47,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 326 transitions, 668 flow [2025-01-10 01:15:47,022 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 326 transitions, 668 flow [2025-01-10 01:15:47,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:15:47,024 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;@2e93b82c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:15:47,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2025-01-10 01:15:47,025 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:15:47,026 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-01-10 01:15:47,027 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:15:47,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:47,027 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 01:15:47,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2025-01-10 01:15:47,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:47,027 INFO L85 PathProgramCache]: Analyzing trace with hash 47709, now seen corresponding path program 1 times [2025-01-10 01:15:47,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:47,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461446975] [2025-01-10 01:15:47,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:47,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:47,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 01:15:47,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 01:15:47,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:47,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:47,071 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-10 01:15:47,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:47,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461446975] [2025-01-10 01:15:47,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461446975] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:47,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:47,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:15:47,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29905783] [2025-01-10 01:15:47,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:47,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:47,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:47,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:47,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:47,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 326 [2025-01-10 01:15:47,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 326 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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-01-10 01:15:47,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:47,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 326 [2025-01-10 01:15:47,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:53,064 INFO L124 PetriNetUnfolderBase]: 45488/87899 cut-off events. [2025-01-10 01:15:53,065 INFO L125 PetriNetUnfolderBase]: For 393/405 co-relation queries the response was YES. [2025-01-10 01:15:53,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155770 conditions, 87899 events. 45488/87899 cut-off events. For 393/405 co-relation queries the response was YES. Maximal size of possible extension queue 2235. Compared 915559 event pairs, 40506 based on Foata normal form. 43431/111126 useless extension candidates. Maximal degree in co-relation 142636. Up to 67641 conditions per place. [2025-01-10 01:15:53,682 INFO L140 encePairwiseOnDemand]: 232/326 looper letters, 123 selfloop transitions, 2 changer transitions 0/232 dead transitions. [2025-01-10 01:15:53,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 232 transitions, 730 flow [2025-01-10 01:15:53,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:53,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions. [2025-01-10 01:15:53,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5501022494887525 [2025-01-10 01:15:53,688 INFO L175 Difference]: Start difference. First operand has 231 places, 326 transitions, 668 flow. Second operand 3 states and 538 transitions. [2025-01-10 01:15:53,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 232 transitions, 730 flow [2025-01-10 01:15:53,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 232 transitions, 730 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:15:53,692 INFO L231 Difference]: Finished difference. Result has 226 places, 232 transitions, 484 flow [2025-01-10 01:15:53,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=484, PETRI_PLACES=226, PETRI_TRANSITIONS=232} [2025-01-10 01:15:53,694 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, -5 predicate places. [2025-01-10 01:15:53,694 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 232 transitions, 484 flow [2025-01-10 01:15:53,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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-01-10 01:15:53,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:53,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 01:15:53,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:15:53,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2025-01-10 01:15:53,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:53,695 INFO L85 PathProgramCache]: Analyzing trace with hash 47710, now seen corresponding path program 1 times [2025-01-10 01:15:53,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:53,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157442717] [2025-01-10 01:15:53,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:53,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:53,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 01:15:53,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 01:15:53,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:53,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:53,764 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-10 01:15:53,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:53,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157442717] [2025-01-10 01:15:53,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157442717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:53,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:53,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:15:53,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120754142] [2025-01-10 01:15:53,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:53,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:53,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:53,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:53,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:53,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 326 [2025-01-10 01:15:53,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 232 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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-01-10 01:15:53,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:53,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 326 [2025-01-10 01:15:53,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:59,143 INFO L124 PetriNetUnfolderBase]: 45488/87898 cut-off events. [2025-01-10 01:15:59,143 INFO L125 PetriNetUnfolderBase]: For 393/405 co-relation queries the response was YES. [2025-01-10 01:15:59,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155771 conditions, 87898 events. 45488/87898 cut-off events. For 393/405 co-relation queries the response was YES. Maximal size of possible extension queue 2235. Compared 915556 event pairs, 40506 based on Foata normal form. 0/67695 useless extension candidates. Maximal degree in co-relation 155758. Up to 67641 conditions per place. [2025-01-10 01:15:59,581 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 122 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2025-01-10 01:15:59,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 231 transitions, 730 flow [2025-01-10 01:15:59,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2025-01-10 01:15:59,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4560327198364008 [2025-01-10 01:15:59,584 INFO L175 Difference]: Start difference. First operand has 226 places, 232 transitions, 484 flow. Second operand 3 states and 446 transitions. [2025-01-10 01:15:59,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 231 transitions, 730 flow [2025-01-10 01:15:59,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 231 transitions, 726 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:15:59,589 INFO L231 Difference]: Finished difference. Result has 225 places, 231 transitions, 482 flow [2025-01-10 01:15:59,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=225, PETRI_TRANSITIONS=231} [2025-01-10 01:15:59,590 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, -6 predicate places. [2025-01-10 01:15:59,590 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 231 transitions, 482 flow [2025-01-10 01:15:59,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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-01-10 01:15:59,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:59,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:15:59,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:15:59,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2025-01-10 01:15:59,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:59,591 INFO L85 PathProgramCache]: Analyzing trace with hash 45899709, now seen corresponding path program 1 times [2025-01-10 01:15:59,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:59,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254157617] [2025-01-10 01:15:59,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:59,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:59,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:15:59,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:15:59,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:59,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:59,659 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-10 01:15:59,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:59,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254157617] [2025-01-10 01:15:59,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254157617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:59,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:59,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:15:59,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384340963] [2025-01-10 01:15:59,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:59,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:15:59,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:59,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:15:59,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:15:59,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 326 [2025-01-10 01:15:59,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 231 transitions, 482 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 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-01-10 01:15:59,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:59,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 326 [2025-01-10 01:15:59,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:05,526 INFO L124 PetriNetUnfolderBase]: 45488/87897 cut-off events. [2025-01-10 01:16:05,527 INFO L125 PetriNetUnfolderBase]: For 393/405 co-relation queries the response was YES. [2025-01-10 01:16:05,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155769 conditions, 87897 events. 45488/87897 cut-off events. For 393/405 co-relation queries the response was YES. Maximal size of possible extension queue 2235. Compared 915542 event pairs, 40506 based on Foata normal form. 0/67695 useless extension candidates. Maximal degree in co-relation 155756. Up to 67637 conditions per place. [2025-01-10 01:16:05,907 INFO L140 encePairwiseOnDemand]: 322/326 looper letters, 120 selfloop transitions, 3 changer transitions 0/230 dead transitions. [2025-01-10 01:16:05,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 230 transitions, 726 flow [2025-01-10 01:16:05,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:16:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:16:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 552 transitions. [2025-01-10 01:16:05,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4233128834355828 [2025-01-10 01:16:05,909 INFO L175 Difference]: Start difference. First operand has 225 places, 231 transitions, 482 flow. Second operand 4 states and 552 transitions. [2025-01-10 01:16:05,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 230 transitions, 726 flow [2025-01-10 01:16:05,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 230 transitions, 722 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:16:05,912 INFO L231 Difference]: Finished difference. Result has 225 places, 230 transitions, 482 flow [2025-01-10 01:16:05,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=482, PETRI_PLACES=225, PETRI_TRANSITIONS=230} [2025-01-10 01:16:05,913 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, -6 predicate places. [2025-01-10 01:16:05,913 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 230 transitions, 482 flow [2025-01-10 01:16:05,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 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-01-10 01:16:05,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:05,913 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:16:05,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:16:05,914 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2025-01-10 01:16:05,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:05,914 INFO L85 PathProgramCache]: Analyzing trace with hash 45899710, now seen corresponding path program 1 times [2025-01-10 01:16:05,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:05,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151476887] [2025-01-10 01:16:05,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:05,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:05,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:16:05,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:16:05,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:05,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:06,006 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-10 01:16:06,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:06,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151476887] [2025-01-10 01:16:06,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151476887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:06,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:06,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:16:06,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233785250] [2025-01-10 01:16:06,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:06,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:16:06,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:06,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:16:06,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:16:06,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 326 [2025-01-10 01:16:06,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 230 transitions, 482 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 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-01-10 01:16:06,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:06,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 326 [2025-01-10 01:16:06,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:11,987 INFO L124 PetriNetUnfolderBase]: 45488/87896 cut-off events. [2025-01-10 01:16:11,988 INFO L125 PetriNetUnfolderBase]: For 393/405 co-relation queries the response was YES. [2025-01-10 01:16:12,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155768 conditions, 87896 events. 45488/87896 cut-off events. For 393/405 co-relation queries the response was YES. Maximal size of possible extension queue 2235. Compared 915622 event pairs, 40506 based on Foata normal form. 0/67695 useless extension candidates. Maximal degree in co-relation 155750. Up to 67637 conditions per place. [2025-01-10 01:16:12,439 INFO L140 encePairwiseOnDemand]: 322/326 looper letters, 119 selfloop transitions, 3 changer transitions 0/229 dead transitions. [2025-01-10 01:16:12,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 229 transitions, 724 flow [2025-01-10 01:16:12,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:16:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:16:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2025-01-10 01:16:12,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42254601226993865 [2025-01-10 01:16:12,443 INFO L175 Difference]: Start difference. First operand has 225 places, 230 transitions, 482 flow. Second operand 4 states and 551 transitions. [2025-01-10 01:16:12,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 229 transitions, 724 flow [2025-01-10 01:16:12,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 229 transitions, 718 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:16:12,450 INFO L231 Difference]: Finished difference. Result has 224 places, 229 transitions, 480 flow [2025-01-10 01:16:12,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=480, PETRI_PLACES=224, PETRI_TRANSITIONS=229} [2025-01-10 01:16:12,451 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, -7 predicate places. [2025-01-10 01:16:12,451 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 229 transitions, 480 flow [2025-01-10 01:16:12,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 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-01-10 01:16:12,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:12,452 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:12,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:16:12,452 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2025-01-10 01:16:12,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:12,453 INFO L85 PathProgramCache]: Analyzing trace with hash 63736820, now seen corresponding path program 1 times [2025-01-10 01:16:12,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:12,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994714690] [2025-01-10 01:16:12,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:12,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:12,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:16:12,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:16:12,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:12,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:12,485 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-10 01:16:12,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:12,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994714690] [2025-01-10 01:16:12,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994714690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:12,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:12,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:16:12,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666121651] [2025-01-10 01:16:12,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:12,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:12,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:12,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:12,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:12,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 326 [2025-01-10 01:16:12,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 229 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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-01-10 01:16:12,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:12,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 326 [2025-01-10 01:16:12,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand