./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/libvsync/ttaslock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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/ttaslock.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 1232142cbd2d3669d71853399351b59e265805f095536d7cdae31e54b7810261 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:46:24,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:46:24,699 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:46:24,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:46:24,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:46:24,720 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:46:24,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:46:24,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:46:24,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:46:24,725 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:46:24,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:46:24,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:46:24,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:46:24,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:46:24,725 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:46:24,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:46:24,725 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:46:24,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:46:24,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:46:24,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:46:24,725 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:46:24,726 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:46:24,726 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:46:24,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:46:24,726 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:46:24,726 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:46:24,726 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:46:24,726 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:46:24,726 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:46:24,726 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:46:24,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:46:24,726 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:46:24,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:46:24,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:46:24,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:46:24,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:46:24,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:46:24,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:46:24,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:46:24,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:46:24,727 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:46:24,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:46:24,727 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 -> 1232142cbd2d3669d71853399351b59e265805f095536d7cdae31e54b7810261 [2025-02-08 08:46:24,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:46:24,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:46:24,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:46:24,959 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:46:24,960 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:46:24,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/ttaslock.i [2025-02-08 08:46:26,114 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4513ee2e6/f485e18c955b4326be85c97c46be2ba2/FLAGb28123863 [2025-02-08 08:46:26,617 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:46:26,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/ttaslock.i [2025-02-08 08:46:26,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4513ee2e6/f485e18c955b4326be85c97c46be2ba2/FLAGb28123863 [2025-02-08 08:46:27,167 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4513ee2e6/f485e18c955b4326be85c97c46be2ba2 [2025-02-08 08:46:27,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:46:27,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:46:27,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:46:27,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:46:27,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:46:27,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:46:27" (1/1) ... [2025-02-08 08:46:27,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@733e2faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:27, skipping insertion in model container [2025-02-08 08:46:27,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:46:27" (1/1) ... [2025-02-08 08:46:27,230 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:46:28,791 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-08 08:46:28,798 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-08 08:46:28,799 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-08 08:46:28,804 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-08 08:46:28,804 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-08 08:46:29,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:46:29,258 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:46:29,340 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-02-08 08:46:29,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-02-08 08:46:29,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-02-08 08:46:29,344 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-02-08 08:46:29,344 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-02-08 08:46:29,345 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-02-08 08:46:29,345 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-02-08 08:46:29,346 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-02-08 08:46:29,346 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-02-08 08:46:29,347 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-02-08 08:46:29,347 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-02-08 08:46:29,347 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-02-08 08:46:29,347 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-02-08 08:46:29,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-02-08 08:46:29,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-02-08 08:46:29,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-02-08 08:46:29,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-02-08 08:46:29,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-02-08 08:46:29,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-02-08 08:46:29,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-02-08 08:46:29,349 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-02-08 08:46:29,349 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-02-08 08:46:29,349 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-02-08 08:46:29,349 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-02-08 08:46:29,349 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-02-08 08:46:29,349 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-02-08 08:46:29,349 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-02-08 08:46:29,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-02-08 08:46:29,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-02-08 08:46:29,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-02-08 08:46:29,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-02-08 08:46:29,409 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-02-08 08:46:29,413 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-02-08 08:46:29,414 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-02-08 08:46:29,414 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-02-08 08:46:29,414 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-02-08 08:46:29,414 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-02-08 08:46:29,414 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-02-08 08:46:29,415 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-02-08 08:46:29,415 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-02-08 08:46:29,415 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-02-08 08:46:29,415 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-02-08 08:46:29,416 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-02-08 08:46:29,416 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-02-08 08:46:29,416 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-02-08 08:46:29,417 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-02-08 08:46:29,417 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-02-08 08:46:29,417 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-02-08 08:46:29,417 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-02-08 08:46:29,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-02-08 08:46:29,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-02-08 08:46:29,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-02-08 08:46:29,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-02-08 08:46:29,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-02-08 08:46:29,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-02-08 08:46:29,421 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-02-08 08:46:29,421 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-02-08 08:46:29,423 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-02-08 08:46:29,423 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-02-08 08:46:29,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-02-08 08:46:29,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-02-08 08:46:29,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-02-08 08:46:29,426 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-02-08 08:46:29,426 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-02-08 08:46:29,426 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-02-08 08:46:29,427 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-02-08 08:46:29,428 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-02-08 08:46:29,428 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-02-08 08:46:29,428 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-02-08 08:46:29,428 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-02-08 08:46:29,428 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-02-08 08:46:29,429 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-02-08 08:46:29,429 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-02-08 08:46:29,429 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-02-08 08:46:29,429 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-02-08 08:46:29,430 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-02-08 08:46:29,430 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-02-08 08:46:29,430 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-02-08 08:46:29,430 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-02-08 08:46:29,430 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-02-08 08:46:29,430 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-02-08 08:46:29,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-02-08 08:46:29,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-02-08 08:46:29,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-02-08 08:46:29,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-02-08 08:46:29,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-02-08 08:46:29,436 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-02-08 08:46:29,436 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-02-08 08:46:29,437 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-02-08 08:46:29,437 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-02-08 08:46:29,437 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-02-08 08:46:29,437 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-02-08 08:46:29,437 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-02-08 08:46:29,437 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-02-08 08:46:29,438 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-02-08 08:46:29,438 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-02-08 08:46:29,438 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-02-08 08:46:29,438 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-02-08 08:46:29,438 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-02-08 08:46:29,438 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-02-08 08:46:29,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:46:29,667 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:46:29,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:29 WrapperNode [2025-02-08 08:46:29,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:46:29,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:46:29,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:46:29,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:46:29,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:29" (1/1) ... [2025-02-08 08:46:29,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:29" (1/1) ... [2025-02-08 08:46:29,748 INFO L138 Inliner]: procedures = 917, calls = 913, calls flagged for inlining = 815, calls inlined = 29, statements flattened = 263 [2025-02-08 08:46:29,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:46:29,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:46:29,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:46:29,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:46:29,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:29" (1/1) ... [2025-02-08 08:46:29,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:29" (1/1) ... [2025-02-08 08:46:29,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:29" (1/1) ... [2025-02-08 08:46:29,775 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 5, 2]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 3 writes are split as follows [0, 2, 1]. [2025-02-08 08:46:29,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:29" (1/1) ... [2025-02-08 08:46:29,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:29" (1/1) ... [2025-02-08 08:46:29,788 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:29" (1/1) ... [2025-02-08 08:46:29,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:29" (1/1) ... [2025-02-08 08:46:29,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:29" (1/1) ... [2025-02-08 08:46:29,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:29" (1/1) ... [2025-02-08 08:46:29,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:46:29,801 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:46:29,801 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:46:29,801 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:46:29,802 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:29" (1/1) ... [2025-02-08 08:46:29,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:46:29,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:46:29,831 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-08 08:46:29,840 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-08 08:46:29,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:46:29,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:46:29,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:46:29,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:46:29,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:46:29,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:46:29,859 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-02-08 08:46:29,859 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-02-08 08:46:29,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:46:29,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:46:29,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:46:29,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:46:29,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:46:29,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:46:29,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:46:29,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:46:29,862 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:46:29,974 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:46:29,975 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:46:30,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3867-1: vatomic32_xchg_~a#1.base, vatomic32_xchg_~a#1.offset := vatomic32_xchg_#in~a#1.base, vatomic32_xchg_#in~a#1.offset; [2025-02-08 08:46:30,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3867: vatomic32_xchg_~v#1 := vatomic32_xchg_#in~v#1; [2025-02-08 08:46:30,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4842: vatomic32_await_eq_~ret~0#1 := vatomic32_await_eq_~o~5#1; [2025-02-08 08:46:30,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 08:46:30,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-1: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 08:46:30,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3871: vatomic32_xchg_~tmp~8#1 := vatomic32_xchg_#t~mem438#1; [2025-02-08 08:46:30,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: assume true; [2025-02-08 08:46:30,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: assume !true; [2025-02-08 08:46:30,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-1: assume false; [2025-02-08 08:46:30,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-1: assume !false; [2025-02-08 08:46:30,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-2: assume true; [2025-02-08 08:46:30,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-2: assume !true; [2025-02-08 08:46:30,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-3: assume false; [2025-02-08 08:46:30,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-3: assume !false; [2025-02-08 08:46:30,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-4: assume true; [2025-02-08 08:46:30,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-4: assume !true; [2025-02-08 08:46:30,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-5: assume false; [2025-02-08 08:46:30,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-5: assume !false; [2025-02-08 08:46:30,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-6: assume true; [2025-02-08 08:46:30,185 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-6: assume !true; [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-7: assume false; [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-7: assume !false; [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-8: assume true; [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-8: assume !true; [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-9: assume false; [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-9: assume !false; [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-10: assume true; [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-10: assume !true; [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-11: assume false; [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-11: assume !false; [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872: havoc vatomic32_xchg_#t~mem438#1; [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-2: SUMMARY for call write~int#1(vatomic32_xchg_~v#1, vatomic32_xchg_~a#1.base, vatomic32_xchg_~a#1.offset, 4); srcloc: null [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-2: assume !(1 == #valid[vatomic32_xchg_~a#1.base]); [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-2: assume !(4 + vatomic32_xchg_~a#1.offset <= #length[vatomic32_xchg_~a#1.base] && 0 <= vatomic32_xchg_~a#1.offset); [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-1: [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-4: [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-3: SUMMARY for call vatomic32_xchg_#t~mem438#1 := read~int#1(vatomic32_xchg_~a#1.base, vatomic32_xchg_~a#1.offset, 4); srcloc: null [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-3: assume !(1 == #valid[vatomic32_xchg_~a#1.base]); [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-3: assume !(4 + vatomic32_xchg_~a#1.offset <= #length[vatomic32_xchg_~a#1.base] && 0 <= vatomic32_xchg_~a#1.offset); [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907: vatomic32_xchg_acq_~v#1 := vatomic32_xchg_acq_#in~v#1; [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907-1: vatomic32_xchg_acq_~a#1.base, vatomic32_xchg_acq_~a#1.offset := vatomic32_xchg_acq_#in~a#1.base, vatomic32_xchg_acq_#in~a#1.offset; [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255: havoc vatomic32_await_eq_rlx_#t~ret168#1; [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255-3: assume { :end_inline_vatomic32_await_eq } true;vatomic32_await_eq_rlx_#res#1 := vatomic32_await_eq_rlx_#t~ret168#1; [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255-2: havoc vatomic32_await_eq_rlx_#t~ret168#1; [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255-5: havoc vatomic32_await_eq_#t~ret636#1, vatomic32_await_eq_#t~ite637#1, vatomic32_await_eq_~a#1.base, vatomic32_await_eq_~a#1.offset, vatomic32_await_eq_~c#1, vatomic32_await_eq_~ret~0#1, vatomic32_await_eq_~o~5#1; [2025-02-08 08:46:30,186 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255-4: havoc vatomic32_await_eq_#in~a#1.base, vatomic32_await_eq_#in~a#1.offset, vatomic32_await_eq_#in~c#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255-6: vatomic32_await_eq_rlx_#t~ret168#1 := vatomic32_await_eq_#res#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3874-1: vatomic32_xchg_#res#1 := vatomic32_xchg_~tmp~8#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910: havoc vatomic32_xchg_acq_#t~ret115#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-2: havoc vatomic32_xchg_acq_#t~ret115#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-3: assume { :end_inline_vatomic32_xchg } true;vatomic32_xchg_acq_#res#1 := vatomic32_xchg_acq_#t~ret115#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-4: havoc vatomic32_xchg_#in~a#1.base, vatomic32_xchg_#in~a#1.offset, vatomic32_xchg_#in~v#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-5: havoc vatomic32_xchg_#t~mem438#1, vatomic32_xchg_~a#1.base, vatomic32_xchg_~a#1.offset, vatomic32_xchg_~v#1, vatomic32_xchg_~tmp~8#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-6: vatomic32_xchg_acq_#t~ret115#1 := vatomic32_xchg_#res#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-7: havoc vatomic32_xchg_#t~mem438#1, vatomic32_xchg_~a#1.base, vatomic32_xchg_~a#1.offset, vatomic32_xchg_~v#1, vatomic32_xchg_~tmp~8#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-8: havoc vatomic32_xchg_#res#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-9: assume { :begin_inline_vatomic32_xchg } true;vatomic32_xchg_#in~a#1.base, vatomic32_xchg_#in~a#1.offset, vatomic32_xchg_#in~v#1 := vatomic32_xchg_acq_~a#1.base, vatomic32_xchg_acq_~a#1.offset, vatomic32_xchg_acq_~v#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5383: assume { :end_inline_vatomic32_await_eq_rlx } true;havoc ttaslock_acquire_#t~ret758#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5383-1: havoc vatomic32_await_eq_rlx_#in~a#1.base, vatomic32_await_eq_rlx_#in~a#1.offset, vatomic32_await_eq_rlx_#in~v#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5383-2: havoc vatomic32_await_eq_rlx_#t~ret168#1, vatomic32_await_eq_rlx_~a#1.base, vatomic32_await_eq_rlx_~a#1.offset, vatomic32_await_eq_rlx_~v#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5383-3: ttaslock_acquire_#t~ret758#1 := vatomic32_await_eq_rlx_#res#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384-1: havoc ttaslock_acquire_#t~ret759#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384-2: havoc ttaslock_acquire_#t~ret759#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384: assume 0 == ttaslock_acquire_#t~ret759#1 % 4294967296; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384: assume !(0 == ttaslock_acquire_#t~ret759#1 % 4294967296); [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384-5: ttaslock_acquire_#t~ret759#1 := vatomic32_xchg_acq_#res#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384-6: havoc vatomic32_xchg_acq_#t~ret115#1, vatomic32_xchg_acq_~a#1.base, vatomic32_xchg_acq_~a#1.offset, vatomic32_xchg_acq_~v#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384-3: havoc vatomic32_xchg_acq_#in~a#1.base, vatomic32_xchg_acq_#in~a#1.offset, vatomic32_xchg_acq_#in~v#1;assume { :end_inline_vatomic32_xchg_acq } true; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384-4: havoc vatomic32_xchg_acq_#t~ret115#1, vatomic32_xchg_acq_~a#1.base, vatomic32_xchg_acq_~a#1.offset, vatomic32_xchg_acq_~v#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384-7: havoc vatomic32_xchg_acq_#res#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384-8: assume { :begin_inline_vatomic32_xchg_acq } true;vatomic32_xchg_acq_#in~a#1.base, vatomic32_xchg_acq_#in~a#1.offset, vatomic32_xchg_acq_#in~v#1 := ttaslock_acquire_~l#1.base, ttaslock_acquire_~l#1.offset, 1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-1: havoc verification_spin_end_#in~v#1;assume { :end_inline_verification_spin_end } true; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-2: havoc verification_spin_end_~v#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-5: havoc vatomic32_await_eq_#t~ite637#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-6: havoc vatomic32_await_eq_#t~ite637#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-3: havoc verification_spin_end_~v#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-4: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 0; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-9: havoc vatomic32_await_eq_#t~ret636#1; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-10: assume { :end_inline_verification_spin_end } true;vatomic32_await_eq_#t~ite637#1 := 0; [2025-02-08 08:46:30,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-7: assume 0 != vatomic32_await_eq_#t~ite637#1; [2025-02-08 08:46:30,188 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-7: assume !(0 != vatomic32_await_eq_#t~ite637#1); [2025-02-08 08:46:30,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-8: havoc vatomic32_await_eq_#t~ret636#1; [2025-02-08 08:46:30,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-13: havoc verification_spin_end_~v#1; [2025-02-08 08:46:30,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-14: assume vatomic32_await_eq_~o~5#1 % 4294967296 != vatomic32_await_eq_~c#1 % 4294967296; [2025-02-08 08:46:30,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-14: assume !(vatomic32_await_eq_~o~5#1 % 4294967296 != vatomic32_await_eq_~c#1 % 4294967296); [2025-02-08 08:46:30,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-11: havoc verification_spin_end_#in~v#1; [2025-02-08 08:46:30,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-12: havoc verification_spin_end_~v#1; [2025-02-08 08:46:30,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-17: assume { :end_inline_vatomic32_read } true;vatomic32_await_eq_~o~5#1 := vatomic32_await_eq_#t~ret636#1; [2025-02-08 08:46:30,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-18: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 08:46:30,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-15: vatomic32_await_eq_#t~ite637#1 := 1; [2025-02-08 08:46:30,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-16: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 1; [2025-02-08 08:46:30,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-19: havoc vatomic32_read_#t~mem432#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 08:46:30,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-20: vatomic32_await_eq_#t~ret636#1 := vatomic32_read_#res#1; [2025-02-08 08:46:30,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841: assume true; [2025-02-08 08:46:30,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841: assume !true; [2025-02-08 08:46:30,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841-1: assume false; [2025-02-08 08:46:30,192 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841-1: assume !false; [2025-02-08 08:46:30,290 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6001: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-02-08 08:46:30,290 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6001-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-02-08 08:46:30,291 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:46:30,291 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:46:30,392 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:46:30,396 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:46:30,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:46:30 BoogieIcfgContainer [2025-02-08 08:46:30,397 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:46:30,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:46:30,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:46:30,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:46:30,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:46:27" (1/3) ... [2025-02-08 08:46:30,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f8191f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:46:30, skipping insertion in model container [2025-02-08 08:46:30,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:29" (2/3) ... [2025-02-08 08:46:30,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f8191f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:46:30, skipping insertion in model container [2025-02-08 08:46:30,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:46:30" (3/3) ... [2025-02-08 08:46:30,405 INFO L128 eAbstractionObserver]: Analyzing ICFG ttaslock.i [2025-02-08 08:46:30,415 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:46:30,417 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ttaslock.i that has 2 procedures, 97 locations, 1 initial locations, 37 loop locations, and 15 error locations. [2025-02-08 08:46:30,417 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:46:30,485 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 08:46:30,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 151 transitions, 309 flow [2025-02-08 08:46:30,566 INFO L124 PetriNetUnfolderBase]: 68/199 cut-off events. [2025-02-08 08:46:30,569 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 08:46:30,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 199 events. 68/199 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 757 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 133. Up to 6 conditions per place. [2025-02-08 08:46:30,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 151 transitions, 309 flow [2025-02-08 08:46:30,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 151 transitions, 309 flow [2025-02-08 08:46:30,587 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:46:30,598 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;@2c9e4e04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:46:30,599 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 08:46:30,603 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:46:30,603 INFO L124 PetriNetUnfolderBase]: 6/19 cut-off events. [2025-02-08 08:46:30,603 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:46:30,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:30,604 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:46:30,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 08:46:30,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:30,609 INFO L85 PathProgramCache]: Analyzing trace with hash 652129518, now seen corresponding path program 1 times [2025-02-08 08:46:30,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:30,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362880416] [2025-02-08 08:46:30,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:30,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:30,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:46:30,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:46:30,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:30,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:30,749 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-08 08:46:30,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:30,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362880416] [2025-02-08 08:46:30,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362880416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:30,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:30,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:46:30,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58509926] [2025-02-08 08:46:30,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:30,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:46:30,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:30,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:46:30,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:46:30,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 151 [2025-02-08 08:46:30,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 151 transitions, 309 flow. Second operand has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 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-08 08:46:30,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:30,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 151 [2025-02-08 08:46:30,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:30,966 INFO L124 PetriNetUnfolderBase]: 201/767 cut-off events. [2025-02-08 08:46:30,966 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-02-08 08:46:30,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 767 events. 201/767 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4495 event pairs, 180 based on Foata normal form. 579/1228 useless extension candidates. Maximal degree in co-relation 1130. Up to 423 conditions per place. [2025-02-08 08:46:30,973 INFO L140 encePairwiseOnDemand]: 99/151 looper letters, 36 selfloop transitions, 0 changer transitions 0/97 dead transitions. [2025-02-08 08:46:30,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 97 transitions, 273 flow [2025-02-08 08:46:30,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:46:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:46:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 210 transitions. [2025-02-08 08:46:30,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.695364238410596 [2025-02-08 08:46:30,985 INFO L175 Difference]: Start difference. First operand has 100 places, 151 transitions, 309 flow. Second operand 2 states and 210 transitions. [2025-02-08 08:46:30,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 97 transitions, 273 flow [2025-02-08 08:46:30,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 97 transitions, 273 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:46:30,994 INFO L231 Difference]: Finished difference. Result has 98 places, 97 transitions, 201 flow [2025-02-08 08:46:30,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=201, PETRI_PLACES=98, PETRI_TRANSITIONS=97} [2025-02-08 08:46:31,000 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2025-02-08 08:46:31,001 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 97 transitions, 201 flow [2025-02-08 08:46:31,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 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-08 08:46:31,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:31,001 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:31,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:46:31,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 08:46:31,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:31,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1747151817, now seen corresponding path program 1 times [2025-02-08 08:46:31,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:31,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685387371] [2025-02-08 08:46:31,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:31,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:31,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:46:31,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:46:31,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:31,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:31,113 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-08 08:46:31,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:31,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685387371] [2025-02-08 08:46:31,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685387371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:31,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:31,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:46:31,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486926835] [2025-02-08 08:46:31,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:31,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:46:31,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:31,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:46:31,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:46:31,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 151 [2025-02-08 08:46:31,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 97 transitions, 201 flow. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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-08 08:46:31,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:31,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 151 [2025-02-08 08:46:31,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:31,314 INFO L124 PetriNetUnfolderBase]: 245/863 cut-off events. [2025-02-08 08:46:31,315 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 08:46:31,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1380 conditions, 863 events. 245/863 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 5300 event pairs, 180 based on Foata normal form. 0/747 useless extension candidates. Maximal degree in co-relation 1376. Up to 422 conditions per place. [2025-02-08 08:46:31,321 INFO L140 encePairwiseOnDemand]: 147/151 looper letters, 58 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2025-02-08 08:46:31,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 117 transitions, 361 flow [2025-02-08 08:46:31,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:46:31,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:46:31,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2025-02-08 08:46:31,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5143487858719646 [2025-02-08 08:46:31,325 INFO L175 Difference]: Start difference. First operand has 98 places, 97 transitions, 201 flow. Second operand 3 states and 233 transitions. [2025-02-08 08:46:31,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 117 transitions, 361 flow [2025-02-08 08:46:31,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 117 transitions, 361 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:46:31,329 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 201 flow [2025-02-08 08:46:31,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2025-02-08 08:46:31,330 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2025-02-08 08:46:31,330 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 201 flow [2025-02-08 08:46:31,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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-08 08:46:31,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:31,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:31,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:46:31,331 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 08:46:31,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:31,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1747151818, now seen corresponding path program 1 times [2025-02-08 08:46:31,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:31,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958819140] [2025-02-08 08:46:31,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:31,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:31,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:46:31,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:46:31,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:31,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:31,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:31,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:31,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958819140] [2025-02-08 08:46:31,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958819140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:31,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:31,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:46:31,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263214829] [2025-02-08 08:46:31,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:31,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:46:31,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:31,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:46:31,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:46:31,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 151 [2025-02-08 08:46:31,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 201 flow. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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-08 08:46:31,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:31,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 151 [2025-02-08 08:46:31,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:31,823 INFO L124 PetriNetUnfolderBase]: 222/985 cut-off events. [2025-02-08 08:46:31,823 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-08 08:46:31,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1480 conditions, 985 events. 222/985 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6455 event pairs, 40 based on Foata normal form. 0/858 useless extension candidates. Maximal degree in co-relation 1475. Up to 264 conditions per place. [2025-02-08 08:46:31,830 INFO L140 encePairwiseOnDemand]: 144/151 looper letters, 77 selfloop transitions, 5 changer transitions 0/139 dead transitions. [2025-02-08 08:46:31,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 139 transitions, 453 flow [2025-02-08 08:46:31,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:46:31,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:46:31,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 320 transitions. [2025-02-08 08:46:31,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5298013245033113 [2025-02-08 08:46:31,833 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 201 flow. Second operand 4 states and 320 transitions. [2025-02-08 08:46:31,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 139 transitions, 453 flow [2025-02-08 08:46:31,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 139 transitions, 449 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:46:31,839 INFO L231 Difference]: Finished difference. Result has 100 places, 95 transitions, 219 flow [2025-02-08 08:46:31,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=100, PETRI_TRANSITIONS=95} [2025-02-08 08:46:31,839 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 0 predicate places. [2025-02-08 08:46:31,839 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 95 transitions, 219 flow [2025-02-08 08:46:31,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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-08 08:46:31,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:31,840 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:31,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:46:31,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 08:46:31,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:31,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1286299347, now seen corresponding path program 1 times [2025-02-08 08:46:31,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:31,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799602581] [2025-02-08 08:46:31,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:31,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:31,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:46:31,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:46:31,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:31,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:46:31,877 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:46:31,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:46:31,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:46:31,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:31,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:46:31,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:46:31,928 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:46:31,929 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-02-08 08:46:31,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2025-02-08 08:46:31,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2025-02-08 08:46:31,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2025-02-08 08:46:31,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-02-08 08:46:31,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (10 of 16 remaining) [2025-02-08 08:46:31,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 16 remaining) [2025-02-08 08:46:31,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (8 of 16 remaining) [2025-02-08 08:46:31,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2025-02-08 08:46:31,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2025-02-08 08:46:31,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2025-02-08 08:46:31,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2025-02-08 08:46:31,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 16 remaining) [2025-02-08 08:46:31,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2025-02-08 08:46:31,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2025-02-08 08:46:31,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 16 remaining) [2025-02-08 08:46:31,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:46:31,931 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 08:46:31,933 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:46:31,933 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 08:46:32,006 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 08:46:32,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 237 transitions, 490 flow [2025-02-08 08:46:32,040 INFO L124 PetriNetUnfolderBase]: 125/368 cut-off events. [2025-02-08 08:46:32,041 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 08:46:32,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 368 events. 125/368 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1574 event pairs, 0 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 250. Up to 12 conditions per place. [2025-02-08 08:46:32,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 237 transitions, 490 flow [2025-02-08 08:46:32,051 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 237 transitions, 490 flow [2025-02-08 08:46:32,053 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:46:32,057 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;@2c9e4e04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:46:32,057 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-02-08 08:46:32,059 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:46:32,059 INFO L124 PetriNetUnfolderBase]: 6/19 cut-off events. [2025-02-08 08:46:32,059 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:46:32,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:32,059 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:46:32,059 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-02-08 08:46:32,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:32,059 INFO L85 PathProgramCache]: Analyzing trace with hash 878299803, now seen corresponding path program 1 times [2025-02-08 08:46:32,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:32,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745312908] [2025-02-08 08:46:32,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:32,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:32,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:46:32,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:46:32,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:32,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:32,072 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-08 08:46:32,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:32,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745312908] [2025-02-08 08:46:32,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745312908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:32,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:32,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:46:32,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931086361] [2025-02-08 08:46:32,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:32,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:46:32,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:32,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:46:32,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:46:32,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 237 [2025-02-08 08:46:32,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 237 transitions, 490 flow. Second operand has 2 states, 2 states have (on average 93.0) internal successors, (186), 2 states have internal predecessors, (186), 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-08 08:46:32,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:32,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 237 [2025-02-08 08:46:32,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:33,644 INFO L124 PetriNetUnfolderBase]: 9219/18887 cut-off events. [2025-02-08 08:46:33,644 INFO L125 PetriNetUnfolderBase]: For 177/177 co-relation queries the response was YES. [2025-02-08 08:46:33,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33018 conditions, 18887 events. 9219/18887 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 169996 event pairs, 8320 based on Foata normal form. 18536/33430 useless extension candidates. Maximal degree in co-relation 31563. Up to 14019 conditions per place. [2025-02-08 08:46:33,767 INFO L140 encePairwiseOnDemand]: 153/237 looper letters, 60 selfloop transitions, 0 changer transitions 0/151 dead transitions. [2025-02-08 08:46:33,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 151 transitions, 438 flow [2025-02-08 08:46:33,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:46:33,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:46:33,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 326 transitions. [2025-02-08 08:46:33,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6877637130801688 [2025-02-08 08:46:33,769 INFO L175 Difference]: Start difference. First operand has 154 places, 237 transitions, 490 flow. Second operand 2 states and 326 transitions. [2025-02-08 08:46:33,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 151 transitions, 438 flow [2025-02-08 08:46:33,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 151 transitions, 438 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:46:33,776 INFO L231 Difference]: Finished difference. Result has 151 places, 151 transitions, 318 flow [2025-02-08 08:46:33,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=318, PETRI_PLACES=151, PETRI_TRANSITIONS=151} [2025-02-08 08:46:33,777 INFO L279 CegarLoopForPetriNet]: 154 programPoint places, -3 predicate places. [2025-02-08 08:46:33,778 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 151 transitions, 318 flow [2025-02-08 08:46:33,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 93.0) internal successors, (186), 2 states have internal predecessors, (186), 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-08 08:46:33,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:33,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:33,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:46:33,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-02-08 08:46:33,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:33,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1711345687, now seen corresponding path program 1 times [2025-02-08 08:46:33,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:33,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699645766] [2025-02-08 08:46:33,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:33,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:33,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:46:33,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:46:33,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:33,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:33,827 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-08 08:46:33,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:33,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699645766] [2025-02-08 08:46:33,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699645766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:33,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:33,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:46:33,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988361668] [2025-02-08 08:46:33,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:33,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:46:33,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:33,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:46:33,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:46:33,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 237 [2025-02-08 08:46:33,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 151 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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-08 08:46:33,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:33,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 237 [2025-02-08 08:46:33,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:35,321 INFO L124 PetriNetUnfolderBase]: 11133/22269 cut-off events. [2025-02-08 08:46:35,322 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2025-02-08 08:46:35,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39262 conditions, 22269 events. 11133/22269 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 201223 event pairs, 8300 based on Foata normal form. 0/17690 useless extension candidates. Maximal degree in co-relation 39257. Up to 13975 conditions per place. [2025-02-08 08:46:35,422 INFO L140 encePairwiseOnDemand]: 233/237 looper letters, 104 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2025-02-08 08:46:35,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 193 transitions, 614 flow [2025-02-08 08:46:35,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:46:35,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:46:35,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2025-02-08 08:46:35,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5189873417721519 [2025-02-08 08:46:35,426 INFO L175 Difference]: Start difference. First operand has 151 places, 151 transitions, 318 flow. Second operand 3 states and 369 transitions. [2025-02-08 08:46:35,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 193 transitions, 614 flow [2025-02-08 08:46:35,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 193 transitions, 614 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:46:35,431 INFO L231 Difference]: Finished difference. Result has 151 places, 149 transitions, 318 flow [2025-02-08 08:46:35,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=151, PETRI_TRANSITIONS=149} [2025-02-08 08:46:35,434 INFO L279 CegarLoopForPetriNet]: 154 programPoint places, -3 predicate places. [2025-02-08 08:46:35,434 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 149 transitions, 318 flow [2025-02-08 08:46:35,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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-08 08:46:35,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:35,435 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:35,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:46:35,435 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-02-08 08:46:35,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:35,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1711345686, now seen corresponding path program 1 times [2025-02-08 08:46:35,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:35,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016792883] [2025-02-08 08:46:35,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:35,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:35,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:46:35,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:46:35,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:35,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:35,547 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-08 08:46:35,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:35,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016792883] [2025-02-08 08:46:35,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016792883] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:35,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:35,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:46:35,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831423161] [2025-02-08 08:46:35,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:35,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:46:35,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:35,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:46:35,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:46:35,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 237 [2025-02-08 08:46:35,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 149 transitions, 318 flow. Second operand has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 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-08 08:46:35,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:35,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 237 [2025-02-08 08:46:35,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:37,210 INFO L124 PetriNetUnfolderBase]: 10164/21619 cut-off events. [2025-02-08 08:46:37,210 INFO L125 PetriNetUnfolderBase]: For 649/659 co-relation queries the response was YES. [2025-02-08 08:46:37,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37644 conditions, 21619 events. 10164/21619 cut-off events. For 649/659 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 203948 event pairs, 3949 based on Foata normal form. 0/17544 useless extension candidates. Maximal degree in co-relation 37638. Up to 8734 conditions per place. [2025-02-08 08:46:37,381 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 145 selfloop transitions, 5 changer transitions 0/237 dead transitions. [2025-02-08 08:46:37,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 237 transitions, 794 flow [2025-02-08 08:46:37,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:46:37,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:46:37,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2025-02-08 08:46:37,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5358649789029536 [2025-02-08 08:46:37,383 INFO L175 Difference]: Start difference. First operand has 151 places, 149 transitions, 318 flow. Second operand 4 states and 508 transitions. [2025-02-08 08:46:37,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 237 transitions, 794 flow [2025-02-08 08:46:37,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 237 transitions, 790 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:46:37,396 INFO L231 Difference]: Finished difference. Result has 153 places, 149 transitions, 336 flow [2025-02-08 08:46:37,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=336, PETRI_PLACES=153, PETRI_TRANSITIONS=149} [2025-02-08 08:46:37,397 INFO L279 CegarLoopForPetriNet]: 154 programPoint places, -1 predicate places. [2025-02-08 08:46:37,397 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 149 transitions, 336 flow [2025-02-08 08:46:37,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 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-08 08:46:37,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:37,398 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:37,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:46:37,398 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-02-08 08:46:37,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:37,398 INFO L85 PathProgramCache]: Analyzing trace with hash 162908352, now seen corresponding path program 1 times [2025-02-08 08:46:37,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:37,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903661041] [2025-02-08 08:46:37,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:37,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:37,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:46:37,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:46:37,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:37,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:46:37,425 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:46:37,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:46:37,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:46:37,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:37,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:46:37,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:46:37,457 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:46:37,457 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2025-02-08 08:46:37,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2025-02-08 08:46:37,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2025-02-08 08:46:37,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2025-02-08 08:46:37,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2025-02-08 08:46:37,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (14 of 20 remaining) [2025-02-08 08:46:37,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 20 remaining) [2025-02-08 08:46:37,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (12 of 20 remaining) [2025-02-08 08:46:37,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2025-02-08 08:46:37,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2025-02-08 08:46:37,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2025-02-08 08:46:37,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2025-02-08 08:46:37,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2025-02-08 08:46:37,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2025-02-08 08:46:37,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2025-02-08 08:46:37,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2025-02-08 08:46:37,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2025-02-08 08:46:37,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 20 remaining) [2025-02-08 08:46:37,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 20 remaining) [2025-02-08 08:46:37,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 20 remaining) [2025-02-08 08:46:37,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:46:37,459 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 08:46:37,460 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:46:37,460 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 08:46:37,532 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 08:46:37,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 323 transitions, 673 flow [2025-02-08 08:46:37,584 INFO L124 PetriNetUnfolderBase]: 201/604 cut-off events. [2025-02-08 08:46:37,584 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 08:46:37,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 604 events. 201/604 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2858 event pairs, 1 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 402. Up to 24 conditions per place. [2025-02-08 08:46:37,591 INFO L82 GeneralOperation]: Start removeDead. Operand has 208 places, 323 transitions, 673 flow [2025-02-08 08:46:37,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 208 places, 323 transitions, 673 flow [2025-02-08 08:46:37,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:46:37,604 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;@2c9e4e04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:46:37,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-02-08 08:46:37,606 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:46:37,606 INFO L124 PetriNetUnfolderBase]: 6/19 cut-off events. [2025-02-08 08:46:37,606 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:46:37,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:37,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:46:37,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:46:37,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:37,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1186540318, now seen corresponding path program 1 times [2025-02-08 08:46:37,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:37,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47957184] [2025-02-08 08:46:37,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:37,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:37,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:46:37,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:46:37,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:37,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:37,623 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-08 08:46:37,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:37,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47957184] [2025-02-08 08:46:37,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47957184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:37,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:37,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:46:37,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8932331] [2025-02-08 08:46:37,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:37,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:46:37,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:37,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:46:37,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:46:37,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 323 [2025-02-08 08:46:37,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 323 transitions, 673 flow. Second operand has 2 states, 2 states have (on average 123.0) internal successors, (246), 2 states have internal predecessors, (246), 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-08 08:46:37,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:37,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 323 [2025-02-08 08:46:37,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand