./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/libvsync/ttaslock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1232142cbd2d3669d71853399351b59e265805f095536d7cdae31e54b7810261 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:32:23,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:32:23,289 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:32:23,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:32:23,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:32:23,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:32:23,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:32:23,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:32:23,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:32:23,320 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:32:23,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:32:23,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:32:23,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:32:23,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:32:23,321 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:32:23,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:32:23,321 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:32:23,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:32:23,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:32:23,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:32:23,321 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:32:23,321 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:32:23,321 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:32:23,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:32:23,321 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:32:23,321 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:32:23,321 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:32:23,321 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:32:23,322 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:32:23,322 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:32:23,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:32:23,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:32:23,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:32:23,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:32:23,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:32:23,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:32:23,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:32:23,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:32:23,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:32:23,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:32:23,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:32:23,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:32:23,322 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1232142cbd2d3669d71853399351b59e265805f095536d7cdae31e54b7810261 [2025-03-09 01:32:23,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:32:23,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:32:23,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:32:23,543 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:32:23,543 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:32:23,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/ttaslock.i [2025-03-09 01:32:24,665 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/241a196a8/3476201374014c3fbe881afdc7b5ac58/FLAG09f8b431b [2025-03-09 01:32:25,057 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:32:25,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/ttaslock.i [2025-03-09 01:32:25,086 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/241a196a8/3476201374014c3fbe881afdc7b5ac58/FLAG09f8b431b [2025-03-09 01:32:25,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/241a196a8/3476201374014c3fbe881afdc7b5ac58 [2025-03-09 01:32:25,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:32:25,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:32:25,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:32:25,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:32:25,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:32:25,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:32:25" (1/1) ... [2025-03-09 01:32:25,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e59b197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:25, skipping insertion in model container [2025-03-09 01:32:25,241 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:32:25" (1/1) ... [2025-03-09 01:32:25,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:32:26,276 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:32:26,283 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:32:26,284 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:32:26,287 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:32:26,288 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:32:26,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:32:26,595 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:32:26,661 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-03-09 01:32:26,663 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-03-09 01:32:26,663 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-03-09 01:32:26,664 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-03-09 01:32:26,665 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-03-09 01:32:26,665 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-03-09 01:32:26,665 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-03-09 01:32:26,665 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-03-09 01:32:26,665 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-03-09 01:32:26,666 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-03-09 01:32:26,666 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-03-09 01:32:26,666 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-03-09 01:32:26,666 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-03-09 01:32:26,668 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-03-09 01:32:26,668 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-03-09 01:32:26,668 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-03-09 01:32:26,669 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-03-09 01:32:26,669 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-03-09 01:32:26,670 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-03-09 01:32:26,670 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-03-09 01:32:26,670 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-03-09 01:32:26,670 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-03-09 01:32:26,670 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-03-09 01:32:26,670 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-03-09 01:32:26,671 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-03-09 01:32:26,671 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-03-09 01:32:26,671 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-03-09 01:32:26,671 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-03-09 01:32:26,672 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-03-09 01:32:26,672 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-03-09 01:32:26,672 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-03-09 01:32:26,673 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-03-09 01:32:26,673 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-03-09 01:32:26,673 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-03-09 01:32:26,674 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-03-09 01:32:26,674 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-03-09 01:32:26,674 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-03-09 01:32:26,674 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-03-09 01:32:26,675 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-03-09 01:32:26,675 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-03-09 01:32:26,676 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-03-09 01:32:26,676 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-03-09 01:32:26,676 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-03-09 01:32:26,677 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-03-09 01:32:26,677 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-03-09 01:32:26,677 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-03-09 01:32:26,677 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-03-09 01:32:26,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-03-09 01:32:26,679 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-03-09 01:32:26,679 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-03-09 01:32:26,679 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-03-09 01:32:26,680 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-03-09 01:32:26,680 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-03-09 01:32:26,680 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-03-09 01:32:26,680 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-03-09 01:32:26,681 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-03-09 01:32:26,681 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-03-09 01:32:26,682 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-03-09 01:32:26,682 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-03-09 01:32:26,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-03-09 01:32:26,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-03-09 01:32:26,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-03-09 01:32:26,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-03-09 01:32:26,684 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-03-09 01:32:26,685 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-03-09 01:32:26,685 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-03-09 01:32:26,686 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-03-09 01:32:26,686 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-03-09 01:32:26,686 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-03-09 01:32:26,686 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-03-09 01:32:26,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-03-09 01:32:26,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-03-09 01:32:26,688 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-03-09 01:32:26,688 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-03-09 01:32:26,688 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-03-09 01:32:26,689 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-03-09 01:32:26,689 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-03-09 01:32:26,690 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-03-09 01:32:26,690 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-03-09 01:32:26,690 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-03-09 01:32:26,690 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-03-09 01:32:26,691 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-03-09 01:32:26,691 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-03-09 01:32:26,691 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-03-09 01:32:26,691 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-03-09 01:32:26,691 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-03-09 01:32:26,691 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-03-09 01:32:26,692 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-03-09 01:32:26,692 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-03-09 01:32:26,692 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-03-09 01:32:26,692 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-03-09 01:32:26,692 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-03-09 01:32:26,692 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-03-09 01:32:26,693 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-03-09 01:32:26,693 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-03-09 01:32:26,693 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-03-09 01:32:26,693 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-03-09 01:32:26,693 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-03-09 01:32:26,693 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-03-09 01:32:26,695 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-03-09 01:32:26,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:32:26,920 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:32:26,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:26 WrapperNode [2025-03-09 01:32:26,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:32:26,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:32:26,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:32:26,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:32:26,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:26" (1/1) ... [2025-03-09 01:32:26,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:26" (1/1) ... [2025-03-09 01:32:27,009 INFO L138 Inliner]: procedures = 917, calls = 913, calls flagged for inlining = 815, calls inlined = 29, statements flattened = 263 [2025-03-09 01:32:27,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:32:27,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:32:27,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:32:27,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:32:27,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:26" (1/1) ... [2025-03-09 01:32:27,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:26" (1/1) ... [2025-03-09 01:32:27,019 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:26" (1/1) ... [2025-03-09 01:32:27,034 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-03-09 01:32:27,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:26" (1/1) ... [2025-03-09 01:32:27,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:26" (1/1) ... [2025-03-09 01:32:27,044 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:26" (1/1) ... [2025-03-09 01:32:27,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:26" (1/1) ... [2025-03-09 01:32:27,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:26" (1/1) ... [2025-03-09 01:32:27,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:26" (1/1) ... [2025-03-09 01:32:27,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:32:27,053 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:32:27,053 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:32:27,053 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:32:27,054 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:26" (1/1) ... [2025-03-09 01:32:27,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:32:27,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:32:27,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:32:27,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:32:27,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:32:27,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:32:27,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:32:27,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:32:27,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:32:27,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:32:27,098 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-03-09 01:32:27,098 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-03-09 01:32:27,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:32:27,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:32:27,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:32:27,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:32:27,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:32:27,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:32:27,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:32:27,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:32:27,100 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:32:27,214 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:32:27,215 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:32:27,434 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255: havoc vatomic32_await_eq_rlx_#t~ret168#1; [2025-03-09 01:32:27,434 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910: havoc vatomic32_xchg_acq_#t~ret115#1; [2025-03-09 01:32:27,528 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6001: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-09 01:32:27,528 INFO L1307 $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-03-09 01:32:27,529 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:32:27,529 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:32:27,664 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:32:27,664 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:32:27,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:32:27 BoogieIcfgContainer [2025-03-09 01:32:27,664 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:32:27,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:32:27,667 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:32:27,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:32:27,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:32:25" (1/3) ... [2025-03-09 01:32:27,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16addf41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:32:27, skipping insertion in model container [2025-03-09 01:32:27,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:26" (2/3) ... [2025-03-09 01:32:27,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16addf41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:32:27, skipping insertion in model container [2025-03-09 01:32:27,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:32:27" (3/3) ... [2025-03-09 01:32:27,674 INFO L128 eAbstractionObserver]: Analyzing ICFG ttaslock.i [2025-03-09 01:32:27,684 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:32:27,685 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ttaslock.i that has 2 procedures, 92 locations, 1 initial locations, 19 loop locations, and 15 error locations. [2025-03-09 01:32:27,685 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:32:27,750 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-09 01:32:27,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 155 transitions, 317 flow [2025-03-09 01:32:27,823 INFO L124 PetriNetUnfolderBase]: 76/197 cut-off events. [2025-03-09 01:32:27,826 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:32:27,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 197 events. 76/197 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 605 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 141. Up to 8 conditions per place. [2025-03-09 01:32:27,832 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 155 transitions, 317 flow [2025-03-09 01:32:27,839 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 155 transitions, 317 flow [2025-03-09 01:32:27,847 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:32:27,857 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;@4c267c3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:32:27,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-09 01:32:27,864 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:32:27,865 INFO L124 PetriNetUnfolderBase]: 10/21 cut-off events. [2025-03-09 01:32:27,865 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:32:27,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:27,866 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:32:27,868 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-03-09 01:32:27,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:27,873 INFO L85 PathProgramCache]: Analyzing trace with hash 670514503, now seen corresponding path program 1 times [2025-03-09 01:32:27,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:27,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352334967] [2025-03-09 01:32:27,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:27,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:27,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:32:27,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:32:27,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:27,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:27,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:27,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:27,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352334967] [2025-03-09 01:32:27,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352334967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:27,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:27,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:32:27,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555364281] [2025-03-09 01:32:27,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:27,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 01:32:27,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:28,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 01:32:28,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 01:32:28,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 155 [2025-03-09 01:32:28,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 155 transitions, 317 flow. Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:28,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:28,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 155 [2025-03-09 01:32:28,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:28,288 INFO L124 PetriNetUnfolderBase]: 447/1107 cut-off events. [2025-03-09 01:32:28,289 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:32:28,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2002 conditions, 1107 events. 447/1107 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6377 event pairs, 380 based on Foata normal form. 470/1384 useless extension candidates. Maximal degree in co-relation 1944. Up to 890 conditions per place. [2025-03-09 01:32:28,300 INFO L140 encePairwiseOnDemand]: 97/155 looper letters, 60 selfloop transitions, 0 changer transitions 0/95 dead transitions. [2025-03-09 01:32:28,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 95 transitions, 317 flow [2025-03-09 01:32:28,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 01:32:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 01:32:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 188 transitions. [2025-03-09 01:32:28,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6064516129032258 [2025-03-09 01:32:28,312 INFO L175 Difference]: Start difference. First operand has 95 places, 155 transitions, 317 flow. Second operand 2 states and 188 transitions. [2025-03-09 01:32:28,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 95 transitions, 317 flow [2025-03-09 01:32:28,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 95 transitions, 317 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:32:28,317 INFO L231 Difference]: Finished difference. Result has 92 places, 95 transitions, 197 flow [2025-03-09 01:32:28,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=197, PETRI_PLACES=92, PETRI_TRANSITIONS=95} [2025-03-09 01:32:28,322 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -3 predicate places. [2025-03-09 01:32:28,322 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 95 transitions, 197 flow [2025-03-09 01:32:28,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:28,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:28,322 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:28,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:32:28,323 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:32:28,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:28,324 INFO L85 PathProgramCache]: Analyzing trace with hash 90004431, now seen corresponding path program 1 times [2025-03-09 01:32:28,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:28,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418839850] [2025-03-09 01:32:28,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:28,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:28,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:32:28,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:32:28,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:28,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:28,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:28,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:28,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418839850] [2025-03-09 01:32:28,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418839850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:28,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:28,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:32:28,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722707928] [2025-03-09 01:32:28,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:28,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:32:28,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:28,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:32:28,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:32:28,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 155 [2025-03-09 01:32:28,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 95 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:28,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:28,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 155 [2025-03-09 01:32:28,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:28,716 INFO L124 PetriNetUnfolderBase]: 535/1304 cut-off events. [2025-03-09 01:32:28,716 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:32:28,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2368 conditions, 1304 events. 535/1304 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 7781 event pairs, 380 based on Foata normal form. 0/1099 useless extension candidates. Maximal degree in co-relation 2364. Up to 889 conditions per place. [2025-03-09 01:32:28,723 INFO L140 encePairwiseOnDemand]: 151/155 looper letters, 104 selfloop transitions, 2 changer transitions 0/137 dead transitions. [2025-03-09 01:32:28,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 137 transitions, 493 flow [2025-03-09 01:32:28,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:32:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:32:28,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2025-03-09 01:32:28,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.432258064516129 [2025-03-09 01:32:28,725 INFO L175 Difference]: Start difference. First operand has 92 places, 95 transitions, 197 flow. Second operand 3 states and 201 transitions. [2025-03-09 01:32:28,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 137 transitions, 493 flow [2025-03-09 01:32:28,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 137 transitions, 493 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:32:28,729 INFO L231 Difference]: Finished difference. Result has 92 places, 93 transitions, 197 flow [2025-03-09 01:32:28,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=92, PETRI_TRANSITIONS=93} [2025-03-09 01:32:28,729 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -3 predicate places. [2025-03-09 01:32:28,730 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 93 transitions, 197 flow [2025-03-09 01:32:28,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:28,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:28,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:28,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:32:28,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:32:28,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:28,730 INFO L85 PathProgramCache]: Analyzing trace with hash 90004432, now seen corresponding path program 1 times [2025-03-09 01:32:28,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:28,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864843114] [2025-03-09 01:32:28,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:28,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:28,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:32:28,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:32:28,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:28,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:28,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:28,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864843114] [2025-03-09 01:32:28,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864843114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:28,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:28,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:32:28,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838685632] [2025-03-09 01:32:28,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:28,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:32:28,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:28,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:32:28,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:32:28,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 155 [2025-03-09 01:32:28,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 93 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:28,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:28,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 155 [2025-03-09 01:32:28,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:29,290 INFO L124 PetriNetUnfolderBase]: 490/1574 cut-off events. [2025-03-09 01:32:29,291 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-03-09 01:32:29,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2593 conditions, 1574 events. 490/1574 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 11445 event pairs, 76 based on Foata normal form. 0/1344 useless extension candidates. Maximal degree in co-relation 2588. Up to 588 conditions per place. [2025-03-09 01:32:29,300 INFO L140 encePairwiseOnDemand]: 148/155 looper letters, 145 selfloop transitions, 5 changer transitions 0/181 dead transitions. [2025-03-09 01:32:29,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 181 transitions, 673 flow [2025-03-09 01:32:29,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:32:29,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:32:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 284 transitions. [2025-03-09 01:32:29,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45806451612903226 [2025-03-09 01:32:29,303 INFO L175 Difference]: Start difference. First operand has 92 places, 93 transitions, 197 flow. Second operand 4 states and 284 transitions. [2025-03-09 01:32:29,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 181 transitions, 673 flow [2025-03-09 01:32:29,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 181 transitions, 669 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:32:29,312 INFO L231 Difference]: Finished difference. Result has 94 places, 93 transitions, 215 flow [2025-03-09 01:32:29,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=94, PETRI_TRANSITIONS=93} [2025-03-09 01:32:29,313 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -1 predicate places. [2025-03-09 01:32:29,313 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 93 transitions, 215 flow [2025-03-09 01:32:29,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:29,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:29,313 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:29,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:32:29,313 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:32:29,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:29,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1546794229, now seen corresponding path program 1 times [2025-03-09 01:32:29,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:29,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171875258] [2025-03-09 01:32:29,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:29,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:29,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:32:29,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:32:29,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:29,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:32:29,345 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:32:29,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:32:29,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:32:29,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:29,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:32:29,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:32:29,384 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:32:29,385 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 24 remaining) [2025-03-09 01:32:29,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 24 remaining) [2025-03-09 01:32:29,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2025-03-09 01:32:29,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2025-03-09 01:32:29,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2025-03-09 01:32:29,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (18 of 24 remaining) [2025-03-09 01:32:29,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (17 of 24 remaining) [2025-03-09 01:32:29,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (16 of 24 remaining) [2025-03-09 01:32:29,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2025-03-09 01:32:29,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2025-03-09 01:32:29,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2025-03-09 01:32:29,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2025-03-09 01:32:29,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2025-03-09 01:32:29,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2025-03-09 01:32:29,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2025-03-09 01:32:29,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2025-03-09 01:32:29,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2025-03-09 01:32:29,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 24 remaining) [2025-03-09 01:32:29,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 24 remaining) [2025-03-09 01:32:29,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 24 remaining) [2025-03-09 01:32:29,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 24 remaining) [2025-03-09 01:32:29,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 24 remaining) [2025-03-09 01:32:29,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 24 remaining) [2025-03-09 01:32:29,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 24 remaining) [2025-03-09 01:32:29,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:32:29,388 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-09 01:32:29,390 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 01:32:29,390 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 01:32:29,462 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:32:29,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 255 transitions, 526 flow [2025-03-09 01:32:29,494 INFO L124 PetriNetUnfolderBase]: 143/372 cut-off events. [2025-03-09 01:32:29,494 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:32:29,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 372 events. 143/372 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1454 event pairs, 0 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 270. Up to 12 conditions per place. [2025-03-09 01:32:29,498 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 255 transitions, 526 flow [2025-03-09 01:32:29,528 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 255 transitions, 526 flow [2025-03-09 01:32:29,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:32:29,529 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;@4c267c3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:32:29,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-03-09 01:32:29,534 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:32:29,534 INFO L124 PetriNetUnfolderBase]: 10/21 cut-off events. [2025-03-09 01:32:29,534 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:32:29,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:29,534 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:32:29,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-03-09 01:32:29,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:29,535 INFO L85 PathProgramCache]: Analyzing trace with hash 913862278, now seen corresponding path program 1 times [2025-03-09 01:32:29,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:29,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399819321] [2025-03-09 01:32:29,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:29,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:29,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:32:29,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:32:29,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:29,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:29,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:29,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399819321] [2025-03-09 01:32:29,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399819321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:29,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:29,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:32:29,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888994506] [2025-03-09 01:32:29,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:29,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 01:32:29,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:29,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 01:32:29,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 01:32:29,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 255 [2025-03-09 01:32:29,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 255 transitions, 526 flow. Second operand has 2 states, 2 states have (on average 51.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:29,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:29,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 255 [2025-03-09 01:32:29,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:33,239 INFO L124 PetriNetUnfolderBase]: 37109/59845 cut-off events. [2025-03-09 01:32:33,239 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2025-03-09 01:32:33,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114642 conditions, 59845 events. 37109/59845 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 1417. Compared 479810 event pairs, 31806 based on Foata normal form. 24756/71916 useless extension candidates. Maximal degree in co-relation 112162. Up to 54595 conditions per place. [2025-03-09 01:32:33,561 INFO L140 encePairwiseOnDemand]: 157/255 looper letters, 106 selfloop transitions, 0 changer transitions 0/155 dead transitions. [2025-03-09 01:32:33,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 155 transitions, 538 flow [2025-03-09 01:32:33,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 01:32:33,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 01:32:33,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 302 transitions. [2025-03-09 01:32:33,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.592156862745098 [2025-03-09 01:32:33,564 INFO L175 Difference]: Start difference. First operand has 152 places, 255 transitions, 526 flow. Second operand 2 states and 302 transitions. [2025-03-09 01:32:33,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 155 transitions, 538 flow [2025-03-09 01:32:33,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 155 transitions, 538 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:32:33,567 INFO L231 Difference]: Finished difference. Result has 147 places, 155 transitions, 326 flow [2025-03-09 01:32:33,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=326, PETRI_PLACES=147, PETRI_TRANSITIONS=155} [2025-03-09 01:32:33,567 INFO L279 CegarLoopForPetriNet]: 152 programPoint places, -5 predicate places. [2025-03-09 01:32:33,568 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 155 transitions, 326 flow [2025-03-09 01:32:33,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:33,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:33,568 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:33,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:32:33,568 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-03-09 01:32:33,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:33,569 INFO L85 PathProgramCache]: Analyzing trace with hash 2018990382, now seen corresponding path program 1 times [2025-03-09 01:32:33,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:33,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056529425] [2025-03-09 01:32:33,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:33,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:33,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:32:33,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:32:33,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:33,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:33,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:33,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:33,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056529425] [2025-03-09 01:32:33,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056529425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:33,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:33,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:32:33,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742827135] [2025-03-09 01:32:33,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:33,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:32:33,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:33,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:32:33,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:32:33,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 255 [2025-03-09 01:32:33,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 155 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:33,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:33,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 255 [2025-03-09 01:32:33,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:37,774 INFO L124 PetriNetUnfolderBase]: 44105/71567 cut-off events. [2025-03-09 01:32:37,774 INFO L125 PetriNetUnfolderBase]: For 331/331 co-relation queries the response was YES. [2025-03-09 01:32:37,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136522 conditions, 71567 events. 44105/71567 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 1671. Compared 591392 event pairs, 31768 based on Foata normal form. 0/57009 useless extension candidates. Maximal degree in co-relation 136517. Up to 54511 conditions per place. [2025-03-09 01:32:38,230 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 194 selfloop transitions, 2 changer transitions 0/241 dead transitions. [2025-03-09 01:32:38,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 241 transitions, 890 flow [2025-03-09 01:32:38,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:32:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:32:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2025-03-09 01:32:38,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43529411764705883 [2025-03-09 01:32:38,233 INFO L175 Difference]: Start difference. First operand has 147 places, 155 transitions, 326 flow. Second operand 3 states and 333 transitions. [2025-03-09 01:32:38,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 241 transitions, 890 flow [2025-03-09 01:32:38,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 241 transitions, 890 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:32:38,236 INFO L231 Difference]: Finished difference. Result has 147 places, 153 transitions, 326 flow [2025-03-09 01:32:38,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=147, PETRI_TRANSITIONS=153} [2025-03-09 01:32:38,239 INFO L279 CegarLoopForPetriNet]: 152 programPoint places, -5 predicate places. [2025-03-09 01:32:38,239 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 153 transitions, 326 flow [2025-03-09 01:32:38,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:38,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:38,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:38,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:32:38,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-03-09 01:32:38,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:38,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2018990383, now seen corresponding path program 1 times [2025-03-09 01:32:38,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:38,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623312793] [2025-03-09 01:32:38,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:38,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:38,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:32:38,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:32:38,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:38,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:38,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:38,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:38,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623312793] [2025-03-09 01:32:38,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623312793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:38,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:38,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:32:38,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519388824] [2025-03-09 01:32:38,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:38,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:32:38,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:38,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:32:38,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:32:38,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 255 [2025-03-09 01:32:38,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 153 transitions, 326 flow. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:38,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:38,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 255 [2025-03-09 01:32:38,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:42,220 INFO L124 PetriNetUnfolderBase]: 40584/67744 cut-off events. [2025-03-09 01:32:42,220 INFO L125 PetriNetUnfolderBase]: For 1898/1907 co-relation queries the response was YES. [2025-03-09 01:32:42,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129178 conditions, 67744 events. 40584/67744 cut-off events. For 1898/1907 co-relation queries the response was YES. Maximal size of possible extension queue 1537. Compared 576136 event pairs, 14983 based on Foata normal form. 0/54272 useless extension candidates. Maximal degree in co-relation 129172. Up to 35797 conditions per place. [2025-03-09 01:32:42,486 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 279 selfloop transitions, 5 changer transitions 0/329 dead transitions. [2025-03-09 01:32:42,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 329 transitions, 1246 flow [2025-03-09 01:32:42,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:32:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:32:42,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 474 transitions. [2025-03-09 01:32:42,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4647058823529412 [2025-03-09 01:32:42,488 INFO L175 Difference]: Start difference. First operand has 147 places, 153 transitions, 326 flow. Second operand 4 states and 474 transitions. [2025-03-09 01:32:42,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 329 transitions, 1246 flow [2025-03-09 01:32:42,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 329 transitions, 1242 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:32:42,526 INFO L231 Difference]: Finished difference. Result has 149 places, 153 transitions, 344 flow [2025-03-09 01:32:42,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=344, PETRI_PLACES=149, PETRI_TRANSITIONS=153} [2025-03-09 01:32:42,527 INFO L279 CegarLoopForPetriNet]: 152 programPoint places, -3 predicate places. [2025-03-09 01:32:42,527 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 153 transitions, 344 flow [2025-03-09 01:32:42,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:42,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:42,528 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:42,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:32:42,528 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-03-09 01:32:42,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:42,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1725474922, now seen corresponding path program 1 times [2025-03-09 01:32:42,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:42,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561733775] [2025-03-09 01:32:42,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:42,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:42,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:32:42,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:32:42,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:42,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:32:42,550 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:32:42,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:32:42,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:32:42,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:42,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:32:42,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:32:42,572 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:32:42,572 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 32 remaining) [2025-03-09 01:32:42,572 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 32 remaining) [2025-03-09 01:32:42,572 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 32 remaining) [2025-03-09 01:32:42,572 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 32 remaining) [2025-03-09 01:32:42,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 32 remaining) [2025-03-09 01:32:42,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (26 of 32 remaining) [2025-03-09 01:32:42,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (25 of 32 remaining) [2025-03-09 01:32:42,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (24 of 32 remaining) [2025-03-09 01:32:42,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 32 remaining) [2025-03-09 01:32:42,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 32 remaining) [2025-03-09 01:32:42,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 32 remaining) [2025-03-09 01:32:42,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 32 remaining) [2025-03-09 01:32:42,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 32 remaining) [2025-03-09 01:32:42,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 32 remaining) [2025-03-09 01:32:42,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 32 remaining) [2025-03-09 01:32:42,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 32 remaining) [2025-03-09 01:32:42,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 32 remaining) [2025-03-09 01:32:42,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 32 remaining) [2025-03-09 01:32:42,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 32 remaining) [2025-03-09 01:32:42,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 32 remaining) [2025-03-09 01:32:42,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 32 remaining) [2025-03-09 01:32:42,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 32 remaining) [2025-03-09 01:32:42,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 32 remaining) [2025-03-09 01:32:42,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 32 remaining) [2025-03-09 01:32:42,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 32 remaining) [2025-03-09 01:32:42,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 32 remaining) [2025-03-09 01:32:42,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 32 remaining) [2025-03-09 01:32:42,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 32 remaining) [2025-03-09 01:32:42,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 32 remaining) [2025-03-09 01:32:42,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 32 remaining) [2025-03-09 01:32:42,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 32 remaining) [2025-03-09 01:32:42,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 32 remaining) [2025-03-09 01:32:42,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:32:42,575 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-09 01:32:42,575 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 01:32:42,575 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-09 01:32:42,633 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:32:42,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 355 transitions, 737 flow [2025-03-09 01:32:42,681 INFO L124 PetriNetUnfolderBase]: 229/610 cut-off events. [2025-03-09 01:32:42,682 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-09 01:32:42,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 610 events. 229/610 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2696 event pairs, 1 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 432. Up to 24 conditions per place. [2025-03-09 01:32:42,691 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 355 transitions, 737 flow [2025-03-09 01:32:42,704 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 355 transitions, 737 flow [2025-03-09 01:32:42,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:32:42,707 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;@4c267c3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:32:42,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-03-09 01:32:42,708 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:32:42,709 INFO L124 PetriNetUnfolderBase]: 10/21 cut-off events. [2025-03-09 01:32:42,709 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:32:42,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:42,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:32:42,709 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:32:42,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:42,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1252640553, now seen corresponding path program 1 times [2025-03-09 01:32:42,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:42,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129097481] [2025-03-09 01:32:42,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:42,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:42,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:32:42,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:32:42,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:42,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:42,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:42,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:42,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129097481] [2025-03-09 01:32:42,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129097481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:42,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:42,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:32:42,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113378805] [2025-03-09 01:32:42,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:42,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 01:32:42,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:42,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 01:32:42,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 01:32:42,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 355 [2025-03-09 01:32:42,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 355 transitions, 737 flow. Second operand has 2 states, 2 states have (on average 65.0) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:42,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:42,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 355 [2025-03-09 01:32:42,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand