./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/libvsync/clhlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/libvsync/clhlock.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bed480fb9329cf4d2bde4e192428cf2ff72174b29c5e6148c18915395bc76ca3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:14:35,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:14:35,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 13:14:35,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:14:35,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:14:35,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:14:35,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:14:35,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:14:35,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:14:35,784 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:14:35,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:14:35,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:14:35,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:14:35,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:14:35,793 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:14:35,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:14:35,793 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:14:35,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:14:35,794 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:14:35,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:14:35,794 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:14:35,794 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:14:35,794 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:14:35,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:14:35,794 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:14:35,794 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:14:35,794 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:14:35,794 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:14:35,794 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:14:35,795 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:14:35,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:14:35,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:14:35,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:14:35,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:14:35,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:14:35,795 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:14:35,795 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:14:35,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:14:35,796 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:14:35,796 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:14:35,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:14:35,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:14:35,796 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bed480fb9329cf4d2bde4e192428cf2ff72174b29c5e6148c18915395bc76ca3 [2025-02-06 13:14:36,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:14:36,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:14:36,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:14:36,049 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:14:36,049 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:14:36,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/clhlock.i [2025-02-06 13:14:37,132 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9854bfc00/ba85598e3c684f998a15c7642fb7c576/FLAG4d6d94107 [2025-02-06 13:14:37,584 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:14:37,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/clhlock.i [2025-02-06 13:14:37,622 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9854bfc00/ba85598e3c684f998a15c7642fb7c576/FLAG4d6d94107 [2025-02-06 13:14:37,702 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9854bfc00/ba85598e3c684f998a15c7642fb7c576 [2025-02-06 13:14:37,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:14:37,705 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:14:37,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:14:37,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:14:37,709 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:14:37,709 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:14:37" (1/1) ... [2025-02-06 13:14:37,710 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ae21ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:37, skipping insertion in model container [2025-02-06 13:14:37,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:14:37" (1/1) ... [2025-02-06 13:14:37,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:14:39,072 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:14:39,083 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:14:39,083 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:14:39,090 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:14:39,091 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:14:39,198 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:14:39,202 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:14:39,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:14:39,402 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:14:39,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-02-06 13:14:39,485 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-02-06 13:14:39,486 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-02-06 13:14:39,486 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-02-06 13:14:39,486 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-02-06 13:14:39,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-02-06 13:14:39,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-02-06 13:14:39,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-02-06 13:14:39,489 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-02-06 13:14:39,489 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-02-06 13:14:39,489 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-02-06 13:14:39,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-02-06 13:14:39,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-02-06 13:14:39,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-02-06 13:14:39,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-02-06 13:14:39,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-02-06 13:14:39,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-02-06 13:14:39,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-02-06 13:14:39,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-02-06 13:14:39,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-02-06 13:14:39,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-02-06 13:14:39,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-02-06 13:14:39,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-02-06 13:14:39,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-02-06 13:14:39,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-02-06 13:14:39,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-02-06 13:14:39,497 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-02-06 13:14:39,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-02-06 13:14:39,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-02-06 13:14:39,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-02-06 13:14:39,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-02-06 13:14:39,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-02-06 13:14:39,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-02-06 13:14:39,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-02-06 13:14:39,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-02-06 13:14:39,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-02-06 13:14:39,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-02-06 13:14:39,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-02-06 13:14:39,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-02-06 13:14:39,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-02-06 13:14:39,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-02-06 13:14:39,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-02-06 13:14:39,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-02-06 13:14:39,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-02-06 13:14:39,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-02-06 13:14:39,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-02-06 13:14:39,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-02-06 13:14:39,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-02-06 13:14:39,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-02-06 13:14:39,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-02-06 13:14:39,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-02-06 13:14:39,507 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-02-06 13:14:39,507 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-02-06 13:14:39,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-02-06 13:14:39,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-02-06 13:14:39,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-02-06 13:14:39,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-02-06 13:14:39,509 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-02-06 13:14:39,510 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-02-06 13:14:39,510 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-02-06 13:14:39,510 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-02-06 13:14:39,510 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-02-06 13:14:39,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-02-06 13:14:39,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-02-06 13:14:39,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-02-06 13:14:39,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-02-06 13:14:39,513 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-02-06 13:14:39,513 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-02-06 13:14:39,513 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-02-06 13:14:39,513 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-02-06 13:14:39,514 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-02-06 13:14:39,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-02-06 13:14:39,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-02-06 13:14:39,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-02-06 13:14:39,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-02-06 13:14:39,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-02-06 13:14:39,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-02-06 13:14:39,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-02-06 13:14:39,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-02-06 13:14:39,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-02-06 13:14:39,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-02-06 13:14:39,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-02-06 13:14:39,520 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-02-06 13:14:39,520 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-02-06 13:14:39,520 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-02-06 13:14:39,520 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-02-06 13:14:39,521 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-02-06 13:14:39,522 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-02-06 13:14:39,522 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-02-06 13:14:39,522 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-02-06 13:14:39,523 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-02-06 13:14:39,523 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-02-06 13:14:39,523 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-02-06 13:14:39,523 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-02-06 13:14:39,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-02-06 13:14:39,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-02-06 13:14:39,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-02-06 13:14:39,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-02-06 13:14:39,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-02-06 13:14:39,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-02-06 13:14:39,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:14:39,766 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:14:39,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39 WrapperNode [2025-02-06 13:14:39,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:14:39,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:14:39,768 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:14:39,768 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:14:39,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,858 INFO L138 Inliner]: procedures = 919, calls = 937, calls flagged for inlining = 820, calls inlined = 37, statements flattened = 315 [2025-02-06 13:14:39,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:14:39,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:14:39,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:14:39,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:14:39,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,884 INFO L175 MemorySlicer]: Split 29 memory accesses to 4 slices as follows [2, 2, 9, 16]. 55 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 0, 2, 9]. The 8 writes are split as follows [0, 1, 5, 2]. [2025-02-06 13:14:39,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,892 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:14:39,898 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:14:39,898 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:14:39,898 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:14:39,899 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (1/1) ... [2025-02-06 13:14:39,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:14:39,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:39,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:14:39,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:14:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:14:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:14:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 13:14:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 13:14:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:14:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 13:14:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 13:14:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 13:14:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 13:14:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:14:39,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:14:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-02-06 13:14:39,942 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-02-06 13:14:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 13:14:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 13:14:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 13:14:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 13:14:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 13:14:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:14:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:14:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 13:14:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 13:14:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 13:14:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 13:14:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 13:14:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 13:14:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 13:14:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:14:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:14:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 13:14:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 13:14:39,943 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 13:14:40,050 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:14:40,051 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:14:40,288 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285: havoc vatomic32_await_eq_acq_#t~ret174#1; [2025-02-06 13:14:40,439 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6012-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-02-06 13:14:40,440 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6012: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-02-06 13:14:40,441 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:14:40,441 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:14:40,593 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:14:40,593 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:14:40,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:14:40 BoogieIcfgContainer [2025-02-06 13:14:40,593 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:14:40,595 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:14:40,595 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:14:40,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:14:40,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:14:37" (1/3) ... [2025-02-06 13:14:40,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5157823c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:14:40, skipping insertion in model container [2025-02-06 13:14:40,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:39" (2/3) ... [2025-02-06 13:14:40,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5157823c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:14:40, skipping insertion in model container [2025-02-06 13:14:40,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:14:40" (3/3) ... [2025-02-06 13:14:40,604 INFO L128 eAbstractionObserver]: Analyzing ICFG clhlock.i [2025-02-06 13:14:40,620 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:14:40,621 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG clhlock.i that has 2 procedures, 154 locations, 1 initial locations, 37 loop locations, and 35 error locations. [2025-02-06 13:14:40,621 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:14:40,694 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 13:14:40,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 226 transitions, 459 flow [2025-02-06 13:14:40,767 INFO L124 PetriNetUnfolderBase]: 86/274 cut-off events. [2025-02-06 13:14:40,769 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 13:14:40,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 274 events. 86/274 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 875 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 185. Up to 6 conditions per place. [2025-02-06 13:14:40,773 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 226 transitions, 459 flow [2025-02-06 13:14:40,778 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 226 transitions, 459 flow [2025-02-06 13:14:40,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:14:40,791 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4104d151, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:14:40,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-02-06 13:14:40,795 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:14:40,795 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-02-06 13:14:40,795 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 13:14:40,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:40,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-06 13:14:40,796 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-06 13:14:40,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:40,800 INFO L85 PathProgramCache]: Analyzing trace with hash 31802, now seen corresponding path program 1 times [2025-02-06 13:14:40,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:40,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929266374] [2025-02-06 13:14:40,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:40,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:40,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 13:14:40,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 13:14:40,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:40,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:41,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:41,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:41,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929266374] [2025-02-06 13:14:41,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929266374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:41,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:41,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:14:41,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509512828] [2025-02-06 13:14:41,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:41,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:41,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:41,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:41,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:41,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 226 [2025-02-06 13:14:41,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 226 transitions, 459 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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-02-06 13:14:41,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:41,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 226 [2025-02-06 13:14:41,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:41,478 INFO L124 PetriNetUnfolderBase]: 385/1366 cut-off events. [2025-02-06 13:14:41,479 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-02-06 13:14:41,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2157 conditions, 1366 events. 385/1366 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 9418 event pairs, 333 based on Foata normal form. 903/1990 useless extension candidates. Maximal degree in co-relation 2066. Up to 783 conditions per place. [2025-02-06 13:14:41,488 INFO L140 encePairwiseOnDemand]: 156/226 looper letters, 64 selfloop transitions, 2 changer transitions 0/156 dead transitions. [2025-02-06 13:14:41,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 156 transitions, 451 flow [2025-02-06 13:14:41,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:41,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2025-02-06 13:14:41,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5958702064896755 [2025-02-06 13:14:41,499 INFO L175 Difference]: Start difference. First operand has 157 places, 226 transitions, 459 flow. Second operand 3 states and 404 transitions. [2025-02-06 13:14:41,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 156 transitions, 451 flow [2025-02-06 13:14:41,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 156 transitions, 451 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 13:14:41,506 INFO L231 Difference]: Finished difference. Result has 154 places, 156 transitions, 323 flow [2025-02-06 13:14:41,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=323, PETRI_PLACES=154, PETRI_TRANSITIONS=156} [2025-02-06 13:14:41,510 INFO L279 CegarLoopForPetriNet]: 157 programPoint places, -3 predicate places. [2025-02-06 13:14:41,510 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 156 transitions, 323 flow [2025-02-06 13:14:41,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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-02-06 13:14:41,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:41,510 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-06 13:14:41,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:14:41,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-06 13:14:41,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:41,511 INFO L85 PathProgramCache]: Analyzing trace with hash 31803, now seen corresponding path program 1 times [2025-02-06 13:14:41,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:41,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115017078] [2025-02-06 13:14:41,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:41,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:41,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 13:14:41,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 13:14:41,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:41,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:41,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:41,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115017078] [2025-02-06 13:14:41,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115017078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:41,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:41,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:14:41,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036082953] [2025-02-06 13:14:41,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:41,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:41,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:41,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:41,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:41,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 226 [2025-02-06 13:14:41,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 156 transitions, 323 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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-02-06 13:14:41,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:41,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 226 [2025-02-06 13:14:41,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:41,943 INFO L124 PetriNetUnfolderBase]: 385/1365 cut-off events. [2025-02-06 13:14:41,944 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-02-06 13:14:41,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2158 conditions, 1365 events. 385/1365 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 9394 event pairs, 333 based on Foata normal form. 0/1087 useless extension candidates. Maximal degree in co-relation 2146. Up to 783 conditions per place. [2025-02-06 13:14:41,950 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 63 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2025-02-06 13:14:41,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 155 transitions, 451 flow [2025-02-06 13:14:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:41,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2025-02-06 13:14:41,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49557522123893805 [2025-02-06 13:14:41,952 INFO L175 Difference]: Start difference. First operand has 154 places, 156 transitions, 323 flow. Second operand 3 states and 336 transitions. [2025-02-06 13:14:41,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 155 transitions, 451 flow [2025-02-06 13:14:41,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 155 transitions, 447 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:41,955 INFO L231 Difference]: Finished difference. Result has 153 places, 155 transitions, 321 flow [2025-02-06 13:14:41,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=321, PETRI_PLACES=153, PETRI_TRANSITIONS=155} [2025-02-06 13:14:41,955 INFO L279 CegarLoopForPetriNet]: 157 programPoint places, -4 predicate places. [2025-02-06 13:14:41,956 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 155 transitions, 321 flow [2025-02-06 13:14:41,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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-02-06 13:14:41,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:41,956 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 13:14:41,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:14:41,956 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-06 13:14:41,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:41,957 INFO L85 PathProgramCache]: Analyzing trace with hash 30589760, now seen corresponding path program 1 times [2025-02-06 13:14:41,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:41,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334911947] [2025-02-06 13:14:41,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:41,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:41,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 13:14:41,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 13:14:41,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:41,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:42,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:42,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:42,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334911947] [2025-02-06 13:14:42,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334911947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:42,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:42,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:42,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679017684] [2025-02-06 13:14:42,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:42,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:14:42,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:42,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:14:42,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:14:42,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 226 [2025-02-06 13:14:42,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 155 transitions, 321 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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-02-06 13:14:42,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:42,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 226 [2025-02-06 13:14:42,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:42,365 INFO L124 PetriNetUnfolderBase]: 385/1364 cut-off events. [2025-02-06 13:14:42,365 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-02-06 13:14:42,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2156 conditions, 1364 events. 385/1364 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 9376 event pairs, 333 based on Foata normal form. 0/1087 useless extension candidates. Maximal degree in co-relation 2144. Up to 779 conditions per place. [2025-02-06 13:14:42,370 INFO L140 encePairwiseOnDemand]: 222/226 looper letters, 61 selfloop transitions, 3 changer transitions 0/154 dead transitions. [2025-02-06 13:14:42,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 154 transitions, 447 flow [2025-02-06 13:14:42,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:14:42,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:14:42,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2025-02-06 13:14:42,372 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47013274336283184 [2025-02-06 13:14:42,372 INFO L175 Difference]: Start difference. First operand has 153 places, 155 transitions, 321 flow. Second operand 4 states and 425 transitions. [2025-02-06 13:14:42,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 154 transitions, 447 flow [2025-02-06 13:14:42,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 154 transitions, 443 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:42,378 INFO L231 Difference]: Finished difference. Result has 153 places, 154 transitions, 321 flow [2025-02-06 13:14:42,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=321, PETRI_PLACES=153, PETRI_TRANSITIONS=154} [2025-02-06 13:14:42,379 INFO L279 CegarLoopForPetriNet]: 157 programPoint places, -4 predicate places. [2025-02-06 13:14:42,379 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 154 transitions, 321 flow [2025-02-06 13:14:42,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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-02-06 13:14:42,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:42,379 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 13:14:42,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:14:42,380 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-06 13:14:42,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:42,380 INFO L85 PathProgramCache]: Analyzing trace with hash 30589761, now seen corresponding path program 1 times [2025-02-06 13:14:42,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:42,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427740523] [2025-02-06 13:14:42,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:42,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:42,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 13:14:42,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 13:14:42,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:42,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:42,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:42,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427740523] [2025-02-06 13:14:42,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427740523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:42,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:42,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:42,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705517632] [2025-02-06 13:14:42,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:42,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:14:42,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:42,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:14:42,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:14:42,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 226 [2025-02-06 13:14:42,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 154 transitions, 321 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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-02-06 13:14:42,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:42,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 226 [2025-02-06 13:14:42,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:42,873 INFO L124 PetriNetUnfolderBase]: 385/1363 cut-off events. [2025-02-06 13:14:42,874 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-02-06 13:14:42,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2155 conditions, 1363 events. 385/1363 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 9422 event pairs, 333 based on Foata normal form. 0/1087 useless extension candidates. Maximal degree in co-relation 2138. Up to 779 conditions per place. [2025-02-06 13:14:42,878 INFO L140 encePairwiseOnDemand]: 222/226 looper letters, 60 selfloop transitions, 3 changer transitions 0/153 dead transitions. [2025-02-06 13:14:42,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 153 transitions, 445 flow [2025-02-06 13:14:42,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:14:42,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:14:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 424 transitions. [2025-02-06 13:14:42,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4690265486725664 [2025-02-06 13:14:42,880 INFO L175 Difference]: Start difference. First operand has 153 places, 154 transitions, 321 flow. Second operand 4 states and 424 transitions. [2025-02-06 13:14:42,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 153 transitions, 445 flow [2025-02-06 13:14:42,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 153 transitions, 439 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:14:42,882 INFO L231 Difference]: Finished difference. Result has 152 places, 153 transitions, 319 flow [2025-02-06 13:14:42,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=319, PETRI_PLACES=152, PETRI_TRANSITIONS=153} [2025-02-06 13:14:42,883 INFO L279 CegarLoopForPetriNet]: 157 programPoint places, -5 predicate places. [2025-02-06 13:14:42,883 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 153 transitions, 319 flow [2025-02-06 13:14:42,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 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-02-06 13:14:42,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:42,883 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:42,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:14:42,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-06 13:14:42,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:42,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2136295017, now seen corresponding path program 1 times [2025-02-06 13:14:42,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:42,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15895912] [2025-02-06 13:14:42,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:42,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:42,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 13:14:42,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 13:14:42,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:42,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:42,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:42,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15895912] [2025-02-06 13:14:42,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15895912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:42,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:42,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:42,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685645017] [2025-02-06 13:14:42,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:42,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:42,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:42,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:42,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:42,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 226 [2025-02-06 13:14:42,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 153 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-02-06 13:14:42,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:42,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 226 [2025-02-06 13:14:42,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:43,100 INFO L124 PetriNetUnfolderBase]: 385/1364 cut-off events. [2025-02-06 13:14:43,101 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-02-06 13:14:43,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2157 conditions, 1364 events. 385/1364 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 9369 event pairs, 333 based on Foata normal form. 0/1088 useless extension candidates. Maximal degree in co-relation 2140. Up to 783 conditions per place. [2025-02-06 13:14:43,105 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 62 selfloop transitions, 2 changer transitions 0/154 dead transitions. [2025-02-06 13:14:43,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 154 transitions, 449 flow [2025-02-06 13:14:43,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:43,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2025-02-06 13:14:43,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4941002949852507 [2025-02-06 13:14:43,107 INFO L175 Difference]: Start difference. First operand has 152 places, 153 transitions, 319 flow. Second operand 3 states and 335 transitions. [2025-02-06 13:14:43,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 154 transitions, 449 flow [2025-02-06 13:14:43,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 154 transitions, 443 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:14:43,113 INFO L231 Difference]: Finished difference. Result has 152 places, 154 transitions, 325 flow [2025-02-06 13:14:43,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=325, PETRI_PLACES=152, PETRI_TRANSITIONS=154} [2025-02-06 13:14:43,114 INFO L279 CegarLoopForPetriNet]: 157 programPoint places, -5 predicate places. [2025-02-06 13:14:43,115 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 154 transitions, 325 flow [2025-02-06 13:14:43,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-02-06 13:14:43,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:43,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:43,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:14:43,115 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-06 13:14:43,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:43,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1702697259, now seen corresponding path program 1 times [2025-02-06 13:14:43,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:43,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761002503] [2025-02-06 13:14:43,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:43,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:43,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:14:43,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:14:43,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:43,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:43,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:43,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:43,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761002503] [2025-02-06 13:14:43,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761002503] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:14:43,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341354942] [2025-02-06 13:14:43,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:43,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:43,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:43,164 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:43,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:14:43,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:14:43,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:14:43,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:43,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:43,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 13:14:43,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:43,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:14:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:43,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341354942] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:14:43,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:14:43,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-06 13:14:43,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417491361] [2025-02-06 13:14:43,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:14:43,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:14:43,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:43,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:14:43,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:14:43,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 226 [2025-02-06 13:14:43,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 154 transitions, 325 flow. Second operand has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 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-02-06 13:14:43,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:43,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 226 [2025-02-06 13:14:43,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:43,446 INFO L124 PetriNetUnfolderBase]: 385/1366 cut-off events. [2025-02-06 13:14:43,447 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-02-06 13:14:43,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2166 conditions, 1366 events. 385/1366 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 9430 event pairs, 333 based on Foata normal form. 0/1090 useless extension candidates. Maximal degree in co-relation 2138. Up to 783 conditions per place. [2025-02-06 13:14:43,451 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 62 selfloop transitions, 4 changer transitions 0/156 dead transitions. [2025-02-06 13:14:43,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 156 transitions, 465 flow [2025-02-06 13:14:43,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:14:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:14:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2025-02-06 13:14:43,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4584070796460177 [2025-02-06 13:14:43,453 INFO L175 Difference]: Start difference. First operand has 152 places, 154 transitions, 325 flow. Second operand 5 states and 518 transitions. [2025-02-06 13:14:43,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 156 transitions, 465 flow [2025-02-06 13:14:43,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 156 transitions, 461 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:43,456 INFO L231 Difference]: Finished difference. Result has 157 places, 156 transitions, 347 flow [2025-02-06 13:14:43,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=157, PETRI_TRANSITIONS=156} [2025-02-06 13:14:43,456 INFO L279 CegarLoopForPetriNet]: 157 programPoint places, 0 predicate places. [2025-02-06 13:14:43,456 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 156 transitions, 347 flow [2025-02-06 13:14:43,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 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-02-06 13:14:43,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:43,457 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:43,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 13:14:43,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:43,658 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-06 13:14:43,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:43,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1070450923, now seen corresponding path program 2 times [2025-02-06 13:14:43,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:43,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539607051] [2025-02-06 13:14:43,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:14:43,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:43,666 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-06 13:14:43,669 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 25 statements. [2025-02-06 13:14:43,669 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:14:43,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:43,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:14:43,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:43,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539607051] [2025-02-06 13:14:43,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539607051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:43,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:43,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:14:43,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155624783] [2025-02-06 13:14:43,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:43,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:43,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:43,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:43,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:43,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 226 [2025-02-06 13:14:43,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 156 transitions, 347 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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-02-06 13:14:43,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:43,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 226 [2025-02-06 13:14:43,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:43,953 INFO L124 PetriNetUnfolderBase]: 469/1553 cut-off events. [2025-02-06 13:14:43,953 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 13:14:43,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2524 conditions, 1553 events. 469/1553 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 11102 event pairs, 333 based on Foata normal form. 0/1268 useless extension candidates. Maximal degree in co-relation 2480. Up to 785 conditions per place. [2025-02-06 13:14:43,959 INFO L140 encePairwiseOnDemand]: 222/226 looper letters, 108 selfloop transitions, 2 changer transitions 0/196 dead transitions. [2025-02-06 13:14:43,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 196 transitions, 647 flow [2025-02-06 13:14:43,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:43,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:43,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2025-02-06 13:14:43,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5412979351032449 [2025-02-06 13:14:43,960 INFO L175 Difference]: Start difference. First operand has 157 places, 156 transitions, 347 flow. Second operand 3 states and 367 transitions. [2025-02-06 13:14:43,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 196 transitions, 647 flow [2025-02-06 13:14:43,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 196 transitions, 637 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:43,963 INFO L231 Difference]: Finished difference. Result has 156 places, 154 transitions, 337 flow [2025-02-06 13:14:43,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=337, PETRI_PLACES=156, PETRI_TRANSITIONS=154} [2025-02-06 13:14:43,963 INFO L279 CegarLoopForPetriNet]: 157 programPoint places, -1 predicate places. [2025-02-06 13:14:43,963 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 154 transitions, 337 flow [2025-02-06 13:14:43,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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-02-06 13:14:43,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:43,963 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:43,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:14:43,964 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-06 13:14:43,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:43,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1070450922, now seen corresponding path program 1 times [2025-02-06 13:14:43,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:43,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004142772] [2025-02-06 13:14:43,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:43,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:43,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 13:14:43,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 13:14:43,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:43,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:44,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:14:44,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:44,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004142772] [2025-02-06 13:14:44,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004142772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:44,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:44,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:14:44,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327709102] [2025-02-06 13:14:44,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:44,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:14:44,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:44,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:14:44,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:14:44,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 226 [2025-02-06 13:14:44,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 154 transitions, 337 flow. Second operand has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 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-02-06 13:14:44,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:44,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 226 [2025-02-06 13:14:44,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:44,389 INFO L124 PetriNetUnfolderBase]: 384/1676 cut-off events. [2025-02-06 13:14:44,390 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-02-06 13:14:44,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2519 conditions, 1676 events. 384/1676 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 12990 event pairs, 37 based on Foata normal form. 39/1484 useless extension candidates. Maximal degree in co-relation 2478. Up to 496 conditions per place. [2025-02-06 13:14:44,396 INFO L140 encePairwiseOnDemand]: 219/226 looper letters, 146 selfloop transitions, 5 changer transitions 0/238 dead transitions. [2025-02-06 13:14:44,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 238 transitions, 807 flow [2025-02-06 13:14:44,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:14:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:14:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 506 transitions. [2025-02-06 13:14:44,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5597345132743363 [2025-02-06 13:14:44,399 INFO L175 Difference]: Start difference. First operand has 156 places, 154 transitions, 337 flow. Second operand 4 states and 506 transitions. [2025-02-06 13:14:44,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 238 transitions, 807 flow [2025-02-06 13:14:44,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 238 transitions, 803 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:44,404 INFO L231 Difference]: Finished difference. Result has 158 places, 154 transitions, 355 flow [2025-02-06 13:14:44,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=355, PETRI_PLACES=158, PETRI_TRANSITIONS=154} [2025-02-06 13:14:44,405 INFO L279 CegarLoopForPetriNet]: 157 programPoint places, 1 predicate places. [2025-02-06 13:14:44,406 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 154 transitions, 355 flow [2025-02-06 13:14:44,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 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-02-06 13:14:44,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:44,407 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:44,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:14:44,407 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-06 13:14:44,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:44,408 INFO L85 PathProgramCache]: Analyzing trace with hash -885364409, now seen corresponding path program 1 times [2025-02-06 13:14:44,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:44,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327037557] [2025-02-06 13:14:44,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:44,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:44,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 13:14:44,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 13:14:44,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:44,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:14:44,440 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 13:14:44,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 13:14:44,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 13:14:44,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:44,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:14:44,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 13:14:44,479 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 13:14:44,479 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (59 of 60 remaining) [2025-02-06 13:14:44,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 60 remaining) [2025-02-06 13:14:44,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 60 remaining) [2025-02-06 13:14:44,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 60 remaining) [2025-02-06 13:14:44,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 60 remaining) [2025-02-06 13:14:44,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 60 remaining) [2025-02-06 13:14:44,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 60 remaining) [2025-02-06 13:14:44,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 60 remaining) [2025-02-06 13:14:44,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 60 remaining) [2025-02-06 13:14:44,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (50 of 60 remaining) [2025-02-06 13:14:44,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (49 of 60 remaining) [2025-02-06 13:14:44,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (48 of 60 remaining) [2025-02-06 13:14:44,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 60 remaining) [2025-02-06 13:14:44,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 60 remaining) [2025-02-06 13:14:44,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 60 remaining) [2025-02-06 13:14:44,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 60 remaining) [2025-02-06 13:14:44,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 60 remaining) [2025-02-06 13:14:44,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 60 remaining) [2025-02-06 13:14:44,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 60 remaining) [2025-02-06 13:14:44,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 60 remaining) [2025-02-06 13:14:44,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 60 remaining) [2025-02-06 13:14:44,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 60 remaining) [2025-02-06 13:14:44,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 60 remaining) [2025-02-06 13:14:44,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 60 remaining) [2025-02-06 13:14:44,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 60 remaining) [2025-02-06 13:14:44,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 60 remaining) [2025-02-06 13:14:44,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 60 remaining) [2025-02-06 13:14:44,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 60 remaining) [2025-02-06 13:14:44,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 60 remaining) [2025-02-06 13:14:44,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 60 remaining) [2025-02-06 13:14:44,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 60 remaining) [2025-02-06 13:14:44,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 60 remaining) [2025-02-06 13:14:44,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 60 remaining) [2025-02-06 13:14:44,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 60 remaining) [2025-02-06 13:14:44,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 60 remaining) [2025-02-06 13:14:44,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 60 remaining) [2025-02-06 13:14:44,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 60 remaining) [2025-02-06 13:14:44,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 60 remaining) [2025-02-06 13:14:44,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 60 remaining) [2025-02-06 13:14:44,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 60 remaining) [2025-02-06 13:14:44,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 60 remaining) [2025-02-06 13:14:44,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 60 remaining) [2025-02-06 13:14:44,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 60 remaining) [2025-02-06 13:14:44,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 60 remaining) [2025-02-06 13:14:44,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 60 remaining) [2025-02-06 13:14:44,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 60 remaining) [2025-02-06 13:14:44,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 60 remaining) [2025-02-06 13:14:44,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 60 remaining) [2025-02-06 13:14:44,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 60 remaining) [2025-02-06 13:14:44,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 60 remaining) [2025-02-06 13:14:44,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 60 remaining) [2025-02-06 13:14:44,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 60 remaining) [2025-02-06 13:14:44,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 60 remaining) [2025-02-06 13:14:44,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 60 remaining) [2025-02-06 13:14:44,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 60 remaining) [2025-02-06 13:14:44,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 60 remaining) [2025-02-06 13:14:44,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 60 remaining) [2025-02-06 13:14:44,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 60 remaining) [2025-02-06 13:14:44,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 60 remaining) [2025-02-06 13:14:44,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 60 remaining) [2025-02-06 13:14:44,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:14:44,486 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:44,487 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 13:14:44,487 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 13:14:44,568 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 13:14:44,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 252 places, 364 transitions, 744 flow [2025-02-06 13:14:44,654 INFO L124 PetriNetUnfolderBase]: 154/495 cut-off events. [2025-02-06 13:14:44,657 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 13:14:44,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 495 events. 154/495 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2154 event pairs, 0 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 354. Up to 12 conditions per place. [2025-02-06 13:14:44,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 252 places, 364 transitions, 744 flow [2025-02-06 13:14:44,683 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 252 places, 364 transitions, 744 flow [2025-02-06 13:14:44,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:14:44,687 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4104d151, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:14:44,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2025-02-06 13:14:44,689 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:14:44,689 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-02-06 13:14:44,689 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 13:14:44,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:44,689 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-06 13:14:44,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2025-02-06 13:14:44,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:44,690 INFO L85 PathProgramCache]: Analyzing trace with hash 43450, now seen corresponding path program 1 times [2025-02-06 13:14:44,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:44,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627708126] [2025-02-06 13:14:44,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:44,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:44,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 13:14:44,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 13:14:44,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:44,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:44,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:44,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:44,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627708126] [2025-02-06 13:14:44,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627708126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:44,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:44,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:14:44,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518906543] [2025-02-06 13:14:44,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:44,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:44,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:44,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:44,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:44,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 364 [2025-02-06 13:14:44,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 364 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 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-02-06 13:14:44,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:44,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 364 [2025-02-06 13:14:44,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:49,960 INFO L124 PetriNetUnfolderBase]: 31274/67753 cut-off events. [2025-02-06 13:14:49,960 INFO L125 PetriNetUnfolderBase]: For 330/330 co-relation queries the response was YES. [2025-02-06 13:14:50,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114369 conditions, 67753 events. 31274/67753 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 2253. Compared 763051 event pairs, 27343 based on Foata normal form. 48122/99641 useless extension candidates. Maximal degree in co-relation 111717. Up to 46416 conditions per place. [2025-02-06 13:14:50,305 INFO L140 encePairwiseOnDemand]: 253/364 looper letters, 108 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2025-02-06 13:14:50,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 253 transitions, 742 flow [2025-02-06 13:14:50,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2025-02-06 13:14:50,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5934065934065934 [2025-02-06 13:14:50,308 INFO L175 Difference]: Start difference. First operand has 252 places, 364 transitions, 744 flow. Second operand 3 states and 648 transitions. [2025-02-06 13:14:50,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 253 transitions, 742 flow [2025-02-06 13:14:50,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 253 transitions, 742 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 13:14:50,313 INFO L231 Difference]: Finished difference. Result has 247 places, 253 transitions, 526 flow [2025-02-06 13:14:50,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=247, PETRI_TRANSITIONS=253} [2025-02-06 13:14:50,314 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -5 predicate places. [2025-02-06 13:14:50,314 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 253 transitions, 526 flow [2025-02-06 13:14:50,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 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-02-06 13:14:50,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:50,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-06 13:14:50,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:14:50,316 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2025-02-06 13:14:50,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:50,316 INFO L85 PathProgramCache]: Analyzing trace with hash 43451, now seen corresponding path program 1 times [2025-02-06 13:14:50,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:50,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837401054] [2025-02-06 13:14:50,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:50,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:50,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 13:14:50,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 13:14:50,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:50,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:50,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:50,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837401054] [2025-02-06 13:14:50,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837401054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:50,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:50,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:14:50,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317172687] [2025-02-06 13:14:50,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:50,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:50,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:50,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:50,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:50,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 364 [2025-02-06 13:14:50,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 253 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 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-02-06 13:14:50,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:50,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 364 [2025-02-06 13:14:50,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:54,887 INFO L124 PetriNetUnfolderBase]: 31274/67752 cut-off events. [2025-02-06 13:14:54,888 INFO L125 PetriNetUnfolderBase]: For 330/330 co-relation queries the response was YES. [2025-02-06 13:14:55,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114370 conditions, 67752 events. 31274/67752 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 2253. Compared 763090 event pairs, 27343 based on Foata normal form. 0/51519 useless extension candidates. Maximal degree in co-relation 114357. Up to 46416 conditions per place. [2025-02-06 13:14:55,240 INFO L140 encePairwiseOnDemand]: 361/364 looper letters, 107 selfloop transitions, 2 changer transitions 0/252 dead transitions. [2025-02-06 13:14:55,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 252 transitions, 742 flow [2025-02-06 13:14:55,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 539 transitions. [2025-02-06 13:14:55,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4935897435897436 [2025-02-06 13:14:55,242 INFO L175 Difference]: Start difference. First operand has 247 places, 253 transitions, 526 flow. Second operand 3 states and 539 transitions. [2025-02-06 13:14:55,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 252 transitions, 742 flow [2025-02-06 13:14:55,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 252 transitions, 738 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:55,248 INFO L231 Difference]: Finished difference. Result has 246 places, 252 transitions, 524 flow [2025-02-06 13:14:55,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=246, PETRI_TRANSITIONS=252} [2025-02-06 13:14:55,248 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -6 predicate places. [2025-02-06 13:14:55,249 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 252 transitions, 524 flow [2025-02-06 13:14:55,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 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-02-06 13:14:55,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:55,250 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 13:14:55,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 13:14:55,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2025-02-06 13:14:55,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:55,250 INFO L85 PathProgramCache]: Analyzing trace with hash 41795136, now seen corresponding path program 1 times [2025-02-06 13:14:55,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:55,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733510767] [2025-02-06 13:14:55,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:55,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:55,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 13:14:55,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 13:14:55,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:55,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:55,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:55,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:55,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733510767] [2025-02-06 13:14:55,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733510767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:55,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:55,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:55,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562436606] [2025-02-06 13:14:55,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:55,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:14:55,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:55,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:14:55,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:14:55,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 364 [2025-02-06 13:14:55,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 252 transitions, 524 flow. Second operand has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 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-02-06 13:14:55,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:55,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 364 [2025-02-06 13:14:55,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:00,448 INFO L124 PetriNetUnfolderBase]: 31274/67751 cut-off events. [2025-02-06 13:15:00,449 INFO L125 PetriNetUnfolderBase]: For 330/330 co-relation queries the response was YES. [2025-02-06 13:15:00,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114368 conditions, 67751 events. 31274/67751 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 2253. Compared 762825 event pairs, 27343 based on Foata normal form. 0/51519 useless extension candidates. Maximal degree in co-relation 114355. Up to 46412 conditions per place. [2025-02-06 13:15:00,742 INFO L140 encePairwiseOnDemand]: 360/364 looper letters, 105 selfloop transitions, 3 changer transitions 0/251 dead transitions. [2025-02-06 13:15:00,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 251 transitions, 738 flow [2025-02-06 13:15:00,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:15:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:15:00,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 681 transitions. [2025-02-06 13:15:00,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4677197802197802 [2025-02-06 13:15:00,744 INFO L175 Difference]: Start difference. First operand has 246 places, 252 transitions, 524 flow. Second operand 4 states and 681 transitions. [2025-02-06 13:15:00,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 251 transitions, 738 flow [2025-02-06 13:15:00,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 251 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:15:00,748 INFO L231 Difference]: Finished difference. Result has 246 places, 251 transitions, 524 flow [2025-02-06 13:15:00,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=524, PETRI_PLACES=246, PETRI_TRANSITIONS=251} [2025-02-06 13:15:00,749 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -6 predicate places. [2025-02-06 13:15:00,750 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 251 transitions, 524 flow [2025-02-06 13:15:00,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 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-02-06 13:15:00,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:00,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 13:15:00,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 13:15:00,750 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2025-02-06 13:15:00,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:00,751 INFO L85 PathProgramCache]: Analyzing trace with hash 41795137, now seen corresponding path program 1 times [2025-02-06 13:15:00,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:00,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714351675] [2025-02-06 13:15:00,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:00,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:00,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 13:15:00,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 13:15:00,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:00,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:00,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:00,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714351675] [2025-02-06 13:15:00,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714351675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:15:00,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:15:00,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:15:00,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029933274] [2025-02-06 13:15:00,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:15:00,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:15:00,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:00,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:15:00,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:15:00,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 364 [2025-02-06 13:15:00,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 251 transitions, 524 flow. Second operand has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 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-02-06 13:15:00,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:00,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 364 [2025-02-06 13:15:00,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:05,741 INFO L124 PetriNetUnfolderBase]: 31274/67750 cut-off events. [2025-02-06 13:15:05,741 INFO L125 PetriNetUnfolderBase]: For 330/330 co-relation queries the response was YES. [2025-02-06 13:15:05,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114367 conditions, 67750 events. 31274/67750 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 2253. Compared 763154 event pairs, 27343 based on Foata normal form. 0/51519 useless extension candidates. Maximal degree in co-relation 114349. Up to 46412 conditions per place. [2025-02-06 13:15:06,147 INFO L140 encePairwiseOnDemand]: 360/364 looper letters, 104 selfloop transitions, 3 changer transitions 0/250 dead transitions. [2025-02-06 13:15:06,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 250 transitions, 736 flow [2025-02-06 13:15:06,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:15:06,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:15:06,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 680 transitions. [2025-02-06 13:15:06,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46703296703296704 [2025-02-06 13:15:06,149 INFO L175 Difference]: Start difference. First operand has 246 places, 251 transitions, 524 flow. Second operand 4 states and 680 transitions. [2025-02-06 13:15:06,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 250 transitions, 736 flow [2025-02-06 13:15:06,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 250 transitions, 730 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:15:06,156 INFO L231 Difference]: Finished difference. Result has 245 places, 250 transitions, 522 flow [2025-02-06 13:15:06,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=522, PETRI_PLACES=245, PETRI_TRANSITIONS=250} [2025-02-06 13:15:06,157 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -7 predicate places. [2025-02-06 13:15:06,157 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 250 transitions, 522 flow [2025-02-06 13:15:06,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 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-02-06 13:15:06,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:06,157 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:06,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 13:15:06,157 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2025-02-06 13:15:06,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:06,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1349710313, now seen corresponding path program 1 times [2025-02-06 13:15:06,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:06,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174985549] [2025-02-06 13:15:06,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:06,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:06,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 13:15:06,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 13:15:06,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:06,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:06,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:06,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174985549] [2025-02-06 13:15:06,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174985549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:15:06,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:15:06,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:15:06,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668738017] [2025-02-06 13:15:06,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:15:06,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:15:06,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:06,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:15:06,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:15:06,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 364 [2025-02-06 13:15:06,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 250 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 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-02-06 13:15:06,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:06,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 364 [2025-02-06 13:15:06,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:10,656 INFO L124 PetriNetUnfolderBase]: 31274/67751 cut-off events. [2025-02-06 13:15:10,657 INFO L125 PetriNetUnfolderBase]: For 330/330 co-relation queries the response was YES. [2025-02-06 13:15:10,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114369 conditions, 67751 events. 31274/67751 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 2253. Compared 762948 event pairs, 27343 based on Foata normal form. 0/51520 useless extension candidates. Maximal degree in co-relation 114351. Up to 46416 conditions per place. [2025-02-06 13:15:10,979 INFO L140 encePairwiseOnDemand]: 361/364 looper letters, 106 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2025-02-06 13:15:10,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 251 transitions, 740 flow [2025-02-06 13:15:10,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:15:10,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:15:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions. [2025-02-06 13:15:10,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4926739926739927 [2025-02-06 13:15:10,981 INFO L175 Difference]: Start difference. First operand has 245 places, 250 transitions, 522 flow. Second operand 3 states and 538 transitions. [2025-02-06 13:15:10,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 251 transitions, 740 flow [2025-02-06 13:15:10,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 251 transitions, 734 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:15:10,985 INFO L231 Difference]: Finished difference. Result has 245 places, 251 transitions, 528 flow [2025-02-06 13:15:10,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=528, PETRI_PLACES=245, PETRI_TRANSITIONS=251} [2025-02-06 13:15:10,986 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -7 predicate places. [2025-02-06 13:15:10,986 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 251 transitions, 528 flow [2025-02-06 13:15:10,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 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-02-06 13:15:10,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:10,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:10,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 13:15:10,987 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2025-02-06 13:15:10,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:10,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1206592449, now seen corresponding path program 1 times [2025-02-06 13:15:10,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:10,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879877646] [2025-02-06 13:15:10,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:10,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:10,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:15:10,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:15:10,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:10,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:11,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:11,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879877646] [2025-02-06 13:15:11,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879877646] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:15:11,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128897814] [2025-02-06 13:15:11,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:11,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:15:11,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:15:11,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:15:11,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 13:15:11,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:15:11,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:15:11,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:11,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:11,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 13:15:11,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:15:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:11,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:15:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:11,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128897814] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:15:11,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:15:11,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-06 13:15:11,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824318209] [2025-02-06 13:15:11,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:15:11,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:15:11,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:11,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:15:11,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:15:11,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 364 [2025-02-06 13:15:11,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 251 transitions, 528 flow. Second operand has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 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-02-06 13:15:11,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:11,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 364 [2025-02-06 13:15:11,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand