/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/libvsync/ttaslock.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:06:57,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:06:57,423 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:06:57,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:06:57,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:06:57,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:06:57,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:06:57,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:06:57,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:06:57,453 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:06:57,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:06:57,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:06:57,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:06:57,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:06:57,453 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:06:57,453 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:06:57,453 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:06:57,453 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:06:57,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:06:57,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:06:57,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:06:57,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:06:57,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:06:57,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:06:57,454 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:06:57,454 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:06:57,454 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:06:57,454 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:06:57,454 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:06:57,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:06:57,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:06:57,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:06:57,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:06:57,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:06:57,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:06:57,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:06:57,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:06:57,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:06:57,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:06:57,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:06:57,455 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:06:57,455 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:06:57,455 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:06:57,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:06:57,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:06:57,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:06:57,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:06:57,455 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 21:06:57,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:06:57,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:06:57,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:06:57,678 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:06:57,680 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:06:57,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/libvsync/ttaslock.i [2025-04-13 21:06:58,974 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df684fd31/e4b3405a3c654705978aa251b0d05659/FLAG768f2f390 [2025-04-13 21:06:59,344 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:06:59,344 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/libvsync/ttaslock.i [2025-04-13 21:06:59,374 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df684fd31/e4b3405a3c654705978aa251b0d05659/FLAG768f2f390 [2025-04-13 21:07:00,034 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df684fd31/e4b3405a3c654705978aa251b0d05659 [2025-04-13 21:07:00,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:07:00,037 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:07:00,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:07:00,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:07:00,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:07:00,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:07:00" (1/1) ... [2025-04-13 21:07:00,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19fa955a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:00, skipping insertion in model container [2025-04-13 21:07:00,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:07:00" (1/1) ... [2025-04-13 21:07:00,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:07:01,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/ttaslock.i[193996,194009] [2025-04-13 21:07:01,645 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/ttaslock.i[194063,194076] [2025-04-13 21:07:01,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:07:01,671 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:07:01,761 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-04-13 21:07:01,763 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-04-13 21:07:01,763 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-04-13 21:07:01,765 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-04-13 21:07:01,765 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-04-13 21:07:01,766 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-04-13 21:07:01,766 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-04-13 21:07:01,766 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-04-13 21:07:01,767 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-04-13 21:07:01,767 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-04-13 21:07:01,767 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-04-13 21:07:01,767 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-04-13 21:07:01,767 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-04-13 21:07:01,769 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-04-13 21:07:01,770 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-04-13 21:07:01,770 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-04-13 21:07:01,770 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-04-13 21:07:01,770 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-04-13 21:07:01,770 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-04-13 21:07:01,771 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-04-13 21:07:01,771 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-04-13 21:07:01,771 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-04-13 21:07:01,771 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-04-13 21:07:01,771 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-04-13 21:07:01,771 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-04-13 21:07:01,772 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-04-13 21:07:01,772 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-04-13 21:07:01,772 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-04-13 21:07:01,772 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-04-13 21:07:01,774 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-04-13 21:07:01,774 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-04-13 21:07:01,775 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-04-13 21:07:01,775 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-04-13 21:07:01,776 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-04-13 21:07:01,776 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-04-13 21:07:01,776 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-04-13 21:07:01,777 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-04-13 21:07:01,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-04-13 21:07:01,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-04-13 21:07:01,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-04-13 21:07:01,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-04-13 21:07:01,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-04-13 21:07:01,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-04-13 21:07:01,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-04-13 21:07:01,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-04-13 21:07:01,781 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-04-13 21:07:01,781 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-04-13 21:07:01,781 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-04-13 21:07:01,781 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-04-13 21:07:01,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-04-13 21:07:01,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-04-13 21:07:01,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-04-13 21:07:01,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-04-13 21:07:01,783 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-04-13 21:07:01,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-04-13 21:07:01,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-04-13 21:07:01,785 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-04-13 21:07:01,786 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-04-13 21:07:01,786 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-04-13 21:07:01,786 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-04-13 21:07:01,786 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-04-13 21:07:01,786 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-04-13 21:07:01,787 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-04-13 21:07:01,787 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-04-13 21:07:01,787 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-04-13 21:07:01,788 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-04-13 21:07:01,788 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-04-13 21:07:01,789 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-04-13 21:07:01,789 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-04-13 21:07:01,789 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-04-13 21:07:01,789 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-04-13 21:07:01,790 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-04-13 21:07:01,790 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-04-13 21:07:01,790 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-04-13 21:07:01,790 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-04-13 21:07:01,791 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-04-13 21:07:01,791 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-04-13 21:07:01,792 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-04-13 21:07:01,792 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-04-13 21:07:01,793 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-04-13 21:07:01,793 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-04-13 21:07:01,793 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-04-13 21:07:01,793 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-04-13 21:07:01,793 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-04-13 21:07:01,794 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-04-13 21:07:01,794 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-04-13 21:07:01,794 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-04-13 21:07:01,794 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-04-13 21:07:01,794 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-04-13 21:07:01,795 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-04-13 21:07:01,795 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-04-13 21:07:01,795 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-04-13 21:07:01,795 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-04-13 21:07:01,797 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-04-13 21:07:01,797 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-04-13 21:07:01,797 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-04-13 21:07:01,797 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-04-13 21:07:01,798 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-04-13 21:07:01,798 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-04-13 21:07:01,798 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-04-13 21:07:01,845 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/ttaslock.i[193996,194009] [2025-04-13 21:07:01,845 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/ttaslock.i[194063,194076] [2025-04-13 21:07:01,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:07:02,025 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:07:02,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:02 WrapperNode [2025-04-13 21:07:02,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:07:02,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:07:02,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:07:02,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:07:02,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:02" (1/1) ... [2025-04-13 21:07:02,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:02" (1/1) ... [2025-04-13 21:07:02,114 INFO L138 Inliner]: procedures = 917, calls = 911, calls flagged for inlining = 813, calls inlined = 27, statements flattened = 257 [2025-04-13 21:07:02,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:07:02,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:07:02,115 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:07:02,115 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:07:02,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:02" (1/1) ... [2025-04-13 21:07:02,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:02" (1/1) ... [2025-04-13 21:07:02,123 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:02" (1/1) ... [2025-04-13 21:07:02,139 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 2, 5]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 3 writes are split as follows [0, 1, 2]. [2025-04-13 21:07:02,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:02" (1/1) ... [2025-04-13 21:07:02,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:02" (1/1) ... [2025-04-13 21:07:02,148 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:02" (1/1) ... [2025-04-13 21:07:02,148 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:02" (1/1) ... [2025-04-13 21:07:02,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:02" (1/1) ... [2025-04-13 21:07:02,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:02" (1/1) ... [2025-04-13 21:07:02,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:02" (1/1) ... [2025-04-13 21:07:02,163 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:07:02,164 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 21:07:02,164 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 21:07:02,164 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 21:07:02,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:02" (1/1) ... [2025-04-13 21:07:02,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:07:02,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:07:02,187 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 21:07:02,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 21:07:02,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 21:07:02,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 21:07:02,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 21:07:02,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:07:02,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:07:02,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:07:02,209 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-04-13 21:07:02,209 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-04-13 21:07:02,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-13 21:07:02,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 21:07:02,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 21:07:02,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 21:07:02,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-13 21:07:02,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:07:02,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:07:02,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 21:07:02,212 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:07:02,325 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 21:07:02,326 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:07:02,599 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:07:02,600 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:07:02,600 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 21:07:02,770 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,773 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,775 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,776 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,778 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,779 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,784 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,785 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,786 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,787 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,789 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,790 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,791 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,794 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,796 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,798 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,803 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,806 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,808 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,809 WARN L179 LargeBlockEncoding]: Complex 4:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,816 WARN L179 LargeBlockEncoding]: Complex 4:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,821 WARN L179 LargeBlockEncoding]: Complex 4:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,828 WARN L179 LargeBlockEncoding]: Complex 4:5 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,844 WARN L179 LargeBlockEncoding]: Complex 7:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,852 WARN L179 LargeBlockEncoding]: Complex 4:4 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:02,863 INFO L313 CfgBuilder]: Removed 32 assume(true) statements. [2025-04-13 21:07:02,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:07:02 BoogieIcfgContainer [2025-04-13 21:07:02,882 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 21:07:02,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:07:02,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:07:02,887 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:07:02,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:07:00" (1/3) ... [2025-04-13 21:07:02,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb8a324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:07:02, skipping insertion in model container [2025-04-13 21:07:02,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:02" (2/3) ... [2025-04-13 21:07:02,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb8a324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:07:02, skipping insertion in model container [2025-04-13 21:07:02,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:07:02" (3/3) ... [2025-04-13 21:07:02,888 INFO L128 eAbstractionObserver]: Analyzing ICFG ttaslock.i [2025-04-13 21:07:02,898 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:07:02,899 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ttaslock.i that has 2 procedures, 38 locations, 132 edges, 1 initial locations, 37 loop locations, and 2 error locations. [2025-04-13 21:07:02,900 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:07:02,965 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-13 21:07:02,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 133 transitions, 273 flow [2025-04-13 21:07:03,013 INFO L116 PetriNetUnfolderBase]: 101/147 cut-off events. [2025-04-13 21:07:03,015 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 21:07:03,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 147 events. 101/147 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 319 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 111. Up to 12 conditions per place. [2025-04-13 21:07:03,020 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 133 transitions, 273 flow [2025-04-13 21:07:03,024 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 129 transitions, 265 flow [2025-04-13 21:07:03,032 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:07:03,040 INFO L340 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=LoopHeads, 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;@174faa1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:07:03,040 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:07:03,046 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:07:03,046 INFO L116 PetriNetUnfolderBase]: 16/24 cut-off events. [2025-04-13 21:07:03,046 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 21:07:03,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:03,046 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-13 21:07:03,047 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:03,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:03,050 INFO L85 PathProgramCache]: Analyzing trace with hash 39531, now seen corresponding path program 1 times [2025-04-13 21:07:03,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:03,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286193101] [2025-04-13 21:07:03,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:03,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:03,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-13 21:07:03,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-13 21:07:03,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:03,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:03,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:03,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286193101] [2025-04-13 21:07:03,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286193101] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:03,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:03,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:07:03,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730564861] [2025-04-13 21:07:03,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:03,146 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:07:03,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:03,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:07:03,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:07:03,166 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 133 [2025-04-13 21:07:03,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 129 transitions, 265 flow. Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-04-13 21:07:03,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:03,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 133 [2025-04-13 21:07:03,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:03,273 INFO L116 PetriNetUnfolderBase]: 68/175 cut-off events. [2025-04-13 21:07:03,274 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 21:07:03,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 175 events. 68/175 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 602 event pairs, 48 based on Foata normal form. 46/178 useless extension candidates. Maximal degree in co-relation 296. Up to 145 conditions per place. [2025-04-13 21:07:03,276 INFO L140 encePairwiseOnDemand]: 47/133 looper letters, 32 selfloop transitions, 0 changer transitions 1/43 dead transitions. [2025-04-13 21:07:03,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 159 flow [2025-04-13 21:07:03,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:07:03,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 21:07:03,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 139 transitions. [2025-04-13 21:07:03,287 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5225563909774437 [2025-04-13 21:07:03,287 INFO L175 Difference]: Start difference. First operand has 41 places, 129 transitions, 265 flow. Second operand 2 states and 139 transitions. [2025-04-13 21:07:03,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 159 flow [2025-04-13 21:07:03,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 159 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 21:07:03,295 INFO L231 Difference]: Finished difference. Result has 42 places, 42 transitions, 91 flow [2025-04-13 21:07:03,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=91, PETRI_PLACES=42, PETRI_TRANSITIONS=42} [2025-04-13 21:07:03,299 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2025-04-13 21:07:03,299 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 42 transitions, 91 flow [2025-04-13 21:07:03,299 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-04-13 21:07:03,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:03,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:07:03,300 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:07:03,300 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:03,300 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:03,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2062491144, now seen corresponding path program 1 times [2025-04-13 21:07:03,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:03,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028724136] [2025-04-13 21:07:03,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:03,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:03,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:07:03,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:07:03,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:03,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:07:03,331 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:07:03,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:07:03,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:07:03,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:03,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:07:03,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:07:03,381 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:07:03,382 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 21:07:03,383 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 21:07:03,383 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-13 21:07:03,383 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:07:03,384 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 21:07:03,386 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:07:03,386 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 21:07:03,472 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:07:03,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 228 transitions, 472 flow [2025-04-13 21:07:03,511 INFO L116 PetriNetUnfolderBase]: 185/272 cut-off events. [2025-04-13 21:07:03,511 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-13 21:07:03,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 272 events. 185/272 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 650 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 214. Up to 18 conditions per place. [2025-04-13 21:07:03,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 228 transitions, 472 flow [2025-04-13 21:07:03,523 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 225 transitions, 466 flow [2025-04-13 21:07:03,524 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:07:03,525 INFO L340 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=LoopHeads, 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;@174faa1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:07:03,525 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:07:03,527 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:07:03,528 INFO L116 PetriNetUnfolderBase]: 16/24 cut-off events. [2025-04-13 21:07:03,528 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 21:07:03,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:03,528 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-13 21:07:03,528 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:03,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:03,528 INFO L85 PathProgramCache]: Analyzing trace with hash 46827, now seen corresponding path program 1 times [2025-04-13 21:07:03,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:03,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311523257] [2025-04-13 21:07:03,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:03,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:03,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-13 21:07:03,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-13 21:07:03,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:03,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:03,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:03,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:03,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311523257] [2025-04-13 21:07:03,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311523257] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:03,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:03,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:07:03,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470585152] [2025-04-13 21:07:03,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:03,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:07:03,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:03,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:07:03,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:07:03,541 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 228 [2025-04-13 21:07:03,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 225 transitions, 466 flow. Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-04-13 21:07:03,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:03,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 228 [2025-04-13 21:07:03,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:04,192 INFO L116 PetriNetUnfolderBase]: 2943/4823 cut-off events. [2025-04-13 21:07:04,193 INFO L117 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-04-13 21:07:04,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9313 conditions, 4823 events. 2943/4823 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 28051 event pairs, 2160 based on Foata normal form. 1378/4990 useless extension candidates. Maximal degree in co-relation 7082. Up to 4398 conditions per place. [2025-04-13 21:07:04,220 INFO L140 encePairwiseOnDemand]: 77/228 looper letters, 56 selfloop transitions, 0 changer transitions 1/74 dead transitions. [2025-04-13 21:07:04,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 74 transitions, 278 flow [2025-04-13 21:07:04,221 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:07:04,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 21:07:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 242 transitions. [2025-04-13 21:07:04,222 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5307017543859649 [2025-04-13 21:07:04,223 INFO L175 Difference]: Start difference. First operand has 67 places, 225 transitions, 466 flow. Second operand 2 states and 242 transitions. [2025-04-13 21:07:04,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 74 transitions, 278 flow [2025-04-13 21:07:04,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 74 transitions, 278 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 21:07:04,224 INFO L231 Difference]: Finished difference. Result has 68 places, 73 transitions, 162 flow [2025-04-13 21:07:04,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=162, PETRI_PLACES=68, PETRI_TRANSITIONS=73} [2025-04-13 21:07:04,226 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, 1 predicate places. [2025-04-13 21:07:04,226 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 73 transitions, 162 flow [2025-04-13 21:07:04,226 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-04-13 21:07:04,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:04,227 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:04,227 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:07:04,227 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:04,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:04,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1268650279, now seen corresponding path program 1 times [2025-04-13 21:07:04,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:04,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96014279] [2025-04-13 21:07:04,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:04,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:04,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:07:04,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:07:04,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:04,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:07:04,271 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:07:04,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:07:04,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:07:04,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:04,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:07:04,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:07:04,304 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:07:04,305 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 21:07:04,305 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 21:07:04,305 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-13 21:07:04,305 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:07:04,305 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 21:07:04,305 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:07:04,305 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 21:07:04,388 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 21:07:04,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 323 transitions, 673 flow [2025-04-13 21:07:04,431 INFO L116 PetriNetUnfolderBase]: 276/418 cut-off events. [2025-04-13 21:07:04,432 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-13 21:07:04,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 418 events. 276/418 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1112 event pairs, 1 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 329. Up to 29 conditions per place. [2025-04-13 21:07:04,436 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 323 transitions, 673 flow [2025-04-13 21:07:04,445 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 320 transitions, 667 flow [2025-04-13 21:07:04,446 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:07:04,446 INFO L340 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=LoopHeads, 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;@174faa1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:07:04,446 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:07:04,447 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:07:04,447 INFO L116 PetriNetUnfolderBase]: 16/24 cut-off events. [2025-04-13 21:07:04,447 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 21:07:04,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:04,447 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-13 21:07:04,448 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:04,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:04,448 INFO L85 PathProgramCache]: Analyzing trace with hash 57163, now seen corresponding path program 1 times [2025-04-13 21:07:04,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:04,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102675528] [2025-04-13 21:07:04,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:04,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:04,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-13 21:07:04,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-13 21:07:04,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:04,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:04,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:04,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102675528] [2025-04-13 21:07:04,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102675528] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:04,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:04,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:07:04,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165588668] [2025-04-13 21:07:04,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:04,455 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:07:04,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:04,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:07:04,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:07:04,456 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 323 [2025-04-13 21:07:04,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 320 transitions, 667 flow. Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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-04-13 21:07:04,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:04,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 323 [2025-04-13 21:07:04,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:11,871 INFO L116 PetriNetUnfolderBase]: 85915/119363 cut-off events. [2025-04-13 21:07:11,871 INFO L117 PetriNetUnfolderBase]: For 3335/3335 co-relation queries the response was YES. [2025-04-13 21:07:12,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234469 conditions, 119363 events. 85915/119363 cut-off events. For 3335/3335 co-relation queries the response was YES. Maximal size of possible extension queue 2746. Compared 819433 event pairs, 64033 based on Foata normal form. 35376/124139 useless extension candidates. Maximal degree in co-relation 149809. Up to 112921 conditions per place. [2025-04-13 21:07:12,564 INFO L140 encePairwiseOnDemand]: 107/323 looper letters, 79 selfloop transitions, 0 changer transitions 1/104 dead transitions. [2025-04-13 21:07:12,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 104 transitions, 395 flow [2025-04-13 21:07:12,564 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:07:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 21:07:12,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 344 transitions. [2025-04-13 21:07:12,566 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5325077399380805 [2025-04-13 21:07:12,566 INFO L175 Difference]: Start difference. First operand has 93 places, 320 transitions, 667 flow. Second operand 2 states and 344 transitions. [2025-04-13 21:07:12,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 104 transitions, 395 flow [2025-04-13 21:07:12,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 104 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 21:07:12,572 INFO L231 Difference]: Finished difference. Result has 94 places, 103 transitions, 233 flow [2025-04-13 21:07:12,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=233, PETRI_PLACES=94, PETRI_TRANSITIONS=103} [2025-04-13 21:07:12,572 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 1 predicate places. [2025-04-13 21:07:12,572 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 103 transitions, 233 flow [2025-04-13 21:07:12,572 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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-04-13 21:07:12,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:12,572 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:12,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:07:12,573 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:12,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:12,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1265852795, now seen corresponding path program 1 times [2025-04-13 21:07:12,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:12,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618539622] [2025-04-13 21:07:12,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:12,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:12,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:07:12,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:07:12,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:12,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:12,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:12,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:12,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618539622] [2025-04-13 21:07:12,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618539622] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:12,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:12,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:07:12,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130964447] [2025-04-13 21:07:12,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:12,783 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:07:12,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:12,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:07:12,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:07:12,784 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 323 [2025-04-13 21:07:12,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 103 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 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-04-13 21:07:12,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:12,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 323 [2025-04-13 21:07:12,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:18,272 INFO L116 PetriNetUnfolderBase]: 64462/92377 cut-off events. [2025-04-13 21:07:18,272 INFO L117 PetriNetUnfolderBase]: For 1886/1886 co-relation queries the response was YES. [2025-04-13 21:07:18,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179893 conditions, 92377 events. 64462/92377 cut-off events. For 1886/1886 co-relation queries the response was YES. Maximal size of possible extension queue 2158. Compared 676055 event pairs, 308 based on Foata normal form. 0/74028 useless extension candidates. Maximal degree in co-relation 179887. Up to 65039 conditions per place. [2025-04-13 21:07:18,649 INFO L140 encePairwiseOnDemand]: 320/323 looper letters, 202 selfloop transitions, 4 changer transitions 0/229 dead transitions. [2025-04-13 21:07:18,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 229 transitions, 894 flow [2025-04-13 21:07:18,649 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:07:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:07:18,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 329 transitions. [2025-04-13 21:07:18,653 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.20371517027863778 [2025-04-13 21:07:18,653 INFO L175 Difference]: Start difference. First operand has 94 places, 103 transitions, 233 flow. Second operand 5 states and 329 transitions. [2025-04-13 21:07:18,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 229 transitions, 894 flow [2025-04-13 21:07:18,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 229 transitions, 890 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 21:07:18,674 INFO L231 Difference]: Finished difference. Result has 94 places, 103 transitions, 234 flow [2025-04-13 21:07:18,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=94, PETRI_TRANSITIONS=103} [2025-04-13 21:07:18,675 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 1 predicate places. [2025-04-13 21:07:18,675 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 103 transitions, 234 flow [2025-04-13 21:07:18,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 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-04-13 21:07:18,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:18,675 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:18,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:07:18,675 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:18,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:18,676 INFO L85 PathProgramCache]: Analyzing trace with hash -533209215, now seen corresponding path program 1 times [2025-04-13 21:07:18,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:18,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175786650] [2025-04-13 21:07:18,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:18,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:18,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 21:07:18,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 21:07:18,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:18,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:18,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:18,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175786650] [2025-04-13 21:07:18,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175786650] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:18,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:18,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:07:18,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154715500] [2025-04-13 21:07:18,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:18,748 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:07:18,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:18,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:07:18,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:07:18,749 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 323 [2025-04-13 21:07:18,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 103 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-04-13 21:07:18,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:18,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 323 [2025-04-13 21:07:18,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:26,668 INFO L116 PetriNetUnfolderBase]: 96037/135728 cut-off events. [2025-04-13 21:07:26,668 INFO L117 PetriNetUnfolderBase]: For 11268/11268 co-relation queries the response was YES. [2025-04-13 21:07:26,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272854 conditions, 135728 events. 96037/135728 cut-off events. For 11268/11268 co-relation queries the response was YES. Maximal size of possible extension queue 2584. Compared 968282 event pairs, 47957 based on Foata normal form. 0/108922 useless extension candidates. Maximal degree in co-relation 272848. Up to 85330 conditions per place. [2025-04-13 21:07:27,482 INFO L140 encePairwiseOnDemand]: 320/323 looper letters, 144 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2025-04-13 21:07:27,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 169 transitions, 678 flow [2025-04-13 21:07:27,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:07:27,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:07:27,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 217 transitions. [2025-04-13 21:07:27,484 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.22394220846233232 [2025-04-13 21:07:27,484 INFO L175 Difference]: Start difference. First operand has 94 places, 103 transitions, 234 flow. Second operand 3 states and 217 transitions. [2025-04-13 21:07:27,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 169 transitions, 678 flow [2025-04-13 21:07:27,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 169 transitions, 675 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:07:27,492 INFO L231 Difference]: Finished difference. Result has 96 places, 104 transitions, 244 flow [2025-04-13 21:07:27,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=96, PETRI_TRANSITIONS=104} [2025-04-13 21:07:27,493 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 3 predicate places. [2025-04-13 21:07:27,493 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 104 transitions, 244 flow [2025-04-13 21:07:27,493 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-04-13 21:07:27,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:27,493 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:27,493 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 21:07:27,493 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:27,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:27,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1435424100, now seen corresponding path program 1 times [2025-04-13 21:07:27,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:27,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654582408] [2025-04-13 21:07:27,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:27,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:27,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 21:07:27,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 21:07:27,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:27,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:27,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:27,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654582408] [2025-04-13 21:07:27,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654582408] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:27,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:27,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:07:27,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116590302] [2025-04-13 21:07:27,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:27,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:07:27,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:27,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:07:27,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:07:27,544 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 323 [2025-04-13 21:07:27,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 104 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-04-13 21:07:27,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:27,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 323 [2025-04-13 21:07:27,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:39,891 INFO L116 PetriNetUnfolderBase]: 142998/202247 cut-off events. [2025-04-13 21:07:39,891 INFO L117 PetriNetUnfolderBase]: For 25700/25700 co-relation queries the response was YES. [2025-04-13 21:07:40,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402917 conditions, 202247 events. 142998/202247 cut-off events. For 25700/25700 co-relation queries the response was YES. Maximal size of possible extension queue 3274. Compared 1482001 event pairs, 72086 based on Foata normal form. 0/168891 useless extension candidates. Maximal degree in co-relation 402910. Up to 126922 conditions per place. [2025-04-13 21:07:40,864 INFO L140 encePairwiseOnDemand]: 320/323 looper letters, 144 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2025-04-13 21:07:40,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 169 transitions, 688 flow [2025-04-13 21:07:40,864 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:07:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:07:40,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2025-04-13 21:07:40,865 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.22291021671826625 [2025-04-13 21:07:40,865 INFO L175 Difference]: Start difference. First operand has 96 places, 104 transitions, 244 flow. Second operand 3 states and 216 transitions. [2025-04-13 21:07:40,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 169 transitions, 688 flow [2025-04-13 21:07:40,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 169 transitions, 684 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:07:40,885 INFO L231 Difference]: Finished difference. Result has 98 places, 105 transitions, 254 flow [2025-04-13 21:07:40,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=98, PETRI_TRANSITIONS=105} [2025-04-13 21:07:40,886 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 5 predicate places. [2025-04-13 21:07:40,886 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 105 transitions, 254 flow [2025-04-13 21:07:40,886 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-04-13 21:07:40,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:40,886 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:40,886 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 21:07:40,886 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:40,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:40,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1401033817, now seen corresponding path program 1 times [2025-04-13 21:07:40,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:40,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406747117] [2025-04-13 21:07:40,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:40,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:40,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 21:07:40,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 21:07:40,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:40,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:40,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:40,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:40,944 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406747117] [2025-04-13 21:07:40,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406747117] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:40,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:40,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:07:40,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848667903] [2025-04-13 21:07:40,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:40,944 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:07:40,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:40,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:07:40,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:07:40,945 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 323 [2025-04-13 21:07:40,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 105 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-04-13 21:07:40,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:40,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 323 [2025-04-13 21:07:40,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:00,423 INFO L116 PetriNetUnfolderBase]: 211113/297330 cut-off events. [2025-04-13 21:08:00,423 INFO L117 PetriNetUnfolderBase]: For 45997/45997 co-relation queries the response was YES. [2025-04-13 21:08:01,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601086 conditions, 297330 events. 211113/297330 cut-off events. For 45997/45997 co-relation queries the response was YES. Maximal size of possible extension queue 4266. Compared 2212996 event pairs, 108266 based on Foata normal form. 0/257156 useless extension candidates. Maximal degree in co-relation 601078. Up to 188661 conditions per place. [2025-04-13 21:08:02,020 INFO L140 encePairwiseOnDemand]: 320/323 looper letters, 144 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2025-04-13 21:08:02,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 169 transitions, 699 flow [2025-04-13 21:08:02,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:08:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:08:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 214 transitions. [2025-04-13 21:08:02,022 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.22084623323013416 [2025-04-13 21:08:02,022 INFO L175 Difference]: Start difference. First operand has 98 places, 105 transitions, 254 flow. Second operand 3 states and 214 transitions. [2025-04-13 21:08:02,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 169 transitions, 699 flow [2025-04-13 21:08:02,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 169 transitions, 695 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:08:02,044 INFO L231 Difference]: Finished difference. Result has 100 places, 106 transitions, 264 flow [2025-04-13 21:08:02,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=100, PETRI_TRANSITIONS=106} [2025-04-13 21:08:02,045 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 7 predicate places. [2025-04-13 21:08:02,045 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 106 transitions, 264 flow [2025-04-13 21:08:02,046 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-04-13 21:08:02,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:02,046 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:02,046 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 21:08:02,046 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:08:02,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:02,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2066760725, now seen corresponding path program 1 times [2025-04-13 21:08:02,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:02,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144217707] [2025-04-13 21:08:02,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:02,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:02,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 21:08:02,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 21:08:02,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:02,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:02,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:08:02,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:02,252 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144217707] [2025-04-13 21:08:02,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144217707] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:02,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:02,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:08:02,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967143875] [2025-04-13 21:08:02,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:02,252 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:08:02,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:02,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:08:02,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:08:02,253 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 323 [2025-04-13 21:08:02,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 106 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-04-13 21:08:02,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:02,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 323 [2025-04-13 21:08:02,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:20,529 INFO L116 PetriNetUnfolderBase]: 191145/261402 cut-off events. [2025-04-13 21:08:20,529 INFO L117 PetriNetUnfolderBase]: For 46541/46541 co-relation queries the response was YES. [2025-04-13 21:08:21,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543707 conditions, 261402 events. 191145/261402 cut-off events. For 46541/46541 co-relation queries the response was YES. Maximal size of possible extension queue 3780. Compared 1784565 event pairs, 90826 based on Foata normal form. 0/234668 useless extension candidates. Maximal degree in co-relation 543698. Up to 160318 conditions per place. [2025-04-13 21:08:21,838 INFO L140 encePairwiseOnDemand]: 320/323 looper letters, 151 selfloop transitions, 2 changer transitions 0/176 dead transitions. [2025-04-13 21:08:21,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 176 transitions, 743 flow [2025-04-13 21:08:21,839 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:08:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:08:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2025-04-13 21:08:21,840 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2260061919504644 [2025-04-13 21:08:21,840 INFO L175 Difference]: Start difference. First operand has 100 places, 106 transitions, 264 flow. Second operand 3 states and 219 transitions. [2025-04-13 21:08:21,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 176 transitions, 743 flow [2025-04-13 21:08:21,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 176 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:08:21,871 INFO L231 Difference]: Finished difference. Result has 102 places, 107 transitions, 274 flow [2025-04-13 21:08:21,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=102, PETRI_TRANSITIONS=107} [2025-04-13 21:08:21,872 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 9 predicate places. [2025-04-13 21:08:21,872 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 107 transitions, 274 flow [2025-04-13 21:08:21,872 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-04-13 21:08:21,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:21,872 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:21,872 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 21:08:21,872 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:08:21,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:21,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1316628624, now seen corresponding path program 1 times [2025-04-13 21:08:21,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:21,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252805006] [2025-04-13 21:08:21,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:21,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:21,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-13 21:08:21,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-13 21:08:21,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:21,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:22,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:22,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:22,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252805006] [2025-04-13 21:08:22,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252805006] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:22,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:22,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:08:22,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681464279] [2025-04-13 21:08:22,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:22,002 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:08:22,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:22,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:08:22,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:08:22,003 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 323 [2025-04-13 21:08:22,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 107 transitions, 274 flow. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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-04-13 21:08:22,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:22,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 323 [2025-04-13 21:08:22,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:40,959 INFO L116 PetriNetUnfolderBase]: 190761/260706 cut-off events. [2025-04-13 21:08:40,962 INFO L117 PetriNetUnfolderBase]: For 94937/94937 co-relation queries the response was YES. [2025-04-13 21:08:41,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561842 conditions, 260706 events. 190761/260706 cut-off events. For 94937/94937 co-relation queries the response was YES. Maximal size of possible extension queue 3780. Compared 1780582 event pairs, 86550 based on Foata normal form. 0/234176 useless extension candidates. Maximal degree in co-relation 561832. Up to 152350 conditions per place. [2025-04-13 21:08:42,479 INFO L140 encePairwiseOnDemand]: 320/323 looper letters, 219 selfloop transitions, 3 changer transitions 1/246 dead transitions. [2025-04-13 21:08:42,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 246 transitions, 1062 flow [2025-04-13 21:08:42,487 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:08:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:08:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 310 transitions. [2025-04-13 21:08:42,492 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.23993808049535603 [2025-04-13 21:08:42,493 INFO L175 Difference]: Start difference. First operand has 102 places, 107 transitions, 274 flow. Second operand 4 states and 310 transitions. [2025-04-13 21:08:42,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 246 transitions, 1062 flow [2025-04-13 21:08:43,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 246 transitions, 1060 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:08:43,777 INFO L231 Difference]: Finished difference. Result has 105 places, 107 transitions, 282 flow [2025-04-13 21:08:43,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=282, PETRI_PLACES=105, PETRI_TRANSITIONS=107} [2025-04-13 21:08:43,777 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 12 predicate places. [2025-04-13 21:08:43,777 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 107 transitions, 282 flow [2025-04-13 21:08:43,778 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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-04-13 21:08:43,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:43,778 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:43,778 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 21:08:43,778 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:08:43,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:43,779 INFO L85 PathProgramCache]: Analyzing trace with hash -341532045, now seen corresponding path program 1 times [2025-04-13 21:08:43,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:43,779 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544549857] [2025-04-13 21:08:43,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:43,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:43,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-04-13 21:08:43,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-04-13 21:08:43,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:43,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:44,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:44,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544549857] [2025-04-13 21:08:44,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544549857] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:44,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:44,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 21:08:44,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724508736] [2025-04-13 21:08:44,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:44,528 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 21:08:44,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:44,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 21:08:44,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:08:44,529 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 323 [2025-04-13 21:08:44,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 107 transitions, 282 flow. Second operand has 8 states, 8 states have (on average 31.375) internal successors, (251), 8 states have internal predecessors, (251), 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-04-13 21:08:44,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:44,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 323 [2025-04-13 21:08:44,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:17,176 INFO L116 PetriNetUnfolderBase]: 320827/442088 cut-off events. [2025-04-13 21:09:17,176 INFO L117 PetriNetUnfolderBase]: For 175231/175231 co-relation queries the response was YES. [2025-04-13 21:09:18,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 976858 conditions, 442088 events. 320827/442088 cut-off events. For 175231/175231 co-relation queries the response was YES. Maximal size of possible extension queue 6236. Compared 3277957 event pairs, 67323 based on Foata normal form. 6668/409618 useless extension candidates. Maximal degree in co-relation 976847. Up to 141886 conditions per place. [2025-04-13 21:09:19,830 INFO L140 encePairwiseOnDemand]: 310/323 looper letters, 553 selfloop transitions, 77 changer transitions 0/653 dead transitions. [2025-04-13 21:09:19,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 653 transitions, 3099 flow [2025-04-13 21:09:19,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 21:09:19,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 21:09:19,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 980 transitions. [2025-04-13 21:09:19,834 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.18962848297213622 [2025-04-13 21:09:19,834 INFO L175 Difference]: Start difference. First operand has 105 places, 107 transitions, 282 flow. Second operand 16 states and 980 transitions. [2025-04-13 21:09:19,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 653 transitions, 3099 flow [2025-04-13 21:09:22,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 653 transitions, 3045 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-13 21:09:22,036 INFO L231 Difference]: Finished difference. Result has 128 places, 188 transitions, 841 flow [2025-04-13 21:09:22,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=841, PETRI_PLACES=128, PETRI_TRANSITIONS=188} [2025-04-13 21:09:22,036 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 35 predicate places. [2025-04-13 21:09:22,036 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 188 transitions, 841 flow [2025-04-13 21:09:22,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.375) internal successors, (251), 8 states have internal predecessors, (251), 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-04-13 21:09:22,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:22,037 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:22,037 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 21:09:22,037 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:09:22,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:22,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1043249119, now seen corresponding path program 2 times [2025-04-13 21:09:22,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:22,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448021690] [2025-04-13 21:09:22,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:09:22,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:22,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-04-13 21:09:22,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 72 of 81 statements. [2025-04-13 21:09:22,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:09:22,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:09:22,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:09:22,527 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448021690] [2025-04-13 21:09:22,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448021690] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:09:22,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:09:22,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 21:09:22,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457978174] [2025-04-13 21:09:22,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:09:22,528 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 21:09:22,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:09:22,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 21:09:22,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:09:22,529 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 323 [2025-04-13 21:09:22,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 188 transitions, 841 flow. Second operand has 8 states, 8 states have (on average 31.375) internal successors, (251), 8 states have internal predecessors, (251), 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-04-13 21:09:22,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:09:22,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 323 [2025-04-13 21:09:22,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand